On the public citation graph

On Compact Encoding of Pagenumber $k$ Graphs

0 signed · 50 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.1006/gmod.2002.0575openalex-snapshot
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
inferredcites →https://doi.org/10.1006/jagm.1994.1028openalex-snapshot
Genus g Graphs Have Pagenumber O(√g)
inferredcites →https://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferredcites →https://doi.org/10.1007/3-540-44612-5_53openalex-snapshot
Informative Labeling Schemes for Graphs
inferredcites →https://doi.org/10.1007/978-3-540-27801-6_12openalex-snapshot
A Simple Optimal Representation for Balanced Parentheses
inferredcites →https://doi.org/10.1007/bfb0055046openalex-snapshot
Compact encodings of planar graphs via canonical orderings and multiple parentheses
inferredcites →https://doi.org/10.1016/0022-0000(89)90032-9openalex-snapshot
Embedding planar graphs in four pages
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/j.jalgor.2004.05.002openalex-snapshot
Distance labeling in graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.03.015openalex-snapshot
Informative labeling schemes for graphs
inferredcites →https://doi.org/10.1016/j.tcs.2006.09.014openalex-snapshot
A simple optimal representation for balanced parentheses
inferredcites →https://doi.org/10.1016/s0196-6774(02)00249-3openalex-snapshot
Degree constrained book embeddings
inferredcites →https://doi.org/10.1049/ip-e.1992.0021openalex-snapshot
Embedding graphs in books: a survey
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
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/sfcs.2002.1181882openalex-snapshot
Small induced-universal graphs and compact implicit graph representations
inferredcites →https://doi.org/10.1109/tct.1963.1082099openalex-snapshot
Enumeration of Trees
inferredcites →https://doi.org/10.1137/0405049openalex-snapshot
Implicat Representation of Graphs
inferredcites →https://doi.org/10.1137/0608002openalex-snapshot
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
inferredcites →https://doi.org/10.1145/12130.12141openalex-snapshot
Four pages are necessary and sufficient for planar graphs
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/248052.248075openalex-snapshot
Memory requirement for routing in distributed networks
inferredcites →https://doi.org/10.1145/62212.62217openalex-snapshot
A tradeoff between space and efficiency for routing tables
inferredcites →https://doi.org/10.1145/62212.62244openalex-snapshot
Implicit representation of graphs
inferredcites →https://doi.org/10.1145/65950.65953openalex-snapshot
A trade-off between space and efficiency for routing tables
inferredcites →https://doi.org/10.2307/1969046openalex-snapshot
The Number of Trees
inferredcites →https://doi.org/10.46298/dmtcs.317openalex-snapshot
On Linear Layouts of Graphs
inferredcites →https://doi.org/10.5555/1109557.1109599openalex-snapshot
Rank/select operations on large alphabets: a tool for text indexing
inferredcites →https://doi.org/10.5555/365411.365447openalex-snapshot
Distance labeling in graphs
inferredcites →https://doi.org/10.5555/365411.365518openalex-snapshot
Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing
inferredcites →https://doi.org/10.5555/365411.365529openalex-snapshot
Compact labeling schemes for ancestor queries
inferredcites →https://doi.org/10.5555/545381.545409openalex-snapshot
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
inferredcites →https://doi.org/10.5555/545381.545410openalex-snapshot
Succinct representations of lcp information and improvements in the compressed suffix arrays

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.2001.1789openalex-snapshot
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
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-15612-5_7openalex-snapshot
A Practical Succinct Data Structure for Tree-Like Graphs
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-642-22006-7_23openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_646-1openalex-snapshot
Compressed Representations of Graphs
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.1016/j.jda.2015.10.004openalex-snapshot
GLOUDS: Representing tree-like 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.1109/viz.2009.31openalex-snapshot
Total or Selective Decompression of a Compressed Plane Triangulation
inferred← citeshttps://doi.org/10.15439/2017f535openalex-snapshot
FLOUDS: A Succinct File System Structure
inferred← citeshttps://doi.org/10.15439/978-83-922646-0-6openalex-snapshot
Position Papers of the 2017 Federated Conference on Computer Science and Information Systems
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
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.