Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Hypergraphs, quasi-randomness, and conditions for regularity
Journal of Combinatorial Theory Series A
Proof of a conjecture of Bollob́s and Kohayakawa on the Erdös-Stone theorem
Journal of Combinatorial Theory Series B
The regularity lemma and its applications in graph theory
Theoretical aspects of computer science
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
An Algorithmic Embedding of Graphs via Perfect Matchings
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
The Regularity Lemma and Its Applications in Graph Theory
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
On characterizing hypergraph regularity
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the number of Hamiltonian cycles in Dirac graphs
Discrete Mathematics
Journal of Algorithms
Regular pairs in sparse random graphs I
Random Structures & Algorithms
Spanning Trees in Dense Graphs
Combinatorics, Probability and Computing
Hypergraph Packing and Graph Embedding
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the cut-norm via Grothendieck's inequality
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM (JACM)
Packings in Dense Regular Graphs
Combinatorics, Probability and Computing
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithmic Version of the Hypergraph Regularity Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory Series B
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Packing directed cycles efficiently
Discrete Applied Mathematics
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory Series B
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hardness of fully dense problems
Information and Computation
On the bandwidth conjecture for 3-colourable graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum H-decompositions of graphs
Journal of Combinatorial Theory Series B
The effect of induced subgraphs on quasi-randomness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
Journal of Combinatorial Theory Series B
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hypergraph regularity and quasi-randomness
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
On Computing the Frequencies of Induced Subhypergraphs
SIAM Journal on Discrete Mathematics
Hardness and algorithms for rainbow connection
Journal of Combinatorial Optimization
An approximate version of Sumner's universal tournament conjecture
Journal of Combinatorial Theory Series B
A deterministic algorithm for the Frieze-Kannan regularity lemma
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Szemerédi-type clustering of peer-to-peer streaming system
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Additive approximation for edge-deletion problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
Maximum dispersion problem in dense graphs
Operations Research Letters
On the price of equivocation in byzantine agreement
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Quasi-randomness and algorithmic regularity for graphs with general degree distributions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A regularity lemma and twins in words
Journal of Combinatorial Theory Series A
Hamilton decompositions of regular expanders: Applications
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |