| Publication | Date of Publication | Type |
|---|
| Testing versus estimation of graph properties, revisited | 2025-01-14 | Paper |
Trimming forests is hard (unless they are made of stars)
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Polynomial removal lemma for ordered matchings
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Maximal chordal subgraphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Large cliques or cocliques in hypergraphs with forbidden order-size pairs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Testing versus estimation of graph properties, revisited
Random Structures & Algorithms | 2024-10-24 | Paper |
Minimum degree threshold for \(H\)-factors with high discrepancy
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
| Counting homomorphic cycles in degenerate graphs | 2024-07-19 | Paper |
The minimum degree removal lemma thresholds
Journal of Combinatorial Theory. Series B | 2024-03-14 | Paper |
On Rödl's theorem for cographs
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
On Ramsey Size-Linear Graphs and Related Questions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
| Tight Hamilton cycles with high discrepancy | 2023-12-15 | Paper |
| Difference-Isomorphic Graph Families | 2023-12-11 | Paper |
Counting Homomorphic Cycles in Degenerate Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
| Trimming forests is hard (unless they are made of stars) | 2023-10-17 | Paper |
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms | 2023-10-12 | Paper |
Testing linear inequalities of subgraph statistics
Random Structures & Algorithms | 2023-10-11 | Paper |
Oriented discrepancy of Hamilton cycles
Journal of Graph Theory | 2023-10-10 | Paper |
Asymptotics of the hypergraph bipartite Turán problem
Combinatorica | 2023-10-04 | Paper |
On 3‐graphs with no four vertices spanning exactly two edges
Bulletin of the London Mathematical Society | 2023-09-20 | Paper |
| Ramsey problems for monotone paths in graphs and hypergraphs | 2023-08-08 | Paper |
| Polynomial removal lemma for ordered matchings | 2023-07-04 | Paper |
| Testing versus estimation of graph properties, revisited | 2023-05-09 | Paper |
| Large cliques or co-cliques in hypergraphs with forbidden order-size pairs | 2023-05-02 | Paper |
Counting Subgraphs in Degenerate Graphs
Journal of the ACM | 2023-04-27 | Paper |
| Minimum Degree Threshold for $H$-factors with High Discrepancy | 2023-02-27 | Paper |
scientific article; zbMATH DE number 7650391 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| An efficient asymmetric removal lemma and its limitations | 2023-01-18 | Paper |
A new bound for the Brown-Erdős-Sós problem
Journal of Combinatorial Theory. Series B | 2022-11-28 | Paper |
Polynomial removal lemmas for ordered graphs
Combinatorial Theory | 2022-11-23 | Paper |
Cycles of many lengths in Hamiltonian graphs
Forum of Mathematics, Sigma | 2022-09-06 | Paper |
| Maximal Chordal Subgraphs | 2022-05-17 | Paper |
A characterization of easily testable induced digraphs and \(k\)-colored graphs
European Journal of Combinatorics | 2022-05-10 | Paper |
Testing graphs against an unknown distribution
Israel Journal of Mathematics | 2022-04-25 | Paper |
Discrepancies of spanning trees and Hamilton cycles
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
| Hypergraph removal with polynomial bounds | 2022-02-15 | Paper |
Removal lemmas with polynomial bounds
IMRN. International Mathematics Research Notices | 2022-01-13 | Paper |
A generalized Turán problem and its applications
IMRN. International Mathematics Research Notices | 2021-12-09 | Paper |
Constructing dense grid-free linear 3-graphs
Proceedings of the American Mathematical Society | 2021-11-09 | Paper |
| Efficient testing without efficient regularity | 2021-06-15 | Paper |
| Small doubling, atomic structure and $\ell$-divisible set families | 2021-03-30 | Paper |
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
| Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties | 2020-09-26 | Paper |
| Oriented cycles in digraphs of large outdegree | 2020-08-30 | Paper |
Testing linear inequalities of subgraph statistics
(available as arXiv preprint) | 2020-07-20 | Paper |
The minrank of random graphs over arbitrary fields
Israel Journal of Mathematics | 2020-03-04 | Paper |
Testing graphs against an unknown distribution
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Efficient removal without efficient regularity
Combinatorica | 2019-09-04 | Paper |
A generalized Turán problem and its applications
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The removal lemma for tournaments
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Random Structures & Algorithms | 2018-09-05 | Paper |
Removal lemmas with polynomial bounds
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Deterministic vs non-deterministic graph property testing
Israel Journal of Mathematics | 2014-12-11 | Paper |
