| Publication | Date of Publication | Type |
|---|
Generalized Ramsey numbers of cycles, paths, and hypergraphs
European Journal of Combinatorics | 2026-01-29 | Paper |
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
Discrete Mathematics | 2025-09-04 | Paper |
The maximum number of odd cycles in a planar graph
Journal of Graph Theory | 2025-03-20 | Paper |
Online Ramsey numbers of ordered paths and cycles
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
Discrete Mathematics | 2024-05-21 | Paper |
| Asymmetric Ramsey properties of randomly perturbed graphs | 2023-11-01 | Paper |
Lower bounds on the Erdős–Gyárfás problem via color energy graphs
Journal of Graph Theory | 2023-10-12 | Paper |
| Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class | 2023-07-03 | Paper |
| The maximum number of odd cycles in a planar graph | 2023-06-30 | Paper |
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
| Embedded graph 3-coloring and flows | 2023-03-09 | Paper |
A strengthening of the Erdős-Szekeres theorem
European Journal of Combinatorics | 2022-01-13 | Paper |
Generalized rainbow Turán numbers of odd cycles
Discrete Mathematics | 2021-11-23 | Paper |
| Hypergraph Models of Biological Networks to Identify Genes Critical to Pathogenic Viral Response | 2020-10-06 | Paper |
New Upper Bounds for the Erd\H{o}s-Gy\'arf\'as Problem on Generalized Ramsey Numbers
(available as arXiv preprint) | 2020-06-16 | Paper |
Ordered size Ramsey number of paths
Discrete Applied Mathematics | 2020-04-01 | Paper |
Scheduling of tasks with effectiveness precedence constraints
Optimization Letters | 2020-02-27 | Paper |
A (5,5)-Colouring of <i>K</i><sub><i>n</i></sub> with Few Colours
Combinatorics, Probability and Computing | 2018-11-09 | Paper |
Applying ranking and selection procedures to long-term mitigation for improved network restoration
EURO Journal on Computational Optimization | 2016-11-11 | Paper |
Economical extremal hypergraphs for the Erdős-Selfridge theorem
Discrete Mathematics | 2016-06-20 | Paper |
Online Ramsey numbers of ordered paths and cycles
(available as arXiv preprint) | N/A | Paper |
New bounds on the generalized Ramsey number f(n,5,8)
(available as arXiv preprint) | N/A | Paper |
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
(available as arXiv preprint) | N/A | Paper |
