| Publication | Date of Publication | Type |
|---|
Climbing up a random subgraph of the hypercube
Electronic Communications in Probability | 2024-12-20 | Paper |
The power of many colours
Forum of Mathematics, Sigma | 2024-12-12 | Paper |
Percolation on irregular high-dimensional product graphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Expansion in supercritical random subgraphs of expanders and its consequences
Random Structures & Algorithms | 2024-10-24 | Paper |
Isoperimetric inequalities and supercritical percolation on high-dimensional graphs
Combinatorica | 2024-09-19 | Paper |
| The largest hole in sparse random graphs | 2024-09-13 | Paper |
Greedy maximal independent sets via local limits
Random Structures & Algorithms | 2024-05-17 | Paper |
Hamilton completion and the path cover number of sparse random graphs
European Journal of Combinatorics | 2024-03-26 | Paper |
On vertex Ramsey graphs with forbidden subgraphs
Discrete Mathematics | 2024-01-17 | Paper |
| scientific article; zbMATH DE number 7788347 (Why is no real title available?) | 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
Combinatorics, Probability and Computing | 2023-11-23 | Paper |
| Component sizes in the supercritical percolation on the binary cube | 2023-11-13 | Paper |
Cycle lengths in randomly perturbed graphs
Random Structures & Algorithms | 2023-11-07 | Paper |
Site percolation on pseudo‐random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Cycle lengths in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms | 2023-10-12 | Paper |
The size‐Ramsey number of short subdivisions
Random Structures & Algorithms | 2023-10-12 | Paper |
Complete minors and average degree: A short proof
Journal of Graph Theory | 2023-10-12 | Paper |
On subgraphs with degrees of prescribed residues in the random graph
Random Structures & Algorithms | 2023-10-12 | Paper |
Oriented discrepancy of Hamilton cycles
Journal of Graph Theory | 2023-10-10 | Paper |
Divisible subdivisions
Journal of Graph Theory | 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
Journal of the London Mathematical Society | 2023-08-23 | Paper |
| Sparse pancyclic subgraphs of random graphs | 2023-08-03 | Paper |
Largest subgraph from a hereditary property in a random graph
Discrete Mathematics | 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
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Large complete minors in random subgraphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7651059 (Why is no real title available?)
(available as arXiv preprint) | 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
The Annals of Probability | 2022-12-08 | Paper |
Obituary: Robin Thomas (1962--2020)
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
On the performance of the depth first search algorithm in supercritical random graphs
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
Every graph contains a linearly sized induced subgraph with all degrees odd
Advances in Mathematics | 2022-08-04 | Paper |
Spanning Trees at the Connectivity Threshold
SIAM Journal on Discrete Mathematics | 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
Transactions of the American Mathematical Society | 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
IMRN. International Mathematics Research Notices | 2022-04-05 | Paper |
Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
SIAM Journal on Discrete Mathematics | 2022-04-01 | Paper |
Discrepancies of spanning trees and Hamilton cycles
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Cycle lengths in expanding graphs
Combinatorica | 2021-06-29 | Paper |
The genus of the Erdős-Rényi random graph and the fragile genus property
(available as arXiv preprint) | 2021-06-15 | Paper |
Edge-statistics on large graphs
Combinatorics, Probability and Computing | 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
Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
The Kőnig graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
| Component Games on Random Graphs | 2020-12-16 | Paper |
Asymptotics in percolation on high-girth expanders
Random Structures & Algorithms | 2020-10-26 | Paper |
Ron Graham (1935--2020)
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Finding a Hamilton cycle fast on average using rotations and extensions
Random Structures & Algorithms | 2020-09-16 | Paper |
The genus of the Erdős-Rényi random graph and the fragile genus property
Random Structures & Algorithms | 2020-06-19 | Paper |
Random graph's Hamiltonicity is strongly tied to its minimum degree
The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
Random graph's Hamiltonicity is strongly tied to its minimum degree
The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
Semirandom models as benchmarks for coloring algorithms
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Goldberg's conjecture is true for random multigraphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Goldberg's conjecture is true for random multigraphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Greedy maximal independent sets via local limits
(available as arXiv preprint) | 2019-07-16 | Paper |
Long cycles in locally expanding graphs, with applications
Combinatorica | 2019-05-23 | Paper |
| Expanders are universal for the class of all spanning trees | 2019-05-10 | Paper |
| On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm | 2019-05-06 | Paper |
The random \(k\)-matching-free process
Random Structures & Algorithms | 2019-02-20 | Paper |
Complete minors in graphs without sparse cuts
(available as arXiv preprint) | 2018-12-05 | Paper |
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Random Structures & Algorithms | 2018-09-05 | Paper |
Clique coloring of dense random graphs
Journal of Graph Theory | 2018-08-16 | Paper |
| Waiter-Client Maximum Degree Game | 2018-07-29 | Paper |
Packing Hamilton cycles online
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
Elegantly colored paths and cycles in edge colored random graphs
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
On the trace of random walks on random graphs
Proceedings of the London Mathematical Society | 2018-05-03 | Paper |
Finding and using expanders in locally sparse graphs
SIAM Journal on Discrete Mathematics | 2018-03-05 | Paper |
Compatible Hamilton cycles in Dirac graphs
Combinatorica | 2018-02-12 | Paper |
Proper colouring painter-builder game
Discrete Mathematics | 2018-01-19 | Paper |
Contagious sets in random graphs
The Annals of Applied Probability | 2018-01-04 | Paper |
Contagious sets in random graphs
The Annals of Applied Probability | 2018-01-04 | Paper |
Positional games
(available as arXiv preprint) | 2017-11-06 | Paper |
Manipulative waiters with probabilistic intuition
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Contagious sets in expanders
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Decomposing random graphs into few cycles and edges
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| Hitting time results for maker-breaker games (extended abstract) | 2017-09-29 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2017-09-29 | Paper |
Long paths and Hamiltonicity in random graphs
(available as arXiv preprint) | 2017-07-24 | Paper |
Efficient winning strategies in random-turn maker-breaker games
Journal of Graph Theory | 2017-07-05 | Paper |
Waiter-client and client-waiter Hamiltonicity games on random graphs
European Journal of Combinatorics | 2017-06-19 | Paper |
| Smoothed Analysis on Connected Graphs | 2017-03-22 | Paper |
Small subgraphs in the trace of a random walk
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Small subgraphs in the trace of a random walk
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
SIAM Journal on Discrete Mathematics | 2017-01-27 | Paper |
Rainbow Hamilton cycles in random graphs and hypergraphs
Recent Trends in Combinatorics | 2017-01-25 | Paper |
Client-waiter games on complete and random graphs
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Client-waiter games on complete and random graphs
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Counting and packing Hamilton cycles in dense graphs and oriented graphs
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Some remarks on rainbow connectivity
Journal of Graph Theory | 2016-11-17 | Paper |
Compatible Hamilton cycles in random graphs
Random Structures & Algorithms | 2016-11-09 | Paper |
Some remarks on rainbow connectivity
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Cycles and matchings in randomly perturbed digraphs and hypergraphs
(available as arXiv preprint) | 2016-10-14 | Paper |
Coloring random graphs
Information Processing Letters | 2016-06-09 | Paper |
Waiter-Client and Client-Waiter planarity, colorability and minor games
Discrete Mathematics | 2016-04-07 | Paper |
Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
Journal of Combinatorics | 2016-02-19 | Paper |
The phase transition in site percolation on pseudo-random graphs
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
The phase transition in site percolation on pseudo-random graphs
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
Generating random graphs in biased maker-breaker games
Random Structures & Algorithms | 2016-01-07 | Paper |
Large subgraphs without short cycles
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Random-player maker-breaker games
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Random-player maker-breaker games
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Bounds on distance distributions in codes of given size
Communications, Information and Network Security | 2015-10-27 | Paper |
On saturation games
European Journal of Combinatorics | 2015-09-30 | Paper |
Smoothed Analysis on Connected Graphs
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Smoothed Analysis on Connected Graphs
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Walker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
Biased games on random boards
Random Structures & Algorithms | 2015-07-23 | Paper |
Long paths and cycles in random subgraphs of graphs with large minimum degree
Random Structures & Algorithms | 2015-04-09 | Paper |
A construction of almost Steiner systems
Journal of Combinatorial Designs | 2014-12-22 | Paper |
| Approximation algorithms for cycle packing problems | 2014-10-13 | Paper |
| On the random 2-stage minimum spanning tree | 2014-10-13 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Cores of random graphs are born Hamiltonian
Proceedings of the London Mathematical Society. Third Series | 2014-08-08 | Paper |
Robust Hamiltonicity of Dirac graphs
Transactions of the American Mathematical Society | 2014-06-11 | Paper |
On covering expander graphs by Hamilton cycles
Random Structures & Algorithms | 2014-04-15 | Paper |
Positional games
Oberwolfach Seminars | 2014-03-05 | Paper |
On the non-planarity of a random subgraph
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Avoider-Enforcer games played on edge disjoint hypergraphs
Discrete Mathematics | 2014-01-27 | Paper |
| Fast embedding of spanning trees in biased maker-breaker games | 2013-11-01 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
(available as arXiv preprint) | 2013-11-01 | Paper |
Avoider-Enforcer: the rules of the game
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Playing to retain the advantage
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
The phase transition in random graphs: a simple proof
Random Structures & Algorithms | 2013-10-09 | Paper |
Longest cycles in sparse random digraphs
Random Structures & Algorithms | 2013-08-27 | Paper |
On the Number of Hamilton Cycles in Sparse Random Graphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
The biased odd cycle game
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
The biased odd cycle game
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Comparing the strength of query types in property testing: the case of \(k\)-colorability
Computational Complexity | 2013-04-11 | Paper |
Expanders Are Universal for the Class of All Spanning Trees
Combinatorics, Probability and Computing | 2013-03-14 | Paper |
Optimal packings of Hamilton cycles in sparse random graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Sharp threshold for the appearance of certain spanning trees in random graphs
Random Structures & Algorithms | 2012-12-14 | Paper |
Fast strategies in maker-breaker games played on random boards
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Creating small subgraphs in Achlioptas processes with growing parameter
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Hitting time results for maker-breaker games
Random Structures & Algorithms | 2012-08-30 | Paper |
Packing Hamilton cycles in random and pseudo-random hypergraphs
Random Structures & Algorithms | 2012-08-30 | Paper |
Long cycles in subgraphs of (pseudo)random directed graphs
Journal of Graph Theory | 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
Computational Complexity | 2012-06-26 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
European Journal of Combinatorics | 2012-06-18 | Paper |
Variations on cops and robbers
Journal of Graph Theory | 2012-06-13 | Paper |
On the number of Hamilton cycles in pseudo-random graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
On the number of Hamilton cycles in pseudo-random graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Biased orientation games
Discrete Mathematics | 2012-05-30 | Paper |
Packing tight Hamilton cycles in 3-uniform hypergraphs
Random Structures & Algorithms | 2012-05-14 | Paper |
The size Ramsey number of a directed path
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Hamilton cycles in random geometric graphs
The Annals of Applied Probability | 2011-07-19 | Paper |
Embedding spanning trees in random graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
The logic of random regular graphs
Journal of Combinatorics | 2011-06-27 | Paper |
Regular induced subgraphs of a random graph
Random Structures & Algorithms | 2011-05-11 | Paper |
Hamilton cycles in random graphs with a fixed degree sequence
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Resilient pancyclicity of random and pseudorandom graphs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Local resilience and hamiltonicity maker-breaker games in random regular graphs
Combinatorics, Probability and Computing | 2011-03-07 | Paper |
The number of \(F\)-matchings in almost every tree is a zero residue
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The number of \(F\)-matchings in almost every tree is a zero residue
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The number of \(F\)-matchings in almost every tree is a zero residue
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
Journal of the American Mathematical Society | 2011-02-09 | Paper |
Hamilton cycles in highly connected and expanding graphs
Combinatorica | 2011-02-08 | Paper |
Hamilton cycles in highly connected and expanding graphs
Combinatorica | 2011-02-08 | Paper |
Ramsey games with giants
Random Structures & Algorithms | 2011-01-17 | Paper |
Global maker-breaker games on sparse graphs
European Journal of Combinatorics | 2011-01-07 | Paper |
Hamiltonicity thresholds in Achlioptas processes
Random Structures & Algorithms | 2010-11-24 | Paper |
Offline thresholds for Ramsey-type games on random graphs
Random Structures & Algorithms | 2010-11-10 | Paper |
A note on regular Ramsey graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Equitable coloring of random graphs
Random Structures & Algorithms | 2010-11-09 | Paper |
Playing to retain the advantage
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
Comparing the strength of query types in property testing: the case of testing \(k\)-colorability
Property Testing | 2010-10-12 | Paper |
Hierarchy theorems for property testing
Property Testing | 2010-10-12 | Paper |
Testing triangle-freeness in general graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Solving random satisfiable 3CNF formulas in expected polynomial time
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764842 (Why is no real title available?) | 2010-08-06 | Paper |
| Why almost all satisfiable k-CNF formulas are easy | 2010-08-02 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Why almost all \(k\)-colorable graphs are easy to color
Theory of Computing Systems | 2010-05-05 | Paper |
Avoider-enforcer: the rules of the game
Journal of Combinatorial Theory. Series A | 2010-04-27 | Paper |
On the random satisfiable process
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Spanning directed trees with many leaves
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Journal of Graph Theory | 2010-03-15 | Paper |
Fast winning strategies in avoider-enforcer games
Graphs and Combinatorics | 2010-01-18 | Paper |
Random regular graphs of non-constant degree: concentration of the chromatic number
Discrete Mathematics | 2009-12-09 | Paper |
Large Nearly Regular Induced Subgraphs
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Hierarchy Theorems for Property Testing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Perfectly balanced partitions of smoothed graphs
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Perfectly balanced partitions of smoothed graphs
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Minors in expanding graphs
Geometric and Functional Analysis. GAFA | 2009-07-06 | Paper |
| Hamiltonicity of the random geometric graph | 2009-05-30 | Paper |
Testing Triangle-Freeness in General Graphs
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
On rainbow trees and cycles
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On rainbow trees and cycles
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Biased positional games and small hypergraphs with large covers
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Biased positional games and small hypergraphs with large covers
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Planarity, Colorability, and Minor Games
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Winning Fast in Sparse Graph Construction Games
Combinatorics, Probability and Computing | 2009-03-04 | Paper |
Corrigendum: On fractional K-factors of random graphs
Random Structures & Algorithms | 2009-03-04 | Paper |
Avoiding small subgraphs in Achlioptas processes
Random Structures & Algorithms | 2009-03-04 | Paper |
A sharp threshold for the Hamilton cycle Maker–Breaker game
Random Structures & Algorithms | 2009-03-04 | Paper |
Vertex percolation on expander graphs
European Journal of Combinatorics | 2009-03-04 | Paper |
Fast winning strategies in maker-breaker games
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Testing Reed–Muller Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounds on Distance Distributions in Codes of Known Size
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Covering codes with improved density
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Small Sample Spaces Cannot Fool Low Degree Polynomials
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Embedding nearly-spanning bounded degree trees
Combinatorica | 2008-10-22 | Paper |
On two Hamilton cycle problems in random graphs
Israel Journal of Mathematics | 2008-10-16 | Paper |
Fast winning strategies in positional games
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
The isoperimetric constant of the random graph process
Random Structures & Algorithms | 2008-01-18 | Paper |
Parameterized Algorithms for Directed Maximum Leaf Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Why Almost All k-Colorable Graphs Are Easy
STACS 2007 | 2007-09-03 | Paper |
On fractional K‐factors of random graphs
Random Structures & Algorithms | 2007-07-18 | Paper |
Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]
Information and Computation | 2007-07-16 | Paper |
Avoider-Enforcer games
Journal of Combinatorial Theory. Series A | 2007-07-04 | Paper |
Bart--Moe games, JumbleG and discrepancy
European Journal of Combinatorics | 2007-04-10 | Paper |
Coloring complete bipartite graphs from random lists
Random Structures & Algorithms | 2007-02-07 | Paper |
On smoothed analysis in dense graphs and formulas
Random Structures & Algorithms | 2007-02-07 | Paper |
Almost universal graphs
Random Structures & Algorithms | 2006-09-06 | Paper |
| Pseudo-random graphs | 2006-06-29 | Paper |
On the asymptotic value of the choice number of complete multi‐partite graphs
Journal of Graph Theory | 2006-06-06 | Paper |
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
SIAM Journal on Computing | 2006-06-01 | Paper |
The Strong Chromatic Index of Random Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
On the random 2-stage minimum spanning tree
Random Structures & Algorithms | 2006-03-24 | Paper |
MaxCut in ${\bm H)$-Free Graphs
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
The Game of JumbleG
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
Discrepancy games
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Discrepancy games
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Triangle factors in sparse pseudo-random graphs
Combinatorica | 2005-07-05 | Paper |
Upper bounds on the rate of LDPC codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On packing Hamilton cycles in \(\varepsilon\)-regular graphs
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2147309 (Why is no real title available?)
IMRN. International Mathematics Research Notices | 2005-03-21 | Paper |
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing | 2005-03-08 | Paper |
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing | 2005-02-21 | Paper |
Colouring powers of cycles from random lists
European Journal of Combinatorics | 2004-10-13 | Paper |
Algorithms with large domination ratio
Journal of Algorithms | 2004-10-04 | Paper |
Approximate coloring of uniform hypergraphs
Journal of Algorithms | 2004-10-01 | Paper |
Adding random edges to dense graphs
Random Structures & Algorithms | 2004-03-29 | Paper |
The emergence of a giant component in random subgraphs of pseudo-random graphs
Random Structures & Algorithms | 2004-02-03 | Paper |
Generalized hashing and parent-identifying codes.
Journal of Combinatorial Theory. Series A | 2004-01-06 | Paper |
| scientific article; zbMATH DE number 1984543 (Why is no real title available?) | 2003-09-22 | Paper |
Induced subgraphs of prescribed size
Journal of Graph Theory | 2003-08-20 | Paper |
Maximum cuts and judicious partitions in graphs without short cycles
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
On the concentration of eigenvalues of random symmetric matrices
Israel Journal of Mathematics | 2003-06-30 | Paper |
Deciding \(k\)-colorability in expected polynomial time
Information Processing Letters | 2003-06-24 | Paper |
The Largest Eigenvalue of Sparse Random Graphs
Combinatorics, Probability and Computing | 2003-06-13 | Paper |
A Sharp Threshold for Network Reliability
Combinatorics, Probability and Computing | 2003-04-11 | Paper |
Sparse pseudo‐random graphs are Hamiltonian
Journal of Graph Theory | 2003-03-19 | Paper |
On the probability of independent sets in random graphs
Random Structures & Algorithms | 2003-03-19 | Paper |
Scalable secure storage when half the system is faulty
Information and Computation | 2003-01-14 | Paper |
Choosability in random hypergraphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Hamilton cycles in random subgraphs of pseudo-random graphs
Discrete Mathematics | 2002-12-02 | Paper |
Fractional planks
Discrete & Computational Geometry | 2002-11-18 | Paper |
Random regular graphs of high degree
Random Structures & Algorithms | 2002-11-06 | Paper |
Two‐coloring random hypergraphs
Random Structures & Algorithms | 2002-08-08 | Paper |
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Journal of Algorithms | 2002-08-01 | Paper |
Sparse graphs usually have exponentially many optimal colorings
The Electronic Journal of Combinatorics | 2002-07-01 | Paper |
Sparse graphs usually have exponentially many optimal colorings
The Electronic Journal of Combinatorics | 2002-07-01 | Paper |
Approximating the independence number and the chromatic number in expected polynomial time
Journal of Combinatorial Optimization | 2002-05-28 | Paper |
Testing \(k\)-colorability
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
| Approximating coloring and maximum independent sets in 3-uniform hypergraphs | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1689045 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670854 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1670810 (Why is no real title available?) | 2001-11-11 | Paper |
Efficient testing of large graphs
Combinatorica | 2001-06-13 | Paper |
| Long cycles in critical graphs | 2001-05-10 | Paper |
Regular languages are testable with a constant number of queries
SIAM Journal on Computing | 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
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
List coloring of random and pseudo-random graphs
Combinatorica | 2000-05-14 | Paper |
The Choice Number of Dense Random Graphs
Combinatorics, Probability and Computing | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1380608 (Why is no real title available?) | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1380583 (Why is no real title available?) | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1305101 (Why is no real title available?) | 1999-10-06 | Paper |
The choice number of random bipartite graphs
Annals of Combinatorics | 1999-06-28 | Paper |
| scientific article; zbMATH DE number 1303602 (Why is no real title available?) | 1999-06-17 | Paper |
The concentration of the chromatic number of random graphs
Combinatorica | 1999-03-14 | Paper |
On the minimal number of edges in color-critical graphs
Combinatorica | 1998-11-24 | Paper |
A lower bound for irredundant Ramsey numbers
Discrete Mathematics | 1998-10-01 | Paper |
Constructive bounds for a Ramsey-type problem
Graphs and Combinatorics | 1998-06-22 | Paper |
Triangle Factors in Random Graphs
Combinatorics, Probability and Computing | 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
The Electronic Journal of Combinatorics | 1998-02-18 | Paper |
An improved bound on the minimal number of edges in color-critical graphs
The Electronic Journal of Combinatorics | 1998-02-18 | Paper |
Approximate Set Covering in Uniform Hypergraphs
Journal of Algorithms | 1997-11-25 | Paper |
| scientific article; zbMATH DE number 949656 (Why is no real title available?) | 1997-10-15 | Paper |
Almost perfect matchings in random uniform hypergraphs
Discrete Mathematics | 1997-08-10 | Paper |
On a theorem of Lovász on covers in \(r\)-partite hypergraphs
Combinatorica | 1997-03-11 | Paper |
| Onk-saturated graphs with restrictions on the degrees | 1997-02-26 | Paper |
Bounding Ramsey numbers through large deviation inequalities
Random Structures & Algorithms | 1995-09-20 | Paper |
On a conjecture of Tuza about packing and covering of triangles
Discrete Mathematics | 1995-08-27 | Paper |
On the edge distribution in triangle-free graphs
Journal of Combinatorial Theory. Series B | 1995-07-02 | Paper |
Ks-Free Graphs Without Large Kr-Free Subgraphs
Combinatorics, Probability and Computing | 1995-04-09 | Paper |
Percolation on High-dimensional Product Graphs
(available as arXiv preprint) | N/A | Paper |
Percolation on Irregular High-dimensional Product Graphs
(available as arXiv preprint) | N/A | Paper |
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
(available as arXiv preprint) | N/A | Paper |
Maximum chordal subgraphs of random graphs
(available as arXiv preprint) | N/A | Paper |
Percolation through Isoperimetry
(available as arXiv preprint) | N/A | Paper |
Colouring graphs from random lists
(available as arXiv preprint) | N/A | Paper |
Hitting time of connectedness in the random hypercube process
(available as arXiv preprint) | N/A | Paper |
Reconstructing random graphs from distance queries
(available as arXiv preprint) | N/A | Paper |
