| Publication | Date of Publication | Type |
|---|
Snakes and ladders and intransitivity, or what mathematicians do in their time off
The Mathematical Intelligencer | 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
Random Structures & Algorithms | 2023-10-12 | Paper |
scientific article; zbMATH DE number 7650127 (Why is no real title available?)
(available as arXiv preprint) | 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
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
Minimum-weight combinatorial structures under random cost-constraints
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Successive shortest paths in complete graphs with random edge weights
Random Structures & Algorithms | 2021-01-05 | Paper |
The Ising antiferromagnet and max cut on random regular graphs
(available as arXiv preprint) | 2020-09-22 | Paper |
Successive minimum spanning trees
(available as arXiv preprint) | 2019-06-04 | Paper |
| A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between | 2019-05-06 | Paper |
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
ACM Transactions on Algorithms | 2018-11-12 | Paper |
The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
SIAM Journal on Discrete Mathematics | 2018-08-15 | Paper |
The satisfiability threshold for \(k\)-XORSAT
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Configuration space analysis for optimization problems
Disordered Systems and Biological Organization | 2017-02-24 | Paper |
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
Automata, Languages, and Programming | 2015-10-27 | Paper |
Phase coexistence and torpid mixing in the 3-coloring model on \({\mathbb Z}^d\)
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Efficient algorithms for three‐dimensional axial and planar random assignment problems
Random Structures & Algorithms | 2015-02-20 | Paper |
Efficient algorithms for three‐dimensional axial and planar random assignment problems
Random Structures & Algorithms | 2015-02-20 | Paper |
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms | 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
Journal of Computer and System Sciences | 2012-05-11 | Paper |
First-passage percolation on a ladder graph, and the path cost in a VCG auction
Random Structures & Algorithms | 2011-05-11 | Paper |
| Structure of random r-SAT below the pure literal threshold | 2010-08-06 | Paper |
Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Average-Case Analyses of Vickrey Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Robust reductions from ranking to classification
Machine Learning | 2009-03-31 | Paper |
A tight bound on the collection of edges in MSTs of induced subgraphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
A tight bound on the collection of edges in MSTs of induced subgraphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
The Power of Choice in a Generalized Pólya Urn Model
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization | 2008-05-14 | Paper |
An LP-Designed Algorithm for Constraint Satisfaction
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Robust Reductions from Ranking to Classification
Learning Theory | 2008-01-03 | Paper |
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
SIAM Journal on Computing | 2007-10-22 | Paper |
Random 2-SAT with prescribed literal degrees
Algorithmica | 2007-08-20 | Paper |
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
Embracing the giant component
Random Structures & Algorithms | 2005-11-15 | Paper |
A two-variable interlace polynomial
Combinatorica | 2005-07-05 | Paper |
The interlace polynomial of a graph
Journal of Combinatorial Theory. Series B | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2119678 (Why is no real title available?) | 2004-11-29 | Paper |
Random MAX SAT, random MAX CUT, and their phase transitions
Random Structures & Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2083805 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079360 (Why is no real title available?) | 2004-07-28 | Paper |
Strings with maximally many distinct subsequences and substrings
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
Strings with maximally many distinct subsequences and substrings
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
| The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 | 2003-10-13 | Paper |
| scientific article; zbMATH DE number 1802784 (Why is no real title available?) | 2003-02-16 | Paper |
Euler circuits and DNA sequencing by hybridization
Discrete Applied Mathematics | 2002-11-13 | Paper |
| scientific article; zbMATH DE number 1787233 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1445310 (Why is no real title available?) | 2001-02-13 | Paper |
| The probabilistic relationship between the assignment and asymmetric traveling salesman problems. | 2001-01-01 | Paper |
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing | 2000-10-18 | Paper |
The Metropolis algorithm for graph bisection
Discrete Applied Mathematics | 2000-03-13 | Paper |
| Constructive bounds and exact expectations for the random assignment problem | 1999-09-22 | Paper |
Constructing Computer Virus Phylogenies
Journal of Algorithms | 1998-02-09 | Paper |
Efficient simulated annealing on fractal energy landscapes
Algorithmica | 1991-01-01 | Paper |
The Enumeration of Nonhomeomorphic Graphs by Edges
Combinatorics 79 | 1980-01-01 | Paper |
Matchings and loose cycles in the semirandom hypergraph model
(available as arXiv preprint) | N/A | Paper |
