On the public citation graph

Planar Graph Drawing

0 signed · 132 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11602613_18openalex-snapshot
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
inferred← citeshttps://doi.org/10.1007/11618058_27openalex-snapshot
Convex Drawings of Plane Graphs of Minimum Outer Apices
inferred← citeshttps://doi.org/10.1007/11618058_37openalex-snapshot
No-bend Orthogonal Drawings of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/11940128_15openalex-snapshot
Convex Grid Drawings of Plane Graphs with Rectangular Contours
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_12openalex-snapshot
Rectangle and Square Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_652openalex-snapshot
Convex Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_28openalex-snapshot
The Complexity of Drawing a Graph in a Polygonal Region
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_21openalex-snapshot
No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_1openalex-snapshot
Drawing Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_20openalex-snapshot
On Turn-Regular Orthogonal Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_34openalex-snapshot
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_7openalex-snapshot
On the Edge-Length Ratio of 2-Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-77867-5_14openalex-snapshot
Force-Directed Layout of Order Diagrams Using Dimensional Reduction
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-15914-5_28openalex-snapshot
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
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_12openalex-snapshot
Rectilinear Planarity of Partial 2-Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_2openalex-snapshot
CelticGraph: Drawing Graphs as Celtic Knots and Links
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_14openalex-snapshot
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-04126-1_6openalex-snapshot
Bar 1-Visibility Drawings of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_10openalex-snapshot
Monotone Grid Drawings of 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-15612-5_29openalex-snapshot
On Triangle Cover Contact Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-24971-1_1openalex-snapshot
Shifting Segments to Optimality
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_29openalex-snapshot
Realizability of Graphs as Triangle Cover Contact Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_1openalex-snapshot
Graphs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_10openalex-snapshot
Some Research Topics
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_2openalex-snapshot
Basic Graph Terminologies
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_4openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_6openalex-snapshot
Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_9openalex-snapshot
Special Classes of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_15openalex-snapshot
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_29openalex-snapshot
Choosing Colors for Geometric Graphs Via Color Space Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_17openalex-snapshot
Computing Upward Topological Book Embeddings of Upward Planar Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_14openalex-snapshot
Point-Set Embedding of Trees with Edge Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_13openalex-snapshot
Four-Connected Spanning Subgraphs of Doughnut Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_14openalex-snapshot
Generating All Triangulations of Plane Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_27openalex-snapshot
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_28openalex-snapshot
Matched Drawability of Graph Pairs and of Graph Triples
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_40openalex-snapshot
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_19openalex-snapshot
Drawing Graphs with Right Angle Crossings
inferred← citeshttps://doi.org/10.1007/978-3-642-04636-0_83openalex-snapshot
Temporal Online Interactions Using Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_77openalex-snapshot
Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_1openalex-snapshot
Graph-Theoretic Solutions to Computational Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_5openalex-snapshot
Small Grid Drawings of Planar Graphs with Balanced Bipartition
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-17514-5_35openalex-snapshot
Testing Simultaneous Planarity When the Common Graph Is 2-Connected
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_29openalex-snapshot
Point-Set Embeddings of Plane 3-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_23openalex-snapshot
Minimum-Layer Drawings of Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_25openalex-snapshot
Consecutive Ones Property Testing: Cut or Swap
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-22685-4_18openalex-snapshot
Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_20openalex-snapshot
Acyclic Colorings of Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_29openalex-snapshot
Triangulations with Circular Arcs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_652-1openalex-snapshot
Convex Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_15openalex-snapshot
Universal Line-Sets for Drawing Planar 3-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_4openalex-snapshot
Faster and Simpler Minimal Conflicting Set Identification
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_29openalex-snapshot
Fáry’s Theorem for 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32384-3_34openalex-snapshot
Spanning Trees Structures of Communications Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_26openalex-snapshot
Geometric Graphs in the Plane Lattice
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_11openalex-snapshot
Acyclic Coloring with Few Division Vertices
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_10openalex-snapshot
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_29openalex-snapshot
On the Density of Maximal 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_7openalex-snapshot
On the Characterization of Plane Bus Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_10openalex-snapshot
Orthogonal Layout with Optimal Face Complexity
inferred← citeshttps://doi.org/10.1007/978-3-7091-0741-6_1openalex-snapshot
A First Encounter
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_1openalex-snapshot
Beyond Planar Graphs: Introduction
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_11openalex-snapshot
Crossing Layout in Non-planar Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_5openalex-snapshot
Algorithms for 1-Planar Graphs
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/s00453-009-9277-4openalex-snapshot
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings
inferred← citeshttps://doi.org/10.1007/s00453-011-9513-6openalex-snapshot
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
inferred← citeshttps://doi.org/10.1007/s00453-017-0321-5openalex-snapshot
Planar Bus Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01110-6openalex-snapshot
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-008-9098-2openalex-snapshot
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00454-009-9235-6openalex-snapshot
Greedy Drawings of Triangulations
inferred← citeshttps://doi.org/10.1007/s10878-011-9381-7openalex-snapshot
Small grid drawings of planar graphs with balanced partition
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/s10878-025-01287-2openalex-snapshot
Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
inferred← citeshttps://doi.org/10.1016/j.akcej.2016.06.006openalex-snapshot
On some properties of doughnut graphs
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.11.023openalex-snapshot
A fuzzy genetic algorithm for automatic orthogonal graph drawing
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.2017.11.001openalex-snapshot
On triangle cover contact graphs
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.jcss.2018.08.003openalex-snapshot
HV-planarity: Algorithms and complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.011openalex-snapshot
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.027openalex-snapshot
Realizability of graphs as triangle cover contact graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.010openalex-snapshot
Graphs
inferred← citeshttps://doi.org/10.1080/00207160903154733openalex-snapshot
Drawing complete binary trees inside rectilinear polygons
inferred← citeshttps://doi.org/10.1080/09720529.2014.932128openalex-snapshot
The Enumeration of Spanning Trees in Dual, Bipartite and Reduced 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.1080/10556788.2015.1130130openalex-snapshot
An approximation algorithm for the longest path problem in solid grid graphs
inferred← citeshttps://doi.org/10.1089/cmb.2013.0086openalex-snapshot
On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction
inferred← citeshttps://doi.org/10.1109/aiccsa.2009.5069328openalex-snapshot
Survey of information visualization techniques for exploitation in KDD
inferred← citeshttps://doi.org/10.1109/apvis.2007.329284openalex-snapshot
Straight-line grid drawings of planar graphs with linear area
inferred← citeshttps://doi.org/10.1109/dcoss.2016.21openalex-snapshot
Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System
inferred← citeshttps://doi.org/10.1109/eict.2014.6777827openalex-snapshot
Bar 1-visibility representation of optimal 1-planar graph
inferred← citeshttps://doi.org/10.1109/icece.2008.4769352openalex-snapshot
A linear algorithm for floorplan compaction
inferred← citeshttps://doi.org/10.1109/icict.2007.375362openalex-snapshot
Current Research on Planar Graphs
inferred← citeshttps://doi.org/10.1109/iciev.2014.6850831openalex-snapshot
Stop propagation of harmful information on social networks
inferred← citeshttps://doi.org/10.1109/iisa.2014.6878792openalex-snapshot
Upward-rightward planar drawings
inferred← citeshttps://doi.org/10.1109/trustcom.2013.125openalex-snapshot
The Buffered Edge Reconfigurable Cell Array and Its Applications
inferred← citeshttps://doi.org/10.1111/cgf.12314openalex-snapshot
Game level layout from design specification
inferred← citeshttps://doi.org/10.1111/cgf.13410openalex-snapshot
The Perception of Graph Properties in Graph Layouts
inferred← citeshttps://doi.org/10.1134/s0005117913090063openalex-snapshot
The topological drawing of a graph: Construction methods
inferred← citeshttps://doi.org/10.1134/s0005117918050028openalex-snapshot
Construction of a Topological Drawing of the Most Planar Subgraph of the Non-planar Graph
inferred← citeshttps://doi.org/10.1137/24m1679240openalex-snapshot
Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1142/s012905410600425xopenalex-snapshot
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054106004297openalex-snapshot
CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
inferred← citeshttps://doi.org/10.1142/s0129054106004303openalex-snapshot
AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
inferred← citeshttps://doi.org/10.1142/s0129054123420042openalex-snapshot
k-Planar Placement and Packing of Δ-Regular Caterpillars
inferred← citeshttps://doi.org/10.1142/s0129054123470019openalex-snapshot
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
inferred← citeshttps://doi.org/10.1142/s0218195921500072openalex-snapshot
On Edge-Length Ratios of Partial 2-Trees
inferred← citeshttps://doi.org/10.1142/s179383091000070xopenalex-snapshot
CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n2) GRIDS
inferred← citeshttps://doi.org/10.1142/s1793830912500097openalex-snapshot
IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES
inferred← citeshttps://doi.org/10.1142/s179383091550007xopenalex-snapshot
Straight-line monotone grid drawings of series–parallel graphs
inferred← citeshttps://doi.org/10.1142/s1793830922501373openalex-snapshot
Sliding column model for t-unit bar visibility representations of graphs
inferred← citeshttps://doi.org/10.1145/1830483.1830616openalex-snapshot
A hybrid genetic algorithm for automatic graph drawing based on the topology-shape-metric approach.
inferred← citeshttps://doi.org/10.1145/2001576.2001703openalex-snapshot
A multiobjective genetic algorithm for automatic orthogonal graph drawing
inferred← citeshttps://doi.org/10.1145/2442754.2442761openalex-snapshot
A new hierarchical clustering technique for restructuring software at the function level
inferred← citeshttps://doi.org/10.1201/b16812-17openalex-snapshot
Graph Drawing
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0011openalex-snapshot
Convex Grid Drawings of Plane Graphs with Pentagonal Contours on O(n2) Grids
inferred← citeshttps://doi.org/10.1587/transfun.2021dmp0010openalex-snapshot
Grid Drawings of Five-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0009openalex-snapshot
Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours
inferred← citeshttps://doi.org/10.1587/transfun.2023dmp0004openalex-snapshot
Rectangle-of-Influence Drawings of Five-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.413openalex-snapshot
Convex Grid Drawings of Plane Graphs with Pentagonal Contours
inferred← citeshttps://doi.org/10.4036/iis.2015.l.05openalex-snapshot
Recent Developments in Floorplan Representations
inferred← citeshttps://doi.org/10.52589/ajmss-wthipshiopenalex-snapshot
Strategic Security Zoning Via Chromatic Graph Theory: An Optimized Patrol Allocation for Nigeria’s Geopolitical Regions
inferred← citeshttps://doi.org/10.56415/csjm.v33.07openalex-snapshot
The modified deep first search algorithm: functional implementation
inferred← citeshttps://doi.org/10.7155/jgaa.00602openalex-snapshot
The Complexity of Drawing a Graph in a Polygonal Region
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.