On the public citation graph

Call routing and the ratcatcher

0 signed · 358 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/jctb.1994.1007openalex-snapshot

Graph Minors. XI. Circuits on a Surface

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/0095-8956(91)90068-uopenalex-snapshot

Quickly excluding a forest

inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot

Some simplified NP-complete graph problems

inferredcites →https://doi.org/10.1137/0216064openalex-snapshot

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

inferredcites →https://doi.org/10.1145/4221.4228openalex-snapshot

A polynomial algorithm for the min-cut linear arrangement of trees

inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot

Some simplified NP-complete problems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0121openalex-snapshot

Branch‐Width and Tangles

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0923openalex-snapshot

Treewidth, Tree Decompositions, and Brambles

inferred← citeshttps://doi.org/10.1002/jgt.20121openalex-snapshot

New upper bounds on the decomposability of planar graphs

inferred← citeshttps://doi.org/10.1002/jgt.20219openalex-snapshot

On self duality of pathwidth in polyhedral graph embeddings

inferred← citeshttps://doi.org/10.1002/net.10099openalex-snapshot

Branch decompositions and minor containment

inferred← citeshttps://doi.org/10.1002/net.20050openalex-snapshot

Graphs, branchwidth, and tangles! Oh my!

inferred← citeshttps://doi.org/10.1002/net.20353openalex-snapshot

Fixed-parameter tractability results for full-degree spanning tree and its dual

inferred← citeshttps://doi.org/10.1002/net.21979openalex-snapshot

Tangle bases: Revisited

inferred← citeshttps://doi.org/10.1002/net.v45:2openalex-snapshot

inferred← citeshttps://doi.org/10.1002/net.v56:2openalex-snapshot

inferred← citeshttps://doi.org/10.1006/jagm.1999.1011openalex-snapshot

Graphs with Branchwidth at Most Three

inferred← citeshttps://doi.org/10.1007/11427186_11openalex-snapshot

Degree-Based Treewidth Lower Bounds

inferred← citeshttps://doi.org/10.1007/11523468_31openalex-snapshot

Optimal Branch-Decomposition of Planar Graphs in O(n 3) Time

inferred← citeshttps://doi.org/10.1007/11549345_32openalex-snapshot

Nondeterministic Graph Searching: From Pathwidth to Treewidth

inferred← citeshttps://doi.org/10.1007/11561071_11openalex-snapshot

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions

inferred← citeshttps://doi.org/10.1007/11561071_35openalex-snapshot

New Tools and Simpler Algorithms for Branchwidth

inferred← citeshttps://doi.org/10.1007/11561071_36openalex-snapshot

Treewidth Lower Bounds with Brambles

inferred← citeshttps://doi.org/10.1007/11604686_33openalex-snapshot

Computing Branchwidth Via Efficient Triangulations and Blocks

inferred← citeshttps://doi.org/10.1007/11604686_5openalex-snapshot

Approximating Rank-Width and Clique-Width Quickly

inferred← citeshttps://doi.org/10.1007/11682462openalex-snapshot

LATIN 2006 : theoretical informatics : 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006 : proceedings

inferred← citeshttps://doi.org/10.1007/11682462_45openalex-snapshot

Connected Treewidth and Connected Graph Searching

inferred← citeshttps://doi.org/10.1007/11682462_66openalex-snapshot

The Branch-Width of Circular-Arc Graphs

inferred← citeshttps://doi.org/10.1007/11785293_18openalex-snapshot

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus

inferred← citeshttps://doi.org/10.1007/11841036_22openalex-snapshot

Traversing the Machining Graph

inferred← citeshttps://doi.org/10.1007/11841036_27openalex-snapshot

Dynamic Programming and Fast Matrix Multiplication

inferred← citeshttps://doi.org/10.1007/11847250_19openalex-snapshot

Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual

inferred← citeshttps://doi.org/10.1007/11847250_23openalex-snapshot

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms

inferred← citeshttps://doi.org/10.1007/11940128_3openalex-snapshot

Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

inferred← citeshttps://doi.org/10.1007/11970125_6openalex-snapshot

On the minimum corridor connection and other generalized geometric problems

inferred← citeshttps://doi.org/10.1007/3-540-40996-3_17openalex-snapshot

Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width

inferred← citeshttps://doi.org/10.1007/3-540-45061-0_65openalex-snapshot

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs

inferred← citeshttps://doi.org/10.1007/3-540-45071-8_39openalex-snapshot

Isoperimetric Inequalities and the Width Parameters of Graphs

