2023
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.
Electron. J. Comb., 2023
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Fully Computer-Assisted Proofs in Extremal Combinatorics.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Oriented Cycles in Digraphs of Large Outdegree.
Comb., December, 2022
Dichromatic number and forced subdivisions.
J. Comb. Theory, Ser. B, 2022
2021
Ryser's Conjecture for <i>t</i>-intersecting hypergraphs.
J. Comb. Theory, Ser. A, 2021
Majority Colorings of Sparse Digraphs.
Electron. J. Comb., 2021
2020
On the odd cycle game and connected rules.
Eur. J. Comb., 2020
Enumerating extensions of mutually orthogonal Latin squares.
Des. Codes Cryptogr., 2020
2019
On the optimality of the uniform random strategy.
Random Struct. Algorithms, 2019
A family of extremal hypergraphs for Ryser's conjecture.
J. Comb. Theory, Ser. A, 2019
2018
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discret. Math., 2018
Extremal hypergraphs for Ryser's Conjecture.
J. Comb. Theory, Ser. A, 2018
2017
Sharp Thresholds for Half-Random Games II.
Graphs Comb., 2017
Random Strategies are Nearly Optimal for Generalized van der Waerden Games.
Electron. Notes Discret. Math., 2017
Graphs without proper subgraphs of minimum degree 3 and short cycles.
Comb., 2017
2016
Sharp thresholds for half-random games I.
Random Struct. Algorithms, 2016
On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory, Ser. B, 2016
The Local Lemma Is Asymptotically Tight for SAT.
J. ACM, 2016
Radiomics-based differentiation of lung disease models generated by polluted air based on X-ray computed tomography data.
,
,
,
,
,
,
,
,
,
,
,
BMC Medical Imaging, 2016
Monitoring of Fetal Heart Rate via iPhone.
,
,
,
,
,
,
,
,
,
,
Proceedings of the eHealth 360°, 2016
2015
On the Concentration of the Domination Number of the Random Graph.
SIAM J. Discret. Math., 2015
Free Edge Lengths in Plane Graphs.
Discret. Comput. Geom., 2015
2014
On covering expander graphs by hamilton cycles.
Random Struct. Algorithms, 2014
On the rank of higher inclusion matrices.
J. Lond. Math. Soc., 2014
What is Ramsey-equivalent to a clique?
J. Comb. Theory, Ser. B, 2014
Conflict-Free Colouring of Graphs.
Comb. Probab. Comput., 2014
How Many Colors Guarantee a Rainbow Matching?
Electron. J. Comb., 2014
2012
Sharp threshold for the appearance of certain spanning trees in random graphs.
Random Struct. Algorithms, 2012
Bounded transversals in multipartite graphs.
J. Graph Theory, 2012
2011
Global Maker-Breaker games on sparse graphs.
Eur. J. Comb., 2011
The Local Lemma is Tight for SAT.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
On the minimum degree of minimal Ramsey graphs.
J. Graph Theory, 2010
2009
A sharp threshold for the Hamilton cycle Maker-Breaker game.
Random Struct. Algorithms, 2009
Asymptotic random graph intuition for the biased connectivity game.
Random Struct. Algorithms, 2009
Fast winning strategies in Maker-Breaker games.
J. Comb. Theory, Ser. B, 2009
Fast Winning Strategies in Avoider-Enforcer Games.
Graphs Comb., 2009
Avoider-Enforcer: The Rules of the Game.
Electron. Notes Discret. Math., 2009
Vizing's conjecture for chordal graphs.
Discret. Math., 2009
Deciding Relaxed Two-Colourability: A Hardness Jump.
Comb. Probab. Comput., 2009
Hamilton cycles in highly connected and expanding graphs.
Comb., 2009
2008
Planarity, Colorability, and Minor Games.
SIAM J. Discret. Math., 2008
Biased Positional Games and Small Hypergraphs with Large Covers.
Electron. J. Comb., 2008
How Long Can a Graph be Kept Planar?
Electron. J. Comb., 2008
2007
Tur[a-acute]n's Theorem in the Hypercube.
SIAM J. Discret. Math., 2007
J. Comb. Theory, Ser. A, 2007
Relaxed two-coloring of cubic graphs.
J. Comb. Theory, Ser. B, 2007
Fast winning strategies in positional games.
Electron. Notes Discret. Math., 2007
Bart-Moe games, JumbleG and discrepancy.
Eur. J. Comb., 2007
2006
Odd Independent Transversals are Odd.
Comb. Probab. Comput., 2006
Extremal Problems For Transversals In Graphs With Bounded Degree.
Comb., 2006
Deciding Relaxed Two-Colorability - A Hardness Jump.
Proceedings of the Algorithms, 2006
2005
Positional games on random graphs.
Random Struct. Algorithms, 2005
A generalization of Turán's theorem.
J. Graph Theory, 2005
Exact <i>k</i>-Wise Intersection Theorems.
Graphs Comb., 2005
Jumping Doesn't Help in Abstract Cubes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes.
Discret. Comput. Geom., 2004
Triangle Factors In Sparse Pseudo-Random Graphs.
Comb., 2004
BCMP Performance Test with TTCN-3 Mobile Node Emulator.
Proceedings of the Testing of Communicating Systems, 16th IFIP International Conerence, 2004
Random Edge Can Be Exponential on Abstract Cubes.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Turán's theorem in sparse random graphs.
Random Struct. Algorithms, 2003
Bounded size components--partitions and transversals.
J. Comb. Theory, Ser. B, 2003
On the spectrum of projective norm-graphs.
Inf. Process. Lett., 2003
2002
Finding the Sink Takes Some Time.
Proceedings of the Algorithms, 2002
2001
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.
Comb. Probab. Comput., 2001
Unique Sink Orientations of Cubes.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
1999
Norm-Graphs: Variations and Applications.
J. Comb. Theory, Ser. B, 1999
On Erdős's Eulerian Trail Game.
Graphs Comb., 1999
Intersection Properties of Subsets of Integers.
Eur. J. Comb., 1999
1996
On nearly regular co-critical graphs.
Discret. Math., 1996
Norm-Graphs and Bipartite Turán Numbers.
Comb., 1996
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Dense Graphs with Cycle Neighborhoods.
J. Comb. Theory, Ser. B, 1995
