Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximating k-spanner problems for k 2
Theoretical Computer Science
t-Spanners for metric space searching
Data & Knowledge Engineering
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A local algorithm for finding dense subgraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Randomized priority algorithms
Theoretical Computer Science
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Journal of Computer and System Sciences
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Link prediction for annotation graphs using graph summarization
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Discovery of top-k dense subgraphs in dynamic graph collections
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Streaming algorithms for k-core decomposition
Proceedings of the VLDB Endowment
| Hi-index | 0.01 |