On the public citation graph
Treewidth: Algorithmic techniques and results
0 signed · 354 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.1002/net.3230200304openalex-snapshot
A characterization of partial 3‐trees
inferredcites →https://doi.org/10.1002/net.3230210305openalex-snapshot
Resilience of partial k ‐tree networks with edge and node failures
inferredcites →https://doi.org/10.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferredcites →https://doi.org/10.1006/inco.1997.2697openalex-snapshot
All Structured Programs Have Small Tree Width and Good Register Allocation
inferredcites →https://doi.org/10.1006/jagm.1993.1001openalex-snapshot
On Linear Time Minor Tests with Depth-First Search
inferredcites →https://doi.org/10.1006/jagm.1994.1019openalex-snapshot
Parametric Problems on Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1006/jagm.1995.1009openalex-snapshot
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
inferredcites →https://doi.org/10.1006/jagm.1995.1037openalex-snapshot
Treewidth of Chordal Bipartite Graphs
inferredcites →https://doi.org/10.1006/jagm.1996.0002openalex-snapshot
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferredcites →https://doi.org/10.1006/jctb.1994.1007openalex-snapshot
Graph Minors. XI. Circuits on a Surface
inferredcites →https://doi.org/10.1006/jctb.1994.1073openalex-snapshot
Quickly Excluding a Planar Graph
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1006/jctb.1995.1034openalex-snapshot
Graph Minors .XII. Distance on a Surface
inferredcites →https://doi.org/10.1006/jctb.1995.1042openalex-snapshot
Graph Minors .XIV. Extending an Embedding
inferredcites →https://doi.org/10.1007/10692760_30openalex-snapshot
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.
inferredcites →https://doi.org/10.1007/3-540-50728-0_32openalex-snapshot
NC-algorithms for graphs with small treewidth
inferredcites →https://doi.org/10.1007/3-540-54487-9_49openalex-snapshot
Monadic second order logic, tree automata and forbidden minors
inferredcites →https://doi.org/10.1007/3-540-55121-2_1openalex-snapshot
Approximating treewidth, pathwidth, and minimum elimination tree height
inferredcites →https://doi.org/10.1007/3-540-56402-0_35openalex-snapshot
Generalized coloring for tree-like graphs
inferredcites →https://doi.org/10.1007/3-540-57155-8_284openalex-snapshot
Practical algorithms on partial k-trees with an application to domination-like problems
inferredcites →https://doi.org/10.1007/3-540-57899-4_45openalex-snapshot
Dynamic algorithms for graphs with treewidth 2
inferredcites →https://doi.org/10.1007/3-540-59071-4_35openalex-snapshot
Tree-width and path-width of comparability graphs of interval orders
inferredcites →https://doi.org/10.1007/3-540-60084-1_80openalex-snapshot
Parallel algorithms with optimal speedup for bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-60220-8_81openalex-snapshot
Obstructions to within a few vertices or edges of acyclic
inferredcites →https://doi.org/10.1007/3-540-60313-1_132openalex-snapshot
Optimal parallel shortest paths in small treewidth digraphs
inferredcites →https://doi.org/10.1007/3-540-60618-1_75openalex-snapshot
On Interval Routing Schemes and treewidth
inferredcites →https://doi.org/10.1007/3-540-61332-3_153openalex-snapshot
Reduction algorithms for constructing solutions in graphs with small treewidth
inferredcites →https://doi.org/10.1007/3-540-62559-3_20openalex-snapshot
Definability equals recognizability of partial 3-trees
inferredcites →https://doi.org/10.1007/3-540-63165-8_186openalex-snapshot
Dynamic algorithms for graphs of bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-63165-8_217openalex-snapshot
Constructive linear time algorithms for branchwidth
inferredcites →https://doi.org/10.1007/bf00396273openalex-snapshot
The free $$ \mathfrak{m} $$ -lattice on the poset H
inferredcites →https://doi.org/10.1007/bf01293664openalex-snapshot
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
inferredcites →https://doi.org/10.1007/bf01462229openalex-snapshot
Treewidth of cocomparability graphs and a new order-theoretic parameter
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1007/bf01994877openalex-snapshot
Canonical representations of partial 2- and 3-trees
inferredcites →https://doi.org/10.1007/bf02088013openalex-snapshot
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
inferredcites →https://doi.org/10.1007/bfb0024496openalex-snapshot
Parallel algorithms for treewidth two
inferredcites →https://doi.org/10.1007/bfb0024507openalex-snapshot
Structured programs have small tree-width and good register allocation
inferredcites →https://doi.org/10.1007/bfb0029969openalex-snapshot
On the dilation of interval routing
inferredcites →https://doi.org/10.1007/pl00009227openalex-snapshot
Maintaining Regular Properties Dynamically in k-Terminal Graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90292-popenalex-snapshot
Forbidden minors characterization of partial 3-trees
inferredcites →https://doi.org/10.1016/0012-365x(92)90687-bopenalex-snapshot
On the complexity of finding iso- and other morphisms for partial k-trees
inferredcites →https://doi.org/10.1016/0012-365x(94)90092-2openalex-snapshot
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
inferredcites →https://doi.org/10.1016/0020-0190(87)90054-8openalex-snapshot
Nonconstructive advances in polynomial-time complexity
inferredcites →https://doi.org/10.1016/0020-0190(95)00190-5openalex-snapshot
A simple linear-time algorithm for finding path-decompositions of small width
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(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
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(86)90031-6openalex-snapshot
Graph minors. VI. Disjoint paths across a disc
inferredcites →https://doi.org/10.1016/0095-8956(88)90070-6openalex-snapshot
Graph minors. VII. Disjoint paths on a surface
inferredcites →https://doi.org/10.1016/0095-8956(90)90063-6openalex-snapshot
Graph minors. IX. Disjoint crossed paths
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/0095-8956(90)90121-fopenalex-snapshot
Graph minors. VIII. A kuratowski theorem for general surfaces
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/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0166-218x(92)90208-ropenalex-snapshot
Narrowness, pathwidth, and their application in natural language processing
inferredcites →https://doi.org/10.1016/0166-218x(93)90012-dopenalex-snapshot
On the pathwidth of chordal graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90226-eopenalex-snapshot
Efficient sets in partial k-trees
inferredcites →https://doi.org/10.1016/0166-218x(94)90021-3openalex-snapshot
Obstruction set isolation for the gate matrix layout problem
inferredcites →https://doi.org/10.1016/0166-218x(94)90025-6openalex-snapshot
Regularity and locality in k-terminal graphs
inferredcites →https://doi.org/10.1016/0167-9260(91)90028-jopenalex-snapshot
Fast search algorithms for layout permutation problems
inferredcites →https://doi.org/10.1016/0168-0072(94)00034-zopenalex-snapshot
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
inferredcites →https://doi.org/10.1016/0169-2070(93)90088-5openalex-snapshot
Journal of the Royal Statistical Society (B)
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(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(87)90039-3openalex-snapshot
Linear-time computation of optimal subgraphs of decomposable graphs
inferredcites →https://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0304-3975(91)90387-hopenalex-snapshot
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
inferredcites →https://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0304-3975(93)90357-yopenalex-snapshot
Complexity of path-forming games
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/s0022-0000(05)80079-0openalex-snapshot
On search, decision, and the efficiency of polynomial-time algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(99)00146-8openalex-snapshot
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1017/s096012950000092xopenalex-snapshot
Equivalent definitions of recognizability for sets of graphs of bounded tree-width
inferredcites →https://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferredcites →https://doi.org/10.1080/09528139308953776openalex-snapshot
Graph decompositions and tree automata in reasoning with uncertainty
inferredcites →https://doi.org/10.1090/conm/147/01199openalex-snapshot
Finite automata, bounded treewidth and well-quasiordering
inferredcites →https://doi.org/10.1090/dimacs/005/02openalex-snapshot
Graph searching, path-width, tree-width and related problems (A survey)
inferredcites →https://doi.org/10.1109/12.277293openalex-snapshot
Parametric module allocation on partial k-trees
inferredcites →https://doi.org/10.1109/sfcs.1994.365715openalex-snapshot
Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping
inferredcites →https://doi.org/10.1111/j.2517-6161.1988.tb01721.xopenalex-snapshot
Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
inferredcites →https://doi.org/10.1137/0404031openalex-snapshot
NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
inferredcites →https://doi.org/10.1137/0404043openalex-snapshot
Deterministic Dcomposition of Recursive Graph Classes
inferredcites →https://doi.org/10.1137/0405010openalex-snapshot
On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
inferredcites →https://doi.org/10.1137/0406014openalex-snapshot
The Pathwidth and Treewidth of Cographs
inferredcites →https://doi.org/10.1137/0601042openalex-snapshot
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
inferredcites →https://doi.org/10.1137/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/0607057openalex-snapshot
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0097539793258143openalex-snapshot
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
inferredcites →https://doi.org/10.1137/s0097539795289859openalex-snapshot
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
inferredcites →https://doi.org/10.1137/s0895480191193789openalex-snapshot
Treewidth of Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/s089548019223992xopenalex-snapshot
Treewidth and Pathwidth of Permutation Graphs
inferredcites →https://doi.org/10.1137/s0895480193243043openalex-snapshot
On Linear Recognition of Tree-Width at Most Four
inferredcites →https://doi.org/10.1137/s0895480195280010openalex-snapshot
The Structure and Number of Obstructions to Treewidth
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferredcites →https://doi.org/10.1145/44483.44491openalex-snapshot
Nonconstructive tools for proving polynomial-time decidability
inferredcites →https://doi.org/10.1145/73007.73055openalex-snapshot
On search decision and the efficiency of polynomial-time algorithms
inferredcites →https://doi.org/10.5555/313651.313830openalex-snapshot
Subgraph isomorphism in planar graphs and related problems
inferredcites →https://doi.org/10.5555/313651.313832openalex-snapshot
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees
inferredcites →https://doi.org/10.7155/jgaa.00014openalex-snapshot
Subgraph Isomorphism in Planar Graphs and Related 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/net.10099openalex-snapshot
Branch decompositions and minor containment
inferred← citeshttps://doi.org/10.1007/11527862_13openalex-snapshot
Approximate Model-Based Diagnosis Using Preference-Based Compilation
inferred← citeshttps://doi.org/10.1007/11537311_16openalex-snapshot
Improved Algorithms and Complexity Results for Power Domination in Graphs
inferred← citeshttps://doi.org/10.1007/11561071_70openalex-snapshot
Greedy Routing in Tree-Decomposed Graphs
inferred← citeshttps://doi.org/10.1007/11591191_34openalex-snapshot
Treewidth in Verification: Local vs. Global
inferred← citeshttps://doi.org/10.1007/11671411_19openalex-snapshot
Approximation and Complexity of k–Splittable Flows
inferred← citeshttps://doi.org/10.1007/11682462_37openalex-snapshot
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
inferred← citeshttps://doi.org/10.1007/11841036_27openalex-snapshot
Dynamic Programming and Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/11847250_20openalex-snapshot
On the Effective Enumerability of NP Problems
inferred← citeshttps://doi.org/10.1007/11917496_19openalex-snapshot
Generation of Graphs with Bounded Branchwidth
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_13openalex-snapshot
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_24openalex-snapshot
Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_9openalex-snapshot
Deciding Clique-Width for Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_32openalex-snapshot
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_33openalex-snapshot
Counting H-Colorings of Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_10openalex-snapshot
Fixed Parameter Algorithms for Planar Dominating Set and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_16openalex-snapshot
Approximation of Pathwidth of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_25openalex-snapshot
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_5openalex-snapshot
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_52openalex-snapshot
Generalized Model-Checking over Locally Tree-Decomposable Classes
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_52openalex-snapshot
Improved Tree Decomposition Based Algorithms for Domination-like Problems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_42openalex-snapshot
Listing All Potential Maximal Cliques of a Graph
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_3openalex-snapshot
Descriptive and Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_22openalex-snapshot
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_58openalex-snapshot
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_30openalex-snapshot
Deciding First-Order Properties of Locally Tree-Decomposable Graphs
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_6openalex-snapshot
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_192openalex-snapshot
Frequency Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-05411-3_70openalex-snapshot
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_5openalex-snapshot
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_33openalex-snapshot
Parameterized Algorithms for Directed Modular Width
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_18openalex-snapshot
Fast Algorithms for Join Operations on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_27openalex-snapshot
A Generic Convolution Algorithm for Join Operations on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_19openalex-snapshot
Quantifier Elimination Meets Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-24644-4_9openalex-snapshot
Benchmarks for Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_39openalex-snapshot
Pixel and Voxel Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_23openalex-snapshot
Definability in First Order Theories of Graph Orderings
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_2openalex-snapshot
Simultaneous Source Location
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_4openalex-snapshot
Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_15openalex-snapshot
A Structural View on Parameterizing Problems: Distance from Triviality
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_21openalex-snapshot
NCE Graph Grammars and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_7openalex-snapshot
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_18openalex-snapshot
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-69995-8_26openalex-snapshot
Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
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-74839-7_27openalex-snapshot
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_77openalex-snapshot
Weighted Treewidth Algorithmic Techniques and Results
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_10openalex-snapshot
Complexity and Algorithms for Well-Structured k-SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_22openalex-snapshot
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_30openalex-snapshot
Digraph Decompositions and Monotonicity in Digraph Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-01085-9_8openalex-snapshot
Graph-Based Local Elimination Algorithms in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_27openalex-snapshot
Distance d-Domination Games
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_27openalex-snapshot
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_31openalex-snapshot
Capacitated Confluent Flows: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_14openalex-snapshot
The Complexity Status of Problems Related to Sparsest Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_29openalex-snapshot
Parity Games on Graphs with Medium Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_527-1openalex-snapshot
Kernelization, Planar F-Deletion
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_11openalex-snapshot
Algorithms for Bandwidth Consecutive Multicolorings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_53openalex-snapshot
FPT Results for Signed Domination
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-33122-0_12openalex-snapshot
Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_36openalex-snapshot
Faster Algorithms for Markov Decision Processes with Low Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_21openalex-snapshot
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_44openalex-snapshot
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-55537-4_62openalex-snapshot
From Edge Decomposition Formulae to Composition Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_68openalex-snapshot
Polynomials of Bounded Tree Width (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_30openalex-snapshot
Triangulating Planar Graphs While Keeping the Pathwidth Small
inferred← citeshttps://doi.org/10.1007/978-94-007-0714-6_10openalex-snapshot
Generalizing Parikh’s Theorem
inferred← citeshttps://doi.org/10.1007/bfb0055821openalex-snapshot
Tree decompositions of small diameter
inferred← citeshttps://doi.org/10.1007/s000260200002openalex-snapshot
Embedding Complexity and Discrete Optimization I: A New Divide and Conquer Approach to Discrete Optimization
inferred← citeshttps://doi.org/10.1007/s00224-007-1346-yopenalex-snapshot
The Complexity of Polynomial-Time Approximation
inferred← citeshttps://doi.org/10.1007/s00224-007-9068-8openalex-snapshot
Maximum k-Splittable s,t-Flows
inferred← citeshttps://doi.org/10.1007/s00453-001-0116-5openalex-snapshot
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-004-1125-yopenalex-snapshot
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors
inferred← citeshttps://doi.org/10.1007/s00453-008-9180-4openalex-snapshot
Approximation Algorithms for Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-010-9484-zopenalex-snapshot
Obtaining a Planar Graph by Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-011-9546-xopenalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/s00453-014-9957-6openalex-snapshot
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
inferred← citeshttps://doi.org/10.1007/s00453-023-01139-7openalex-snapshot
Parameterized Complexity of Minimum Membership Dominating Set
inferred← citeshttps://doi.org/10.1007/s00453-024-01265-wopenalex-snapshot
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
inferred← citeshttps://doi.org/10.1007/s00454-010-9310-zopenalex-snapshot
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
inferred← citeshttps://doi.org/10.1007/s10479-007-0178-0openalex-snapshot
Models and solution techniques for frequency assignment problems
inferred← citeshttps://doi.org/10.1007/s10559-007-0080-4openalex-snapshot
Tree decomposition and discrete optimization problems: A survey
inferred← citeshttps://doi.org/10.1007/s10951-011-0225-1openalex-snapshot
Scheduling of pipelined operator graphs
inferred← citeshttps://doi.org/10.1007/s11786-007-0031-5openalex-snapshot
Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/s12351-023-00742-4openalex-snapshot
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs
inferred← citeshttps://doi.org/10.1007/s12572-018-0237-6openalex-snapshot
Graphical dynamical systems and their applications to bio-social systems
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/j.artint.2006.11.003openalex-snapshot
AND/OR search spaces for graphical models
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.004openalex-snapshot
Subexponential parameterized algorithms
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.08.001openalex-snapshot
Practical algorithms for MSO model-checking on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.012openalex-snapshot
Tree-decompositions of small pathwidth
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.016openalex-snapshot
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.020openalex-snapshot
Counting truth assignments of formulas of bounded tree-width or clique-width
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.002openalex-snapshot
Complexity results for minimum sum edge coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2008.07.011openalex-snapshot
The parameterized complexity of the induced matching problem
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.023openalex-snapshot
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2008.09.001openalex-snapshot
Complexity of the packing coloring problem for trees
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.011openalex-snapshot
Dynamic programming and planarity: Improved tree-decomposition based algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2013.07.012openalex-snapshot
Polynomial-time algorithms for special cases of the maximum confluent flow problem
inferred← citeshttps://doi.org/10.1016/j.dam.2014.12.012openalex-snapshot
Treewidth and Pathwidth parameterized by the vertex cover number
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.023openalex-snapshot
ToTo: An open database for computation, storage and retrieval of tree decompositions
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.030openalex-snapshot
Edge-maximal graphs of branchwidth k : The k -branches
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.05.008openalex-snapshot
Tree decompositions of graphs: Saving memory in dynamic programming
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.03.010openalex-snapshot
On the algorithmic effectiveness of digraph decompositions and complexity measures
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.02.014openalex-snapshot
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.023openalex-snapshot
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.04.002openalex-snapshot
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.12.003openalex-snapshot
Cutwidth II: Algorithms for partial w-trees of bounded degree
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.2006.08.002openalex-snapshot
Online promise problems with online width metrics
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.01.003openalex-snapshot
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.003openalex-snapshot
Upper and lower bounds for finding connected motifs in vertex-colored graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.002openalex-snapshot
Kernelization using structural parameters on sparse graph classes
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.04.001openalex-snapshot
The relative clique-width of a graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.04.004openalex-snapshot
The dag-width of directed graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2005.07.005openalex-snapshot
Exact algorithms and applications for Tree-like Weighted Set Cover
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.008openalex-snapshot
The complexity of finding uniform sparsest cuts in various graph classes
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.005openalex-snapshot
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.026openalex-snapshot
Predecessor existence problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.038openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.027openalex-snapshot
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.003openalex-snapshot
Digraph decompositions and monotonicity in digraph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.020openalex-snapshot
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.052openalex-snapshot
Parameterized top- K algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.015openalex-snapshot
Bandwidth consecutive multicolorings of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.003openalex-snapshot
Complexity and monotonicity results for domination games
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.025openalex-snapshot
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.017openalex-snapshot
Eccentricity queries and beyond using hub labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115176openalex-snapshot
Theoretical Foundations for Parent Divorcing Transformations in Bayesian Networks
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00078-3openalex-snapshot
A comparison of structural CSP decomposition methods
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00294-2openalex-snapshot
On the extension of a partial metric to a tree metric
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00080-1openalex-snapshot
The parametrized complexity of knot polynomials
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00221-3openalex-snapshot
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00298-1openalex-snapshot
Algorithms for graphs with small octopus
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00001-9openalex-snapshot
Approximation of pathwidth of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00007-xopenalex-snapshot
Listing all potential maximal cliques of a graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00108-6openalex-snapshot
Computing LOGCFL certificates
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00017-8openalex-snapshot
Counting H-colorings of partial k-trees
inferred← citeshttps://doi.org/10.1016/s0378-4754(99)00052-xopenalex-snapshot
Computing invariants in graphs of small bandwidth
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00331-2openalex-snapshot
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00379-8openalex-snapshot
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00410-xopenalex-snapshot
Tree-decompositions of small pathwidth
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80116-7openalex-snapshot
The algorithmic theory of treewidth
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80011-8openalex-snapshot
Tractable Structures for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1051/ita/2009010openalex-snapshot
Inductive computations on graphs defined by clique-width expressions
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/logcom/exaa017openalex-snapshot
Definability in first-order theories of graph orderings ⋆
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184528openalex-snapshot
On the diagnosability of decentralized, timed discrete event systems
inferred← citeshttps://doi.org/10.1109/focs.2012.62openalex-snapshot
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
inferred← citeshttps://doi.org/10.1109/icdm.2013.157openalex-snapshot
Subgraph Enumeration in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/inftech.2008.4621644openalex-snapshot
Some results on a trading model in a consensus list coloring
inferred← citeshttps://doi.org/10.1109/lics.2013.19openalex-snapshot
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
inferred← citeshttps://doi.org/10.1109/pccc.2007.358889openalex-snapshot
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters
inferred← citeshttps://doi.org/10.1111/j.1551-6709.2011.01182.xopenalex-snapshot
Bayesian Intractability Is Not an Ailment That Approximation Can Cure
inferred← citeshttps://doi.org/10.1134/s0081543821030081openalex-snapshot
On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines
inferred← citeshttps://doi.org/10.1137/050644756openalex-snapshot
Simulating Quantum Computation by Contracting Tensor Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973075.36openalex-snapshot
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
inferred← citeshttps://doi.org/10.1137/1.9781611973099.123openalex-snapshot
Directed Nowhere Dense Classes of Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.104openalex-snapshot
Losing Treewidth by Separating Subsets
inferred← citeshttps://doi.org/10.1137/100812653openalex-snapshot
Sparse Balanced Partitions and the Complexity of Subgraph Problems
inferred← citeshttps://doi.org/10.1137/s0895480102419755openalex-snapshot
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
inferred← citeshttps://doi.org/10.1142/s0218195913600091openalex-snapshot
THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
inferred← citeshttps://doi.org/10.1145/2000807.2000812openalex-snapshot
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
inferred← citeshttps://doi.org/10.1145/2261250.2261257openalex-snapshot
The point-set embeddability problem for plane graphs
inferred← citeshttps://doi.org/10.1145/2591796.2591876openalex-snapshot
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
inferred← citeshttps://doi.org/10.1145/3290366openalex-snapshot
Efficient parameterized algorithms for data packing
inferred← citeshttps://doi.org/10.1145/3357713.3384318openalex-snapshot
Hitting topological minors is FPT
inferred← citeshttps://doi.org/10.1145/3368630openalex-snapshot
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
inferred← citeshttps://doi.org/10.1145/3519265openalex-snapshot
Generating User-Centred Explanations via Illocutionary Question Answering: From Philosophy to Interfaces
inferred← citeshttps://doi.org/10.1145/3649134openalex-snapshot
A Family of Centrality Measures for Graph Data Based on Subgraphs
inferred← citeshttps://doi.org/10.1145/504794.504798openalex-snapshot
Deciding first-order properties of locally tree-decomposable structures
inferred← citeshttps://doi.org/10.1162/1063656053583423openalex-snapshot
Space Complexity of Estimation of Distribution Algorithms
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0075openalex-snapshot
Planar Branch Decompositions I: The Ratcatcher
inferred← citeshttps://doi.org/10.14279/depositonce-3327openalex-snapshot
Network Flow Problems Arising From Evacuation Planning
inferred← citeshttps://doi.org/10.14288/1.0052175openalex-snapshot
Representing and reasoning with large games
inferred← citeshttps://doi.org/10.1504/ijcis.2009.024874openalex-snapshot
The structure of electrical networks: a graph theory based analysis
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25775openalex-snapshot
From Width-Based Model Checking to Width-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.1613/jair.1683openalex-snapshot
Pure Nash Equilibria: Hard and Easy Games
inferred← citeshttps://doi.org/10.1613/jair.2151openalex-snapshot
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
inferred← citeshttps://doi.org/10.1613/jair.3744openalex-snapshot
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
inferred← citeshttps://doi.org/10.18419/opus-2455openalex-snapshot
Hierarchische Graphen zur Wegesuche
inferred← citeshttps://doi.org/10.2178/jsl/1096901758openalex-snapshot
On spectra of sentences of monadic second order logic with counting
inferred← citeshttps://doi.org/10.2200/s00529ed1v01y201308aim023openalex-snapshot
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
inferred← citeshttps://doi.org/10.2200/s00596ed1v01y201409qmc009openalex-snapshot
Approximability of Optimization Problems through Adiabatic Quantum Computation
inferred← citeshttps://doi.org/10.2200/s00893ed2v01y201901aim041openalex-snapshot
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition
inferred← citeshttps://doi.org/10.26481/dis.20120405lmopenalex-snapshot
Treewidth : structural properties and algorithmic insights
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2591openalex-snapshot
Broadcast in sparse conversion optical networks using fewest converters
showing the first 200 of 239 · page through all 239
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.