scientific article; zbMATH DE number 7651203

DOI10.4230/LIPICS.ESA.2020.64MaRDI QIDQ5874536zbMATH OpenFDO

Authors Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos

Publication date 7 February 2023

zbMATH Keywords

pathwidthgraph decompositionsparameterized algorithmsgraph searchingtypical sequences

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• scientific article; zbMATH DE number 4162691 (Why is no real title available?)
• scientific article; zbMATH DE number 4091210 (Why is no real title available?)
• scientific article; zbMATH DE number 176761 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 4123550 (Why is no real title available?)
• scientific article; zbMATH DE number 2080246 (Why is no real title available?)
• scientific article; zbMATH DE number 6862107 (Why is no real title available?)
• scientific article; zbMATH DE number 7650942 (Why is no real title available?)
• An annotated bibliography on guaranteed graph searching
• Complexity of Finding Embeddings in a k-Tree
• Connected Search for a Lazy Robber
• Connected graph searching
• Constructive algorithm for path-width of matroids
• Constructive linear time algorithms for branchwidth
• Cutwidth I: A linear time fixed parameter algorithm
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Derivation of algorithms for cutwidth and related graph layout parameters
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Equivalent definitions of recognizability for sets of graphs of bounded tree-width
• Faster computation of path-width
• Finding branch-decompositions of matroids, hypergraphs, and more
• Finding small-width connected path decompositions in polynomial time
• From pathwidth to connected pathwidth
• Graph minors. I. Excluding a forest
• Graph minors. XX: Wagner's conjecture
• Interval graphs and searching
• Parameterized and Exact Computation
• Searching and pebbling
• Searching is not jumping.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The vertex separation number of a graph equals its path-width
• The “Art of Trellis Decoding” Is Fixed-Parameter Tractable

Cited in

(4)

• Fixed-parameter tractable algorithms for tracking shortest paths
• Connected search for a lazy robber
• A Polynomial Time Algorithm for Bounded Directed Pathwidth
• Improved FPT Algorithms for Rectilinear k-Links Spanning Path

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874536)