| Publication | Date of Publication | Type |
|---|
| Snakes and ladders and intransitivity, or what mathematicians do in their time off | 2024-02-27 | Paper |
| Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds | 2023-11-09 | Paper |
| Successive minimum spanning trees | 2023-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875520 | 2023-02-03 | Paper |
| Hamilton cycles in a semi-random graph model | 2022-07-30 | Paper |
| The Ising Antiferromagnet and Max Cut on Random Regular Graphs | 2022-06-03 | Paper |
| Minimum-weight combinatorial structures under random cost-constraints | 2021-01-29 | Paper |
| Successive shortest paths in complete graphs with random edge weights | 2021-01-05 | Paper |
| The Ising antiferromagnet and max cut on random regular graphs | 2020-09-22 | Paper |
| Successive minimum spanning trees | 2019-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633872 | 2019-05-06 | Paper |
| Separate, Measure and Conquer | 2018-11-12 | Paper |
| The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights | 2018-08-15 | Paper |
| The Satisfiability Threshold fork-XORSAT | 2017-10-10 | Paper |
| Configuration Space Analysis for Optimization Problems | 2017-02-24 | Paper |
| Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets | 2015-10-27 | Paper |
| Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$ | 2015-07-31 | Paper |
| Efficient algorithms for three‐dimensional axial and planar random assignment problems | 2015-02-20 | Paper |
| Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function | 2014-11-18 | Paper |
| The Satisfiability Threshold for $k$-XORSAT, using an alternative proof | 2012-12-16 | Paper |
| A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between | 2012-05-11 | Paper |
| First-passage percolation on a ladder graph, and the path cost in a VCG auction | 2011-05-11 | Paper |
| Structure of random r-SAT below the pure literal threshold | 2010-08-06 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Average-Case Analyses of Vickrey Costs | 2009-10-28 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Robust reductions from ranking to classification | 2009-03-31 | Paper |
| A tight bound on the collection of edges in MSTs of induced subgraphs | 2009-03-04 | Paper |
| The Power of Choice in a Generalized Pólya Urn Model | 2008-11-27 | Paper |
| Linear-programming design and analysis of fast algorithms for Max 2-CSP | 2008-05-14 | Paper |
| An LP-Designed Algorithm for Constraint Satisfaction | 2008-03-11 | Paper |
| Robust Reductions from Ranking to Classification | 2008-01-03 | Paper |
| The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems | 2007-10-22 | Paper |
| Random 2-SAT with prescribed literal degrees | 2007-08-20 | Paper |
| Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time | 2006-03-13 | Paper |
| Embracing the giant component | 2005-11-15 | Paper |
| A two-variable interlace polynomial | 2005-07-05 | Paper |
| The interlace polynomial of a graph | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828949 | 2004-11-29 | Paper |
| Random MAX SAT, random MAX CUT, and their phase transitions | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739606 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471319 | 2004-07-28 | Paper |
| Strings with maximally many distinct subsequences and substrings | 2004-02-05 | Paper |
| The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3147236 | 2003-02-16 | Paper |
| Euler circuits and DNA sequencing by hybridization | 2002-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550238 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952623 | 2001-02-13 | Paper |
| The probabilistic relationship between the assignment and asymmetric traveling salesman problems. | 2001-01-01 | Paper |
| Gadgets, Approximation, and Linear Programming | 2000-10-18 | Paper |
| The Metropolis algorithm for graph bisection | 2000-03-13 | Paper |
| Constructive bounds and exact expectations for the random assignment problem | 1999-09-22 | Paper |
| Constructing Computer Virus Phylogenies | 1998-02-09 | Paper |
| Efficient simulated annealing on fractal energy landscapes | 1991-01-01 | Paper |
| The Enumeration of Nonhomeomorphic Graphs by Edges | 1980-01-01 | Paper |
| Matchings and loose cycles in the semirandom hypergraph model | N/A | Paper |
