On the public citation graph

Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families

0 signed · 256 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-19487-8_26openalex-snapshot

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

inferredcites →https://doi.org/10.1007/3-540-19488-6_105openalex-snapshot

Problems easy for tree-decomposable graphs extended abstract

inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot

Dynamic programming on graphs with bounded treewidth

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-51517-8_142openalex-snapshot

A combinatorial and logical approach to linear-time computability (extended abstract)

inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot

Graph expressions and graph rewritings

inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot

Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

inferredcites →https://doi.org/10.1016/0022-0000(78)90045-4openalex-snapshot

On the complexity of some two-person perfect-information games

inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot

The NP-completeness column: an ongoing guide

inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot

The NP-completeness column: An ongoing guide

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/0304-3975(82)90133-5openalex-snapshot

The subgraph isomorphism problem for outerplanar graphs

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

Complexity Results for Bandwidth Minimization

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

Complexity of Finding Embeddings in a k -Tree

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

Linear-time computability of combinatorial problems on series-parallel graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<26::aid-net3>3.0.co;2-mopenalex-snapshot

Degree-preserving trees

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

The linear arrangement problem on recursively constructed graphs

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

Branch decompositions and minor containment

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

Low‐connectivity network design on series‐parallel graphs

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

A linear‐time algorithm for broadcast domination in a tree

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

A note on trees, tables, and algorithms

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

The firebreak problem

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

Tangle bases: Revisited

inferred← citeshttps://doi.org/10.1006/inco.1997.2669openalex-snapshot

On Interval Routing Schemes and Treewidth

inferred← citeshttps://doi.org/10.1006/inco.1997.2697openalex-snapshot

All Structured Programs Have Small Tree Width and Good Register Allocation

inferred← citeshttps://doi.org/10.1006/inco.2000.2958openalex-snapshot

Reduction Algorithms for Graphs of Small Treewidth

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

Parametric Problems on Graphs of Bounded Tree-Width

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

A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs

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

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

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

Edge-Coloring Partialk-Trees

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

Optimal Parametric Search on Graphs of Bounded Tree-Width

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

An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs

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

A Data Structure for Dynamically Maintaining Rooted Trees

inferred← citeshttps://doi.org/10.1007/10692760_9openalex-snapshot

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees

inferred← citeshttps://doi.org/10.1007/11533719_81openalex-snapshot

Algorithms for Finding Distance-Edge-Colorings of Graphs

inferred← citeshttps://doi.org/10.1007/11560647_37openalex-snapshot

Maximum Marking Problems with Accumulative Weight Functions

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

Traversing the Machining Graph

inferred← citeshttps://doi.org/10.1007/11917496_1openalex-snapshot

Treewidth: Characterizations, Applications, and Computations

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_29openalex-snapshot

Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids

inferred← citeshttps://doi.org/10.1007/3-540-44679-6_32openalex-snapshot

Algorithm for the Cost Edge-Coloring of Trees

inferred← citeshttps://doi.org/10.1007/3-540-44806-3_5openalex-snapshot

Generation of Efficient Programs for Solving Maximum Multi-marking Problems

inferred← citeshttps://doi.org/10.1007/3-540-45655-4_46openalex-snapshot

Algorithms for the Multicolorings of Partial k-Trees

inferred← citeshttps://doi.org/10.1007/3-540-45678-3_44openalex-snapshot

Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs

inferred← citeshttps://doi.org/10.1007/3-540-46632-0_35openalex-snapshot

A Linear Algorithm for Finding Total Colorings of Partial k-Trees

inferred← citeshttps://doi.org/10.1007/3-540-46784-x_16openalex-snapshot

Efficient Analy sis of Graphs with Small Minimal Separators

inferred← citeshttps://doi.org/10.1007/3-540-48224-5_42openalex-snapshot

Total Colorings of Degenerated Graphs

