C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Computational Discrete Mathematics
2001
2001
2001
Keyphrases
Publications
2001
Bernd Gärtner
,
Emo Welzl
Explicit and Implicit Enforcing - Randomized Optimization.
Computational Discrete Mathematics
(2001)
Tor Helleseth
.
Computational Discrete Mathematics
(2001)
Günter M. Ziegler
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions.
Computational Discrete Mathematics
(2001)
Rolf H. Möhring
Scheduling under Uncertainty: Bounding the Makespan Distribution.
Computational Discrete Mathematics
(2001)
Günter Rote
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches.
Computational Discrete Mathematics
(2001)
Heinz Adolf Jung
Degree Bounds for Long Paths and Cycles in k-Connected Graphs.
Computational Discrete Mathematics
(2001)
Martin Aigner
Lattice Paths and Determinants.
Computational Discrete Mathematics
(2001)
Ralph-Hardo Schulz
Check Character Systems and Anti-symmetric Mappings.
Computational Discrete Mathematics
(2001)
Gernot Stroth
Algorithms in Pure Mathematics.
Computational Discrete Mathematics
(2001)
Hans Jürgen Prömel
,
Anusch Taraz
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders.
Computational Discrete Mathematics
(2001)
Helmut Alt
The Nearest Neighbor.
Computational Discrete Mathematics
(2001)
Christoph Meinel
,
Christian Stangier
Data Structures for Boolean Functions.
Computational Discrete Mathematics
(2001)
volume 2122, 2001
Computational Discrete Mathematics, Advanced Lectures
Computational Discrete Mathematics
2122 (2001)