The page number of genus g graphs is (g)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The pagenumber of genus g graphs is O(g)
Journal of the ACM (JACM)
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A near optimal algorithm for edge separators (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Moments of inertia and graph separators
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Dynamic Algorithm for Maintaining Graph Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Min-Max-Boundary Domain Decomposition
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of Algorithms
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Enhanced algorithms for local search
Information Processing Letters
The first order definability of graphs with separators via the Ehrenfeucht game
Theoretical Computer Science - Game theory meets theoretical computer science
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Separator Theorem for String Graphs and Its Applications
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Computing the Girth of a Planar Graph in O(n logn) Time
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Journal of the ACM (JACM)
Enhanced algorithms for Local Search
Information Processing Letters
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European Journal of Combinatorics
A separator theorem for string graphs and its applications
Combinatorics, Probability and Computing
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Improved sublinear time algorithm for width-bounded separators
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
The size and depth of layered Boolean circuits
Information Processing Letters
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
SIAM Journal on Discrete Mathematics
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Planar crossing numbers of genus g graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximate shortest path queries on weighted polyhedral surfaces
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |