According to our database1, Tibor Szabó authored at least 64 papers between 1995 and 2019.
Legend:Book In proceedings Article PhD thesis Other
A family of extremal hypergraphs for Ryser's conjecture.
J. Comb. Theory, Ser. A, 2019
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discrete Math., 2018
Extremal hypergraphs for Ryser's Conjecture.
J. Comb. Theory, Ser. A, 2018
Sharp Thresholds for Half-Random Games II.
Graphs and Combinatorics, 2017
Random Strategies are Nearly Optimal for Generalized van der Waerden Games.
Electronic Notes in Discrete Mathematics, 2017
Graphs without proper subgraphs of minimum degree 3 and short cycles.
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
On the Concentration of the Domination Number of the Random Graph.
SIAM J. Discrete Math., 2015
On covering expander graphs by hamilton cycles.
Random Struct. Algorithms, 2014
On the rank of higher inclusion matrices.
J. London Math. Society, 2014
What is Ramsey-equivalent to a clique?
J. Comb. Theory, Ser. B, 2014
Conflict-Free Colouring of Graphs.
Combinatorics, Probability & Computing, 2014
How Many Colors Guarantee a Rainbow Matching?
Electr. J. Comb., 2014
Free Edge Lengths in Plane Graphs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
Sharp threshold for the appearance of certain spanning trees in random graphs.
Random Struct. Algorithms, 2012
Bounded transversals in multipartite graphs.
Journal of Graph Theory, 2012
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
On the minimum degree of minimal Ramsey graphs.
Journal of Graph Theory, 2010
Avoider-Enforcer: The rules of the game.
J. Comb. Theory, Ser. A, 2010
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 and Combinatorics, 2009
Avoider-Enforcer: The Rules of the Game.
Electronic Notes in Discrete Mathematics, 2009
Vizing's conjecture for chordal graphs.
Discrete Mathematics, 2009
Deciding Relaxed Two-Colourability: A Hardness Jump.
Combinatorics, Probability & Computing, 2009
Hamilton cycles in highly connected and expanding graphs.
Planarity, Colorability, and Minor Games.
SIAM J. Discrete Math., 2008
Biased Positional Games and Small Hypergraphs with Large Covers.
Electr. J. Comb., 2008
How Long Can a Graph be Kept Planar?
Electr. J. Comb., 2008
Tur[a-acute]n's Theorem in the Hypercube.
SIAM J. Discrete 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.
Electronic Notes in Discrete Mathematics, 2007
Bart-Moe games, JumbleG and discrepancy.
Eur. J. Comb., 2007
Odd Independent Transversals are Odd.
Combinatorics, Probability & Computing, 2006
Extremal Problems For Transversals In Graphs With Bounded Degree.
Deciding Relaxed Two-Colorability - A Hardness Jump.
Proceedings of the Algorithms, 2006
Positional games on random graphs.
Random Struct. Algorithms, 2005
A generalization of Turán's theorem.
Journal of Graph Theory, 2005
Exact k-Wise Intersection Theorems.
Graphs and Combinatorics, 2005
Electr. J. Comb., 2005
Jumping Doesn't Help in Abstract Cubes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes.
Discrete & Computational Geometry, 2004
Triangle Factors In Sparse Pseudo-Random Graphs.
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
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
Finding the Sink Takes Some Time.
Proceedings of the Algorithms, 2002
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.
Combinatorics, Probability & Computing, 2001
Unique Sink Orientations of Cubes.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
Norm-Graphs: Variations and Applications.
J. Comb. Theory, Ser. B, 1999
On Erdős's Eulerian Trail Game.
Graphs and Combinatorics, 1999
Intersection Properties of Subsets of Integers.
Eur. J. Comb., 1999
On nearly regular co-critical graphs.
Discrete Mathematics, 1996
Norm-Graphs and Bipartite Turán Numbers.
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
Dense Graphs with Cycle Neighborhoods.
J. Comb. Theory, Ser. B, 1995