Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Edge coloring planar graphs with two outerplanar subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Area-efficient upward tree drawings
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Angles of planar triangular graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal decomposition of polygonal models into triangle strips
Proceedings of the eighteenth annual symposium on Computational geometry
IEEE Transactions on Software Engineering
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Convex Grid Drwaings of Four-Connected Plane Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing Outer-Planar Graphs in O(n log n) Area
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Computer and System Sciences - STOC 2001
Compact floor-planning via orderly spanning trees
Journal of Algorithms
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs
Information Processing Letters
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Strictly convex drawings of planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Rectangle-of-influence drawings of four-connected plane graphs: extended abstract
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Improved visibility representation of plane graphs
Computational Geometry: Theory and Applications
Visibility representation of plane graphs via canonical ordering tree
Information Processing Letters
On simultaneous straight-line grid embedding of a planar graph and its dual
Information Processing Letters
Distances with neighbourhood sequences in cubic and triangular grids
Pattern Recognition Letters
Area-efficient planar straight-line drawings of outerplanar graphs
Discrete Applied Mathematics
Embedding 3-polytopes on a small grid
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Matching edges and faces in polygonal partitions
Computational Geometry: Theory and Applications
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry: Theory and Applications
Triangulations without pointed spanning trees
Computational Geometry: Theory and Applications
Greedy drawings of triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Schnyder woods for higher genus triangulated surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Intervals in Catalan lattices and realizers of triangulations
Journal of Combinatorial Theory Series A
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Graph-Theoretic Concepts in Computer Science
A Lower Bound on the Area Requirements of Series-Parallel Graphs
Graph-Theoretic Concepts in Computer Science
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Upward straight-line embeddings of directed graphs into point sets
Computational Geometry: Theory and Applications
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Visibility representation of plane graphs via canonical ordering tree
Information Processing Letters
Motorcycle graphs: canonical quad mesh partitioning
SGP '08 Proceedings of the Symposium on Geometry Processing
Robust self-assembly of graphs
Natural Computing: an international journal
Embedding graphs simultaneously with fixed edges
GD'06 Proceedings of the 14th international conference on Graph drawing
Open rectangle-of-influence drawings of inner triangulated plane graphs
GD'06 Proceedings of the 14th international conference on Graph drawing
Straight-line drawing of quadrangulations
GD'06 Proceedings of the 14th international conference on Graph drawing
Schnyder woods and orthogonal surfaces
GD'06 Proceedings of the 14th international conference on Graph drawing
Partitions of graphs into trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the number of α-orientations
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Succinct representation of labeled graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Representation of planar hypergraphs by contacts of triangles
GD'07 Proceedings of the 15th international conference on Graph drawing
Minimizing the area for planar straight-line grid drawings
GD'07 Proceedings of the 15th international conference on Graph drawing
GD'07 Proceedings of the 15th international conference on Graph drawing
A note on minimum-area straight-line drawings of planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Universal sets of n points for 1-bend drawings of planar graphs with n vertices
GD'07 Proceedings of the 15th international conference on Graph drawing
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A compact encoding of plane triangulations with efficient query supports
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A note on isosceles planar graph drawing
Information Processing Letters
Steinitz theorems for orthogonal polyhedra
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 compact encoding of plane triangulations with efficient query supports
Information Processing Letters
Bijections for Baxter families and related objects
Journal of Combinatorial Theory Series A
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Drawing graphs in the plane with a prescribed outer face and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
Improved lower bounds on the area requirements of series-parallel graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Point-set embeddings of plane 3-trees
GD'10 Proceedings of the 18th international conference on Graph drawing
Human-centered visualization environments
Human-centered visualization environments
Integer representations of convex polygon intersection graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Orthogonal cartograms with few corners per face
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Point-set embeddings of plane 3-trees
Computational Geometry: Theory and Applications
Improved floor-planning of graphs via adjacency-preserving transformations
Journal of Combinatorial Optimization
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Transversal structures on triangulations, with application to straight-line drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Convex drawings of plane graphs of minimum outer apices
GD'05 Proceedings of the 13th international conference on Graph Drawing
An application of well-orderly trees in graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Planar straight-line drawing in an O(n)×O(n) grid with angular resolution Ω(1/n)
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Convex drawings of 3-connected plane graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends
GD'04 Proceedings of the 12th international conference on Graph Drawing
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing 3-polytopes with good vertex resolution
GD'09 Proceedings of the 17th international conference on Graph Drawing
GD'09 Proceedings of the 17th international conference on Graph Drawing
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
Manhattan-Geodesic embedding of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing planar 3-trees with given face-areas
GD'09 Proceedings of the 17th international conference on Graph Drawing
4-Labelings and grid embeddings of plane quadrangulations
GD'09 Proceedings of the 17th international conference on Graph Drawing
The hamiltonian augmentation problem and its applications to graph drawing
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Small grid drawings of planar graphs with balanced bipartition
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Proportional contact representations of planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
On point-sets that support planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Small point sets for simply-nested planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the hardness of point-set embeddability
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Unified bijections for maps with prescribed degrees and girth
Journal of Combinatorial Theory Series A
Green's theorem and isolation in planar graphs
Information and Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications
Pointed drawings of planar graphs
Computational Geometry: Theory and Applications
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
Minimum-width grid drawings of plane graphs
Computational Geometry: Theory and Applications
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization
Succinct strictly convex greedy drawing of 3-connected plane graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On point-sets that support planar graphs
Computational Geometry: Theory and Applications
Drawing planar graphs on points inside a polygon
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Approximating infeasible 2VPI-systems
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On representing graphs by touching cuboids
GD'12 Proceedings of the 20th international conference on Graph Drawing
Grid drawings and the chromatic number
GD'12 Proceedings of the 20th international conference on Graph Drawing
On the density of maximal 1-planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
A simple routing algorithm based on Schnyder coordinates
Theoretical Computer Science
Morphing orthogonal planar graph drawings
ACM Transactions on Algorithms (TALG)
On the curve complexity of upward planar drawings
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Plane 3-trees: embeddability and approximation
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Universal point sets for planar three-trees
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Upward planar drawings on the standing and the rolling cylinders
Computational Geometry: Theory and Applications
Orthogonal cartograms with at most 12 corners per face
Computational Geometry: Theory and Applications
Reprint of: Grid representations and the chromatic number
Computational Geometry: Theory and Applications
Acyclic coloring with few division vertices
Journal of Discrete Algorithms
| Hi-index | 0.00 |