2005
- : Complete disorder is impossible: The mathematical work of Walter Deuber, Combinatorics, Probability and Computing, 14: 3-16.
2004
- : Ordered binary decision diagrams and the Shannon effect, Discrete Applied Mathematics, 142: 67-85.
2003
- : Independent Deuber sets in graphs on the natural numbers, Journal of Combinatorial Theory (A), 103: 305-322.
- : On random planar graphs, the number of planar graphs and their triangulations, Journal of Combinatorial Theory (B), 88: 119-134.
- : For which densities are random triangle-free graphs almost surely bipartite?, Combinatorica, 23: 105-150.
- : Graphentheorie.
- : Graphentheorie. Spektrum Akademischer Verlag, Heidelberg.
- : Zufällige Graphen. Spektrum Akademischer Verlag, Heidelberg.
- : Zufällige Graphen.
2002
- : K4-free subgraphs of random graphs revisited.
- : Large numbers, Knuth's arrow notation, and Ramsey theory, Synthese, 133: 87-105.
- : A note on triangle-free and bipartite graphs, Discrete Mathematics, 257: 531-540.
- : The Steiner Tree Problem - A Tour through Graphs, Algorithms, and Complexity. Vieweg Verlag.
2001
- : On the Evolution of the Worst-Case OBDD Size, Information Processing Letters, 77: 1-7.
- : Independent arithmetic progressions in clique-free graphs on the natural numbers, Journal of Combinatorial Theory (A), 93: 1-17.
- : Almost all graphs with high girth and suitable density have high chromatic number, Journal of Graph Theory, 37: 220-226.
- : On the structure of clique-free graphs, Random Structures and Algorithms, 19: 37-53.
- : Asymptotic enumeration, global structure and constrained evolution, Discrete Mathematics, 229: 213-233.
- : Phase transitions in the evolution of partial orders, Journal of Combinatorial Theory (A), 94: 230-275.
- : Counting partial orders with a fixed number of comparable pairs, Combinatorics, Probability and Computing, 10: 159-177.
- : Random graphs, random triangle-free graphs, and random partial orders. In: Helmut Alt (editor): Computational Discrete Mathematics, volume 2122 of series LNCS Tutorial, page 98 ff.. Springer-Verlag.
2000
- : Size and Structure of Random Ordered Binary Decision Diagrams. March.
- : Walter Deuber 1942 - 1999, European Journal on Combinatorics, 21: 697-699.
- : A new approximation algorithm for the Steiner tree problem with performance ratio 5/3, Journal of Algorithms, 36: 89-101.
1999
- : Forbidden induced partial orders, Discrete Mathematics, 201: 53-80.
- : A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448-453.
- (editor): Lectures on Approximation and Randomized Algorithms. Polish Scientific Publishers PWN, Series: Advanced Topics in Mathematics, Warszawa.
- : Non-Ramsey graphs are $c log n$-universal, Journal of Combinatorial Theory (A), 88: 379-384.
1998
- : Size and Structure of Random Ordered Binary Decision Diagrams. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of series Lecture Notes In Computer Science, pages 238 - 248.
- : Zelikovsky's $(1+ln 2)$ Approximation Algorithm for the Steiner Problem in Graphs: A Simplified Analysis. April.
- : Induced Ramsey numbers, Combinatorica, 18: 373-404.
- (editor): Lectures on Proof Verification and Approximation Algorithms, volume 1367 of series LNCS. Springer-Verlag, Berlin. LNCS-Tutorial 1367.
1997
- : Efficient ordering of state variables and transition relation partitions in symbolic model checking. technical report, Humboldt-Universität zu Berlin.
- : RNC-approximation algorithms for the Steiner problem. In: Proceedings Symposium on Theoretical Aspects of Computer Science, volume LNCS 1200, pages 559-570. Springer-Verlag.
1996
- : The average number of linear extensions of a partial order, Journal of Combinatorial Theory (A), 73: 193-206.
- : Einführung in Graphen und Algorithmen. technical report, Humboldt-Universität zu Berlin, September.
- : On the asymptotic structure of sparse triangle free graphs, Journal of Graph Theory, 21: 137-151.
- : Counting H-free graphs, Discrete Mathematics, 154: 311-315.
- : Wie man Beweise verifiziert, ohne sie zu lesen.
1995
- (editor): Trends in Discrete Mathematics, volume 9. North-Holland, Amsterdam, Topics in Discrete Mathematics edition.
- : Probabilistically checkable proofs and their consequences for approximation algorithms. In: Walter A. Deuber, Hans Jürgen Prömel, and Bernd Voigt (editor): Trends in Discrete Mathematics, pages 175-223. North Holland.
- : Random $l$-colorable graphs, Random Structures and Algorithms, 6: 21-37.
1994
- : Probabilistically checkable proofs and their consequences for approximation algorithms, Discrete Mathematics, 136: 175-223.
- : Probabilistische Argumente und algorithmische Probleme in der Diskreten Mathematik.
1993
- : Extremal graph problems for graphs with a color-critical vertex, Combinatorics, Probability and Computing, 2: 465-477.
- : Excluding induced subgraphs. II: Extremal graphs, Discrete Applied Mathematics, 44: 283-294.
- : The asymptotic structure of $H$-free graphs. In: Neil Robertson and Paul D. Seymour (editor): Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, volume 147 of series Contemporary Mathematics, pages 167-178. American Mathematical Society.
1992
- : The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica, 12: 463-473.
- : Coloring Clique-free Graphs in Linear Expected Time, Random Structures and Algorithms, 3(4): 375-402.
- : Almost all Berge graphs are perfect, Combinatorics, Probability and Computing, 1: 53-79.
- : Excluding induced subgraphs III: a general asymptotic, Random Structures and Algorithms, 3: 19-31.
- : From wqo to bqo via Ellentuck's theorem, Discrete Mathematics, 108: 83-106.
1991
- : Routing in VLSI-layout, Acta Mathematica Applicatae Sinica (English Version), 7: 53-66.
- : Excluding induced subgraphs: quadrilaterals, Random Structures and Algorithms, 2: 55-71.
- : Fast growing functions based on Ramsey theorems, Discrete Mathematics, 95: 341-358.
- : Graham-Rothschild parameter words and measurable partitions, Combinatorica, 11: 253-259.
1990
- : VLSI-placement based on routing and timing information. In: Proceedings of the European Design Automation Conference 1990, pages 317-321.
- : Finding clusters in VLSI circuits. In: Proceedings of the IEEE International Conference on Computer-Aided Design, pages 520-523.
- : Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design, Informatik - Forschung und Entwicklung, 5: 2-19.
- : A design-system for ASIC's with macrocells. In: Proceedings of the EURO ASIC'99 Conference 1990, pages 220-224.
- : Steiner trees in VLSI-layout. In: Bernhard Korte, László Lovász, Hans Jürgen Prömel, and Alexander Schrijver (editor): Paths, Flows, and VLSI-Layout, pages 185-214. Springer-Verlag Berlin.
- : Almost bipartite-making graphs. In: Jerzy Jaworski, Michal Karoński, and Andrzej Ruciński (editor): Random graphs '87, Proc. 3rd Int. Semin., Poznan/Poland 1987, pages 275-282. John Wiley, New York.
- : Ramsey theory for the Cantor space, Rostocker Mathematisches Kolloquium, 39: 21-34.
- : A partition theorem for [0,1], Proceedings of the American Mathematical Society, 109: 281-285.
- : A sparse Gallai-Witt theorem. In: Rainer Bodendiek and Rudolf Henn (editor): Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, pages 747-755. Physica Verlag, Heidelberg.
- : Graham-Rothschild parameter sets. In: Jaroslav Nešetřil and Vojtěch Rödl (editor): Mathematics of Ramsey theory, pages 113-149. Springer-Verlag Berlin.
1989
- : Combining partitioning and global routing in sea-of-cells design. In: Proceedings of the IEEE International Conference on Computer-Aided-Design 1989, pages 98-101.
- : Some remarks on natural orders for combinatorial cubes, Discrete Mathematics, 73: 189-198.
- : A short proof of the restricted Ramsey theorem for finite set systems, Journal of Combinatorial Theory (A), 52: 313-320.
1988
- : A sparse Graham-Rothschild theorem, Transactions of the American Mathematical Society, 309: 113-137.
1987
- : $K_ell +1$-free graphs: Asymptotic structures and a $0-1$ law, Transactions of the American Mathematical Society, 303: 637-671.
- : Counting Unlabeled Structures, Journal of Combinatorial Theory (A), 44: 83-93.
- : Aspects of asymptotic graph theory. In: A. Kerber (editor): Publication de I.R.M.A. Strasbourg 1987, Actes 15e S'eminaire Lotharingien, pages 89-95.
- : A canonical restricted version of van der Waerden's theorem, Combinatorica, 7: 115-119.
1986
- : Partition properties of q-hypergraphs, Journal of Combinatorial Theory (B), 41: 356-385.
- : An elementary proof of the canonizing version of Gallai-Witt's theorem, Journal of Combinatorial Theory (A), 42: 144-149.
- : A dual form of Erdos-Rado's canonization theorem, Journal of Combinatorial Theory (A), 42: 159-178.
- : Hereditary attributes of surjections and parameter sets, European Journal on Combinatorics, 7: 161-170.
1985
- : On the sum of the reciprocals of cycle lengths in sparse graphs, Combinatorica, 5: 41-52.
- : Asymptotic enumeration and a $0-1$ law for $m$-clique free graphs, Bulletin of the American Mathematical Society, 13: 160-162.
- : Canonizing ordering theorems for Hales-Jewett structures, Journal of Combinatorial Theory (A), 40: 394-408.
- : Induced partition properties of combinatorial cubes, Journal of Combinatorial Theory (A), 39: 177-208.
- : Canonical Forms of Borel-Measurable Mappings $delta:[omega]omegarightarrow R$, Journal of Combinatorial Theory (A), 40: 409-417.
- : Baire sets of $k$-parameter words are Ramsey, Transactions of the American Mathematical Society, 291: 189-201.
- : Canonizing Ramsey Theory, Discrete Mathematics, 54: 49-59. Nachdruck als Preprint 92-027 SFB 243, Bielefeld 1992.
- : Canonizing Ramsey theorems for finite graphs and hypergraphs, Discrete Mathematics, 54: 49-59.
1984
- : A restricted version of Hales-Jewett's theorem. In: András Hajnal, László Lovász, and Vera T. Sós (editor): Finite and Infinite Sets, Colloquia Mathematica Societatis Jan'os Bolyai, volume 37, pages 231-246. North-Holland, amsterdam.
- : Note on canonizing ordering theorems for Hales-Jewett structures, Supplemento ai Rendiconti del Circolo Matematico di Palermo, Serie II, 3: 191-196.
1983
- : A canonical partition theorem for equivalence relations on $Zt$, Journal of Combinatorial Theory (A), 34: 331-339.
- : Erdos-Szekeres' monotone subsequence theorem for projective points and $q$-graphs, Ars Combinatorica, 16-B: 73-94.
- : Canonical partition theorems for parameter sets, Journal of Combinatorial Theory (A), 35: 309-327.
1982
- : Canonical equivalence relations for chains in trees.
- : A canonical partition theorem for chains in regular trees. In: Dieter Jungnickel and K. Vedder (editor): Combinatorial Theory, volume 969 of series Springer Lecture Notes in Mathematics, pages 115-132. Springer.
- : Canonical ordering theorems, a first attempt, Supplemento ai Rendiconti del Circolo Matematico di Palermo, Serie II, 2: 193-197.
- : Canonical partition theorems for finite distributive lattices, Supplemento ai Rendiconti del Circolo Matematico di Palermo, Serie II, 2: 223-237.
1981
- : Partition theorems for parameter systems and graphs, Discrete Mathematics, 36: 83-96.
- : Recent results in partition (Ramsey) theory for finite lattices, Discrete Mathematics, 35: 185-198.
