On the public citation graph

Black-white pebbles and graph separation

https://doi.org/10.1007/bf00264496
0 signed · 77 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-09510-1_32openalex-snapshot
A comparison between two variations of a pebble game on graphs
inferredcites →https://doi.org/10.1007/bf00289065openalex-snapshot
�ber separatoren in planaren graphen
inferredcites →https://doi.org/10.1016/0020-0190(80)90136-2openalex-snapshot
The space complexity of pebble games on trees
inferredcites →https://doi.org/10.1016/s0022-0000(76)80048-7openalex-snapshot
Storage requirements for deterministic polynomialtime recognizable languages
inferredcites →https://doi.org/10.1016/s0304-3975(81)80004-7openalex-snapshot
A comparison of two variations of a pebble game on graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.13openalex-snapshot
Area-efficient graph layouts
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0204020openalex-snapshot
Complete Register Allocation Problems
inferredcites →https://doi.org/10.1137/0209038openalex-snapshot
The Pebbling Problem is Complete in Polynomial Space
inferredcites →https://doi.org/10.1137/0603010openalex-snapshot
Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118135617.ch3openalex-snapshot
Distributed Security Algorithms for Mobile Agents
inferred← citeshttps://doi.org/10.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferred← citeshttps://doi.org/10.1006/jagm.2000.1149openalex-snapshot
Approximating Layout Problems on Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/11611257_17openalex-snapshot
Graph Searching and Search Time
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_19openalex-snapshot
Topological Bandwidth
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_76openalex-snapshot
Min Cut is NP-complete for edge weighted trees
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_37openalex-snapshot
Computing Optimal Linear Layouts of Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_28openalex-snapshot
Linear Orderings of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_17openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_29openalex-snapshot
On the complexity of some coloring games
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_2openalex-snapshot
Graph layout problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_7openalex-snapshot
Parameterized Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_20openalex-snapshot
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_25openalex-snapshot
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings
inferred← citeshttps://doi.org/10.1007/978-3-319-05170-3_36openalex-snapshot
On the Exact Solution of VSP for General and Structured Graphs: Models and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-17747-2_35openalex-snapshot
Comparative Study on Constructive Heuristics for the Vertex Separation Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-47054-2_44openalex-snapshot
Integer Linear Programming Formulation and Exact Algorithm for Computing Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-319-71008-2_35openalex-snapshot
A New Heuristic Algorithm for the Vertex Separation Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_27openalex-snapshot
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_62openalex-snapshot
Boundary-Optimal Triangulation Flooding
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_44openalex-snapshot
Centrality Measures Based on Current Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_12openalex-snapshot
Fixed-Parameter Tractability of Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_2openalex-snapshot
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferred← citeshttps://doi.org/10.1007/bfb0040395openalex-snapshot
Fast self-reduction algorithms for combinatorial problems of VLSI design
inferred← citeshttps://doi.org/10.1007/s00224-018-9882-1openalex-snapshot
On Tradeoffs Between Width- and Fill-like Graph Parameters
inferred← citeshttps://doi.org/10.1007/s00236-025-00505-yopenalex-snapshot
On integer linear programs for treewidth based on perfect elimination orderings (extended version)
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90208-ropenalex-snapshot
Narrowness, pathwidth, and their application in natural language processing
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90018-3openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/0167-9260(91)90028-jopenalex-snapshot
Fast search algorithms for layout permutation problems
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90019-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferred← citeshttps://doi.org/10.1016/j.cor.2012.04.017openalex-snapshot
Variable neighborhood search for the Vertex Separation Problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100724openalex-snapshot
A survey of heuristics for matrix bandwidth reduction
inferred← citeshttps://doi.org/10.1016/j.endm.2012.10.009openalex-snapshot
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.03.007openalex-snapshot
The treewidth of line graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2018.11.012openalex-snapshot
Linear ordering based MIP formulations for the vertex separation or pathwidth problem
inferred← citeshttps://doi.org/10.1016/j.orl.2003.12.003openalex-snapshot
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00131-5openalex-snapshot
Helicopter search problems, bandwidth and pathwidth
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00225-0openalex-snapshot
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00054-5openalex-snapshot
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80112-4openalex-snapshot
Chapter 8 VLSI network design
inferred← citeshttps://doi.org/10.1109/ccc.2001.933895openalex-snapshot
On separators, segregators and time versus space
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00051openalex-snapshot
On Approximating Cutwidth and Pathwidth
inferred← citeshttps://doi.org/10.1109/sfcs.1982.85openalex-snapshot
Polynomial time algorithms for the MIN CUT problem on degree restricted trees
inferred← citeshttps://doi.org/10.1109/sfcs.1983.2openalex-snapshot
A polynomial algorithm for the MIN CUT linear arrangement of trees
inferred← citeshttps://doi.org/10.1137/0214013openalex-snapshot
Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
inferred← citeshttps://doi.org/10.1137/0217064openalex-snapshot
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
inferred← citeshttps://doi.org/10.1137/0405010openalex-snapshot
On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
inferred← citeshttps://doi.org/10.1137/0608031openalex-snapshot
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
inferred← citeshttps://doi.org/10.1137/s0895480199350477openalex-snapshot
Graph Searching and Interval Completion
inferred← citeshttps://doi.org/10.1142/s0218195906002038openalex-snapshot
BOUNDARY-OPTIMAL TRIANGULATION FLOODING
inferred← citeshttps://doi.org/10.1145/3767110.3767118openalex-snapshot
Revisiting Pebble Games for Modeling and Efficient Use of Disaggregated Memory Systems
inferred← citeshttps://doi.org/10.1145/4221.4228openalex-snapshot
A polynomial algorithm for the min-cut linear arrangement of trees
inferred← citeshttps://doi.org/10.1145/564870.564906openalex-snapshot
Capture of an intruder by mobile agents
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1214/aoap/1019487353openalex-snapshot
Vertex ordering and partitioning problems for random spatial graphs
inferred← citeshttps://doi.org/10.1613/jair.4030openalex-snapshot
Inapproximability of Treewidth and Related Problems
inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot
Black Hole Search in the Network and Subway Models
inferred← citeshttps://doi.org/10.37236/13205openalex-snapshot
Treewidth is NP-Complete on Cubic Graphs
inferred← citeshttps://doi.org/10.4018/978-1-4666-9779-9.ch002openalex-snapshot
Optimization of the Vertex Separation Problem with Genetic Algorithms
inferred← citeshttps://doi.org/10.4236/ojdm.2020.101003openalex-snapshot
Improved Approximation of Layout Problems on Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4910openalex-snapshot
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
inferred← citeshttps://doi.org/10.70675/2a7d2deaz145ez4ee9z91d4z066559920227openalex-snapshot
Twin-width : lower bounds and approximation algorithms
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.