Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A New 3-Color Criterion for Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Short path queries in planar graphs in constant time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Adjacency queries in dynamic sparse graphs
Information Processing Letters
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Proceedings of the twenty-fourth annual symposium on Computational geometry
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Min-max coverage in multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
External-memory network analysis algorithms for naturally sparse graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Cliques in odd-minor-free graphs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
A dynamic data structure for counting subgraphs in sparse graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 5.23 |