On the public citation graph
Planar graphs and poset dimension
0 signed · 255 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/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf01895851openalex-snapshot
Dimension transitiv orientierbarer graphen
inferredcites →https://doi.org/10.1007/bf01896428openalex-snapshot
Minimal scrambling sets of simple orders
inferredcites →https://doi.org/10.1007/bf02253207openalex-snapshot
The complexity of comparability graph recognition and coloring
inferredcites →https://doi.org/10.1007/bf02483890openalex-snapshot
Dimension and automorphism groups of lattices
inferredcites →https://doi.org/10.1016/s0012-365x(76)80011-8openalex-snapshot
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
inferredcites →https://doi.org/10.1090/s0002-9939-1950-0038922-4openalex-snapshot
Concerning a Certain Set of Arrangements
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0417001-6openalex-snapshot
The Dimension of a Comparability Graph
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.2307/2372194openalex-snapshot
On the Dimension of Partially Ordered Sets
inferredcites →https://doi.org/10.24517/00011543openalex-snapshot
On the Dimension of Partially Ordered Sets.
inferredcites →https://doi.org/10.4064/fm-16-1-386-389openalex-snapshot
Sur l'extension de l'ordre partiel
inferredcites →https://doi.org/10.4153/cjm-1977-040-3openalex-snapshot
The 3-Irreducible Partially Ordered Sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190170303openalex-snapshot
A note on graphs and sphere orders
inferred← citeshttps://doi.org/10.1002/jgt.3190170610openalex-snapshot
Two trees in maximal planar bipartite graphs
inferred← citeshttps://doi.org/10.1007/11602613_111openalex-snapshot
Localized and Compact Data-Structure for Comparability Graphs
inferred← citeshttps://doi.org/10.1007/11618058_17openalex-snapshot
Transversal Structures on Triangulations, with Application to Straight-Line Drawing
inferred← citeshttps://doi.org/10.1007/11618058_41openalex-snapshot
An Application of Well-Orderly Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/11786986_36openalex-snapshot
Nearly Optimal Visibility Representations of Plane Graphs
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_5openalex-snapshot
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
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-45465-9_89openalex-snapshot
Wagner’s Theorem on Realizers
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-46648-7_14openalex-snapshot
Graph Planarity and Related Topics
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_33openalex-snapshot
Geometric Realization of Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_48openalex-snapshot
Genus of orders and lattices
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-57568-5_261openalex-snapshot
Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
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-58950-3_362openalex-snapshot
Regular orientations, arboricity, and augmentation
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_141openalex-snapshot
Output-sensitive reporting of disjoint paths (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_16openalex-snapshot
The Space Complexity of Sum Labelling
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_8openalex-snapshot
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-031-67868-4_11openalex-snapshot
Realizability of Rectangular Euler Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_20openalex-snapshot
Tabular Intermediate Logics Comparison
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_11openalex-snapshot
Straight Line Triangle Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-23374-1_3openalex-snapshot
Modelling Spatial Structures
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-27261-0_20openalex-snapshot
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-91146-5_16openalex-snapshot
Geometric Routing Without Coordinates but Measurements
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_21openalex-snapshot
Simultaneous Embedding of Planar Graphs with Few Bends
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-39890-5_18openalex-snapshot
Tree-Partitions of k-Trees with Applications in Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_22openalex-snapshot
On Simultaneous Planar Graph Embeddings
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-70904-6_40openalex-snapshot
Schnyder Woods and Orthogonal Surfaces
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-74456-6_36openalex-snapshot
Packing and Squeezing Subgraphs into Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_19openalex-snapshot
On the Number of α-Orientations
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-540-77537-9_22openalex-snapshot
On Planar Polyline Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_41openalex-snapshot
Untangling a Planar Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_11openalex-snapshot
On Open Rectangle-of-Influence Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_25openalex-snapshot
Schnyder Greedy Routing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_25openalex-snapshot
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
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_24openalex-snapshot
Triangle Contact Representations and Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-21554-4_30openalex-snapshot
Secure Authenticated Comparisons
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_11openalex-snapshot
Coloring Planar Homothets and Three-Dimensional Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_2openalex-snapshot
Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_17openalex-snapshot
On Representing Graphs by Touching Cuboids
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_31openalex-snapshot
Planar Packing of Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_25openalex-snapshot
Morphing Schnyder Drawings of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/bf00814406openalex-snapshot
Fractional dimension of partial orders
inferred← citeshttps://doi.org/10.1007/bf01108600openalex-snapshot
Incidence posets of trees in posets of large dimension
inferred← citeshttps://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferred← citeshttps://doi.org/10.1007/bfb0021812openalex-snapshot
Grid embedding of 4-connected plane graphs
inferred← citeshttps://doi.org/10.1007/pl00009290openalex-snapshot
Grid Embedding of 4-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00022-012-0129-zopenalex-snapshot
The non-planarity of K 5 and K 3,3 as axioms for plane ordered geometry
inferred← citeshttps://doi.org/10.1007/s00025-024-02199-zopenalex-snapshot
Realization of Permutation Modules via Alexandroff Spaces
inferred← citeshttps://doi.org/10.1007/s00026-015-0295-4openalex-snapshot
Definability in the Substructure Ordering of Simple 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/s00224-023-10130-2openalex-snapshot
The Space Complexity of Sum Labelling
inferred← citeshttps://doi.org/10.1007/s00357-019-09315-7openalex-snapshot
Clustering Analysis of a Dissimilarity: a Review of Algebraic and Geometric Representation
inferred← citeshttps://doi.org/10.1007/s00440-020-00969-8openalex-snapshot
A mating-of-trees approach for graph distances in random planar maps
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-008-9215-xopenalex-snapshot
Planar Polyline Drawings via Graph Transformations
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-012-9682-yopenalex-snapshot
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane 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-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-012-9400-1openalex-snapshot
Triangle Contact Representations and Duality
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-016-9850-yopenalex-snapshot
Straight Line Triangle Representations
inferred← citeshttps://doi.org/10.1007/s00454-018-0018-9openalex-snapshot
Morphing Schnyder Drawings of Planar Triangulations
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-9324-8openalex-snapshot
Improved floor-planning of graphs via adjacency-preserving transformations
inferred← citeshttps://doi.org/10.1007/s11083-007-9075-zopenalex-snapshot
Orthogonal Surfaces and Their CP-Orders
inferred← citeshttps://doi.org/10.1007/s11083-010-9167-zopenalex-snapshot
A Note on Schnyder’s Theorem
inferred← citeshttps://doi.org/10.1007/s11083-010-9181-1openalex-snapshot
On the Order Dimension of Outerplanar Maps
inferred← citeshttps://doi.org/10.1007/s11083-011-9203-7openalex-snapshot
A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices
inferred← citeshttps://doi.org/10.1007/s11083-011-9204-6openalex-snapshot
Dimension Preserving Contractions and a Finite List of 3-Irreducible Posets
inferred← citeshttps://doi.org/10.1007/s11083-013-9301-9openalex-snapshot
Incidence Posets and Cover Graphs
inferred← citeshttps://doi.org/10.1007/s11083-017-9437-0openalex-snapshot
Grid Intersection Graphs and Order Dimension
inferred← citeshttps://doi.org/10.1007/s11083-023-09628-8openalex-snapshot
Separability, Boxicity, and Partial Orders
inferred← citeshttps://doi.org/10.1007/s11083-025-09710-3openalex-snapshot
Order Dimension, Grids, and Products
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90295-qopenalex-snapshot
Representing orders by moving figures in space
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00214-hopenalex-snapshot
Decomposition of some planar graphs into trees
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90023-qopenalex-snapshot
Dimensions of hypergraphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50010-5openalex-snapshot
10.1016/b978-044488002-4/50010-5
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.2006.05.006openalex-snapshot
On simultaneous planar graph embeddings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.05.003openalex-snapshot
Simultaneous graph embedding with bends and circular arcs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.06.004openalex-snapshot
Coloring planar homothets and three-dimensional hypergraphs
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.2007.12.091openalex-snapshot
Localized and compact data-structure for comparability graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2008.10.003openalex-snapshot
Topological graph dimension
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.005openalex-snapshot
Adjacency posets of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112338openalex-snapshot
Adjacency posets of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114730openalex-snapshot
Boundedness for proper conflict-free and odd colorings
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.2013.06.017openalex-snapshot
Dimension and height for posets with planar cover graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.031openalex-snapshot
On symmetric quadrangulations and triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.003openalex-snapshot
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103110openalex-snapshot
Dushnik–Miller dimension of TD-Delaunay complexes
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103290openalex-snapshot
A bijection for essentially 3-connected toroidal maps
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.endm.2011.10.035openalex-snapshot
Dimension and Height for Posets with Planar Cover Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.075openalex-snapshot
Dushnik-Miller dimension of contact systems of d-dimensional boxes
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.2010.04.001openalex-snapshot
A note on isosceles planar graph drawing
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.12.004openalex-snapshot
Monotone drawings of graphs with few directions
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.05.005openalex-snapshot
Intervals in Catalan lattices and realizers of triangulations
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.jcta.2011.08.006openalex-snapshot
A bijection for triangulations, quadrangulations, pentagulations, etc.
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.017openalex-snapshot
A simple routing algorithm based on Schnyder coordinates
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.024openalex-snapshot
Succinct strictly convex greedy drawing of 3-connected plane graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.029openalex-snapshot
Geographic routing on Virtual Raw Anchor Coordinate systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.021openalex-snapshot
Every Schnyder drawing is a greedy embedding
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.010openalex-snapshot
Fully dynamic arboricity maintenance
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00305-4openalex-snapshot
Orthogonal drawings based on the stratification of planar graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00193-8openalex-snapshot
On the tree number of regular graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00309-4openalex-snapshot
The maximum number of edges in a graph of bounded dimension, with applications to ring theory
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00315-xopenalex-snapshot
The order dimension of the complete graph
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(03)00218-4openalex-snapshot
Watermelon uniform random generation with applications
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/s1571-0653(05)80118-0openalex-snapshot
Orthogonal Drawings Based On The Stratification Of Planar Graphs
inferred← citeshttps://doi.org/10.1017/s0963548309009894openalex-snapshot
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
inferred← citeshttps://doi.org/10.1023/a:1006110326269openalex-snapshot
Geometric Containment Orders: A Survey
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.1023/b:orde.0000009251.68514.8bopenalex-snapshot
Geodesic Embeddings and Planar Graphs
inferred← citeshttps://doi.org/10.1088/1361-6382/ab4f21openalex-snapshot
Precision measurements of Hausdorff dimensions in two-dimensional quantum gravity
inferred← citeshttps://doi.org/10.1090/dimacs/049/24openalex-snapshot
Ramsey theory and partially ordered sets
inferred← citeshttps://doi.org/10.1090/tran/8887openalex-snapshot
Schnyder woods, SLE₁₆, and Liouville quantum gravity
inferred← citeshttps://doi.org/10.1109/dcoss.2012.64openalex-snapshot
Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm
inferred← citeshttps://doi.org/10.1109/dcoss.2016.21openalex-snapshot
Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System
inferred← citeshttps://doi.org/10.1137/0404040openalex-snapshot
A Note on Planar Graphs and Circle Orders
inferred← citeshttps://doi.org/10.1137/0406018openalex-snapshot
The Order Dimension of Convex Polytopes
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/1.9781611973105.112openalex-snapshot
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
inferred← citeshttps://doi.org/10.1137/1.9781611973105.120openalex-snapshot
Combinatorial and Geometric Properties of Planar Laman Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.27openalex-snapshot
Shorter Labeling Schemes for Planar Graphs
inferred← citeshttps://doi.org/10.1137/130945284openalex-snapshot
The Order Dimension of Planar Maps Revisited
inferred← citeshttps://doi.org/10.1137/140965752openalex-snapshot
Sampling and Counting 3-Orientations of Planar Triangulations
inferred← citeshttps://doi.org/10.1137/15m1007720openalex-snapshot
The Complexity of the Partial Order Dimension Problem: Closing the Gap
inferred← citeshttps://doi.org/10.1137/24m1660395openalex-snapshot
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion
inferred← citeshttps://doi.org/10.1137/s0097539702411381openalex-snapshot
Orderly Spanning Trees with Applications
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
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/s0895480191221453openalex-snapshot
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0895480192238561openalex-snapshot
The Order Dimension of Planar Maps
inferred← citeshttps://doi.org/10.1137/s0895480194264010openalex-snapshot
Angles of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1142/9789812794741_0022openalex-snapshot
Connectivity of Planar Graphs
inferred← citeshttps://doi.org/10.1142/s0129054106004303openalex-snapshot
AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
inferred← citeshttps://doi.org/10.1142/s021819670900541xopenalex-snapshot
CONGRUENCE LIFTING OF SEMILATTICE DIAGRAMS
inferred← citeshttps://doi.org/10.1145/1102120.1102147openalex-snapshot
Dynamic and efficient key management for access hierarchies
inferred← citeshttps://doi.org/10.1145/1133058.1133062openalex-snapshot
Key management for non-tree access hierarchies
inferred← citeshttps://doi.org/10.1145/1377676.1377730openalex-snapshot
Schnyder woods for higher genus triangulated surfaces
inferred← citeshttps://doi.org/10.1145/140901.141933openalex-snapshot
O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs
inferred← citeshttps://doi.org/10.1145/1455526.1455531openalex-snapshot
Dynamic and Efficient Key Management for Access Hierarchies
inferred← citeshttps://doi.org/10.1145/3320344openalex-snapshot
Exact Algorithms for the Maximum Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1145/3592445openalex-snapshot
Efficient Embeddings in Exact Arithmetic
inferred← citeshttps://doi.org/10.1145/74074.74088openalex-snapshot
A lower bound on the size of universal sets for planar graphs
inferred← citeshttps://doi.org/10.1201/b15385-9openalex-snapshot
- Planar Straight-Line Drawing Algorithms
inferred← citeshttps://doi.org/10.1214/16-aop1124openalex-snapshot
The scaling limit of random simple triangulations and random simple quadrangulations
inferred← citeshttps://doi.org/10.1214/20-ejp537openalex-snapshot
Scaling limit of triangulations of polygons
inferred← citeshttps://doi.org/10.1214/23-ejp912openalex-snapshot
Random cubic planar graphs converge to the Brownian sphere
inferred← citeshttps://doi.org/10.14279/depositonce-1523openalex-snapshot
Orthogonal Surfaces - A combinatorial approach
inferred← citeshttps://doi.org/10.14279/depositonce-1750openalex-snapshot
Geometric and Combinatorial Structures on Graphs
inferred← citeshttps://doi.org/10.14279/depositonce-3190openalex-snapshot
Geometric Representations of Graphs with Low Polygonal Complexity
inferred← citeshttps://doi.org/10.14279/depositonce-4380openalex-snapshot
Geometric representations of planar graphs
inferred← citeshttps://doi.org/10.17863/cam.55414openalex-snapshot
A mating-of-trees approach for graph distances in random planar maps
inferred← citeshttps://doi.org/10.18297/etd/647openalex-snapshot
Planar graphs : a historical perspective.
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.3390/math9192511openalex-snapshot
Construction and Analysis of Queuing and Reliability Models Using Random Graphs
inferred← citeshttps://doi.org/10.37236/3386openalex-snapshot
A Generic Method for Bijections between Blossoming Trees and Planar Maps
inferred← citeshttps://doi.org/10.37236/464openalex-snapshot
Another Characterisation of Planar Graphs
inferred← citeshttps://doi.org/10.37236/7897openalex-snapshot
A Bijection for Essentially 4-Connected Toroidal Triangulations
inferred← citeshttps://doi.org/10.37236/801openalex-snapshot
On the Number of Planar Orientations with Prescribed Degrees
inferred← citeshttps://doi.org/10.3929/ethz-b-000452875openalex-snapshot
Scaling limit of triangulations of polygons
showing the first 200 of 236 · page through all 236
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.