An improved parallel algorithm for maximal matching
Information Processing Letters
The NP-completeness column: An ongoing guide
Journal of Algorithms
The complexity of parallel algorithms
The complexity of parallel algorithms
Parallelism and the maximal path problem
Information Processing Letters
Graph Theory, 1736-1936
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Simple local search problems that are hard to solve
SIAM Journal on Computing
Efficient maximal cubic graph cuts (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Lower bounds on universal traversal sequences for cycles and other low degree graphs
SIAM Journal on Computing
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Lower bounds on universal traversal sequences based on chains of length five
Information and Computation
Analysis of a simple greedy matching algorithm on random cubic graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Discrete Computational Structures
Discrete Computational Structures
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some Further Approximation Algorithms for the Vertex Cover Problem
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Graph isomorphism, general remarks
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
A Simple Parallel Algorithm to Draw Cubic Graphs
IEEE Transactions on Parallel and Distributed Systems
4-edge-coloring graphs of maximum degree 3 in linear time
Information Processing Letters
Delta-List Vertex Coloring in Linear Time
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On the Hardness of Approximating Minimum Monopoly Problems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Symmetric and semisymmetric graphs construction using G-graphs
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Controlled Markov chains, graphs, and Hamiltonicity
Foundations and Trends® in Stochastic Systems
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Theoretical Computer Science
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
DESIGN SPACE ANALYSIS IN MODEL-DRIVEN ENGINEERING
Journal of Integrated Design & Process Science
| Hi-index | 0.00 |