On the public citation graph
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
0 signed · 61 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.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
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.1023/a:1009720402326openalex-snapshot
Simple and Efficient Graph Compression Schemes for Dense and Complement 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/0136016openalex-snapshot
A Separator Theorem for 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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4805893openalex-extracted
Succinct Planar Encoding with Minor Operations
inferred← citeshttps://doi.org/10.1007/11785293_38openalex-snapshot
Linear-Time Algorithms for Tree Root Problems
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-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/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-3-540-75530-2_11openalex-snapshot
A Fast and Compact Web Graph Representation
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-642-13509-5_13openalex-snapshot
Succinct Representations of Separable Graphs
inferred← citeshttps://doi.org/10.1007/978-981-99-8132-8_7openalex-snapshot
On Searching for Minimal Integer Representation of Undirected 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-013-9815-yopenalex-snapshot
Linear-Time Algorithms for Tree Root Problems
inferred← citeshttps://doi.org/10.1007/s00453-021-00861-4openalex-snapshot
Succinct Encoding of Binary Strings Representing Triangulations
inferred← citeshttps://doi.org/10.1007/s13740-019-00102-6openalex-snapshot
Dynamic Discovery of Type Classes and Relations in Semantic Web Data
inferred← citeshttps://doi.org/10.1016/j.amc.2011.03.040openalex-snapshot
Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits
inferred← citeshttps://doi.org/10.1016/j.artint.2016.07.003openalex-snapshot
Building knowledge maps of Web graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101630openalex-snapshot
Fast and compact planar embeddings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101922openalex-snapshot
Navigating planar topologies in near-optimal space and time
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.028openalex-snapshot
Tight and simple Web graph compression for forward and reverse neighbor queries
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.004openalex-snapshot
Graph compression and the zeros of polynomials
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.ipl.2010.06.014openalex-snapshot
A compact encoding of plane triangulations with efficient query supports
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115682openalex-snapshot
Space-efficient graph coarsening with applications to succinct planar encodings
inferred← citeshttps://doi.org/10.1109/bigcomp.2017.7881738openalex-snapshot
On succinct representation of directed graphs
inferred← citeshttps://doi.org/10.1109/compsac.2018.00135openalex-snapshot
On Graph Representation with Smallest Numerical Encoding
inferred← citeshttps://doi.org/10.1109/compsac.2018.00136openalex-snapshot
Numerical Representation of Modular Graphs
inferred← citeshttps://doi.org/10.1109/ictai.2017.00061openalex-snapshot
On the Numerical Representation of Labeled Graphs with Self-Loops
inferred← citeshttps://doi.org/10.1109/smc.2014.6973948openalex-snapshot
Bijections for the numeric representation of labeled graphs
inferred← citeshttps://doi.org/10.1109/viz.2009.31openalex-snapshot
Total or Selective Decompression of a Compressed Plane Triangulation
inferred← citeshttps://doi.org/10.1137/120879142openalex-snapshot
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
inferred← citeshttps://doi.org/10.1137/s0097539702411381openalex-snapshot
Orderly Spanning Trees with Applications
inferred← citeshttps://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
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/1361192.1361196openalex-snapshot
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
inferred← citeshttps://doi.org/10.1145/1841909.1841913openalex-snapshot
Fast and Compact Web Graph Representations
inferred← citeshttps://doi.org/10.1184/r1/6603281openalex-snapshot
An Experimental Analysis of a Compact Graph Representation
inferred← citeshttps://doi.org/10.14722/ndss.2016.23052openalex-snapshot
Privacy-Preserving Shortest Path Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1006.0809openalex-snapshot
Tight and simple Web graph compression
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.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.5555/644108.644219openalex-snapshot
Compact Representations of Separable Graphs
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.