inferred← citeshttps://doi.org/10.1007/3-540-49381-6_44openalex-snapshot

The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_162openalex-snapshot

Better algorithms for the pathwidth and treewidth of graphs

inferred← citeshttps://doi.org/10.1007/3-540-55121-2_2openalex-snapshot

Monadic second-order evaluations on tree-decomposable graphs

inferred← citeshttps://doi.org/10.1007/3-540-55121-2_24openalex-snapshot

On disjoint cycles

inferred← citeshttps://doi.org/10.1007/3-540-55706-7_26openalex-snapshot

Parametric problems on graphs of bounded tree-width

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot

Two strikes against perfect phylogeny

inferred← citeshttps://doi.org/10.1007/3-540-57155-8_284openalex-snapshot

Practical algorithms on partial k-trees with an application to domination-like problems

inferred← citeshttps://doi.org/10.1007/3-540-57273-2_76openalex-snapshot

A linear algorithm for edge-coloring partial k-trees

inferred← citeshttps://doi.org/10.1007/3-540-57899-4_40openalex-snapshot

On reduction algorithms for graphs with small treewidth

inferred← citeshttps://doi.org/10.1007/3-540-57899-4_45openalex-snapshot

Dynamic algorithms for graphs with treewidth 2

inferred← citeshttps://doi.org/10.1007/3-540-58218-5_14openalex-snapshot

Optimal parametric search on graphs of bounded tree-width

inferred← citeshttps://doi.org/10.1007/3-540-58218-5_33openalex-snapshot

A parallel algorithm for edge-coloring partial k-trees

inferred← citeshttps://doi.org/10.1007/3-540-59042-0_92openalex-snapshot

The χt-coloring problem

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_80openalex-snapshot

Parallel algorithms with optimal speedup for bounded treewidth

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_80openalex-snapshot

Regular-factors in the complements of partial k-trees

inferred← citeshttps://doi.org/10.1007/3-540-60618-1_75openalex-snapshot

On Interval Routing Schemes and treewidth

inferred← citeshttps://doi.org/10.1007/3-540-61332-3_153openalex-snapshot

Reduction algorithms for constructing solutions in graphs with small treewidth

inferred← citeshttps://doi.org/10.1007/3-540-61422-2_129openalex-snapshot

Vertex partitioning problems on partial k-trees

inferred← citeshttps://doi.org/10.1007/3-540-61680-2_62openalex-snapshot

Parallel algorithms for series parallel graphs

inferred← citeshttps://doi.org/10.1007/3-540-62559-3_20openalex-snapshot

Definability equals recognizability of partial 3-trees

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

Dynamic algorithms for graphs of bounded treewidth

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-4020-8678-6_30openalex-snapshot

Extending the Spatial Relational Model PLA to Represent Trees

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

Courcelle’s Theorem

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

Kernelization, Bidimensionality and Kernels

inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_25openalex-snapshot

A General Framework for Path Convexities

inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_16openalex-snapshot

A Retrospective on (Meta) Kernelization

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-031-09993-9_7openalex-snapshot

A Meta-Theorem for Distributed Certification

inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_19openalex-snapshot

Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond

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

Graceful Coloring is Computationally Hard

inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_12openalex-snapshot

On the Complexity of Locally Rainbow Path

inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_27openalex-snapshot

Speeding Up Dynamic Programming with Representative Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_28openalex-snapshot

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_52openalex-snapshot

Convex Independence in Permutation Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_13openalex-snapshot

Complete Axiomatization of an Algebraic Construction of 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-73545-8_10openalex-snapshot

Connected Coloring Completion for General Graphs: Algorithms and Complexity

inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_11openalex-snapshot

Quadratic Kernelization for Convex Recoloring of Trees

inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_38openalex-snapshot

On the Complexity of Some Colorful Problems Parameterized by Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-540-78582-8_72openalex-snapshot

A Note on Root Choice for Parallel Processing of Tree Decompositions

inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_7openalex-snapshot

A Short Cut to Optimal Sequences

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

Kernelization: New Upper and Lower Bound Techniques

inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_2openalex-snapshot

Algorithmic Aspects of Dominator Colorings in Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_526-1openalex-snapshot

Kernelization, Bidimensionality and Kernels

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-30891-8_13openalex-snapshot

Graph Minors and Parameterized Algorithm Design

inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_4openalex-snapshot

Probabilistic Inference and Monadic Second Order Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_8openalex-snapshot

Optimization Problems in Dotted Interval Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_35openalex-snapshot

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques

inferred← citeshttps://doi.org/10.1007/978-94-015-1288-6_8openalex-snapshot

inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_22openalex-snapshot

Cost Graph Colorings

inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_27openalex-snapshot

Orientable Burning Number of Graphs

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

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs

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

Tree polytope on 2-trees

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

Algorithms for recognition of regular properties and decomposition of recursive graph families

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

Finding edge-disjoint paths in partial k-trees

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

Algorithms for finding f-colorings of partial k-trees

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

Structured programs have small tree-width and good register allocation

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

Maintaining Regular Properties Dynamically in k-Terminal Graphs

inferred← citeshttps://doi.org/10.1007/s00354-010-0098-4openalex-snapshot

A Short Cut to Optimal Sequences

inferred← citeshttps://doi.org/10.1007/s00453-003-1060-3openalex-snapshot

Multicolorings of Series-Parallel Graphs

inferred← citeshttps://doi.org/10.1007/s00453-011-9565-7openalex-snapshot

Parameterized Complexity of the Spanning Tree Congestion Problem

inferred← citeshttps://doi.org/10.1007/s00453-014-9934-0openalex-snapshot

Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions

inferred← citeshttps://doi.org/10.1007/s00453-018-0453-2openalex-snapshot

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques

inferred← citeshttps://doi.org/10.1007/s00453-018-0495-5openalex-snapshot

Explicit Linear Kernels for Packing Problems

inferred← citeshttps://doi.org/10.1007/s00453-019-00663-9openalex-snapshot

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width

inferred← citeshttps://doi.org/10.1007/s00453-023-01161-9openalex-snapshot

Extended MSO Model Checking via Small Vertex Integrity

inferred← citeshttps://doi.org/10.1007/s00453-023-01185-1openalex-snapshot

A Meta-Theorem for Distributed Certification

inferred← citeshttps://doi.org/10.1007/s00453-024-01261-0openalex-snapshot

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited

inferred← citeshttps://doi.org/10.1007/s00453-025-01349-1openalex-snapshot

Distributed Model Checking on Graphs of Bounded Treedepth

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

A Linear Algorithm for Finding \boldmath[{ g,f }]-Colorings of Partial \boldmath{ k }-Trees

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

Linear-Time Algorithms for Partial \boldmath k -Tree Complements

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

Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1

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

Finding Edge-Disjoint Paths in Partial k -Trees

inferred← citeshttps://doi.org/10.1007/s10878-020-00618-9openalex-snapshot

A general framework for path convexities

inferred← citeshttps://doi.org/10.1007/s40305-019-00241-4openalex-snapshot

Computing the Number of k-Component Spanning Forests of a Graph with Bounded Treewidth

inferred← citeshttps://doi.org/10.1016/0012-365x(90)90364-nopenalex-snapshot

On minimum dominating sets with minimum intersection

inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0131-hopenalex-snapshot

On Halin subgraphs and supergraphs

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/0166-218x(94)90020-5openalex-snapshot

A recurrence template for several parameters in series–parallel graphs

inferred← citeshttps://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot

Easy problems for tree-decomposable graphs

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot

Monadic second-order evaluations on tree-decomposable graphs

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90357-yopenalex-snapshot

Complexity of path-forming games

inferred← citeshttps://doi.org/10.1016/0377-2217(94)90425-1openalex-snapshot

A graph approximation heuristic for the vertex cover problem on planar graphs

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.2009.10.003openalex-snapshot

Bounded treewidth as a key to tractability of knowledge representation and reasoning

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

Confronting intractability via parameters

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.cosrev.2020.100344openalex-snapshot

Compactors for parameterized counting problems

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

A polynomial time algorithm for strong edge coloring of partial k-trees

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

Tree-edges deletion problems with bounded diameter obstruction sets

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

Optimization problems in dotted interval graphs

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

Clique-perfectness of complements of line graphs

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

Sparse obstructions for minor-covering parameters

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

A polynomial time algorithm to compute the connected treewidth of a series–parallel graph

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

The complexity of restricted star colouring

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

Hardness transitions and uniqueness of acyclic colouring

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

Orientable burning number of graphs

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

Hardness transitions of star colouring and restricted star colouring

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

Safe separators for treewidth

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

On domination and reinforcement numbers in trees

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

Star colouring of bounded degree graphs and regular graphs

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.2015.09.005openalex-snapshot

A branch-and-price-and-cut method for computing an optimal bramble

inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.025openalex-snapshot

Definability equals recognizability for k -outerplanar graphs and l -chordal partial k -trees

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

Clique-perfectness of complements of line graphs

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

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

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

On the complexity of some colorful problems parameterized by treewidth

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

The parameterised complexity of list problems on graphs of bounded treewidth

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.002openalex-snapshot

Approximation algorithms for partial covering problems

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

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

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

Branch-width, parse trees, and monadic second-order logic for matroids

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

Algorithms for finding distance-edge-colorings of graphs

inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2015.04.001openalex-snapshot

The complexity of power indexes with graph restricted coalitions

inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103732openalex-snapshot

Series–parallel-loop decompositions of control-flow graphs

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

Kernel bounds for path and cycle problems

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

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

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

Grouped domination parameterized by vertex cover, twin cover, and beyond

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

On minimum cuts and the linear arrangement problem

inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00223-2openalex-snapshot

The edge-disjoint paths problem is NP-complete for series–parallel graphs

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00449-8openalex-snapshot

Tree-width and the monadic quantifier hierarchy

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot

A partial k-arboretum of graphs with bounded treewidth

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

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-0661(05)80203-8openalex-snapshot

Linear Time Computable Problems and Logical Descriptions

inferred← citeshttps://doi.org/10.1023/b:joco.0000021940.40066.0copenalex-snapshot

Algorithm for the Cost Edge-Coloring of Trees

inferred← citeshttps://doi.org/10.1080/09728600.2008.12088857openalex-snapshot

On the Wimer Method for Designing Edge-Based Algorithms

inferred← citeshttps://doi.org/10.1080/16073606.1993.9631742openalex-snapshot

MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

inferred← citeshttps://doi.org/10.1093/comjnl/bxm037openalex-snapshot

Combinatorial Optimization on Graphs of Bounded Treewidth

inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot

Width Parameters Beyond Tree-width and their Applications

inferred← citeshttps://doi.org/10.1109/cso.2010.202openalex-snapshot

Problem Reduction Graph Model for Discrete Optimization Problems

inferred← citeshttps://doi.org/10.1109/focs.2009.46openalex-snapshot

(Meta) Kernelization

inferred← citeshttps://doi.org/10.1109/focs.2010.21openalex-snapshot

Logspace Versions of the Theorems of Bodlaender and Courcelle

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/iciea.2010.5515313openalex-snapshot

The wheels: an infinite family of bi-connected planar synchronizing graphs

inferred← citeshttps://doi.org/10.1109/ines.2006.1689353openalex-snapshot

A Method to Represent Restricted Classes of Planar Graphs in the Enhanced Spatial Relational Model PLA, Based on Hahn Graphs

inferred← citeshttps://doi.org/10.1109/ispan.1994.367150openalex-snapshot

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees

inferred← citeshttps://doi.org/10.1109/secon.1992.202325openalex-snapshot

On polynomial time algorithms for tree-decomposable graphs

inferred← citeshttps://doi.org/10.1109/tcsi.2002.805729openalex-snapshot

On critical spanning trees and the linear-arrangement problem

inferred← citeshttps://doi.org/10.1137/1.9781611973075.43openalex-snapshot

Bidimensionality and Kernels

inferred← citeshttps://doi.org/10.1137/1.9781611973082.59openalex-snapshot

Bidimensionality and EPTAS

inferred← citeshttps://doi.org/10.1137/1.9781611973402.130openalex-snapshot

A Near-Optimal Planarization Algorithm

inferred← citeshttps://doi.org/10.1137/1.9781611975031.16openalex-snapshot

Minor-matching hypertree width

inferred← citeshttps://doi.org/10.1137/1.9781611975031.19openalex-snapshot

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth

inferred← citeshttps://doi.org/10.1137/1.9781611976465.116openalex-snapshot

Induced subgraphs of bounded treewidth and the container method

inferred← citeshttps://doi.org/10.1137/1.9781611977073.79openalex-snapshot

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent

inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch141openalex-snapshot

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

inferred← citeshttps://doi.org/10.1137/130930133openalex-snapshot

Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs

inferred← citeshttps://doi.org/10.1137/140964801openalex-snapshot

Large Induced Subgraphs via Triangulations and CMSO

inferred← citeshttps://doi.org/10.1137/140997889openalex-snapshot

Hitting Forbidden Minors: Approximation and Kernelization

inferred← citeshttps://doi.org/10.1137/16m1080264openalex-snapshot

Bidimensionality and Kernels

inferred← citeshttps://doi.org/10.1137/20m1352119openalex-snapshot

Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

inferred← citeshttps://doi.org/10.1137/20m1383732openalex-snapshot

Induced Subgraphs of Bounded Treewidth and the Container Method

inferred← citeshttps://doi.org/10.1137/22m153937xopenalex-snapshot

Fast FPT-Approximation of Branchwidth

inferred← citeshttps://doi.org/10.1137/23m1595059openalex-snapshot

An Improved Parameterized Algorithm for Treewidth

inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot

Fixed-Parameter Tractability and Completeness I: Basic Results

inferred← citeshttps://doi.org/10.1137/s0097539792241928openalex-snapshot

Weighted Multidimensional Search and Its Application to Convex Optimization

inferred← citeshttps://doi.org/10.1137/s0097539793251219openalex-snapshot

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

inferred← citeshttps://doi.org/10.1137/s0097539795289859openalex-snapshot

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

inferred← citeshttps://doi.org/10.1137/s0097539799363359openalex-snapshot

On Local Search and Placement of Meters in Networks

inferred← citeshttps://doi.org/10.1137/s0895480194275825openalex-snapshot

Algorithms for Vertex Partitioning Problems on Partial k-Trees

inferred← citeshttps://doi.org/10.1145/1456650.1456654openalex-snapshot

Solving problems on recursively constructed graphs

inferred← citeshttps://doi.org/10.1145/167088.167161openalex-snapshot

A linear time algorithm for finding tree-decompositions of small treewidth

inferred← citeshttps://doi.org/10.1145/195058.195229openalex-snapshot

Beyond NP-completeness for problems of bounded width (extended abstract)

inferred← citeshttps://doi.org/10.1145/2797140openalex-snapshot

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

inferred← citeshttps://doi.org/10.1145/2973749openalex-snapshot

(Meta) Kernelization

inferred← citeshttps://doi.org/10.1145/3154833openalex-snapshot

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes

inferred← citeshttps://doi.org/10.1145/3280824openalex-snapshot

Clique-width III

showing the first 200 of 241 · page through all 241

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.