On the public citation graph
Drawing Planar Graphs Using the Canonical Ordering
0 signed · 297 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140202openalex-snapshot
On minimal‐node‐cost planar embeddings
inferredcites →https://doi.org/10.1007/3-540-57155-8_244openalex-snapshot
Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-57568-5_261openalex-snapshot
Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
inferredcites →https://doi.org/10.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferredcites →https://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferredcites →https://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/bf01762117openalex-snapshot
A linear algorithm to find a rectangular dual of a planar triangulated graph
inferredcites →https://doi.org/10.1007/bf02006154openalex-snapshot
Theoretical results on at most 1-bend embeddability of graphs
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1007/bf02662066openalex-snapshot
At most single-bend embeddings of cubic graphs
inferredcites →https://doi.org/10.1007/bfb0049393openalex-snapshot
Planar drawings and angular resolution: Algorithms and bounds
inferredcites →https://doi.org/10.1016/0020-0190(91)90059-qopenalex-snapshot
Lower bounds for planar orthogonal drawings of graphs
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0095-8956(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
inferredcites →https://doi.org/10.1016/0304-3975(92)90349-kopenalex-snapshot
Constructing compact rectiliner planar layouts using canonical representation of planar graphs
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/31.1746openalex-snapshot
Planar embedding: linear-time algorithms for vertex placement and edge orderings
inferredcites →https://doi.org/10.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferredcites →https://doi.org/10.1112/plms/s3-10.1.304openalex-snapshot
Convex Representations of Graphs
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1137/0222063openalex-snapshot
Drawing Graphs in the Plane with High Resolution
inferredcites →https://doi.org/10.1137/0222072openalex-snapshot
On Finding the Rectangular Duals of Planar Triangular Graphs
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferredcites →https://doi.org/10.1137/s0895480193242931openalex-snapshot
On the Angular Resolution of Planar Graphs
inferredcites →https://doi.org/10.1142/s0218195995000179openalex-snapshot
COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
inferredcites →https://doi.org/10.1142/s0218195997000144openalex-snapshot
Convex Grid Drawings of 3-Connected Planar Graphs
inferredcites →https://doi.org/10.1145/142675.142728openalex-snapshot
A framework for dynamic graph drawing
inferredcites →https://doi.org/10.1145/167088.167207openalex-snapshot
Angles of planar triangular graphs
inferredcites →https://doi.org/10.1145/73833.73839openalex-snapshot
Area requirement and symmetry display in drawing graphs
inferredcites →https://doi.org/10.5555/320176.320191openalex-snapshot
Embedding planar graphs on the grid
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2635openalex-snapshot
Triangulating Planar Graphs While Minimizing the Maximum Degree
inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1105openalex-snapshot
Box-Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1115openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1006/jagm.2001.1161openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1495openalex-snapshot
Orthogonally Drawing Cubic Graphs in Parallel
inferred← citeshttps://doi.org/10.1007/10692760_11openalex-snapshot
Drawing Planar Partitions II: HH-Drawings
inferred← citeshttps://doi.org/10.1007/10692760_26openalex-snapshot
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
inferred← citeshttps://doi.org/10.1007/11533719_86openalex-snapshot
On the Complexity of the Balanced Vertex Ordering Problem
inferred← citeshttps://doi.org/10.1007/11618058_41openalex-snapshot
An Application of Well-Orderly Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_50openalex-snapshot
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_31openalex-snapshot
Some Applications of Orderly Spanning Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_6openalex-snapshot
Drawing Outer-Planar Graphs in O(n log n )Area
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_4openalex-snapshot
Optimal Area Algorithm for Planar Polyline Drawings
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_3openalex-snapshot
Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_12openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_13openalex-snapshot
Planar Polyline Drawings with Good Angular Resolution
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_27openalex-snapshot
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_22openalex-snapshot
Convex Grid Drawings of Four-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_28openalex-snapshot
A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_8openalex-snapshot
A Linear Time Implementation of SPQR-Trees
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_22openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_83openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_89openalex-snapshot
Wagner’s Theorem on Realizers
inferred← citeshttps://doi.org/10.1007/3-540-45579-5_17openalex-snapshot
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_8openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_26openalex-snapshot
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_29openalex-snapshot
Floor-Planning via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_32openalex-snapshot
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_52openalex-snapshot
AGD: A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45875-1_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_12openalex-snapshot
Drawing Planar Graphs with Circular Arcs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_15openalex-snapshot
Grid Drawings of Four-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_20openalex-snapshot
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_25openalex-snapshot
Box-Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_16openalex-snapshot
Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_49openalex-snapshot
A new minimum cost flow algorithm with applications to graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_74openalex-snapshot
Orthogonal drawing of high degree graphs with small area and few bends
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_50openalex-snapshot
Incremental orthogonal graph drawing in three dimensions
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_54openalex-snapshot
A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_84openalex-snapshot
The three-phase method: A unified approach to orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/978-1-4471-2804-5_7openalex-snapshot
How to Draw a Graph, Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_11openalex-snapshot
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_19openalex-snapshot
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_30openalex-snapshot
$$\beta $$-Stars or On Extending a Drawing of a Connected Subgraph
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_34openalex-snapshot
Bend-Minimum Orthogonal Drawings in Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_18openalex-snapshot
Imbalance, Cutwidth, and the Structure of Optimal Orderings
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_13openalex-snapshot
Imbalance Parameterized by Twin Cover Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_25openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_27openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_52openalex-snapshot
Computing Imbalance-Minimal Orderings for Bipartite Permutation Graphs and Threshold Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_14openalex-snapshot
Quasi-upward Planar Drawings with Minimum Curve Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_12openalex-snapshot
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_10openalex-snapshot
Unit-length Rectangular Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_11openalex-snapshot
Strictly-Convex Drawings of 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-09544-2_9openalex-snapshot
Conversion of a Digital Object into a Finite Set of Balls: Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_13openalex-snapshot
On Balanced -Contact Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_26openalex-snapshot
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_8openalex-snapshot
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_6openalex-snapshot
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_13openalex-snapshot
Small-Area Orthogonal Drawings of 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_16openalex-snapshot
Universal Systems of Oblivious Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_18openalex-snapshot
Bitonic st-orderings for Upward Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_23openalex-snapshot
How to Draw a Planarization
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_15openalex-snapshot
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_12openalex-snapshot
Partitioning Orthogonal Histograms into Rectangular Boxes
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_6openalex-snapshot
10 Reasons to Get Interested in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_1openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_33openalex-snapshot
On the Orthogonal Drawing of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_34openalex-snapshot
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_14openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_8openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_25openalex-snapshot
Drawing Graphs with Large Vertices and Thick Edges
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_21openalex-snapshot
Hardness Results for the Power Range Assignment Problem in Packet Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_23openalex-snapshot
Straight-Line Drawing of Quadrangulations
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_40openalex-snapshot
Schnyder Woods and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_41openalex-snapshot
Partitions of Graphs into Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_21openalex-snapshot
Minimizing the Area for Planar Straight-Line Grid Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_28openalex-snapshot
Graph Layout Problems Parameterized by Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_26openalex-snapshot
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_38openalex-snapshot
Non-convex Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_10openalex-snapshot
Edge-Intersection Graphs of k-Bend Paths in Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_16openalex-snapshot
Leftist Canonical Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_27openalex-snapshot
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_7openalex-snapshot
Planar Drawings of Higher-Genus Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_37openalex-snapshot
Optimal Polygonal Representation of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_21openalex-snapshot
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_23openalex-snapshot
Imbalance Is Fixed Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_1openalex-snapshot
Regular Labelings and Geometric Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_12openalex-snapshot
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_18openalex-snapshot
Lombardi Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_9openalex-snapshot
Orthogonal Cartograms with Few Corners Per Face
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_30openalex-snapshot
Planar and Poly-arc Lombardi Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_31openalex-snapshot
Force-Directed Lombardi-Style Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_31openalex-snapshot
Box-Rectangular Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_14openalex-snapshot
Smooth Orthogonal Layouts
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_34openalex-snapshot
Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_35openalex-snapshot
Planar Preprocessing for Spring Embedders
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_35openalex-snapshot
Drawing Graphs with Few Arcs
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_12openalex-snapshot
The Planar Slope Number of Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_13openalex-snapshot
Smooth Orthogonal Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_14openalex-snapshot
Drawing HV-Restricted Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_15openalex-snapshot
Periodic Planar Straight-Frame Drawings with Polynomial Resolution
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_14openalex-snapshot
Bitonic st-orderings of Biconnected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_26openalex-snapshot
Trade-Offs in Planar Polyline Drawings
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_32openalex-snapshot
Height-Preserving Transformations of Planar Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_41openalex-snapshot
Graph Drawings with One Bend and Few Slopes
inferred← citeshttps://doi.org/10.1007/978-3-7091-6783-0_3openalex-snapshot
Improving Angular Resolution in Visualizations of Geographic Networks
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_25openalex-snapshot
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_26openalex-snapshot
(t, s)-Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/bfb0030817openalex-snapshot
An efficient orthogonal grid drawing algorithm for cubic graphs
inferred← citeshttps://doi.org/10.1007/s00224-005-1143-4openalex-snapshot
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
inferred← citeshttps://doi.org/10.1007/s00453-004-1144-8openalex-snapshot
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
inferred← citeshttps://doi.org/10.1007/s00453-006-0114-8openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferred← citeshttps://doi.org/10.1007/s00453-006-0177-6openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9514-5openalex-snapshot
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing
inferred← citeshttps://doi.org/10.1007/s00453-011-9525-2openalex-snapshot
Optimal Polygonal Representation of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-00542-9openalex-snapshot
Universal Slope Sets for 1-Bend Planar Drawings
inferred← citeshttps://doi.org/10.1007/s00453-018-0523-5openalex-snapshot
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
inferred← citeshttps://doi.org/10.1007/s00453-020-00769-5openalex-snapshot
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-023-01111-5openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
inferred← citeshttps://doi.org/10.1007/s004539910006openalex-snapshot
Efficient Orthogonal Drawings of High Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00454-001-0004-4openalex-snapshot
Grid Drawings of 4-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00454-007-9027-9openalex-snapshot
Schnyder Woods and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-009-9169-zopenalex-snapshot
Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding
inferred← citeshttps://doi.org/10.1007/s00454-010-9310-zopenalex-snapshot
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-013-9552-7openalex-snapshot
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations
inferred← citeshttps://doi.org/10.1007/s00454-016-9832-0openalex-snapshot
Encoding Toroidal Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-022-00398-5openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/s004540010080openalex-snapshot
Drawing planar graphs with circular arcs
inferred← citeshttps://doi.org/10.1007/s10878-011-9390-6openalex-snapshot
Minimum-segment convex drawings of 3-connected cubic plane graphs
inferred← citeshttps://doi.org/10.1007/s12650-019-00582-5openalex-snapshot
A novel centrality-based method for visual analytics of small-world networks
inferred← citeshttps://doi.org/10.1007/s12650-020-00695-2openalex-snapshot
On aesthetics for user-sketched layouts of vertex-weighted graphs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.04.002openalex-snapshot
Curve-constrained drawings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.09.002openalex-snapshot
Drawings of planar graphs with few slopes and segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.04.003openalex-snapshot
Orthogeodesic point-set embedding of trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.005openalex-snapshot
Orthogonal cartograms with at most 12 corners per face
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.07.002openalex-snapshot
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.10.007openalex-snapshot
T-shape visibility representations of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101946openalex-snapshot
Geodesic obstacle representation of graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102036openalex-snapshot
Straight-line drawings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.12.001openalex-snapshot
Balanced vertex-orderings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.12.010openalex-snapshot
On the two-dimensional orthogonal drawing of series-parallel graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.01.021openalex-snapshot
A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114282openalex-snapshot
Structural parameters of Schnyder woods
inferred← citeshttps://doi.org/10.1016/j.eij.2012.01.003openalex-snapshot
GA for straight-line grid drawings of maximal planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.009openalex-snapshot
Packing and covering immersion-expansions of planar sub-cubic graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.005openalex-snapshot
Drawing Planar Graphs on Area
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.022openalex-snapshot
Schnyder woods for higher genus triangulated surfaces (abstract)
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.003openalex-snapshot
Clean the graph before you draw it!
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.06.010openalex-snapshot
Imbalance is fixed parameter tractable
inferred← citeshttps://doi.org/10.1016/j.jvlc.2018.08.004openalex-snapshot
Evaluating aesthetics for user-sketched layouts of symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.031openalex-snapshot
On the fairness and complexity of generalized k -in-a-row games
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.12.004openalex-snapshot
Drawing subcubic planar graphs with four slopes and optimal angular resolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114290openalex-snapshot
Convex grid drawings of planar graphs with constant edge-vertex resolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115551openalex-snapshot
Toward Grünbaum’s conjecture bounding vertices of degree 4
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115811openalex-snapshot
Weakly leveled planarity with bounded span
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00207-xopenalex-snapshot
Relating bends and size in orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00172-4openalex-snapshot
Three-dimensional orthogonal graph drawing algorithms
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00282-2openalex-snapshot
Point matching under non-uniform distortions
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00057-9openalex-snapshot
Compact floor-planning via orderly spanning trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00272-2openalex-snapshot
Advances in the theory and practice of graph drawing
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00006-2openalex-snapshot
The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference…
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00026-6openalex-snapshot
A better heuristic for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1023/b:mone.0000013624.32948.87openalex-snapshot
On the Power Assignment Problem in Radio Networks
inferred← citeshttps://doi.org/10.1023/b:qinp.0000020075.20455.5fopenalex-snapshot
Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing
inferred← citeshttps://doi.org/10.1080/09720529.2014.932132openalex-snapshot
Algorithms for Drawing Planar p-petal Graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218459openalex-snapshot
An annotated review on graph drawing and its applications
inferred← citeshttps://doi.org/10.1093/comjnl/bxz133openalex-snapshot
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.6.1583openalex-snapshot
On the Orthogonal Drawing of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1109/12.736444openalex-snapshot
Interactive orthogonal graph drawing
inferred← citeshttps://doi.org/10.1109/71.888641openalex-snapshot
A simple parallel algorithm to draw cubic graphs
inferred← citeshttps://doi.org/10.1109/iscas.2008.4541392openalex-snapshot
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract)
inferred← citeshttps://doi.org/10.1109/tvcg.2025.3577533openalex-snapshot
GraphTrials: Visual Proofs of Graph Properties
inferred← citeshttps://doi.org/10.1137/060651811openalex-snapshot
Nearly Optimal Visibility Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1137/070703041openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1137/090748640openalex-snapshot
Nonconvex Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.49openalex-snapshot
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
inferred← citeshttps://doi.org/10.1137/15m1030030openalex-snapshot
Mondshein Sequences (a.k.a. (2,1)-Orders)
inferred← citeshttps://doi.org/10.1137/20m1336412openalex-snapshot
On Covering Segments with Unit Intervals
inferred← citeshttps://doi.org/10.1137/s0097539702411381openalex-snapshot
Orderly Spanning Trees with Applications
inferred← citeshttps://doi.org/10.1137/s0097539794262847openalex-snapshot
Spirality and Optimal Orthogonal Drawings
inferred← citeshttps://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferred← citeshttps://doi.org/10.1137/s0895480103420744openalex-snapshot
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
inferred← citeshttps://doi.org/10.1137/s0895480194264010openalex-snapshot
Angles of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1142/9789812773289_0001openalex-snapshot
Drawing Planar Graphs with Large Vertices and Thick Edges
inferred← citeshttps://doi.org/10.1142/s0129054105002905openalex-snapshot
CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s012905410600425xopenalex-snapshot
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054106004303openalex-snapshot
AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
inferred← citeshttps://doi.org/10.1142/s0129626409000213openalex-snapshot
HOW FAR IS IT TO THE NEXT RECURRENT CONFIGURATION? AN NP-COMPLETE PROBLEM IN THE SANDPILE MODEL
showing the first 200 of 254 · page through all 254
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.