inferred← citeshttps://doi.org/10.1007/3-540-45477-2_17openalex-snapshot

On the Monotonicity of Games Generated by Symmetric Submodular Functions

inferred← citeshttps://doi.org/10.1007/3-540-45753-4_16openalex-snapshot

Minimum Restricted Diameter Spanning Trees

inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot

1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor

inferred← citeshttps://doi.org/10.1007/3-540-49116-3_16openalex-snapshot

New Branchwidth Territories

inferred← citeshttps://doi.org/10.1007/3-540-63165-8_217openalex-snapshot

Constructive linear time algorithms for branchwidth

inferred← citeshttps://doi.org/10.1007/3-540-63397-9_11openalex-snapshot

Weighted graph separators and their applications

inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_55openalex-snapshot

Branchwidth of Graphs

inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_59openalex-snapshot

Branchwidth and Branch Decompositions

inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_76openalex-snapshot

Graph Searching and Related Problems

inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_16openalex-snapshot

Other Width Metrics

inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_29openalex-snapshot

The M-Hierarchy, and XP-Optimality

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_55openalex-snapshot

Branchwidth of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_6openalex-snapshot

On Directed Feedback Vertex Set Parameterized by Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_12openalex-snapshot

A Join-Based Hybrid Parameter for Constraint Satisfaction

inferred← citeshttps://doi.org/10.1007/978-3-030-51051-0_17openalex-snapshot

On the Treewidth of Planar Minor Free Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_21openalex-snapshot

Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_32openalex-snapshot

Approximating Branchwidth on Parametric Extensions of Planarity

inferred← citeshttps://doi.org/10.1007/978-3-031-87469-7_2openalex-snapshot

Tree Decompositions and Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_5openalex-snapshot

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth

inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_25openalex-snapshot

Subexponential Fixed-Parameter Algorithms for Partial Vector Domination

inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_1openalex-snapshot

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_20openalex-snapshot

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-14115-2_25openalex-snapshot

Subexponential Fixed-Parameter Algorithms for Partial Vector Domination

inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_4openalex-snapshot

An FPT 2-Approximation for Tree-cut Decomposition

inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_12openalex-snapshot

A SAT Approach to Branchwidth

inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_7openalex-snapshot

Tangle and Maximal Ideal

inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_8openalex-snapshot

A Width Parameter Useful for Chordal and Co-comparability Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-59108-7_21openalex-snapshot

Image Segmentation via Weighted Carving Decompositions

inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_43openalex-snapshot

The Effect of Planarization on Width

inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_19openalex-snapshot

FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models

inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_20openalex-snapshot

A Survey on the Complexity of Flood-Filling Games

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_6openalex-snapshot

A Simple and Fast Approach for Solving Problems on Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_1openalex-snapshot

Discovering Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_68openalex-snapshot

A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_7openalex-snapshot

Computing Branch Decomposition of Large Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_49openalex-snapshot

Spanners in Sparse Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_3openalex-snapshot

Treewidth: Structure and Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_4openalex-snapshot

Subexponential Parameterized Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_16openalex-snapshot

Finding Branch-Decompositions and Rank-Decompositions

inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_33openalex-snapshot

Determining the Smallest k Such That G Is k-Outerplanar

inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_3openalex-snapshot

Algorithmic Meta-theorems

inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_9openalex-snapshot

Computational Study on Dominating Set Problem of Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_24openalex-snapshot

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_99openalex-snapshot

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time

inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_11openalex-snapshot

Improved Induced Matchings in Sparse Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_31openalex-snapshot

Faster Parameterized Algorithms for Minor Containment

inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_32openalex-snapshot

Dynamic Programming for Graphs on Surfaces

inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_9openalex-snapshot

Fast Minor Testing in Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_9openalex-snapshot

Computational Study for Planar Connected Dominating Set Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_8openalex-snapshot

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_37openalex-snapshot

A Local Search Algorithm for Branchwidth

inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_31openalex-snapshot

Fast Sub-exponential Algorithms and Compactness in Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_38openalex-snapshot

Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem

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-31770-5_32openalex-snapshot

Characterizing Graphs of Small Carving-Width

inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_8openalex-snapshot

Dynamic Programming for H-minor-free Graphs

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-642-54423-1_21openalex-snapshot

(Total) Vector Domination for Graphs with Bounded Branchwidth

inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_14openalex-snapshot

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model

inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot

Treewidth: Algorithmic techniques and results

inferred← citeshttps://doi.org/10.1007/s00373-002-0490-zopenalex-snapshot

Pathwidth of Planar and Line Graphs

inferred← citeshttps://doi.org/10.1007/s00453-007-9041-6openalex-snapshot

Nondeterministic Graph Searching: From Pathwidth to Treewidth

inferred← citeshttps://doi.org/10.1007/s00453-007-9056-zopenalex-snapshot

Treewidth Lower Bounds with Brambles

inferred← citeshttps://doi.org/10.1007/s00453-007-9138-yopenalex-snapshot

Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

inferred← citeshttps://doi.org/10.1007/s00453-008-9180-4openalex-snapshot

Approximation Algorithms for Treewidth

inferred← citeshttps://doi.org/10.1007/s00453-009-9296-1openalex-snapshot

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

inferred← citeshttps://doi.org/10.1007/s00453-010-9390-4openalex-snapshot

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms

inferred← citeshttps://doi.org/10.1007/s00453-011-9563-9openalex-snapshot

Fast Minor Testing in Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00453-012-9627-5openalex-snapshot

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

inferred← citeshttps://doi.org/10.1007/s00453-012-9661-3openalex-snapshot

Proper Interval Vertex Deletion

inferred← citeshttps://doi.org/10.1007/s00453-016-0245-5openalex-snapshot

An FPT 2-Approximation for Tree-Cut Decomposition

inferred← citeshttps://doi.org/10.1007/s00453-018-0424-7openalex-snapshot

Cutwidth: Obstructions and Algorithmic Aspects

inferred← citeshttps://doi.org/10.1007/s00453-019-00670-wopenalex-snapshot

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00453-021-00839-2openalex-snapshot

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

inferred← citeshttps://doi.org/10.1007/s00453-023-01142-yopenalex-snapshot

Upward Book Embeddability of st-Graphs: Complexity and Algorithms

inferred← citeshttps://doi.org/10.1007/s004530010031openalex-snapshot

Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications

inferred← citeshttps://doi.org/10.1007/s00493-008-2140-4openalex-snapshot

Linearity of grid minors in treewidth with applications through bidimensionality

inferred← citeshttps://doi.org/10.1007/s00493-019-3798-5openalex-snapshot

Tangle-Tree Duality: In Graphs, Matroids and Beyond

inferred← citeshttps://doi.org/10.1007/s10589-011-9397-zopenalex-snapshot

A combinatorial optimization algorithm for solving the branchwidth problem

inferred← citeshttps://doi.org/10.1007/s10878-015-9871-0openalex-snapshot

New analysis and computational study for the planar connected dominating set problem

inferred← citeshttps://doi.org/10.1007/s10878-020-00555-7openalex-snapshot

Efficient reassembling of three-regular planar graphs

inferred← citeshttps://doi.org/10.1007/s10951-021-00719-1openalex-snapshot

An analysis of the parameterized complexity of periodic timetabling

inferred← citeshttps://doi.org/10.1016/0166-218x(94)90028-0openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/j.aim.2020.107470openalex-snapshot

Tangle-tree duality in abstract separation systems

inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.05.001openalex-snapshot

On the minimum corridor connection problem and other generalized geometric problems

inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.004openalex-snapshot

Subexponential parameterized algorithms

inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot

Confronting intractability via parameters

inferred← citeshttps://doi.org/10.1016/j.cpc.2020.107750openalex-snapshot

Simulation of quantum many-body systems on Amazon cloud

inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.013openalex-snapshot

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.015openalex-snapshot

Computing the branchwidth of interval graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.006openalex-snapshot

Branchwidth of chordal graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.009openalex-snapshot

Computing branchwidth via efficient triangulations and blocks

inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.026openalex-snapshot

Improved induced matchings in sparse graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.028openalex-snapshot

On self-duality of branchwidth in graphs of bounded genus

inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.007openalex-snapshot

A note on planar graphs with large width parameters and small grid-minors

inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.036openalex-snapshot

Characterizing graphs of small carving-width

inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.026openalex-snapshot

Square roots of minor closed graph classes

inferred← citeshttps://doi.org/10.1016/j.dam.2014.12.017openalex-snapshot

Practical algorithms for branch-decompositions of planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.020openalex-snapshot

An algorithmic metatheorem for directed treewidth

inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.002openalex-snapshot

(Total) Vector domination for graphs with bounded branchwidth

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.dam.2018.08.027openalex-snapshot

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.022openalex-snapshot

Treelength of series–parallel graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2024.02.003openalex-snapshot

Branchwidth is (1,g) -self-dual

inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.012openalex-snapshot

The carvingwidth of hypercubes

inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.021openalex-snapshot

