On the public citation graph
Fast self-reduction algorithms for combinatorial problems of VLSI design
0 signed · 42 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.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/3-540-10291-4_12openalex-snapshot
Issues in the study of graph embeddings
inferredcites →https://doi.org/10.1007/3-540-16766-8_23openalex-snapshot
A polynomial algorithm for recognizing small cutwidth in hypergraphs
inferredcites →https://doi.org/10.1007/bf00264496openalex-snapshot
Black-white pebbles and graph separation
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1007/bfb0028825openalex-snapshot
Tree-partite graphs and the complexity of algorithms
inferredcites →https://doi.org/10.1016/0020-0190(87)90054-8openalex-snapshot
Nonconstructive advances in polynomial-time complexity
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0095-8956(90)90120-oopenalex-snapshot
Graph minors. IV. Tree-width and well-quasi-ordering
inferredcites →https://doi.org/10.1016/0166-218x(89)90016-4openalex-snapshot
On minimizing width in linear layouts
inferredcites →https://doi.org/10.1016/0196-6774(84)90006-3openalex-snapshot
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
inferredcites →https://doi.org/10.1016/0196-6774(87)90043-5openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in Graphs
inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot
On well-quasi-ordering finite trees
inferredcites →https://doi.org/10.1017/s0305004100039062openalex-snapshot
On well-quasi-ordering infinite trees
inferredcites →https://doi.org/10.1080/00207168908803783openalex-snapshot
Polynomial-time self-reducibility: theoretical motivations and practical results ∗
inferredcites →https://doi.org/10.1090/conm/089/1006472openalex-snapshot
The Robertson-Seymour theorems: a survey of applications
inferredcites →https://doi.org/10.1109/sfcs.1985.66openalex-snapshot
Why certain subgraph computations requite only linear time
inferredcites →https://doi.org/10.1109/tcad.1987.1270248openalex-snapshot
Exact and Approximate Solutions for the Gate Matrix Layout Problem
inferredcites →https://doi.org/10.1145/22145.22197openalex-snapshot
Are search and decision programs computationally equivalent?
inferredcites →https://doi.org/10.1145/44483.44491openalex-snapshot
Nonconstructive tools for proving polynomial-time decidability
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0025openalex-snapshot
Layout Permutation Problems and Well-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.1007/978-3-642-11269-0_12openalex-snapshot
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8openalex-snapshot
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
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/bf02090388openalex-snapshot
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
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/j.dam.2016.08.006openalex-snapshot
Rank-width: Algorithmic and structural results
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.04.008openalex-snapshot
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.008openalex-snapshot
Turing kernelization for finding long paths and cycles in restricted graph classes
inferred← citeshttps://doi.org/10.1080/00207168908803783openalex-snapshot
Polynomial-time self-reducibility: theoretical motivations and practical results ∗
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.1145/44483.44491openalex-snapshot
Nonconstructive tools for proving polynomial-time decidability
inferred← citeshttps://doi.org/10.1145/73007.73055openalex-snapshot
On search decision and the efficiency of polynomial-time 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.