| Publication | Date of Publication | Type |
|---|
| Strongly sublinear algorithms for testing pattern freeness | 2024-07-03 | Paper |
| Strongly sublinear algorithms for testing pattern freeness | 2024-06-24 | Paper |
| Parameterized convexity testing | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059200 | 2023-11-02 | Paper |
| Large simple \(d\)-cycles in simplicial complexes | 2023-10-12 | Paper |
| Self-simulation for the Passive Optical Star model | 2023-05-08 | Paper |
| Testing of graph properties | 2022-12-21 | Paper |
| Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes | 2021-07-06 | Paper |
| On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs | 2020-03-06 | Paper |
| Query Complexity | 2020-03-04 | Paper |
| On connectivity of the facet graphs of simplicial complexes | 2019-12-17 | Paper |
| Testing for forbidden order patterns in an array | 2019-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5197582 | 2019-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743377 | 2019-05-10 | Paper |
| Extremal hypercuts and shadows of simplicial complexes | 2019-02-07 | Paper |
| A lower bound on the distortion of embedding planar metrics into Euclidean space | 2018-11-23 | Paper |
| Testing for Forbidden Order Patterns in an Array | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636453 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501854 | 2015-08-14 | Paper |
| Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes | 2015-07-16 | Paper |
| Hats, auctions and derandomization | 2015-05-29 | Paper |
| Testing of matrix properties | 2015-02-27 | 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 |
| Extremal problems on shadows and hypercuts in simplicial complexes | 2014-08-04 | Paper |
| Every property of hyperfinite graphs is testable | 2014-06-05 | Paper |
| On multiplicative \(\lambda\)-approximations and some geometric applications | 2013-09-25 | Paper |
| Every property of hyperfinite graphs is testable | 2013-09-25 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| Treewidth governs the complexity of target set selection | 2012-10-16 | Paper |
| Hierarchy theorems for property testing | 2012-06-26 | Paper |
| Local versus global properties of metric spaces | 2012-05-30 | Paper |
| Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs | 2012-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002805 | 2011-05-24 | Paper |
| Testing periodicity | 2011-05-10 | Paper |
| LCS approximation via embedding into locally non-repetitive strings | 2011-04-28 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Computing in fault tolerant broadcast networks and noisy decision trees | 2010-11-09 | Paper |
| Property Testing of Massively Parametrized Problems – A Survey | 2010-10-12 | Paper |
| Hierarchy Theorems for Property Testing | 2010-10-12 | Paper |
| Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs | 2010-09-10 | Paper |
| Testing versus estimation of graph properties | 2010-08-16 | Paper |
| Local versus global properties of metric spaces | 2010-08-16 | 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 |
| Lower bounds for testing Euclidean minimum spanning trees | 2010-01-29 | Paper |
| A New Derandomization of Auctions | 2009-12-01 | Paper |
| Hierarchy Theorems for Property Testing | 2009-10-28 | Paper |
| LCS Approximation via Embedding into Local Non-repetitive Strings | 2009-07-07 | Paper |
| Testing st-Connectivity | 2009-02-17 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| On the Query Complexity of Testing Orientations for Being Eulerian | 2008-11-27 | Paper |
| Quantum Property Testing | 2008-10-28 | Paper |
| Space complexity vs. query complexity | 2008-08-20 | Paper |
| Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs | 2008-06-19 | Paper |
| Testing versus Estimation of Graph Properties | 2008-04-22 | Paper |
| Testing of matrix-poset properties | 2007-11-12 | Paper |
| Hard Metrics from Cayley Graphs of Abelian Groups | 2007-09-03 | Paper |
| Space Complexity vs. Query Complexity | 2007-08-28 | Paper |
| Robust polynomials and quantum algorithms | 2007-08-23 | Paper |
| Partitioning multi-dimensional sets in a small number of ``uniform parts | 2006-12-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Embedding k-Outerplanar Graphs into l1 | 2006-06-01 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time | 2005-10-28 | Paper |
| Cuts, trees and \(\ell_1\)-embeddings of graphs | 2005-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471340 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471376 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471333 | 2004-07-28 | Paper |
| Functions that have read‐twice constant width branching programs are not necessarily testable | 2004-03-29 | Paper |
| A lower bound on the distortion of embedding planar metrics into Euclidean space | 2003-03-17 | Paper |
| Communication-processor tradeoffs in a limited resources PRAM | 2002-12-01 | Paper |
| Testing Membership in Languages that Have Small Width Branching Programs | 2002-09-29 | Paper |
| Regular languages are testable with a constant number of queries | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228511 | 2000-05-22 | Paper |
| Self-Simulation for the Passive Optical Star | 2000-03-16 | Paper |
| Optimal Search in Trees | 1999-10-28 | Paper |
| Geometric approach for optimal routing on a mesh with buses | 1997-08-03 | Paper |
| Randomized Single-Target Hot-Potato Routing | 1997-07-06 | Paper |
| Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy | 1996-07-02 | Paper |
| Decision trees with Boolean threshold queries | 1996-03-19 | Paper |
| Search Problems in the Decision Tree Model | 1995-08-06 | Paper |
| Non-deterministic communication complexity with few witnesses | 1994-11-06 | Paper |
| Combinatorial characterization of read-once formulae | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036698 | 1993-05-18 | Paper |
| On read-once threshold formulae and their randomized decision tree complexity | 1993-05-16 | Paper |
| Private vs. common random bits in communication complexity | 1992-06-27 | Paper |
| On grid intersection graphs | 1992-06-25 | Paper |
| Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight | 1990-01-01 | Paper |
