| Publication | Date of Publication | Type |
|---|
| Hamilton completion and the path cover number of sparse random graphs | 2024-03-26 | Paper |
| On vertex Ramsey graphs with forbidden subgraphs | 2024-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147255 | 2024-01-15 | Paper |
| Colouring random subgraphs | 2023-12-13 | Paper |
| Climbing up a random subgraph of the hypercube | 2023-11-28 | Paper |
| Rigid partitions: from high connectivity to random graphs | 2023-11-24 | Paper |
| Supercritical site percolation on the hypercube: small components are small | 2023-11-23 | Paper |
| Component sizes in the supercritical percolation on the binary cube | 2023-11-13 | Paper |
| Cycle lengths in randomly perturbed graphs | 2023-11-07 | Paper |
| The largest hole in sparse random graphs | 2023-10-17 | Paper |
| Cycle lengths in sparse random graphs | 2023-10-17 | Paper |
| Site percolation on pseudo‐random graphs | 2023-10-17 | Paper |
| Complete minors and average degree: A short proof | 2023-10-12 | Paper |
| The size‐Ramsey number of short subdivisions | 2023-10-12 | Paper |
| Color‐biased Hamilton cycles in random graphs | 2023-10-12 | Paper |
| On subgraphs with degrees of prescribed residues in the random graph | 2023-10-12 | Paper |
| Oriented discrepancy of Hamilton cycles | 2023-10-10 | Paper |
| Divisible subdivisions | 2023-10-04 | Paper |
| The power of many colours | 2023-08-29 | Paper |
| Turán‐type problems for long cycles in random and pseudo‐random graphs | 2023-08-23 | Paper |
| Sparse pancyclic subgraphs of random graphs | 2023-08-03 | Paper |
| Largest subgraph from a hereditary property in a random graph | 2023-06-12 | Paper |
| Crowns in pseudo-random graphs and Hamilton cycles in their squares | 2023-05-15 | Paper |
| Short proofs for long induced paths | 2023-03-31 | Paper |
| Large complete minors in random subgraphs | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874419 | 2023-02-07 | Paper |
| Minors, connectivity, and diameter in randomly perturbed sparse graphs | 2022-12-14 | Paper |
| Expansion in supercritical random subgraphs of the hypercube and its consequences | 2022-12-08 | Paper |
| Obituary: Robin Thomas (1962--2020) | 2022-11-23 | Paper |
| On the performance of the depth first search algorithm in supercritical random graphs | 2022-10-06 | Paper |
| Every graph contains a linearly sized induced subgraph with all degrees odd | 2022-08-04 | Paper |
| Spanning Trees at the Connectivity Threshold | 2022-07-28 | Paper |
| Fast construction on a restricted budget | 2022-07-14 | Paper |
| Rolling backwards can move you forward: On embedding problems in sparse expanders | 2022-06-16 | Paper |
| The choosability version of Brooks' theorem -- a short proof | 2022-05-15 | Paper |
| Expansion in Supercritical Random Subgraphs of Expanders and its Consequences | 2022-05-10 | Paper |
| Complete Minors in Graphs Without Sparse Cuts | 2022-04-05 | Paper |
| Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs | 2022-04-01 | Paper |
| Discrepancies of spanning trees and Hamilton cycles | 2022-03-03 | Paper |
| Cycle lengths in expanding graphs | 2021-06-29 | Paper |
| Edge-statistics on large graphs | 2021-06-15 | Paper |
| The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property | 2021-06-15 | Paper |
| Expansion, long cycles, and complete minors in supercritical random subgraphs of the hypercube | 2021-06-08 | Paper |
| Expanders – how to find them, and what to find in them | 2021-02-06 | Paper |
| Very fast construction of bounded-degree spanning graphs via the semi-random graph process | 2021-02-02 | Paper |
| Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process | 2021-01-05 | Paper |
| The Kőnig graph process | 2021-01-05 | Paper |
| Component Games on Random Graphs | 2020-12-16 | Paper |
| Asymptotics in percolation on high‐girth expanders | 2020-10-26 | Paper |
| Ron Graham (1935--2020) | 2020-09-24 | Paper |
| Finding a Hamilton cycle fast on average using rotations and extensions | 2020-09-16 | Paper |
| The genus of the Erdős‐Rényi random graph and the fragile genus property | 2020-06-19 | Paper |
| Random graph's Hamiltonicity is strongly tied to its minimum degree | 2020-01-27 | Paper |
| Semirandom Models as Benchmarks for Coloring Algorithms | 2019-09-16 | Paper |
| Goldberg's conjecture is true for random multigraphs | 2019-07-17 | Paper |
| Greedy maximal independent sets via local limits | 2019-07-16 | Paper |
| Long cycles in locally expanding graphs, with applications | 2019-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743497 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633854 | 2019-05-06 | Paper |
| The random k‐matching‐free process | 2019-02-20 | Paper |
| Complete minors in graphs without sparse cuts | 2018-12-05 | Paper |
| Approximation algorithms and hardness results for cycle packing problems | 2018-11-05 | Paper |
| On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments | 2018-09-05 | Paper |
| Clique coloring of dense random graphs | 2018-08-16 | Paper |
| Waiter-Client Maximum Degree Game | 2018-07-29 | Paper |
| Packing Hamilton Cycles Online | 2018-07-24 | Paper |
| Elegantly Colored Paths and Cycles in Edge Colored Random Graphs | 2018-07-18 | Paper |
| On the trace of random walks on random graphs | 2018-05-03 | Paper |
| Finding and Using Expanders in Locally Sparse Graphs | 2018-03-05 | Paper |
| Compatible Hamilton cycles in Dirac graphs | 2018-02-12 | Paper |
| Proper colouring painter-builder game | 2018-01-19 | Paper |
| Contagious sets in random graphs | 2018-01-04 | Paper |
| Positional Games | 2017-11-06 | Paper |
| Manipulative Waiters with Probabilistic Intuition | 2017-10-10 | Paper |
| Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs | 2017-10-10 | Paper |
| Contagious Sets in Expanders | 2017-10-05 | Paper |
| Decomposing Random Graphs into Few Cycles and Edges | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365089 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365090 | 2017-09-29 | Paper |
| Long paths and Hamiltonicity in random graphs | 2017-07-24 | Paper |
| Efficient Winning Strategies in Random‐Turn Maker–Breaker Games | 2017-07-05 | Paper |
| Waiter-client and client-waiter Hamiltonicity games on random graphs | 2017-06-19 | Paper |
| Smoothed Analysis on Connected Graphs | 2017-03-22 | Paper |
| Small subgraphs in the trace of a random walk | 2017-02-17 | Paper |
| Bounded-Degree Spanning Trees in Randomly Perturbed Graphs | 2017-01-27 | Paper |
| Rainbow Hamilton cycles in random graphs and hypergraphs | 2017-01-25 | Paper |
| Client-waiter games on complete and random graphs | 2017-01-18 | Paper |
| Counting and packing Hamilton cycles in dense graphs and oriented graphs | 2016-11-25 | Paper |
| Some remarks on rainbow connectivity | 2016-11-17 | Paper |
| Compatible Hamilton cycles in random graphs | 2016-11-09 | Paper |
| Some remarks on rainbow connectivity | 2016-10-14 | Paper |
| Cycles and matchings in randomly perturbed digraphs and hypergraphs | 2016-10-14 | Paper |
| Coloring random graphs | 2016-06-09 | Paper |
| Waiter-Client and Client-Waiter planarity, colorability and minor games | 2016-04-07 | Paper |
| Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs | 2016-02-19 | Paper |
| The phase transition in site percolation on pseudo-random graphs | 2016-01-25 | Paper |
| Generating random graphs in biased Maker-Breaker games | 2016-01-07 | Paper |
| Large Subgraphs without Short Cycles | 2015-11-27 | Paper |
| Random-player maker-breaker games | 2015-11-02 | Paper |
| Bounds on Distance Distributions in Codes of Given Size | 2015-10-27 | Paper |
| On saturation games | 2015-09-30 | Paper |
| Smoothed Analysis on Connected Graphs | 2015-09-23 | Paper |
| Walker-Breaker Games | 2015-09-02 | Paper |
| Biased games on random boards | 2015-07-23 | Paper |
| Long paths and cycles in random subgraphs of graphs with large minimum degree | 2015-04-09 | Paper |
| A Construction of Almost Steiner Systems | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921712 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921759 | 2014-10-13 | Paper |
| Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs | 2014-09-04 | Paper |
| Packing tree factors in random and pseudo-random graphs | 2014-09-04 | Paper |
| Cores of random graphs are born Hamiltonian | 2014-08-08 | Paper |
| Robust Hamiltonicity of Dirac graphs | 2014-06-11 | Paper |
| On covering expander graphs by hamilton cycles | 2014-04-15 | Paper |
| Positional games | 2014-03-05 | Paper |
| On the Non-Planarity of a Random Subgraph | 2014-02-24 | Paper |
| Avoider-Enforcer games played on edge disjoint hypergraphs | 2014-01-27 | Paper |
| Fast embedding of spanning trees in biased Maker-Breaker games | 2013-11-01 | Paper |
| Avoider-Enforcer: The Rules of the Game | 2013-10-10 | Paper |
| Playing to retain the advantage | 2013-10-10 | Paper |
| The phase transition in random graphs: A simple proof | 2013-10-09 | Paper |
| Longest cycles in sparse random digraphs | 2013-08-27 | Paper |
| On the Number of Hamilton Cycles in Sparse Random Graphs | 2013-06-27 | Paper |
| The biased odd cycle game | 2013-06-07 | Paper |
| Comparing the strength of query types in property testing: the case of \(k\)-colorability | 2013-04-11 | Paper |
| Expanders Are Universal for the Class of All Spanning Trees | 2013-03-14 | Paper |
| Optimal Packings of Hamilton Cycles in Sparse Random Graphs | 2013-01-04 | Paper |
| Sharp threshold for the appearance of certain spanning trees in random graphs | 2012-12-14 | Paper |
| Fast Strategies In Maker–Breaker Games Played on Random Boards | 2012-10-31 | Paper |
| Creating Small Subgraphs in Achlioptas Processes With Growing Parameter | 2012-09-12 | Paper |
| Packing hamilton cycles in random and pseudo-random hypergraphs | 2012-08-30 | Paper |
| Hitting time results for Maker-Breaker games | 2012-08-30 | Paper |
| Long cycles in subgraphs of (pseudo)random directed graphs | 2012-07-10 | Paper |
| Long paths and cycles in random subgraphs of graphs with large minimum degree | 2012-07-02 | Paper |
| Hierarchy theorems for property testing | 2012-06-26 | Paper |
| Fast embedding of spanning trees in biased maker-breaker games | 2012-06-18 | Paper |
| Variations on cops and robbers | 2012-06-13 | Paper |
| On the number of Hamilton cycles in pseudo-random graphs | 2012-06-12 | Paper |
| Biased orientation games | 2012-05-30 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2012-05-14 | Paper |
| The size Ramsey number of a directed path | 2012-05-11 | Paper |
| On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs | 2012-03-15 | Paper |
| Hamilton cycles in random geometric graphs | 2011-07-19 | Paper |
| Embedding Spanning Trees in Random Graphs | 2011-07-18 | Paper |
| The logic of random regular graphs | 2011-06-27 | Paper |
| Regular induced subgraphs of a random Graph | 2011-05-11 | Paper |
| Hamilton Cycles in Random Graphs with a Fixed Degree Sequence | 2011-04-15 | Paper |
| Resilient Pancyclicity of Random and Pseudorandom Graphs | 2011-03-15 | Paper |
| Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs | 2011-03-07 | Paper |
| The number of \(F\)-matchings in almost every tree is a zero residue | 2011-02-17 | Paper |
| The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 | 2011-02-09 | Paper |
| Hamilton cycles in highly connected and expanding graphs | 2011-02-08 | Paper |
| Ramsey games with giants | 2011-01-17 | Paper |
| Global maker-breaker games on sparse graphs | 2011-01-07 | Paper |
| Hamiltonicity thresholds in Achlioptas processes | 2010-11-24 | Paper |
| Offline thresholds for Ramsey-type games on random graphs | 2010-11-10 | Paper |
| A note on regular Ramsey graphs | 2010-11-10 | Paper |
| Equitable coloring of random graphs | 2010-11-09 | Paper |
| Playing to Retain the Advantage | 2010-10-14 | Paper |
| Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability | 2010-10-12 | Paper |
| Hierarchy Theorems for Property Testing | 2010-10-12 | Paper |
| Testing triangle-freeness in general graphs | 2010-08-16 | Paper |
| Solving random satisfiable 3CNF formulas in expected polynomial time | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579435 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576756 | 2010-08-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Why almost all \(k\)-colorable graphs are easy to color | 2010-05-05 | Paper |
| Avoider-enforcer: the rules of the game | 2010-04-27 | Paper |
| On the Random Satisfiable Process | 2010-04-22 | Paper |
| Spanning Directed Trees with Many Leaves | 2010-03-17 | Paper |
| The rainbow connection of a graph is (at most) reciprocal to its minimum degree | 2010-03-15 | Paper |
| Fast winning strategies in avoider-enforcer games | 2010-01-18 | Paper |
| Random regular graphs of non-constant degree: concentration of the chromatic number | 2009-12-09 | Paper |
| Large Nearly Regular Induced Subgraphs | 2009-11-27 | Paper |
| Hierarchy Theorems for Property Testing | 2009-10-28 | Paper |
| Perfectly balanced partitions of smoothed graphs | 2009-07-08 | Paper |
| Minors in expanding graphs | 2009-07-06 | Paper |
| Hamiltonicity of the random geometric graph | 2009-05-30 | Paper |
| Testing Triangle-Freeness in General Graphs | 2009-05-27 | Paper |
| On rainbow trees and cycles | 2009-04-07 | Paper |
| Biased positional games and small hypergraphs with large covers | 2009-04-07 | Paper |
| Planarity, Colorability, and Minor Games | 2009-03-16 | Paper |
| Vertex percolation on expander graphs | 2009-03-04 | Paper |
| Corrigendum: On fractional K-factors of random graphs | 2009-03-04 | Paper |
| A sharp threshold for the Hamilton cycle Maker–Breaker game | 2009-03-04 | Paper |
| Avoiding small subgraphs in Achlioptas processes | 2009-03-04 | Paper |
| Winning Fast in Sparse Graph Construction Games | 2009-03-04 | Paper |
| Fast winning strategies in maker-breaker games | 2009-01-21 | Paper |
| Testing Reed–Muller Codes | 2008-12-21 | Paper |
| Bounds on Distance Distributions in Codes of Known Size | 2008-12-21 | Paper |
| Covering codes with improved density | 2008-12-21 | Paper |
| Small Sample Spaces Cannot Fool Low Degree Polynomials | 2008-11-27 | Paper |
| Embedding nearly-spanning bounded degree trees | 2008-10-22 | Paper |
| On two Hamilton cycle problems in random graphs | 2008-10-16 | Paper |
| Fast winning strategies in positional games | 2008-06-05 | Paper |
| Better Algorithms and Bounds for Directed Maximum Leaf Problems | 2008-04-24 | Paper |
| On the Chromatic Number of Random Graphs with a Fixed Degree Sequence | 2008-02-22 | Paper |
| The isoperimetric constant of the random graph process | 2008-01-18 | Paper |
| Parameterized Algorithms for Directed Maximum Leaf Problems | 2007-11-28 | Paper |
| Why Almost All k-Colorable Graphs Are Easy | 2007-09-03 | Paper |
| On fractional K‐factors of random graphs | 2007-07-18 | Paper |
| Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] | 2007-07-16 | Paper |
| Avoider-Enforcer games | 2007-07-04 | Paper |
| Bart--Moe games, JumbleG and discrepancy | 2007-04-10 | Paper |
| On smoothed analysis in dense graphs and formulas | 2007-02-07 | Paper |
| Coloring complete bipartite graphs from random lists | 2007-02-07 | Paper |
| Almost universal graphs | 2006-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477817 | 2006-06-29 | Paper |
| On the asymptotic value of the choice number of complete multi‐partite graphs | 2006-06-06 | Paper |
| Recognizing More Unsatisfiable Random k-SAT Instances Efficiently | 2006-06-01 | Paper |
| The Strong Chromatic Index of Random Graphs | 2006-06-01 | Paper |
| On the random 2-stage minimum spanning tree | 2006-03-24 | Paper |
| MaxCut in ${\bm H)$-Free Graphs | 2005-11-14 | Paper |
| The Game of JumbleG | 2005-11-14 | Paper |
| Discrepancy games | 2005-11-01 | Paper |
| Triangle factors in sparse pseudo-random graphs | 2005-07-05 | Paper |
| Upper bounds on the rate of LDPC codes | 2005-05-11 | Paper |
| On packing Hamilton cycles in \(\varepsilon\)-regular graphs | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4658950 | 2005-03-21 | Paper |
| Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions | 2005-03-08 | Paper |
| Tight Bounds for Testing Bipartiteness in General Graphs | 2005-02-21 | Paper |
| Colouring powers of cycles from random lists | 2004-10-13 | Paper |
| Algorithms with large domination ratio | 2004-10-04 | Paper |
| Approximate coloring of uniform hypergraphs | 2004-10-01 | Paper |
| Adding random edges to dense graphs | 2004-03-29 | Paper |
| The emergence of a giant component in random subgraphs of pseudo-random graphs | 2004-02-03 | Paper |
| Generalized hashing and parent-identifying codes. | 2004-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428908 | 2003-09-22 | Paper |
| Induced subgraphs of prescribed size | 2003-08-20 | Paper |
| Maximum cuts and judicious partitions in graphs without short cycles | 2003-08-17 | Paper |
| On the concentration of eigenvalues of random symmetric matrices | 2003-06-30 | Paper |
| Deciding \(k\)-colorability in expected polynomial time | 2003-06-24 | Paper |
| The Largest Eigenvalue of Sparse Random Graphs | 2003-06-13 | Paper |
| A Sharp Threshold for Network Reliability | 2003-04-11 | Paper |
| Sparse pseudo‐random graphs are Hamiltonian | 2003-03-19 | Paper |
| On the probability of independent sets in random graphs | 2003-03-19 | Paper |
| Scalable secure storage when half the system is faulty | 2003-01-14 | Paper |
| Choosability in random hypergraphs | 2002-12-10 | Paper |
| Hamilton cycles in random subgraphs of pseudo-random graphs | 2002-12-02 | Paper |
| Fractional planks | 2002-11-18 | Paper |
| Random regular graphs of high degree | 2002-11-06 | Paper |
| Two‐coloring random hypergraphs | 2002-08-08 | Paper |
| Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs | 2002-08-01 | Paper |
| Sparse graphs usually have exponentially many optimal colorings | 2002-07-01 | Paper |
| Approximating the independence number and the chromatic number in expected polynomial time | 2002-05-28 | Paper |
| Testing k-colorability | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768313 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762790 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754178 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754130 | 2001-11-11 | Paper |
| Efficient testing of large graphs | 2001-06-13 | Paper |
| Long cycles in critical graphs | 2001-05-10 | Paper |
| Regular Languages are Testable with a Constant Number of Queries | 2001-03-19 | Paper |
| Sharp thresholds for certain Ramsey properties of random graphs | 2001-01-23 | Paper |
| On the concentration of eigenvalues of random symmetric matrices | 2000-09-21 | Paper |
| Coloring graphs with sparse neighborhoods | 2000-06-25 | Paper |
| List coloring of random and pseudo-random graphs | 2000-05-14 | Paper |
| The Choice Number of Dense Random Graphs | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705318 | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705344 | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252044 | 1999-10-06 | Paper |
| The choice number of random bipartite graphs | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250228 | 1999-06-17 | Paper |
| The concentration of the chromatic number of random graphs | 1999-03-14 | Paper |
| On the minimal number of edges in color-critical graphs | 1998-11-24 | Paper |
| A lower bound for irredundant Ramsey numbers | 1998-10-01 | Paper |
| Constructive bounds for a Ramsey-type problem | 1998-06-22 | Paper |
| Triangle Factors in Random Graphs | 1998-05-04 | Paper |
| Subgraphs with a large cochromatic number | 1998-03-02 | Paper |
| An improved bound on the minimal number of edges in color-critical graphs | 1998-02-18 | Paper |
| Approximate Set Covering in Uniform Hypergraphs | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4716332 | 1997-10-15 | Paper |
| Almost perfect matchings in random uniform hypergraphs | 1997-08-10 | Paper |
| On a theorem of Lovász on covers in \(r\)-partite hypergraphs | 1997-03-11 | Paper |
| Onk-saturated graphs with restrictions on the degrees | 1997-02-26 | Paper |
| Bounding Ramsey numbers through large deviation inequalities | 1995-09-20 | Paper |
| On a conjecture of Tuza about packing and covering of triangles | 1995-08-27 | Paper |
| On the edge distribution in triangle-free graphs | 1995-07-02 | Paper |
| Ks-Free Graphs Without Large Kr-Free Subgraphs | 1995-04-09 | Paper |
