A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Separators in two and three dimensions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Applications of the crossing number
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Analysis of multilevel graph partitioning
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Moments of inertia and graph separators
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On External-Memory Planar Depth First Search
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Planar Graph Blocking for External Searching
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on maximum independent set and related problems on box graphs
Information Processing Letters
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Online geometric reconstruction
Proceedings of the twenty-second annual symposium on Computational geometry
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed search in railway scheduling problems
Engineering Applications of Artificial Intelligence
A parallel algorithm for finding a separator in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
A note on maximum independent set and related problems on box graphs
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SIAM Journal on Discrete Mathematics
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
GD'11 Proceedings of the 19th international conference on Graph Drawing
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Parallel nested dissection for path algebra computations
Operations Research Letters
Fixed-parameter tractability for non-crossing spanning trees
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Parameterized complexity of 1-planarity
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Approximation algorithms for cutting a convex polyhedron out of a sphere
Theoretical Computer Science
| Hi-index | 0.00 |