Computational Discrete Mathematics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540427759, 9783540455066

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Nearest Neighbor

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_2 ◽

2001 ◽

pp. 13-24 ◽

Cited By ~ 4

Author(s):

Helmut Alt

Keyword(s):

Nearest Neighbor

Download Full-text

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_9 ◽

2001 ◽

pp. 119-135 ◽

Cited By ~ 7

Author(s):

Günter Rote

Download Full-text

Check Character Systems and Anti-symmetric Mappings

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_10 ◽

2001 ◽

pp. 136-147 ◽

Cited By ~ 2

Author(s):

Ralph-Hardo Schulz

Keyword(s):

Check Character Systems

Download Full-text

Lattice Paths and Determinants

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_1 ◽

2001 ◽

pp. 1-12 ◽

Cited By ~ 2

Author(s):

Martin Aigner

Keyword(s):

Lattice Paths

Download Full-text

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_8 ◽

2001 ◽

pp. 98-118

Author(s):

Hans Jürgen Prömel ◽

Anusch Taraz

Keyword(s):

Random Graphs ◽

Partial Orders

Download Full-text

Explicit and Implicit Enforcing - Randomized Optimization

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_3 ◽

2001 ◽

pp. 25-46 ◽

Cited By ~ 3

Author(s):

Bernd Gärtner ◽

Emo Welzl

Download Full-text

Codes over Z 4

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_4 ◽

2001 ◽

pp. 47-55 ◽

Cited By ~ 2

Author(s):

Tor Helleseth

Download Full-text

Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_12 ◽

2001 ◽

pp. 159-171 ◽

Cited By ~ 18

Author(s):

Günter M. Ziegler

Keyword(s):

Binary Codes ◽

Low Dimensions ◽

Hamming Graphs ◽

Borsuk Problem

Download Full-text

Scheduling under Uncertainty: Bounding the Makespan Distribution

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_7 ◽

2001 ◽

pp. 79-97 ◽

Cited By ~ 24

Author(s):

Rolf H. Möhring

Keyword(s):

Scheduling Under Uncertainty

Download Full-text

Algorithms in Pure Mathematics

Computational Discrete Mathematics - Lecture Notes in Computer Science ◽

10.1007/3-540-45506-x_11 ◽

2001 ◽

pp. 148-158

Author(s):

Gernot Stroth

Keyword(s):

Pure Mathematics

Download Full-text

Computational Discrete Mathematics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Nearest Neighbor

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches

Check Character Systems and Anti-symmetric Mappings

Lattice Paths and Determinants

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders

Explicit and Implicit Enforcing - Randomized Optimization

Codes over Z 4

Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions

Scheduling under Uncertainty: Bounding the Makespan Distribution

Algorithms in Pure Mathematics

Computational Discrete Mathematics - Lecture Notes in Computer Science
Latest Publications