SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
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
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Information and Computation
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
IEEE Transactions on Pattern Analysis and Machine Intelligence
An inductive definition of cubic toroidal maps
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Blocking nonorientability of a surface
Journal of Combinatorial Theory Series B
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
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
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
European Journal of Combinatorics - Special issue: Topological graph theory II
On maximum planar induced subgraphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On the minimum load coloring problem
Journal of Discrete Algorithms
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Faster parameterized algorithms for minor containment
Theoretical Computer Science
On the minimum load coloring problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Planar drawings of higher-genus graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Operations Research Letters
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |