On the public citation graph
Polynomial Bounds for the Grid-Minor Theorem
0 signed · 128 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.1994.1073openalex-snapshot
Quickly Excluding a Planar Graph
inferredcites →https://doi.org/10.1006/jctb.1998.1862openalex-snapshot
Highly Connected Sets and the Excluded Grid Theorem
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_22openalex-snapshot
A Graph Reduction Step Preserving Element-Connectivity and Applications
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_28openalex-snapshot
Maximum Edge-Disjoint Paths in k-Sums of Graphs
inferredcites →https://doi.org/10.1007/bf01788671openalex-snapshot
On a connection between the existence ofk-trees and the toughness of a graph
inferredcites →https://doi.org/10.1007/s00453-007-9138-yopenalex-snapshot
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
inferredcites →https://doi.org/10.1007/s00493-008-2140-4openalex-snapshot
Linearity of grid minors in treewidth with applications through bidimensionality
inferredcites →https://doi.org/10.1016/0012-365x(89)90299-9openalex-snapshot
Surveys in combinatorics 1987
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/j.jctb.2014.09.003openalex-snapshot
Tree-width and planar minors
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.1016/s0167-6377(03)00022-1openalex-snapshot
Reconstructing edge-disjoint paths
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1109/focs.2010.33openalex-snapshot
Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
inferredcites →https://doi.org/10.1109/sfcs.2002.1181881openalex-snapshot
Minimizing congestion in general networks
inferredcites →https://doi.org/10.1137/080715093openalex-snapshot
Edge Disjoint Paths in Moderately Connected Graphs
inferredcites →https://doi.org/10.1137/100796820openalex-snapshot
The All-or-Nothing Multicommodity Flow Problem
inferredcites →https://doi.org/10.1137/130910464openalex-snapshot
Routing in Undirected Graphs with Constant Congestion
inferredcites →https://doi.org/10.1145/1060590.1060618openalex-snapshot
Multicommodity flow, well-linked terminals, and routing problems
inferredcites →https://doi.org/10.1145/1101821.1101823openalex-snapshot
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
inferredcites →https://doi.org/10.1145/1374376.1374442openalex-snapshot
On partitioning graphs via single commodity flows
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1538902.1538903openalex-snapshot
Graph partitioning using single commodity flows
inferredcites →https://doi.org/10.1145/2488608.2488645openalex-snapshot
Large-treewidth graph decompositions and applications
inferredcites →https://doi.org/10.1145/2629366openalex-snapshot
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
inferredcites →https://doi.org/10.1145/2893472openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.278openalex-snapshot
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23083openalex-snapshot
On tree decompositions whose trees are minors
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_13openalex-snapshot
On Tseitin Formulas, Read-Once Branching Programs and Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_8openalex-snapshot
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_24openalex-snapshot
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-031-87469-7_2openalex-snapshot
Tree Decompositions and Treewidth
inferred← citeshttps://doi.org/10.1007/s00224-020-10007-8openalex-snapshot
On Tseitin Formulas, Read-Once Branching Programs and Treewidth
inferred← citeshttps://doi.org/10.1007/s00454-021-00282-8openalex-snapshot
Fractal Dimension and Lower Bounds for Geometric Problems
inferred← citeshttps://doi.org/10.1007/s00454-021-00285-5openalex-snapshot
Unavoidable Minors for Graphs with Large $$\ell _p$$-Dimension
inferred← citeshttps://doi.org/10.1007/s00493-019-3848-zopenalex-snapshot
Clustered Colouring in Minor-Closed Classes
inferred← citeshttps://doi.org/10.1007/s00493-021-4743-yopenalex-snapshot
Packing Directed Circuits Quarter-Integrally
inferred← citeshttps://doi.org/10.1007/s00493-023-00077-wopenalex-snapshot
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path
inferred← citeshttps://doi.org/10.1007/s00493-025-00168-wopenalex-snapshot
The Grid-Minor Theorem Revisited
inferred← citeshttps://doi.org/10.1007/s10107-020-01563-5openalex-snapshot
New limits of treewidth-based tractability in optimization
inferred← citeshttps://doi.org/10.1007/s10107-026-02364-yopenalex-snapshot
A second-order cone representable class of nonconvex quadratic programs
inferred← citeshttps://doi.org/10.1007/s11083-025-09713-0openalex-snapshot
Graph Parameters, Universal Obstructions, and WQO
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102706openalex-snapshot
On the parameterized complexity of freezing dynamics
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.023openalex-snapshot
Edge-treewidth: Algorithmic and combinatorial properties
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111952openalex-snapshot
Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.009openalex-snapshot
Packing and covering immersion-expansions of planar sub-cubic graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.021openalex-snapshot
Adapting The Directed Grid Theorem into an FPT Algorithm
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.12.007openalex-snapshot
Treewidth of graphs with balanced separations
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.007openalex-snapshot
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.010openalex-snapshot
Towards tight(er) bounds for the Excluded Grid Theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.01.002openalex-snapshot
Grid induced minor theorem for graphs of small degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.007openalex-snapshot
On the size of two minimal linkages
inferred← citeshttps://doi.org/10.1016/j.orl.2018.12.001openalex-snapshot
Extension complexity of the correlation polytope
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/s0963548324000415openalex-snapshot
Tight bound for the Erdős–Pósa property of tree minors
inferred← citeshttps://doi.org/10.1017/s0963548326100522openalex-snapshot
Optimal tree-decompositions with bags of bounded treewidth
inferred← citeshttps://doi.org/10.1109/focs.2019.00057openalex-snapshot
Parametric Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00108openalex-snapshot
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00111openalex-snapshot
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00061openalex-snapshot
On the Power of Preconditioning in Sparse Linear Regression
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00044openalex-snapshot
Planar Disjoint Paths, Treewidth, and Kernels
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00011openalex-snapshot
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
inferred← citeshttps://doi.org/10.1137/1.9781611975482.104openalex-snapshot
Losing Treewidth by Separating Subsets
inferred← citeshttps://doi.org/10.1137/1.9781611975482.88openalex-snapshot
Towards Tight(er) Bounds for the Excluded Grid Theorem
inferred← citeshttps://doi.org/10.1137/1.9781611976465.117openalex-snapshot
Approximating Pathwidth for Graphs of Small Treewidth
inferred← citeshttps://doi.org/10.1137/1.9781611977912.74openalex-snapshot
Count on CFI graphs for #P-hardness
inferred← citeshttps://doi.org/10.1137/17m1148566openalex-snapshot
Finding Detours is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/17m1150694openalex-snapshot
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
inferred← citeshttps://doi.org/10.1137/17m1153169openalex-snapshot
A Tight Erdös--Pósa Function for Wheel Minors
inferred← citeshttps://doi.org/10.1137/18m122162xopenalex-snapshot
Minor-Closed Graph Classes with Bounded Layered Pathwidth
inferred← citeshttps://doi.org/10.1137/18m1228839openalex-snapshot
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
inferred← citeshttps://doi.org/10.1137/20m1355902openalex-snapshot
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
inferred← citeshttps://doi.org/10.1137/21m1452664openalex-snapshot
Adapting the Directed Grid Theorem into an FPT Algorithm
inferred← citeshttps://doi.org/10.1137/22m152058xopenalex-snapshot
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
inferred← citeshttps://doi.org/10.1137/24m1712400openalex-snapshot
An FPT Algorithm for the Embeddability of Graphs Into Two-Dimensional Simplicial Complexes
inferred← citeshttps://doi.org/10.1145/3154833openalex-snapshot
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.1145/3355629openalex-snapshot
Spanning Circuits in Regular Matroids
inferred← citeshttps://doi.org/10.1145/3357713.3384250openalex-snapshot
An exponential time parameterized algorithm for planar disjoint paths
inferred← citeshttps://doi.org/10.1145/3357713.3384318openalex-snapshot
Hitting topological minors is FPT
inferred← citeshttps://doi.org/10.1145/3519935.3520021openalex-snapshot
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
inferred← citeshttps://doi.org/10.1145/3576044openalex-snapshot
Approximating Pathwidth for Graphs of Small Treewidth
inferred← citeshttps://doi.org/10.1145/3798129.3800723openalex-snapshot
Forbidden Subgraphs of Graphs with Low Bandwidth
inferred← citeshttps://doi.org/10.1145/3798129.3800779openalex-snapshot
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
inferred← citeshttps://doi.org/10.1365/s13291-022-00247-7openalex-snapshot
Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász
inferred← citeshttps://doi.org/10.1613/jair.1.11864openalex-snapshot
The Parameterized Complexity of Motion Planning for Snake-Like Robots
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.31openalex-snapshot
A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2021.74openalex-snapshot
Large Minors in Expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00541openalex-snapshot
Extension Complexity of the Correlation Polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05115openalex-snapshot
Parametric Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12099openalex-snapshot
Structural properties of bipartite subgraphs
inferred← citeshttps://doi.org/10.70675/2d968259z74a9z4ad1za734zf2cbe72459aeopenalex-snapshot
Topological embeddings of graphs onsimplicial complexes
inferred← citeshttps://doi.org/10.70675/51e45e6ez63a9z47e1zb7ddzdffdf0494203openalex-snapshot
Treewidth : algorithmic, combinatorial, and practical aspects
inferred← citeshttps://doi.org/10.70675/d018672cz6094z46cfzb860z9ce2e74da160openalex-snapshot
On automata networks dynamics : an approach based on computational complexity theory
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.