scientific article; zbMATH DE number 7651203
From MaRDI portal
Publication:5874536
DOI10.4230/LIPIcs.ESA.2020.64MaRDI QIDQ5874536
Dimitrios M. Thilikos, Christophe Paul, Mamadou Moustapha Kanté
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Connected graph searching
- Graph minors. XX: Wagner's conjecture
- An annotated bibliography on guaranteed graph searching
- Derivation of algorithms for cutwidth and related graph layout parameters
- Graph minors. I. Excluding a forest
- Interval graphs and searching
- The vertex separation number of a graph equals its path-width
- Searching and pebbling
- Finding small-width connected path decompositions in polynomial time
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Faster Computation of Path-Width
- Complexity of Finding Embeddings in a k-Tree
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
- Constructive linear time algorithms for branchwidth
- Constructive algorithm for path-width of matroids
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- From Pathwidth to Connected Pathwidth
- Finding branch-decompositions of matroids, hypergraphs, and more
- Parameterized and Exact Computation
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Connected Search for a Lazy Robber
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
