A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Long cycles in graphs on a fixed surface
Journal of Combinatorial Theory Series B
Generating cycle spaces for graphs on surfaces with small genera
European Journal of Combinatorics
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Finding shortest contractible and shortest separating cycles in embedded graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Generalized duality for graphs on surfaces and the signed Bollobás--Riordan polynomial
Journal of Combinatorial Theory Series B
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Finding shortest contractible and shortest separating cycles in embedded graphs
ACM Transactions on Algorithms (TALG)
Output-sensitive algorithm for the edge-width of an embedded graph
Proceedings of the twenty-sixth annual symposium on Computational geometry
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Shortest cut graph of a surface with prescribed vertex set
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Algorithms for the edge-width of an embedded graph
Computational Geometry: Theory and Applications
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
Finding Cycles with Topological Properties in Embedded Graphs
SIAM Journal on Discrete Mathematics
Graphs obtained from Moufang loops and regular maps
Journal of Graph Theory
The complexity of separating points in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |