Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
The traveling salesman problem with distances one and two
Mathematics of Operations Research
An O(m log n)-time algorithm for the maximal planar subgraph problem
SIAM Journal on Computing
An analysis of some heuristics for the maximum planar subgraph problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Linear Algorithm for the Maximal Planar Subgraph Problem
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Applications of the linear matroid parity algorithm to approximating steiner trees
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |