| Publication | Date of Publication | Type |
|---|
| Local-vs-global combinatorics | 2024-03-20 | Paper |
| On Rödl's theorem for cographs | 2024-02-16 | Paper |
| Counting Homomorphic Cycles in Degenerate Graphs | 2023-10-23 | Paper |
| Trimming forests is hard (unless they are made of stars) | 2023-10-17 | Paper |
| Testing linear inequalities of subgraph statistics | 2023-10-11 | Paper |
| Testing versus estimation of graph properties, revisited | 2023-05-09 | Paper |
| Weakly saturated hypergraphs and a conjecture of Tuza | 2023-04-27 | Paper |
| Counting Subgraphs in Degenerate Graphs | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875743 | 2023-02-03 | Paper |
| A new approach for the Brown-Erdos-Sos problem | 2023-01-18 | Paper |
| An efficient asymmetric removal lemma and its limitations | 2023-01-18 | Paper |
| A new bound for the Brown-Erdős-Sós problem | 2022-11-28 | Paper |
| Exact limit theorems for restricted integer partitions | 2022-08-24 | Paper |
| Bounding the number of odd paths in planar graphs via convex optimization | 2022-08-03 | Paper |
| An Elementary Proof of a Theorem of Hardy and Ramanujan | 2022-07-19 | Paper |
| Testing graphs against an unknown distribution | 2022-04-25 | Paper |
| Hypergraph removal with polynomial bounds | 2022-02-15 | Paper |
| Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph | 2022-02-01 | Paper |
| Removal lemmas with polynomial bounds | 2022-01-13 | Paper |
| A Ramsey variant of the Brown–Erdős–Sós conjecture | 2022-01-13 | Paper |
| A Generalized Turán Problem and its Applications | 2021-12-09 | Paper |
| Constructing dense grid-free linear $3$-graphs | 2021-11-09 | Paper |
| On Erdős’s Method for Bounding the Partition Function | 2021-09-27 | Paper |
| Quasirandom Graphs and the Pantograph Equation | 2021-08-12 | Paper |
| Tournament quasirandomness from local counting | 2021-06-29 | Paper |
| A quantitative Lovász criterion for Property B | 2021-06-15 | Paper |
| Efficient Testing without Efficient Regularity | 2021-06-15 | Paper |
| Exact Limit Theorems for Restricted Integer Partitions | 2021-04-06 | Paper |
| Two Erdős-Hajnal-type theorems in hypergraphs | 2021-02-03 | Paper |
| Testing linear inequalities of subgraph statistics | 2020-07-20 | Paper |
| The Induced Removal Lemma in Sparse Graphs | 2020-04-06 | Paper |
| Testing graphs against an unknown distribution | 2020-01-30 | Paper |
| A tight bound for hypergraph regularity | 2019-11-07 | Paper |
| Efficient removal without efficient regularity | 2019-09-04 | Paper |
| A generalized Turán problem and its applications | 2019-08-22 | Paper |
| A Tight Bound for Hyperaph Regularity | 2019-07-17 | Paper |
| The removal lemma for tournaments | 2019-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743465 | 2019-05-10 | Paper |
| A sparse regular approximation lemma | 2019-05-06 | Paper |
| A Tight Bound for Hypergraph Regularity II | 2018-04-16 | Paper |
| A short proof of Gowers' lower bound for the regularity lemma | 2018-02-13 | Paper |
| Decomposing a graph into expanding subgraphs | 2018-01-16 | Paper |
| Decomposing a graph into expanding subgraphs | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365069 | 2017-09-29 | Paper |
| An improved lower bound for arithmetic regularity | 2017-09-28 | Paper |
| Removal lemmas with polynomial bounds | 2017-08-17 | Paper |
| A tournament approach to pattern avoiding matrices | 2017-04-28 | Paper |
| Constructing near spanning trees with few local inspections | 2017-04-18 | Paper |
| Small complete minors above the extremal edge density | 2016-09-09 | Paper |
| Unavoidable tournaments | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501357 | 2015-08-03 | Paper |
| A unified framework for testing linear‐invariant properties | 2015-04-09 | Paper |
| Exact bounds for some hypergraph saturation problems | 2015-03-05 | Paper |
| Green's conjecture and testing linear-invariant properties | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934626 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934690 | 2014-12-18 | Paper |
| Deterministic vs non-deterministic graph property testing | 2014-12-11 | Paper |
| A combinatorial characterization of the testable graph properties | 2014-11-25 | Paper |
| Finding cycles and trees in sublinear time | 2014-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921732 | 2014-10-13 | Paper |
| All-pairs shortest paths with a sublinear additive error | 2014-09-09 | Paper |
| Forcing \(k\)-repetitions in degree sequences | 2014-09-04 | Paper |
| Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem | 2014-07-15 | Paper |
| Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs | 2014-02-24 | Paper |
| A Note on Even Cycles and Quasirandom Tournaments | 2013-07-31 | Paper |
| A Wowzer-type lower bound for the strong regularity lemma | 2013-05-16 | Paper |
| A note on maximizing the spread of influence in social networks | 2013-04-04 | Paper |
| Testing Odd-Cycle-Freeness in Boolean Functions | 2012-10-31 | Paper |
| A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma | 2012-08-22 | Paper |
| Sublinear Time Algorithms | 2012-03-15 | Paper |
| The quasi-randomness of hypergraph cut properties | 2012-03-07 | Paper |
| A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma | 2011-08-17 | Paper |
| Color-critical graphs have logarithmic circumference | 2011-07-08 | Paper |
| On randomizing two derandomized greedy algorithms | 2011-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002762 | 2011-05-24 | Paper |
| Approximate Hypergraph Partitioning and Applications | 2011-04-04 | Paper |
| All-pairs bottleneck paths in vertex weighted graphs | 2011-03-30 | Paper |
| The effect of induced subgraphs on quasi-randomness | 2010-11-10 | Paper |
| On the density of a graph and its blowup | 2010-11-05 | Paper |
| Green’s Conjecture and Testing Linear Invariant Properties | 2010-10-12 | Paper |
| Every monotone graph property is testable | 2010-08-16 | Paper |
| Testing subgraphs in directed graphs | 2010-08-16 | Paper |
| The effect of induced subgraphs on quasi-randomness | 2010-08-06 | Paper |
| Testing the expansion of a graph | 2010-04-08 | Paper |
| Every minor-closed property of sparse graphs is testable | 2010-04-06 | Paper |
| A proof of Green's conjecture regarding the removal properties of sets of linear equations | 2010-03-31 | Paper |
| Can a Graph Have Distinct Regular Partitions? | 2010-03-17 | Paper |
| A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity | 2010-03-17 | Paper |
| Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs | 2010-01-06 | Paper |
| Quasi-randomness and the distribution of copies of a fixed graph | 2009-12-28 | Paper |
| Additive approximation for edge-deletion problems | 2009-07-15 | Paper |
| Multigraphs (only) satisfy a weak triangle removal lemma | 2009-07-08 | Paper |
| Every Monotone Graph Property Is Testable | 2009-04-30 | Paper |
| Can a Graph Have Distinct Regular Partitions? | 2009-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549723 | 2009-01-05 | Paper |
| A Characterization of the (Natural) Graph Properties Testable with One-Sided Error | 2008-12-22 | Paper |
| An Elementary Construction of Constant-Degree Expanders | 2008-12-11 | Paper |
| A separation theorem in property testing | 2008-10-21 | Paper |
| All-Pairs Shortest Paths with a Sublinear Additive Error | 2008-08-28 | Paper |
| Space complexity vs. query complexity | 2008-08-20 | Paper |
| Space Complexity vs. Query Complexity | 2007-08-28 | Paper |
| On an extremal hypergraph problem of Brown, Erdős and Sós | 2007-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424887 | 2007-03-05 | Paper |
| Behrend-type constructions for sets of linear equations | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828996 | 2004-11-29 | Paper |
| Testing subgraphs in directed graphs | 2004-11-18 | Paper |
| Testing satisfiability | 2003-08-17 | Paper |
