Hierarchical planarity testing algorithms
Journal of the ACM (JACM)
Optimal parallel algorithms for transitive closure and point location in planar structures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Area requirement and symmetry display in drawing graphs
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The Via Minimization Problem is NP-Complete
IEEE Transactions on Computers
On upward drawing testing of triconnected digraphs (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Randomized graph drawing with heavy-duty preprocessing
AVI '94 Proceedings of the workshop on Advanced visual interfaces
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Appearance-preserving simplification
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Inserting an edge into a planar graph
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Software—Practice & Experience
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A new approach for visualizing UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph-Theoretic Concepts in Computer Science
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Bijective counting of plane bipolar orientations and Schnyder woods
European Journal of Combinatorics
Planarity testing and optimal edge insertion with embedding constraints
GD'06 Proceedings of the 14th international conference on Graph drawing
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Practical level planarity testing and layout with embedding constraints
GD'07 Proceedings of the 15th international conference on Graph drawing
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Complexity of 3-D floorplans by analysis of graph cuboidal dual hardness
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Computational Geometry: Theory and Applications
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences: an International Journal
On minimizing the number of label transitions around a vertex of a planar graph
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.00 |