Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithms column: sublinear time algorithms
ACM SIGACT News
Machine Learning
Approximating vertex cover on dense graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
Multiple Sequence Alignment as a Facility-Location Problem
INFORMS Journal on Computing
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the Approximation of Correlation Clustering and Consensus Clustering
Journal of Computer and System Sciences
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal Incentives for Participation with Type-Dependent Externalities
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximation algorithms for geometric intersection graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Semidefinite approximations for quadratic programs over orthogonal matrices
Journal of Global Optimization
A polynomial time approximation scheme for k-consensus clustering
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Top-d rank aggregation in web meta-search engine
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
An improved approximation algorithm for spanning star forest in dense graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Property testing
Introduction to testing graph properties
Property testing
Property testing
Introduction to testing graph properties
Property testing
On variants of the spanning star forest problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Introduction to testing graph properties
Studies in complexity and cryptography
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Correlation clustering and consensus clustering
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Additive approximation for edge-deletion problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Rearrangement of noisy genomes
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Finding overlapping communities in social networks: toward a rigorous approach
Proceedings of the 13th ACM Conference on Electronic Commerce
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences
Improved approximation for spanning star forest in dense graphs
Journal of Combinatorial Optimization
Proceedings of the 5th conference on Innovations in theoretical computer science
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
| Hi-index | 0.03 |