| Publication | Date of Publication | Type |
|---|
A bounded diameter strengthening of Kőnig's theorem
SIAM Journal on Discrete Mathematics | 2025-06-25 | Paper |
| A precise condition for independent transversals in bipartite covers (extended abstract) | 2025-04-08 | Paper |
Improved integrality gap in max-min allocation, or, topology at the north pole
Combinatorica | 2025-04-08 | Paper |
Density of 3-critical signed graphs
Journal of Graph Theory | 2024-08-30 | Paper |
Constructing graphs with no independent transversals
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
A precise condition for independent transversals in bipartite covers
SIAM Journal on Discrete Mathematics | 2024-05-22 | Paper |
| Improved integrality gap in max-min allocation: or topology at the north pole | 2024-05-14 | Paper |
| Algorithms for weighted independent transversals and strong colouring | 2024-01-15 | Paper |
Large cliques in graphs with high chromatic number
Discrete Mathematics | 2023-11-27 | Paper |
A note on \(\Delta\)-critical graphs
Graphs and Combinatorics | 2023-11-07 | Paper |
Algorithms for Weighted Independent Transversals and Strong Colouring
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Constructing graphs with no independent transversals | 2023-09-21 | Paper |
| Density of 3-critical signed graphs | 2023-09-08 | Paper |
| Degree criteria and stability for independent transversals | 2023-05-17 | Paper |
Finding independent transversals efficiently
Combinatorics, Probability and Computing | 2021-04-30 | Paper |
Topological connectedness and independent sets in graphs
Surveys in Combinatorics 2019 | 2021-02-06 | 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 |
Morphing Schnyder drawings of planar triangulations
Discrete & Computational Geometry | 2019-04-25 | Paper |
A stability theorem for matchings in tripartite 3-graphs
Combinatorics, Probability and Computing | 2018-11-05 | Paper |
Extremal hypergraphs for Ryser's conjecture
Journal of Combinatorial Theory. Series A | 2018-07-18 | Paper |
Ramsey-nice families of graphs
European Journal of Combinatorics | 2018-06-28 | Paper |
Homological connectedness of random hypergraphs
(available as arXiv preprint) | 2018-01-18 | Paper |
A note on intersecting hypergraphs with large cover number
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
A note on intersecting hypergraphs with large cover number
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
On Lower Bounds for the Matching Number of Subcubic Graphs
Journal of Graph Theory | 2017-07-05 | Paper |
How to morph planar graph drawings
SIAM Journal on Computing | 2017-05-30 | Paper |
Independent transversals and hypergraph matchings -- an elementary approach
Recent Trends in Combinatorics | 2017-01-25 | Paper |
Edge coloring multigraphs without small dense subsets
Discrete Mathematics | 2015-08-05 | Paper |
Morphing Schnyder drawings of planar triangulations
Lecture Notes in Computer Science | 2015-01-07 | Paper |
| Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs | 2013-12-31 | Paper |
Packing and covering tetrahedra
Discrete Applied Mathematics | 2013-11-29 | Paper |
Primality of trees
Journal of Combinatorics | 2013-07-30 | Paper |
Tree-minimal graphs are almost regular
Journal of Combinatorics | 2013-07-12 | Paper |
Packing and covering triangles in \(K_{4}\)-free planar graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Bounded transversals in multipartite graphs
Journal of Graph Theory | 2012-07-10 | Paper |
On Ryser's conjecture
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
On even-degree subgraphs of linear hypergraphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
A stability theorem on fractional covering of triangles by edges
European Journal of Combinatorics | 2012-05-04 | Paper |
On characterizing Vizing's edge colouring bound
Journal of Graph Theory | 2012-02-08 | Paper |
On Forming Committees
The American Mathematical Monthly | 2011-11-21 | Paper |
A note on Schnyder's theorem
Order | 2011-08-16 | Paper |
On the stable paths problem
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
List coloring hypergraphs
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
| scientific article; zbMATH DE number 5764805 (Why is no real title available?) | 2010-08-06 | Paper |
Packing and covering triangles in planar graphs
Graphs and Combinatorics | 2010-05-05 | Paper |
The Ramsey number for 3-uniform tight hypergraph cycles
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Large monochromatic components in colorings of complete 3-uniform hypergraphs
Discrete Mathematics | 2009-06-23 | Paper |
On directed triangles in digraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On directed triangles in digraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
An Algorithmic Version of the Hypergraph Regularity Method
SIAM Journal on Computing | 2008-12-22 | Paper |
An improved bound for the strong chromatic number
Journal of Graph Theory | 2008-06-12 | Paper |
Maximum acyclic and fragmented sets in regular graphs
Journal of Graph Theory | 2008-02-13 | Paper |
Integer and fractional packings in dense graphs
Combinatorica | 2007-03-29 | Paper |
Independent dominating sets and hamiltonian cycles
Journal of Graph Theory | 2007-03-20 | Paper |
The Ramsey number for hypergraph cycles. I.
Journal of Combinatorial Theory. Series A | 2006-03-16 | Paper |
Odd Independent Transversals are Odd
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
A note on the Size-Ramsey number of long subdivisions of graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
A note on the Size-Ramsey number of long subdivisions of graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
A note on the Size-Ramsey number of long subdivisions of graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
On the Strong Chromatic Number
Combinatorics, Probability and Computing | 2005-02-18 | Paper |
To Adrian Bondy and U.S.R. Murty.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Bounded size components -- partitions and transversals.
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947420 (Why is no real title available?) | 2003-07-08 | Paper |
Integer and fractional packings in dense 3‐uniform hypergraphs
Random Structures & Algorithms | 2003-05-11 | Paper |
A note on cycle lengths in graphs
Graphs and Combinatorics | 2003-03-25 | Paper |
On characterizing hypergraph regularity
Random Structures & Algorithms | 2003-03-19 | Paper |
Ramsey numbers for trees of small maximum degree
Combinatorica | 2002-11-03 | Paper |
A note on vertex list colouring
Combinatorics, Probability and Computing | 2002-06-03 | Paper |
Tree embeddings
Journal of Graph Theory | 2001-08-27 | Paper |
Embedding trees into graphs of large girth
Discrete Mathematics | 2001-03-30 | Paper |
| Hall's theorem for hypergraphs | 2001-03-04 | Paper |
Packing and covering triangles in graphs
Discrete Mathematics | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1104337 (Why is no real title available?) | 1999-04-25 | Paper |
Packing and covering triangles in tripartite graphs
Graphs and Combinatorics | 1998-09-06 | Paper |
Partitioning complete bipartite graphs by monochromatic cycles
Journal of Combinatorial Theory. Series B | 1997-08-03 | Paper |
Hypercubes and Multicommodity Flows
SIAM Journal on Discrete Mathematics | 1997-05-26 | Paper |
Partitioning by monochromatic trees
Journal of Combinatorial Theory. Series B | 1997-02-23 | Paper |
Atoms of set systems with a fixed number of pairwise unions
Discrete Mathematics | 1996-07-02 | Paper |
The Induced Size-Ramsey Number of Cycles
Combinatorics, Probability and Computing | 1996-06-18 | Paper |
Turán's extremal problem in random graphs: Forbidding odd cycles
Combinatorica | 1996-05-14 | Paper |
On an anti‐Ramsey property of Ramanujan graphs
Random Structures & Algorithms | 1996-01-28 | Paper |
Turán's extremal problem in random graphs: Forbidding even cycles
Journal of Combinatorial Theory. Series B | 1995-12-18 | Paper |
A condition for matchability in hypergraphs
Graphs and Combinatorics | 1995-10-31 | Paper |
A note on a conjecture of Gallai
Graphs and Combinatorics | 1995-10-08 | Paper |
The size-Ramsey number of trees
Israel Journal of Mathematics | 1995-10-05 | Paper |
A note on a conjecture of Ryser
Periodica Mathematica Hungarica | 1995-07-02 | Paper |
Counting interval orders
Order | 1987-01-01 | Paper |
A precise condition for independent transversals in bipartite covers
(available as arXiv preprint) | N/A | Paper |
