On the public citation graph

Compact encodings of planar graphs via canonical orderings and multiple parentheses

0 signed · 96 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-62034-6_35openalex-snapshot
Tables
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf00288971openalex-snapshot
Representation of graphs
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1016/0166-218x(84)90126-4openalex-snapshot
On the succinct representation of graphs
inferredcites →https://doi.org/10.1016/0166-218x(90)90011-zopenalex-snapshot
Succinct representation of general unlabeled graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)e0150-wopenalex-snapshot
Short encodings of planar graphs and maps
inferredcites →https://doi.org/10.1016/s0019-9958(83)80004-7openalex-snapshot
Succinct representations of graphs
inferredcites →https://doi.org/10.1016/s0019-9958(86)80009-2openalex-snapshot
A note on succinct representations of graphs
inferredcites →https://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
inferredcites →https://doi.org/10.1023/a:1009720402326openalex-snapshot
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1109/sfcs.1997.646100openalex-snapshot
Succinct representation of balanced parentheses, static trees and planar graphs
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1137/0405049openalex-snapshot
Implicat Representation of Graphs
inferredcites →https://doi.org/10.1137/s0895480191221453openalex-snapshot
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
inferredcites →https://doi.org/10.1137/s0895480197325031openalex-snapshot
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
inferredcites →https://doi.org/10.4153/cjm-1962-002-9openalex-snapshot
A Census of Planar Triangulations
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/gmod.2002.0575openalex-snapshot
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
inferred← citeshttps://doi.org/10.1007/11534273_13openalex-snapshot
Succinct Representation of Triangulations with a Boundary
inferred← citeshttps://doi.org/10.1007/3-540-26808-1_1openalex-snapshot
Recent Advances in Compression of 3D Meshes
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_17openalex-snapshot
Compact Encodings of Planar Orthogonal Drawings
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_44openalex-snapshot
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
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-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_29openalex-snapshot
Floor-Planning via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_34openalex-snapshot
Dynamic Representations of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_47openalex-snapshot
A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_32openalex-snapshot
Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-8176-4904-3openalex-snapshot
Towards an Information Theory of Complex Networks: Statistical Methods and Applications
inferred← citeshttps://doi.org/10.1007/978-0-8176-4904-3_2openalex-snapshot
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_410openalex-snapshot
Succinct Data Structures for Parentheses Matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_646openalex-snapshot
Compressed Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_33openalex-snapshot
Fast and Compact Planar Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_23openalex-snapshot
Planar Graphs, via Well-Orderly Maps and Trees
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_7openalex-snapshot
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_11openalex-snapshot
A Fast and Compact Web Graph Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_29openalex-snapshot
Succinct Representation of Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_12openalex-snapshot
A Compact Encoding of Plane Triangulations with Efficient Query Supports
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_33openalex-snapshot
Succinct Representations of Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_38openalex-snapshot
Universal Succinct Representations of Trees?
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-13509-5_13openalex-snapshot
Succinct Representations of Separable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_23openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_33openalex-snapshot
Explicit Array-Based Compact Data Structures for Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_646-1openalex-snapshot
Compressed Representations of 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/s00373-006-0647-2openalex-snapshot
Planar Graphs, via Well-Orderly Maps and Trees
inferred← citeshttps://doi.org/10.1007/s00453-010-9452-7openalex-snapshot
Succinct Representation of Labeled Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9712-9openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-015-0086-7openalex-snapshot
I/O-Efficient Path Traversal in Succinct Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00861-4openalex-snapshot
Succinct Encoding of Binary Strings Representing Triangulations
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.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.ipl.2008.04.017openalex-snapshot
Quick encoding of plane graphs in bits per edge
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.016openalex-snapshot
Succinct representations of planar maps
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/s0925-7721(99)00028-0openalex-snapshot
Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
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/cbo9781316588284.008openalex-snapshot
Parentheses
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.010openalex-snapshot
Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf051openalex-snapshot
Heuristic-based computation of tailored spanning trees to speed up compact planar graphs
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.5.1181openalex-snapshot
Coding Floorplans with Fewer Bits
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00036openalex-snapshot
Speeding up compact planar graphs by using shallower trees
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181882openalex-snapshot
Small induced-universal graphs and compact implicit graph representations
inferred← citeshttps://doi.org/10.1109/viz.2009.31openalex-snapshot
Total or Selective Decompression of a Compressed Plane Triangulation
inferred← citeshttps://doi.org/10.1111/1467-8659.t01-1-00649openalex-snapshot
On the Optimality of Valence‐based Connectivity Coding
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/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferred← citeshttps://doi.org/10.1145/1137856.1137902openalex-snapshot
Optimal succinct representations of planar maps
inferred← citeshttps://doi.org/10.1145/1341012.1341080openalex-snapshot
Selective decompression of vector maps
inferred← citeshttps://doi.org/10.1145/1361192.1361194openalex-snapshot
Compact dictionaries for variable-length keys and data with applications
inferred← citeshttps://doi.org/10.1145/1367064.1367068openalex-snapshot
Balanced parentheses strike back
inferred← citeshttps://doi.org/10.1145/1377676.1377730openalex-snapshot
Schnyder woods for higher genus triangulated surfaces
inferred← citeshttps://doi.org/10.1145/1841909.1841913openalex-snapshot
Fast and Compact Web Graph Representations
inferred← citeshttps://doi.org/10.1145/301250.301448openalex-snapshot
Random sampling of large planar maps and convex polyhedra
inferred← citeshttps://doi.org/10.1184/r1/6603281openalex-snapshot
An Experimental Analysis of a Compact Graph Representation
inferred← citeshttps://doi.org/10.1184/r1/6604223openalex-snapshot
Compact Representations of Separable Graphs
inferred← citeshttps://doi.org/10.14279/depositonce-1750openalex-snapshot
Geometric and Combinatorial Structures on Graphs
inferred← citeshttps://doi.org/10.2197/ipsjjip.21.660openalex-snapshot
Two Compact Codes for Rectangular Drawings with Degree Four Vertices
inferred← citeshttps://doi.org/10.46298/dmtcs.436openalex-snapshot
On Compact Encoding of Pagenumber $k$ Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4469openalex-snapshot
External Memory Algorithms For Path Traversal in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0005005openalex-snapshot
Connectivity Compression for Irregular Quadrilateral Meshes
inferred← citeshttps://doi.org/10.5555/1070432.1070434openalex-snapshot
Dictionaries using variable-length keys and data, with applications
inferred← citeshttps://doi.org/10.5555/365411.365518openalex-snapshot
Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing
inferred← citeshttps://doi.org/10.5555/545381.545409openalex-snapshot
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
inferred← citeshttps://doi.org/10.70675/0b79e38ez468bz4347za6b3z7228cf0c1f3dopenalex-snapshot
Compression Progressive et avec Accès Aléatoire de Maillages
inferred← citeshttps://doi.org/10.7155/jgaa.00219openalex-snapshot
More Canonical Ordering
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.