| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6136030 | 2023-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875702 | 2023-02-03 | Paper |
| Extensions and Limits of the Specker-Blatter Theorem | 2022-06-24 | Paper |
| Earthmover Resilience and Testing in Ordered Structures | 2020-09-22 | Paper |
| Testing Read-Once Formula Satisfaction | 2019-12-06 | Paper |
| Improving and extending the testing of distributions for shape-restricted properties | 2019-08-20 | Paper |
| Testing Low Complexity Affine-Invariant Properties | 2019-05-15 | Paper |
| Fast distributed algorithms for testing graph properties | 2019-03-21 | Paper |
| Longest paths in 2-edge-connected cubic graphs | 2019-03-06 | Paper |
| Ordered Graph Limits and Their Applications | 2018-11-05 | Paper |
| Fast distributed algorithms for testing graph properties | 2018-08-16 | Paper |
| Improving and extending the testing of distributions for shape-restricted properties | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607989 | 2018-03-15 | Paper |
| Partial tests, universal tests and decomposability | 2017-05-19 | Paper |
| On the power of conditional samples in distribution testing | 2017-05-16 | Paper |
| Testing hereditary properties of ordered graphs and matrices | 2017-04-07 | Paper |
| PCP characterizations of NP | 2016-09-29 | Paper |
| On the power of conditional samples in distribution testing | 2016-08-16 | Paper |
| Hardness and algorithms for rainbow connection | 2015-08-24 | Paper |
| Testing of matrix properties | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497116 | 2015-02-03 | Paper |
| A combinatorial characterization of the testable graph properties | 2014-11-25 | Paper |
| On the query complexity of testing orientations for being Eulerian | 2014-09-09 | Paper |
| Every locally characterized affine-invariant property is testable | 2014-08-07 | Paper |
| New Results on Quantum Property Testing | 2012-08-29 | Paper |
| Testing Formula Satisfaction | 2012-08-14 | Paper |
| Hardness and Algorithms for Rainbow Connectivity | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118380 | 2012-03-02 | Paper |
| Two-phase algorithms for the parametric shortest path problem | 2012-01-23 | Paper |
| PCP characterizations of NP: toward a polynomially-small error-probability | 2011-11-30 | Paper |
| Inflatable Graph Properties and Natural Property Tests | 2011-08-17 | Paper |
| Testing convexity properties of tree colorings | 2011-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002771 | 2011-05-24 | Paper |
| Approximate Hypergraph Partitioning and Applications | 2011-04-04 | Paper |
| The Specker-Blatter Theorem Revisited | 2011-03-18 | Paper |
| Approximate Satisfiability and Equivalence | 2011-01-17 | Paper |
| Testing versus estimation of graph properties | 2010-08-16 | Paper |
| Testing graph isomorphism | 2010-08-16 | Paper |
| The difficulty of testing for isomorphism against a graph that is given in advance | 2010-08-15 | Paper |
| Monotonicity testing over general poset domains | 2010-08-05 | Paper |
| A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity | 2010-03-17 | Paper |
| Testing Graph Isomorphism | 2009-03-16 | Paper |
| Testing st-Connectivity | 2009-02-17 | Paper |
| Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects | 2009-02-17 | Paper |
| On the Query Complexity of Testing Orientations for Being Eulerian | 2008-11-27 | Paper |
| Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs | 2008-06-19 | Paper |
| Testing versus Estimation of Graph Properties | 2008-04-22 | Paper |
| Linear Recurrence Relations for Graph Polynomials | 2008-03-25 | Paper |
| Counting truth assignments of formulas of bounded tree-width or clique-width | 2008-02-26 | Paper |
| Testing of matrix-poset properties | 2007-11-12 | Paper |
| Testing Convexity Properties of Tree Colorings | 2007-09-03 | Paper |
| The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance | 2005-09-16 | Paper |
| On spectra of sentences of monadic second order logic with counting | 2005-08-29 | Paper |
| Testing graphs for colorability properties* | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668732 | 2005-04-15 | Paper |
| On the strength of comparisons in property testing | 2004-11-23 | Paper |
| Testing juntas | 2004-08-06 | Paper |
| Functions that have read‐twice constant width branching programs are not necessarily testable | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768393 | 2003-10-26 | Paper |
| The Specker-Blatter theorem does not hold for quaternary relations | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152421 | 2002-10-23 | Paper |
| Parent-identifying codes | 2002-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2761012 | 2001-12-17 | Paper |
| Efficient testing of large graphs | 2001-06-13 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem] | 2000-06-04 | Paper |
| Cycle factors in dense graphs | 2000-01-30 | Paper |
| Induced complete \(h\)-partite graphs in dense clique-less graphs | 1999-12-14 | Paper |
| 2-factors in dense graphs | 1996-07-07 | Paper |
