On the public citation graph
Rectilinear planar layouts and bipolar orientations of planar graphs
0 signed · 282 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.1007/3-540-16078-7_71openalex-snapshot
Algorithms for visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02253293openalex-snapshot
st-Ordering the vertices of biconnected graphs
inferredcites →https://doi.org/10.1016/0012-365x(83)90128-0openalex-snapshot
Representing a planar graph by vertical lines joining different levels
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
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.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22470.xopenalex-snapshot
Embedding in the Plane With Orientation Constraints: The Angle Graph
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1145/800031.808596openalex-snapshot
A system for algorithm animation
inferredcites →https://doi.org/10.3233/fi-1986-9105openalex-snapshot
Two Streamlined Depth-First Search Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-bopenalex-snapshot
Experimental studies on graph drawing algorithms
inferred← citeshttps://doi.org/10.1002/9780470399279.ch4openalex-snapshot
Algorithmic Basis for Pathway Visualization
inferred← citeshttps://doi.org/10.1002/jgt.22062openalex-snapshot
Partitioning Perfect Graphs into Stars
inferred← citeshttps://doi.org/10.1002/jgt.22803openalex-snapshot
Good acyclic orientations of 4‐regular 4‐connected graphs
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1007/11604686_15openalex-snapshot
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
inferred← citeshttps://doi.org/10.1007/11618058_32openalex-snapshot
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
inferred← citeshttps://doi.org/10.1007/11618058_41openalex-snapshot
An Application of Well-Orderly Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/11618058_47openalex-snapshot
A New Method for Efficiently Generating Planar Graph Visibility Representations
inferred← citeshttps://doi.org/10.1007/11618058_7openalex-snapshot
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
inferred← citeshttps://doi.org/10.1007/11786986_36openalex-snapshot
Nearly Optimal Visibility Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
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-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-36494-3_4openalex-snapshot
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_10openalex-snapshot
On Improving Orthogonal Drawings: The 4M-Algorithm
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-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_7openalex-snapshot
Level Planar Embedding in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_2openalex-snapshot
The Reduced Genus of a Multigraph
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_76openalex-snapshot
Testing approximate symmetry in the plane is NP-hard
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_28openalex-snapshot
Weighted visibility graphs of bars and related flow problems
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_33openalex-snapshot
On feedback problems in planar digraphs
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_78openalex-snapshot
Contracting planar graphs efficiently in parallel
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_19openalex-snapshot
The minimum broadcast time problem
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_8openalex-snapshot
On triangulating planar graphs under the four-connectivity constraint
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_357openalex-snapshot
Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_360openalex-snapshot
Regular edge labelings and drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_35openalex-snapshot
On rectangle visibility graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_39openalex-snapshot
Drawing directed acyclic graphs: An experimental study
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_45openalex-snapshot
2-Visibility drawings of planar graphs
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-63397-9_4openalex-snapshot
Area-efficient static and incremental graph drawings
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-4614-0110-0_12openalex-snapshot
Rectangle and Square Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_9openalex-snapshot
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_36openalex-snapshot
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_36openalex-snapshot
Homotopy Height, Grid-Major Height and Graph-Drawing Height
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_9openalex-snapshot
Path-Monotonic Upward Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_13openalex-snapshot
Plattenbauten: Touching Rectangles in Space
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-92931-2_12openalex-snapshot
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_21openalex-snapshot
Optimal-Area Visibility Representations of Outer-1-Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_15openalex-snapshot
st-Orientations with Few Transitive Edges
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_29openalex-snapshot
Visibility Representations of Toroidal and Klein-bottle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_31openalex-snapshot
On Plane Cycles in Geometric Multipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_36openalex-snapshot
Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_22openalex-snapshot
On Bar (1,j)-Visibility Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_2openalex-snapshot
Contact Representations of Graphs in 3D
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-27261-0_45openalex-snapshot
L-Visibility Drawings of IC-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-29604-3_7openalex-snapshot
Space-Efficient Planar Acyclicity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_8openalex-snapshot
On Aligned Bar 1-Visibility Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_10openalex-snapshot
1-Bend Upward Planar Drawings of SP-Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_20openalex-snapshot
Visibility Representations of Boxes in 2.5 Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_22openalex-snapshot
Ortho-Polygon Visibility Representations of Embedded Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_7openalex-snapshot
Grid-Obstacle Representations with Connections to Staircase Guarding
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_9openalex-snapshot
3D Visibility Representations of 1-planar Graphs
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-24749-4_42openalex-snapshot
On Visibility Representation of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_13openalex-snapshot
Unit Bar-Visibility Layouts of Triangulated Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_43openalex-snapshot
New Theoretical Bounds of Visibility Representation of Plane Graphs
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_14openalex-snapshot
The One-Round Voronoi Game Replayed
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_43openalex-snapshot
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_29openalex-snapshot
On Representation of Planar Graphs by Segments
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_22openalex-snapshot
Parameterized st-Orientations of Graphs: Algorithms and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_28openalex-snapshot
Optimal st-Orientations for Plane Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_16openalex-snapshot
Width-Optimal Visibility Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_15openalex-snapshot
Representation of Planar Hypergraphs by Contacts of Triangles
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_8openalex-snapshot
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_12openalex-snapshot
Three Results on Frequency Assignment in Linear Cellular Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_27openalex-snapshot
NP-Completeness of st-Orientations for Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_41openalex-snapshot
Minimum Covering with Travel Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_11openalex-snapshot
Upward Planarization Layout
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_37openalex-snapshot
Closed Rectangle-of-Influence Drawings for Irreducible Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_28openalex-snapshot
Compact Visibility Representation of 4-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_37openalex-snapshot
Connectivity Graphs of Uncertainty Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_16openalex-snapshot
On Graphs Supported by Line Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_7openalex-snapshot
AGD — A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_16openalex-snapshot
Planar Graphs as VPG-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-642-45043-3_13openalex-snapshot
Equilateral L-Contact Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_13openalex-snapshot
Domino Tatami Covering Is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_15openalex-snapshot
Star Partitions of Perfect Graphs
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-53174-7_18openalex-snapshot
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_6openalex-snapshot
Edge Partitions and Visibility Representations of 1-planar Graphs
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01189069openalex-snapshot
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
inferred← citeshttps://doi.org/10.1007/bf01759038openalex-snapshot
Multilayer grid embeddings for VLSI
inferred← citeshttps://doi.org/10.1007/bf01840399openalex-snapshot
A theory of rectangular dual graphs
inferred← citeshttps://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferred← citeshttps://doi.org/10.1007/bf01990536openalex-snapshot
The complexity of detecting crossingfree configurations in the plane
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferred← citeshttps://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/bf02574056openalex-snapshot
A left-first search algorithm for planar graphs
inferred← citeshttps://doi.org/10.1007/bf02583267openalex-snapshot
On the net-embeddability of graphs
inferred← citeshttps://doi.org/10.1007/bfb0021788openalex-snapshot
New lower bounds for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1007/bfb0021809openalex-snapshot
Drawing high degree graphs with low bend numbers
inferred← citeshttps://doi.org/10.1007/bfb0021812openalex-snapshot
Grid embedding of 4-connected plane graphs
inferred← citeshttps://doi.org/10.1007/bfb0021820openalex-snapshot
Grid intersection and box intersection graphs on surfaces
inferred← citeshttps://doi.org/10.1007/bfb0049393openalex-snapshot
Planar drawings and angular resolution: Algorithms and bounds
inferred← citeshttps://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1007/bfb0053964openalex-snapshot
Approximation of geometric dispersion problems
inferred← citeshttps://doi.org/10.1007/pl00009290openalex-snapshot
Grid Embedding of 4-Connected Plane 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-001-0022-xopenalex-snapshot
Approximation of Geometric Dispersion Problems
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-010-9433-xopenalex-snapshot
Colored Simultaneous Geometric Embeddings and Universal Pointsets
inferred← citeshttps://doi.org/10.1007/s00453-016-0191-2openalex-snapshot
Connectivity Graphs of Uncertainty Regions
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-004-1154-yopenalex-snapshot
Canonical Ordering Trees and Their Applications in Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00454-012-9464-yopenalex-snapshot
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00454-017-9939-yopenalex-snapshot
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
inferred← citeshttps://doi.org/10.1007/s10878-007-9119-8openalex-snapshot
Optimal st-orientations for plane triangulations
inferred← citeshttps://doi.org/10.1007/s10878-010-9303-0openalex-snapshot
Minimum covering with travel cost
inferred← citeshttps://doi.org/10.1007/s10958-012-0908-yopenalex-snapshot
Special graph representation and visualization of semantic networks
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90124-copenalex-snapshot
Reconstructing sets of orthogonal line segments in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90072-4openalex-snapshot
Constrained visibility representations of graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00020-dopenalex-snapshot
A linear-time algorithm for drawing a planar graph on a grid
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90018-6openalex-snapshot
Some results on visibility graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00085-ropenalex-snapshot
Bipolar orientations revisited
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90001-uopenalex-snapshot
Generalized planar matching
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90389-jopenalex-snapshot
Testing approximate symmetry in the plane is NP-hard
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90349-kopenalex-snapshot
Constructing compact rectiliner planar layouts using canonical representation of planar graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00230-gopenalex-snapshot
The minimum broadcast time problem for several processor networks
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00003-8openalex-snapshot
Geometric three-dimensional assignment problems
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90019-oopenalex-snapshot
Detecting and decomposing self-overlapping curves
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90003-oopenalex-snapshot
One strike against the min-max degree triangulation problem
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00017-8openalex-snapshot
Determining bar-representability for ordered 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.05.005openalex-snapshot
The one-round Voronoi game replayed
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.08.002openalex-snapshot
Improved visibility representation of plane graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.11.004openalex-snapshot
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.006openalex-snapshot
Visibility representations of four-connected plane graphs with near optimal heights
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.07.001openalex-snapshot
Closed rectangle-of-influence drawings for irreducible triangulations
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.2018.02.007openalex-snapshot
Visibility representations of boxes in 2.5 dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101592openalex-snapshot
Colored anchored visibility representations in 2D and 3D space
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101628openalex-snapshot
1-bend upward planar slope number of SP-digraphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2017.06.002openalex-snapshot
An annotated bibliography on 1-planarity
inferred← citeshttps://doi.org/10.1016/j.dam.2004.12.001openalex-snapshot
Balanced vertex-orderings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115035openalex-snapshot
Degree-truncated choice number of planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103806openalex-snapshot
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.05.024openalex-snapshot
Visibility representation of plane graphs via canonical ordering tree
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.02.010openalex-snapshot
On simultaneous straight-line grid embedding of a planar graph and its dual
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.11.011openalex-snapshot
L-visibility drawings of IC-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.05.002openalex-snapshot
3-coloring arrangements of line segments with 4 slopes is hard
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.03.017openalex-snapshot
Bijections for Baxter families and related objects
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.007openalex-snapshot
Skyscraper polytopes and realizations of plane triangulations
inferred← citeshttps://doi.org/10.1016/j.jda.2007.04.001openalex-snapshot
On stable cutsets in claw-free graphs and planar graphs
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.016openalex-snapshot
Space-efficient acyclicity constraints: A declarative pearl
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.012openalex-snapshot
Algorithms for computing a parameterized st-orientation
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.019openalex-snapshot
Three results on frequency assignment in linear cellular networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.006openalex-snapshot
NP-Completeness of st -orientations for plane graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.010openalex-snapshot
Compact visibility representation of 4-connected plane graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.030openalex-snapshot
Base-object location problems for base-monotone regions
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.024openalex-snapshot
On the number of upward planar orientations of maximal planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.004openalex-snapshot
Good spanning trees in graph drawing
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.045openalex-snapshot
Simultaneous visibility representations of plane st-graphs using L-shapes
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.029openalex-snapshot
On 3D visibility representations of graphs with few crossings per edge
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00048-3openalex-snapshot
Area requirement of visibility representations of trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(95)00257-xopenalex-snapshot
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
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(96)00005-3openalex-snapshot
An experimental comparison of four graph drawing algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00026-6openalex-snapshot
A better heuristic for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80118-0openalex-snapshot
Orthogonal Drawings Based On The Stratification Of Planar Graphs
inferred← citeshttps://doi.org/10.1023/a:1009760732249openalex-snapshot
Constraints in Graph Drawing Algorithms
inferred← citeshttps://doi.org/10.1023/a:1010604726900openalex-snapshot
Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes
inferred← citeshttps://doi.org/10.1080/09720529.2014.932132openalex-snapshot
Algorithms for Drawing Planar p-petal Graphs
inferred← citeshttps://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferred← citeshttps://doi.org/10.1109/31.1746openalex-snapshot
Planar embedding: linear-time algorithms for vertex placement and edge orderings
inferred← citeshttps://doi.org/10.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferred← citeshttps://doi.org/10.1109/43.503943openalex-snapshot
Process compilation of thin film microdevices
inferred← citeshttps://doi.org/10.1109/fscs.1990.89527openalex-snapshot
Drawing graphs in the plane with high resolution
inferred← citeshttps://doi.org/10.1109/iscas.1990.112025openalex-snapshot
Planar orthogonal drawings of graphs
inferred← citeshttps://doi.org/10.1109/iv.2003.1217979openalex-snapshot
A graph drawing algorithm for spherical pictures
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814603openalex-snapshot
Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design]
inferred← citeshttps://doi.org/10.1109/tevc.2004.837923openalex-snapshot
Automatic Mesh Generation for Mobile Network Dimensioning Using Evolutionary Approach
inferred← citeshttps://doi.org/10.1109/tifs.2013.2271425openalex-snapshot
On Identity Disclosure Control for Hypergraph-Based Data Publishing
showing the first 200 of 270 · page through all 270
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.