| Publication | Date of Publication | Type |
|---|
On the spectral radius of graphs with given maximum degree and girth
Linear Algebra and its Applications | 2024-04-25 | Paper |
On a rainbow extremal problem for color‐critical graphs
Random Structures & Algorithms | 2024-02-29 | Paper |
| On rainbow Tur\'{a}n Densities of Trees | 2023-12-26 | Paper |
Fractional Helly theorem for Cartesian products of convex sets
Discrete & Computational Geometry | 2023-12-21 | Paper |
Hypergraph regularity and random sampling
Random Structures & Algorithms | 2023-10-23 | Paper |
2‐complexes with unique embeddings in 3‐space
Bulletin of the London Mathematical Society | 2023-08-23 | Paper |
| Hamilton transversals in tournaments | 2023-07-03 | Paper |
Embedding clique-factors in graphs with low -independence number
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
| Covering multigraphs with bipartite graphs | 2023-04-23 | Paper |
Ramsey numbers of cycles versus general graphs
Forum of Mathematics, Sigma | 2023-02-21 | Paper |
| A bandwidth theorem for graph transversals | 2023-02-19 | Paper |
| On the Combinatorics of $\mathbb{F}_1$-Representations of Pseudotree Quivers | 2023-01-17 | Paper |
Crux and Long Cycles in Graphs
SIAM Journal on Discrete Mathematics | 2022-12-02 | Paper |
A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
Discrete Mathematics | 2022-11-23 | Paper |
| Rainbow cycles in properly edge-colored graphs | 2022-11-06 | Paper |
Extremal density for sparse minors and subdivisions
IMRN. International Mathematics Research Notices | 2022-10-27 | Paper |
Well-mixing vertices and almost expanders
Proceedings of the American Mathematical Society | 2022-10-12 | Paper |
| On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os | 2022-09-28 | Paper |
| A proof of the Elliott-R\"{o}dl conjecture on hypertrees in Steiner triple systems | 2022-08-22 | Paper |
| Crux, space constraints and subdivisions | 2022-07-14 | Paper |
| Conflict-free hypergraph matchings | 2022-05-11 | Paper |
On 1-subdivisions of transitive tournaments
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Nested cycles with no geometric crossings
Proceedings of the American Mathematical Society, Series B | 2022-02-16 | Paper |
A Cvetković-type theorem for coloring of digraphs
Linear Algebra and its Applications | 2021-11-25 | Paper |
| New lower bounds on kissing numbers and spherical codes in high dimensions | 2021-11-01 | Paper |
Crux and long cycles in graphs
(available as arXiv preprint) | 2021-07-05 | Paper |
Resolution of the Oberwolfach problem
Journal of the European Mathematical Society (JEMS) | 2021-07-05 | Paper |
The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
The Electronic Journal of Combinatorics | 2021-04-12 | Paper |
On the rational Turán exponents conjecture
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Asymptotic Structure for the Clique Density Theorem
discrete Analysis | 2021-01-16 | Paper |
Rainbow structures in locally bounded colorings of graphs
Random Structures & Algorithms | 2020-10-26 | Paper |
Tree decompositions of graphs without large bipartite holes
Random Structures & Algorithms | 2020-09-16 | Paper |
The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
Discrete Mathematics | 2020-09-10 | Paper |
On a rainbow version of Dirac's theorem
Bulletin of the London Mathematical Society | 2020-07-27 | Paper |
Spanning trees in randomly perturbed graphs
Random Structures & Algorithms | 2020-06-19 | Paper |
| $K_{r+1}$-saturated graphs with small spectral radius | 2020-06-08 | Paper |
| Fragile minor-monotone parameters under random edge perturbation | 2020-05-20 | Paper |
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
(available as arXiv preprint) | 2020-01-17 | Paper |
| Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs | 2020-01-17 | Paper |
On 1-factors with prescribed lengths in tournaments
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Optimal packings of bounded degree trees
Journal of the European Mathematical Society (JEMS) | 2019-12-12 | Paper |
A bandwidth theorem for approximate decompositions
Proceedings of the London Mathematical Society | 2019-07-10 | Paper |
A bandwidth theorem for approximate decompositions
Proceedings of the London Mathematical Society | 2019-07-10 | Paper |
Disjoint path covers joining prescribed source and sink sets in interval graphs
Theoretical Computer Science | 2019-05-29 | Paper |
A blow-up lemma for approximate decompositions
Transactions of the American Mathematical Society | 2019-05-03 | Paper |
Two Conjectures in Ramsey--Turán Theory
SIAM Journal on Discrete Mathematics | 2019-03-29 | Paper |
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
European Journal of Combinatorics | 2018-12-06 | Paper |
Forbidding induced even cycles in a graph: typical structure and counting
Journal of Combinatorial Theory. Series B | 2018-05-09 | Paper |
Dynamic choosability of triangle-free graphs and sparse random graphs
Journal of Graph Theory | 2018-04-27 | Paper |
Two-regular subgraphs of odd-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Strong edge-colorings of sparse graphs with large maximum degree
European Journal of Combinatorics | 2017-10-10 | Paper |
Sparse spanning \(k\)-connected subgraphs in tournaments
SIAM Journal on Discrete Mathematics | 2017-09-27 | Paper |
| A characterization of testable hypergraph properties | 2017-07-11 | Paper |
On the number of r-matchings in a tree
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
On the number of r-matchings in a tree
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
On \(r\)-dynamic coloring of graphs
Discrete Applied Mathematics | 2016-05-02 | Paper |
Regular subgraphs of uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2016-04-21 | Paper |
Improper coloring of sparse graphs with a given girth. II: Constructions
Journal of Graph Theory | 2016-04-15 | Paper |
The difference and ratio of the fractional matching number and the matching number of graphs
Discrete Mathematics | 2016-01-21 | Paper |
A relative of Hadwiger's conjecture
SIAM Journal on Discrete Mathematics | 2016-01-04 | Paper |
Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
European Journal of Combinatorics | 2014-09-04 | Paper |
Equicovering subgraphs of graphs and hypergraphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Maximum hypergraphs without regular subgraphs
Discussiones Mathematicae Graph Theory | 2014-04-02 | Paper |
Ramsey-minimal saturation numbers for matchings
Discrete Mathematics | 2014-02-27 | Paper |
Average connectivity and average edge-connectivity in graphs
Discrete Mathematics | 2014-01-23 | Paper |
New results in \(t\)-tone coloring of graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
New results in \(t\)-tone coloring of graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Harmonious coloring of trees with large maximum degree
Discrete Mathematics | 2012-05-30 | Paper |
Scheduling broadcasts with deadlines
Lecture Notes in Computer Science | 2011-03-18 | Paper |
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
International Journal of Computational Geometry & Applications | 2009-06-30 | Paper |
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters | 2009-04-28 | Paper |
Optimal Construction of the City Voronoi Diagram
Algorithms and Computation | 2008-04-24 | Paper |
Maximizing the Throughput of Multiple Machines On-Line
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
The swing voter's curse with adversarial preferences
Journal of Economic Theory | 2007-09-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Optimal broadcasting with universal lists based on competitive analysis*
Networks | 2005-08-05 | Paper |
Improved gossipings by short messages in 2-dimensional meshes
Journal of Parallel and Distributed Computing | 2005-06-30 | Paper |
Scheduling broadcasts with deadlines
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2080980 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1983233 (Why is no real title available?) | 2003-09-18 | Paper |
Online deadline scheduling on faster machines.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1796987 (Why is no real title available?) | 2002-09-05 | Paper |
Dense triangle-free (n, d, \lambda)-graphs for all orders
(available as arXiv preprint) | N/A | Paper |
Extremal density for subdivisions with length or sparsity constraints
(available as arXiv preprint) | N/A | Paper |
On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$
(available as arXiv preprint) | N/A | Paper |
Optimal bounds on the polynomial Schur's theorem
(available as arXiv preprint) | N/A | Paper |
Ore-type conditions for existence of a jellyfish in a graph
(available as arXiv preprint) | N/A | Paper |