On spanning tree congestion of graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.039openalex-snapshot

The carving-width of generalized hypercubes

inferred← citeshttps://doi.org/10.1016/j.disc.2012.12.011openalex-snapshot

Asymptotic enumeration of non-crossing partitions on surfaces

inferred← citeshttps://doi.org/10.1016/j.disc.2026.115407openalex-snapshot

Directed branch-width: A directed analogue of tree-width

inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.004openalex-snapshot

Branch decomposition heuristics for linear matroids

inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.003openalex-snapshot

Subexponential fixed-parameter algorithms for partial vector domination

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.endm.2005.06.032openalex-snapshot

Connected Graph Searching in Outerplanar Graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2009.02.006openalex-snapshot

On planar graphs with large tree-width and small grid minors

inferred← citeshttps://doi.org/10.1016/j.endm.2009.02.009openalex-snapshot

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.099openalex-snapshot

On the Tree-Width of Planar Graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2011.10.014openalex-snapshot

Square Roots of Minor Closed Graph Classes

inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.041openalex-snapshot

Hardness of computing width parameters based on branch decompositions over the vertex set

inferred← citeshttps://doi.org/10.1016/j.ic.2011.04.003openalex-snapshot

Treewidth computations II. Lower bounds

inferred← citeshttps://doi.org/10.1016/j.ic.2012.08.004openalex-snapshot

Connected graph searching

inferred← citeshttps://doi.org/10.1016/j.ins.2016.09.043openalex-snapshot

Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs

inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.018openalex-snapshot

Computing rank-width exactly

inferred← citeshttps://doi.org/10.1016/j.jcss.2003.12.001openalex-snapshot

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.009openalex-snapshot

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

inferred← citeshttps://doi.org/10.1016/j.jcss.2005.02.003openalex-snapshot

Kernels in planar digraphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2010.10.002openalex-snapshot

Spanners in sparse graphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2010.12.002openalex-snapshot

Implicit branching and parameterized partial cover problems

inferred← citeshttps://doi.org/10.1016/j.jcss.2012.02.004openalex-snapshot

Catalan structures and dynamic programming in H-minor-free graphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.007openalex-snapshot

Parameterized complexity of graph planarity with restricted cyclic orders

inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103785openalex-snapshot

Approximating branchwidth on parametric extensions of planarity

inferred← citeshttps://doi.org/10.1016/j.jctb.2006.12.007openalex-snapshot

The branchwidth of graphs and their cycle matroids

inferred← citeshttps://doi.org/10.1016/j.jctb.2014.07.003openalex-snapshot

The structure of graphs not admitting a fixed immersion

inferred← citeshttps://doi.org/10.1016/j.jctb.2021.06.005openalex-snapshot

Packing and covering immersions in 4-edge-connected graphs

inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.005openalex-snapshot

A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three

inferred← citeshttps://doi.org/10.1016/j.jda.2010.02.002openalex-snapshot

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.008openalex-snapshot

Treelength of Series-parallel Graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.038openalex-snapshot

Communication tree problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot

An annotated bibliography on guaranteed graph searching

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.012openalex-snapshot

Computational study on planar dominating set problem

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.017openalex-snapshot

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.015openalex-snapshot

Faster parameterized algorithms for minor containment

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.010openalex-snapshot

The role of planarity in connectivity problems parameterized by treewidth

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.039openalex-snapshot

Hardness of computing width parameters based on branch decompositions over the vertex set

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.040openalex-snapshot

Approximate tree decompositions of planar graphs in linear time

inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00230-9openalex-snapshot

Chordal embeddings of planar graphs

inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00459-6openalex-snapshot

On the monotonicity of games generated by symmetric submodular functions

inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00360-3openalex-snapshot

Minimum restricted diameter spanning trees

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80125-2openalex-snapshot

Chapter 8 Algorithmic implications of the graph minor theorem

inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot

Kernelization

inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot

Acknowledgements

inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot

What Is a Kernel?

inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot

Warm Up

inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot

Inductive Priorities

inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot

Crown Decomposition

inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot

Expansion Lemma

inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot

Linear Programming

inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot

Hypertrees

inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot

Sunflower Lemma

inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot

Modules

inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot

Matroids

inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot

Representative Families

inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot

Greedy Packing

inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot

Euler–s Formula

inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot

Introduction to Treewidth

inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot

Bidimensionality and Protrusions

inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot

Surgery on Graphs

inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot

Framework

showing the first 200 of 351 · page through all 351

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.