2009+
- : Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions, SIAM Journal on Computing. to appear; Extended Abstract appeared in Proceedings of ICALP 2007.
- : Enumeration and limit laws of series-parallel graphs, European Journal on Combinatorics. Accepted for publication.
- : A direct decomposition of 3-connected planar graphs, Séminaire Lotharingien de Combinatoire. Accepted for publication.
- : Generating Labeled Planar Graphs Uniformly at Random, Theoretical Computer Science. To appear.
- : The Complexity of Equality Constraint Languages, Theory of Computing Systems. Accepted for publication.
- : A Fast Algorithm and Lower Bound for Temporal Reasoning. In: Submitted.
- : The first order definability of trees and sparse random graphs, Combinatorics, Probability and Computing. to appear.
- : Solving NP-hard semirandom graph problems in polynomial expected time, Journal of Algorithms. to appear.
- : Coloring semirandom graphs, Combinatorics, Probability and Computing. to appear.
- : Counting connected graphs and hypergraphs via the probabilistic method, Random Structures and Algorithms. to appear.
- : Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Journal of Combinatorial Theory (B). to appear.
- : Note on bipartite graph tilings, SIAM Journal on Discrete Mathematics. to appear.
- : The phase transition of the minimum degree random multi-graph process, Random Structures and Algorithms. accepted for publication.
- : Weak regularity and linear hypergraphs, Journal of Combinatorial Theory (B). to appear.
- : Generalizations of the removal lemma, Combinatorica. to appear; Extended abstract appeared in Proceedings of STOC 2007.
2009
- : Proof of the bandwidth conjecture of Bollobás and Komlós, Math. Ann., 343(1): 175-205. Extended abstract appeared in Electron. Notes Discrete Math. 29, pages 485-489..
- : Note on strong refutation algorithms for random k-SAT formulas. In: Proceedings of LAGOS 2009. to appear.
- : On perfect matchings in uniform hypergraphs with large minimum vertex degree, SIAM Journal on Discrete Mathematics, 23(2): 732-748.
- : On colorings of hypergraphs without monochromatic Fano planes, Combinatorics, Probability and Computing, 18(5): 803-818.
- : Hypergraph regularity and quasi-randomness. In: Claire Mathieu (Herausgeber): Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), Seiten 227-235. ACM Press.
- : An expected polynomial time algorithm for coloring 2-colorable 3-graphs. In: Proceedings of EuroComb 09, Band 34 der Reihe Electron. Notes Discrete Math., Seiten 465-469. full article.
- : Almost all hypergraphs without Fano planes are bipartite. In: Claire Mathieu (Herausgeber): Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), Seiten 217-226. ACM Press.
- : Approximating optimum branchings in linear time, Information Processing Letters, 109: 175-178.
2008
- : Superimposé: a 3D structural superposition server, Nucleic Acids Research, 36(Web Server Issue): 47-54.
- : Die Eulertour. In: Berthold Vöcking, M. Dietzfelbinger, Helmut Alt, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer und Dorothea Wagner (Herausgeber): Taschenbuch der Algorithmen, eXamen.press, Kapitel 29, Seiten 295-301. Springer.
- : Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Journal of Combinatorial Theory (B), 98(4): 752–777. Extended abstract appeared in Proceedings of SODA 2007, pages 618-626..
- : Polyhedral tori with minimal integer coordinates, Electronic Geometry Models, 2008.10.001.
- : On the Ramsey number of sparse 3-graphs, Graphs and Combinatorics, 24(3): 205-228.
- : Note on the 3-graph counting lemma, Discrete Mathematics, 308(19): 4501-4517.
- : A note on perfect matchings in uniform hypergraphs with large minimum collective degree, Commentationes Mathematicae Universitatis Carolinae, 49(4): 633-636.
- : Approximation algorithms for restricted Bayesian network structures, Information Processing Letters, 108: 60-63.
2007
- : Quasi-randomness and algorithmic regularity for graphs with general degree distributions. In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, Band 4596 der Reihe Lecture Notes in Computer Science, Seiten 789-800. Springer. full version.
- : Every monotone 3-graph property is testable, SIAM Journal on Discrete Mathematics, 21(1): 73-92. Extended abstract appeared in: Electron. Notes Discrete Math. 22, pages 539-542.
- : Component evolution in random intersection graphs, Electronic Journal of Combinatorics, 14(1).
- : Cores of Countably Categorical Structures, Logical Methods in Computer Science. DOI: 10.2168/LMCS-3(1:2).
- : Quantified Equality Constraints. In: Logic in Computer Science (LICS07).
- : Qualitative Temporal and Spatial Reasoning Revisited. In: Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic (CSL07).
- : Maximal Infinite-valued Constraint Languages. In: International Colloquium on Colloquium on Automata, Languages and Programming (ICALP07). To appear.
- : An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA07), Seiten 356-365.
- : A direct decomposition of 3-connected planar graphs, Séminaire Lotharingien de Combinatoire, 54A: Article B54Ak, 15 pp. An earlier version of the paper was presented at the 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC05)..
- : Random cubic planar graphs, Random Structures and Algorithms, 30: 78-94.
- : Determining the Consistency of Partial Tree Descriptions, Artificial Intelligence, 171: 185-196.
- : Essentially infinite colourings of hypergraphs, Proceedings of the London Mathematical Society, 95(3): 709-–734. Extended abstract appeared in: Electron. Notes Discrete Math. 19, pages 179-185..
- : Embedding spanning subgraphs of small bandwidth. In: Proceedings of EuroComb 07, Band 29 der Reihe Electron. Notes Discrete Math., Seiten 485-489. full article.
- : On the bandwidth conjecture for 3-colourable graphs. In: Hal Gabow (Herausgeber): Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 07), Seiten 618-626. ACM Press. full article.
- : Strong refutation heuristics for random k-SAT, Combinatorics, Probability and Computing, 16: 5-28.
- : Polyhedra of genus 3 with 10 vertices and minimal coordinates, Electronic Geometry Models, 2006.02.001.
- : Polyhedra of genus 2 with 10 vertices and minimal coordinates, Electronic Geometry Models, 2005.08.001.
- : Turán's theorem for pseudo-random graphs, Journal of Combinatorial Theory (A), 114(4): 631-657.
- : Ramsey properties of random k-partite k-uniform hypergraphs, SIAM Journal on Discrete Mathematics, 21(2): 442-460.
- : Regular partitions of hypergraphs: Counting Lemmas, Combinatorics, Probability and Computing, 16(6): 887-901.
- : Regular partitions of hypergraphs: Regularity Lemmas, Combinatorics, Probability and Computing, 16(6): 833-885.
- : Property testing in hypergraphs and the removal lemma. In: David S. Johnson und Uriel Feige (Herausgeber): Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 11-13, 2007, Seiten 488-495. ACM Press. full article.
- : Integer and fractional packings of hypergraphs, Journal of Combinatorial Theory (B), 97(2): 245-268.
- : Optimal Per-Edge Processing Times in the Semi-Streaming Model, Information Processing Letters, 104(3): 106-112.
2006
- : On six problems posed by Jarik Nešetřil. In: M. Klazar, J. Kratochvil, Martin Loebl, J. Matoušek, Robin Thomas und Pavel Valtr (Herausgeber): Topics in Discrete Mathematics, Band 26 der Reihe Algorithms Combin., Seiten 613-627. Springer, Berlin.
- : Zufällige Graphen. In: Wolfgang Reisig und Johann Christoph Freytag (Herausgeber): Informatik - Aktuelle Themen im historischen Kontext, Seiten 49-77. Springer.
- : Efficiently covering complex networks with cliques of similar vertices, Theoretical Computer Science, 355(1): 37-47, April.
- : Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. In: Computer Science Logic (CSL06), LNCS 4207, Seiten 197-211, Szeged, Hungary.
- : Datalog and Constraint Satisfaction with Infinite Templates. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS06), Marseille, LNCS 3884, Seiten 646-659. Springer Verlag.
- : Generating outerplanar graphs uniformly at random, Combinatorics, Probability and Computing, 15: 333-343. An earlier version of the paper was presented at the 1st workshop on Algorithms for Listing, Counting, and Enumeration (ALICE03)..
- : Generating outerplanar graphs uniformly at random, Combinatorics, Probability and Computing, 15(03): 333-343.
- : The Complexity of Equality Constraint Languages. In: Proceedings of the International Computer Science Symposium in Russia (CSR06), LNCS 3967, Seiten 114-126. Springer Verlag.
- : Constraint Satisfaction with Countable Homogeneous Templates, Journal of Logic and Computation (JLC), 16(3): 359-373.
- : A spectral heuristic for bisecting random graphs, Random Structures and Algorithms, 29: 351-398.
- : Finding large independent sets in polynomial expected time, Combinatorics, Probability and Computing, 15: 731-751.
- : An adaptive spectral heuristic for partitioning random graphs. In: ICALP, Nummer 4051 in LNCS, Seiten 691-702. Springer. JOURNAL VERSION.
- : Spectral partitioning of random graphs with given expected degrees. In: Gonzalo Navarro, Leopoldo Bertossi und Yoshiharu Kohayakawa (Herausgeber): 4th IFIP International Conference on Theoretical Computer Science - TCS 2006 (19th World Computer Congress 2006, Santiago de Chile), Seiten 271-282.
- : A heuristic for the stacker crane problem on trees which is almost surely exact, Journal of Algorithms, 61: 1-19.
- : An improved algorithm for approximating the chromatic number of G(n,p), Information Processing Letters, 99: 234-238.
- : The spectral gap of random graphs with given expected degrees. In: ICALP, Nummer 4051 in LNCS, Seiten 15-26. Springer.
- : MAX k-CUT and approximating the chromatic number of random graphs, Random Structures and Algorithms, 28: 289-322.
- : Reconstruction of Bayesian networks from mRNA and metabolite expression data. In: Systems Biology: Global Regulation of Gene Expression.
- : Classes of perfect graphs, Discrete Mathematics, 306(19-20): 2529-2571.
- : On a conjecture of Hoàng and Tu concerning perfectly orderable graphs, Discrete Mathematics, 306(22): 2962-2963.
- : Lower Bounds for the Relative Greedy Algorithm for Approximating Steiner Trees, Networks, 47(2): 111-115.
- : Approximating weighted matchings in parallel, Information Processing Letters, 99(3): 119-123.
- : The connectivity threshold for the min-degree random graph process, Random Structures and Algorithms, 29: 105-120.
- : The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms, 28(2): 113-179.
- : Extremal hypergraph problems and the regularity method. In: M. Klazar, J. Kratochvil, Martin Loebl, J. Matoušek, Robin Thomas und Pavel Valtr (Herausgeber): Topics in Discrete Mathematics, Band 26 der Reihe Algorithms Combin., Seiten 247-278. Springer, Berlin.
- : Density theorems and extremal hypergraph problems, Israel Journal of Mathematics, 152: 371-380.
2005
- : Every Monotone 3-Graph Property is Testable. In: 7th International Colloquium on Graph Theory, Band 22 der Reihe Electron. Notes Discrete Math., Seiten 539-542, Amsterdam. full article.
- : The Core of a Countably Categorical Structure. In: Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS05), Band LNCS 3404, Seiten 110-120, Stuttgart. Springer.
- : Representing Series-parallel Graphs as Intersection Graphs of Line Segments in Three Directions. In: Asian Applied Computing Conference.
- : On the number of series-parallel and outerplanar graphs. In: Proceedings of European Conference on Combinatorics, Graph Theory, and Applications (EuroComb05), DMTCS Proceedings Series, Seiten 383 - 388.
- : Sampling unlabeled biconnected planar graphs. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC05), LNCS 3827, Seiten 593-603. Springer Verlag.
- : Locally Consistent Constraint Satisfaction Problems with Binary Constraints. In: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG05), LNCS 3787, Seiten 295 - 306. Springer Verlag.
- : Well-nested Drawings as Models of Syntactic Structure. In: Proceedings of the 10th conference on Formal Grammer and the 9th Meeting on Mathematics of Language (FG-MOL05), Edinburgh.
- : A spectral heuristic for bisecting random graphs. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, Seiten 850-859. JOURNAL VERSION.
- : The Lovasz number of random graphs, Combinatorics, Probability and Computing, 14: 439-465.
- : A hard dial-a-ride problem that is easy on average, Journal of Scheduling, 8: 197-210.
- : Limit theorems for non-commutative random variables, Journal of Theoretical Probability, 18: 595-614.
- : On the computational complexity of the forcing chromatic number. In: V. Diekert und B. Durand (Herausgeber): Proc. of the 22nd Int. Symp. on Theoretical Aspects of the Computer Science (STACS 2005), Lecture Notes in Computer Science.
- : Maximum K_r+1-free graphs which are not r-partite, Mat. Studii, 24: 12-20.
- : How complex are random graphs in first order logic?, Random Structures and Algorithms, 26: 119-145.
- : Spanning triangulations in graphs, Journal of Graph Theory, 49: 205-233.
- : Packings in dense regular graphs, Combinatorics, Probability and Computing, 14: 325-337.
- : 4-cycles in graphs without a forbidden even cycle, Journal of Graph Theory, 48: 147-156.
- : Decomposable graphs and definitions with no quantifier alternation. In: Proc. of the 3rd European Conference on Combinatorics, Graph Theory and Applications EuroComb'2005, Berlin, Seiten 25-30. journal version submitted to European Journal of Combinatorics.
- : Descriptive complexity of finite structures: saving the quantifier rank, Journal of Symbolic Logic, 70(2): 419-450.
- : Complete disorder is impossible: The mathematical work of Walter Deuber, Combinatorics, Probability and Computing, 14: 3-16.
- : The hypergraph regularity method and its applications, Proceedings of the National Academy of Sciences USA, 102(23): 8109-8113.
- : Globally bounded local edge colourings of hypergraphs. In: Proceedings of GRACO 2005, Band 19 der Reihe Electron. Notes Discrete Math., Seiten 179-185, Amsterdam. full article.
- : The first order definability of graphs with separators via the Ehrenfeucht game, Theoretical Computer Science, 343(1-2): 158-176.
- : A linear time approximation algorithm for weighted matchings in graphs, ACM Transactions on Algorithms, 1(1): 107-122.
2004
- : A new algorithm for normal dominance constraints. In: Proceedings of the Symposium on Discrete Algorithms (SODA04), Seiten 59-67.
- : Efficiently Computing the Limit Density of Regular Languages. In: Proceedings of Latin American INformatics (LATIN'04), LNCS 2976, Seiten 262-270, Buenos Aires. Springer Verlag. LATIN04.
- : Popularity based random graph models leading to a scale-free degree sequence, Discrete Mathematics, 282: 53-68.
- : Coloring semirandom graphs optimally. In: Josep Diaz, Juhani Karhumäki, Arto Lepistö und Donald Sannella (Herausgeber): Automata, Languages and Programming: 31st International Colloquium (ICALP 2004), Band 3142 der Reihe LNCS, Seiten 383-395. Springer. JOURNAL VERSION.
- : Strong refutation heuristics for random k-SAT. In: Klaus Jansen, Sanjeev Khanna, Jose D. P. Rolim und Dana Ron (Herausgeber): Approximation, Randomization, and Combinatorial Optimization, Nummer 3122 in LNCS, Seiten 310-321. Springer. JOURNAL VERSION.
- : Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT, Theoretical Computer Science, 329: 1-45.
- : Counting connected graphs and hypergraphs via the probabilistic method. In: Klaus Jansen, Sanjeev Khanna, Jose D. P. Rolim und Dana Ron (Herausgeber): Approximation, Randomization, and Combinatorial Optimization, Nummer 3122, Seiten 322-333. Springer. JOURNAL VERSION.
- : Exact and approximative algorithms for coloring G(n,p), Random Structures and Algorithms, 24(3): 259-278, May.
- : On approximation algorithms for the terminal Steiner tree problem, Information Processing Letters, 89: 15-18.
- : Ordered binary decision diagrams and the Shannon effect, Discrete Applied Mathematics, 142: 67-85.
- : On simplicial and co-simplicial vertices in graphs, Discrete Applied Mathematics, 138: 117-132.
- : Approximation Algorithms for the Weighted Matching Problem, Oberwolfach Reports, 1(3): 1503-1506.
- : Perfectness is an Elusive Graph Property, SIAM Journal on Computing, 34(1): 109-117.
- : Random walks on finite graphs with congestion points, Applied Mathematics and Computation, 153: 601-610.
- : Efficiency test of pseudorandom number generators using random walks, Journal of Computational and Applied Mathematics, 174(1): 165-177.
- : Complete minors in $K_s,s$-free graphs, Combinatorica, 25: 49-61.
- : Subdivisions of $K_r+2$ in graphs of average degree at least $r+varepsilon$ and large but constant girth, Combinatorics, Probability and Computing, 13: 361-371.
- : Large topological cliques in graphs without a 4-cycle, Combinatorics, Probability and Computing, 13: 93-102.
- : Every graph of sufficiently large average degree contains a C_4-free subgraph of large average degree, Combinatorica, 24: 155-162.
- : Induced subdivisions in $K_s,s$-free graphs of large average degree, Combinatorica, 24: 287-304.
- : Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database, Journal of Chemical Information and Computer Sciences, 44: 1816-1822.
2003
- : Generating Labeled Planar Graphs Uniformly at Random. In: Proceedings of the Thirtieth International Colloquium on Automata, Languages and Programming (ICALP'03), LNCS 2719, Seiten 1095-1107. Springer Verlag. Journal version to appear in Theoretical Computer Science.
- : Constraint Satisfaction with Countable Homogeneous Templates. In: Proceedings of Computer Science Logic (CSL03), LNCS 2803, Seiten 44-57, Vienna. Springer Verlag.
- : Finding large independent sets in polynomial expected time. In: Helmut Alt und M. Habib (Herausgeber): STACS 2003, Band 2607 der Reihe LNCS, Seiten 511-522. Springer. JOURNAL VERSION.
- : The Lovasz number of random graphs. In: Sanjeev Arora, Klaus Jansen, Jose D. P. Rolim und A. Sahai (Herausgeber): Approximation, randomization, and combinatorial optimization, Band 2764 der Reihe LNCS, Seiten 228-239. Springer. JOURNAL VERSION.
- : Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques. In: A. Lingas und B. J. Nilsson (Herausgeber): FCT 2003, Band 2751 der Reihe LNCS, Seiten 15-26. Springer. JOURNAL VERSION.
- : A heuristic for the stacker crane problem on trees which is almost surely exact. In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, Band 2906 der Reihe LNCS, Seiten 605-614. Springer. JOURNAL VERSION.
- : MAX k-CUT and approximating the chromatic number of random graphs. In: J. C. M. Baeten, Jan Karel Lenstra, J. Parrow und Gerhard J. Woeginger (Herausgeber): Automata, Languages and Programming (30th International Colloquium, ICALP 2003), Band 2719 der Reihe LNCS, Seiten 200-211. Springer. JOURNAL VERSION.
- : Revisiting the algebra of Petri net processes under the collective token philosophy, Fundamenta Informaticae, 54: 151-164.
- : Colouring random graphs in polynomial expected time. In: Helmut Alt und M. Habib (Herausgeber): STACS 2003, Band 2607 der Reihe LNCS, Seiten 487-498. Springer. JOURNAL VERSION.
- : A Simple Approximation Algorithm for the Weighted Matching Problem, Information Processing Letters, 85: 211-213.
- : Improved Linear Time Approximation Algorithms for Weighted Matchings. In: Sanjeev Arora, Klaus Jansen, Jose D. P. Rolim und A. Sahai (Herausgeber): Approximation, Randomization, and Combinatorial Optimization, Nummer 2764 in LNCS 2764, Seiten 14-23. Springer.
- : Linear Time Local Improvements for Weighted Matchings in Graphs. In: Klaus Jansen, M. Margraf, M. Mastrolli und Jose D. P. Rolim (Herausgeber): WEA 2003, Nummer 2647 in LNCS, Seiten 107-119. Springer.
- : Accelerating screening of 3D protein data with a graph theoretical approach, Bioinformatics, 19(18): 2442-2447.
- : Independent Deuber sets in graphs on the natural numbers, Journal of Combinatorial Theory (A), 103: 305-322.
- : First hitting times of simple random walks on graphs with congestion points, International Journal of Mathematics and Mathematical Sciences, 30: 1911-1922.
- : Minors in graphs of large girth, Random Structures and Algorithms, 22: 213-225.
- : Partitions of graphs of high minimum degree or connectivity, Journal of Combinatorial Theory (B), 88: 29-43.
- : 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.
- : On the Approximability of the Steiner Tree Problem, Theoretical Computer Science, 295: 387-402.
2002
- : Pure Dominance Constraints. In: Preceedings of the 19th Symposium on Theoretical Aspects of Computer Science (STACS02), LNCS 2285, Seiten 287-298, Antibes - Juan le Pins. Springer Verlag.
- : Recursive generation of partitionable graphs, Journal of Graph Theory, 41(4): 259-285.
- : Coloring k-colorable Semi-Random Graphs in Polynomial Expected Time via Semidefinite Programming. In: Krzystof Diks und W. Rytter (Herausgeber): Mathematical Foundations of Computer Science 2002, Band 2420 der Reihe LNCS, Seiten 201-211. JOURNAL VERSION.
- : Finding sparse induced subgraphs of semirandom graphs. In: Jose D. P. Rolim und S. Vadhan (Herausgeber): Randomization and approximation techniques in computer science, Band 2483 der Reihe LNCS, Seiten 139-148. Springer. JOURNAL VERSION.
- : Steiner trees in uniformly quasi-bipartite graphs, Information Processing Letters, 83: 195-200.
- : Polynomial Time Recognition of P4-structure. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms.
- : The Width of Random Subsets of Boolean Lattices, Journal of Combinatorial Theory (A), 100(2): 376-386.
- : Topological minors in graphs of large girth, Journal of Combinatorial Theory (B), 86: 364-380.
- : 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.
2001
- : Lower bounds for approximation algorithms for the Steiner tree problem. In: Proceedings WG 2001, Band 2204 der Reihe LNCS. Springer Verlag.
- : Approximation algorithms for the Steiner tree problem in graphs. In: Xiuzhen Cheng und Ding-Zhu Du (Herausgeber): Steiner Trees in Industry, Seiten 235-279. Kluwer Academic Publishers.
- : 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.
- : The P4-Structure of Perfect Graphs. In: Jorge L. Ramírez-Alfonsín und Bruce A. Reed (Herausgeber): Perfect Graphs, Kapitel 5, Seiten 93-112. John Wiley & Sons.
- : 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 (Herausgeber): Computational Discrete Mathematics, Band 2122 der Reihe LNCS Tutorial, Seite 98 ff.. Springer-Verlag.
- : On the approximability of the Steiner tree problem. In: Proc. MFCS, Band 2136 der Reihe LNCS, Seiten 678-689. Springer.
2000
- : The length of random subsets of Boolean lattices, Random Structures and Algorithms, 16: 117-194.
- : A Tight Bound on the Irregularity Strength of Graphs, SIAM Journal on Discrete Mathematics, 13(3): 313-323.
- : Maximum antichains in random subsets of a finite set, Journal of Combinatorial Theory (A), 90: 336-346.
- : 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.
- : Best Practice Simulated Annealing for the Airline Crew Scheduling Problem, Journal of Heuristics, 5(4): 419-436.
- : On wing perfect graphs, Journal of Graph Theory, 31: 51-66.
- : A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Seiten 448-453.
- : Non-Ramsey graphs are $c log n$-universal, Journal of Combinatorial Theory (A), 88: 379-384.
1998
- : Uniquely colourable graphs and the hardness of colouring graphs of large girth, Combinatorics, Probability and Computing, 7: 375-386.
- : Size and Structure of Random Ordered Binary Decision Diagrams. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Band 1373 der Reihe Lecture Notes In Computer Science, Seiten 238 - 248.
- : Parallel Repetition of MIP(2,1) Systems. In: Ernst W. Mayr, Hans Jürgen Prömel und Angelika Steger (Herausgeber): Lectures on Proof Verification and Approximation Algorithms, Nummer 1367 in Lecture Notes in Computer Science, Kapitel 6, Seiten 161-177. Springer.
- : Proof Checking and Non-Approximability. In: Ernst W. Mayr, Hans Jürgen Prömel und Angelika Steger (Herausgeber): Lectures on Proof Verification and Approximation Algorithms, Kapitel 4, Seiten 63-82. Springer.
- : Induced Ramsey numbers, Combinatorica, 18: 373-404.
- : Small sublattices in random subsets of Boolean lattices, Random Structures and Algorithms, 13: 383-407.
1997
- : Does the Jones-polynomial detect unknottedness ?, Experimental Mathematics, 6: 51-56.
- : Perfect graphs with unique P4-structure, Discrete Mathematics, 165/166: 421-430.
- : Wing triangulated graphs are perfect, Journal of Graph Theory, 24: 25-31.
- : Threshold functions for asymmetric Ramsey properties involving cycles, Random Structures and Algorithms, 11: 245-276.
- : Greedily Approximating the $r$-independent Set and $k$-center Problems on Random Instances. In: Jose D. P. Rolim (Herausgeber): Randomization and Approximation Techniques in Computer Science, Band 1269 der Reihe LNCS, Seiten 43-53, jul. Springer.
- : RNC-approximation algorithms for the Steiner problem. In: Proceedings Symposium on Theoretical Aspects of Computer Science, Band LNCS 1200, Seiten 559-570. Springer-Verlag.
1996
- : The average number of linear extensions of a partial order, Journal of Combinatorial Theory (A), 73: 193-206.
- : A conjecture of Kauffman on amphicheiral alternating knots, Journal of Knot Theory and Its Ramifications, 5(5): 629-635.
- : Set intersection representations for almost all graphs, Journal of Graph Theory, 23: 309-320.
- : On the P4-structure of perfect graphs V. Overlap graphs, Journal of Combinatorial Theory (B), 67: 212-237.
- : Even pairs and the strong perfect graph conjecture, Discrete Mathematics, 154: 277-278.
- : Threshold functions for asymmetric Ramsey properties with respect to vertex colorings, Random Structures and Algorithms, 9: 335-348.
- : 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.
1995
- : The genus of a random graph, Discrete Mathematics, 142: 21-37.
- : The diameter of a random graph with bounded diameter, Random Structures and Algorithms, 6: 193-199.
- : The minimum independence number for designs, Combinatorica, 15: 175-185.
- : Even and odd pairs in linegraphs of bipartite graphs, European Journal on Combinatorics, 16: 17-21.
- : Probabilistically checkable proofs and their consequences for approximation algorithms. In: Walter A. Deuber, Hans Jürgen Prömel und Bernd Voigt (Herausgeber): Trends in Discrete Mathematics, Seiten 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.
1993
- : Counterexamples to three conjectures concerning perfect graphs, Discrete Mathematics, 117: 245-251.
- : 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 und Paul D. Seymour (Herausgeber): Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, Band 147 der Reihe Contemporary Mathematics, Seiten 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, Seiten 317-321.
- : Finding clusters in VLSI circuits. In: Proceedings of the IEEE International Conference on Computer-Aided Design, Seiten 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, Seiten 220-224.
- : Steiner trees in VLSI-layout. In: Bernhard Korte, László Lovász, Hans Jürgen Prömel und Alexander Schrijver (Herausgeber): Paths, Flows, and VLSI-Layout, Seiten 185-214. Springer-Verlag Berlin.
- : Almost bipartite-making graphs. In: Jerzy Jaworski, Michal Karoński und Andrzej Ruciński (Herausgeber): Random graphs '87, Proc. 3rd Int. Semin., Poznan/Poland 1987, Seiten 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 und Rudolf Henn (Herausgeber): Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, Seiten 747-755. Physica Verlag, Heidelberg.
- : Graham-Rothschild parameter sets. In: Jaroslav Nešetřil und Vojtěch Rödl (Herausgeber): Mathematics of Ramsey theory, Seiten 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, Seiten 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 (Herausgeber): Publication de I.R.M.A. Strasbourg 1987, Actes 15e S'eminaire Lotharingien, Seiten 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 und Vera T. Sós (Herausgeber): Finite and Infinite Sets, Colloquia Mathematica Societatis Jan'os Bolyai, Band 37, Seiten 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
- : A canonical partition theorem for chains in regular trees. In: Dieter Jungnickel und K. Vedder (Herausgeber): Combinatorial Theory, Band 969 der Reihe Springer Lecture Notes in Mathematics, Seiten 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.
