Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the 11th international conference on World Wide Web
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Representing Graph Metrics with Fewest Edges
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
A New Conceptual Clustering Framework
Machine Learning
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
An iterative, multi-level, and scalable approach to comparing execution traces
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
An iterative, multi-level, and scalable approach to comparing execution traces
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers
Connectivity structure of bipartite graphs via the KNC-plot
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
SIFT: a scalable iterative-unfolding technique for filtering execution traces
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Efficient algorithms for the 2-gathering problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Speeding up algorithms on compressed web graphs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Graph Theory, Computational Intelligence and Thought
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
An O(n log n) algorithm for a load balancing problem on paths
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Preserving terminal distances using minors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
A practical simulation method for social networks
AWC '13 Proceedings of the First Australasian Web Conference - Volume 144
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |