Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
The NP-completeness column: an ongoing guide
Journal of Algorithms
Introduction to algorithms
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Finding minimally weighted subgraphs
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On linear time minor tests with depth-first search
Journal of Algorithms
Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
On Approximating the Longest Path in a Graph (Preliminary Version)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Finding Even Cycles Even Faster
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Extremal Graph Theory
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Finding long paths and cycles in sparse Hamiltonian graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs
SODA '00 Proceedings of the eleventh 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
Understanding planning with incomplete information and sensing
Artificial Intelligence
Algorithms for long paths in graphs
Theoretical Computer Science
A framework towards web services composition modelling and execution
International Journal of Web and Grid Services
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Understanding planning with incomplete information and sensing
Artificial Intelligence
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
Computers & Mathematics with Applications
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Deciding first order properties of matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |