scientific article; zbMATH DE number 7559442
From MaRDI portal
Publication:5089244
DOI10.4230/LIPIcs.MFCS.2020.71MaRDI QIDQ5089244
Mathias Weller, Carolin Rehs, Nils Morawietz
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Descriptional and computational complexity of finite automata -- a survey
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Gibbs measures and dismantlable graphs
- Problems on finite automata and the exponential time hypothesis
- Vertex-to-vertex pursuit in a graph
- The smallest graph variety containing all paths
- Directed tree-width
- Temporal vertex cover with a sliding time window
- Knapsack problems: a parameterized point of view
- Directed path-width and monotonicity in digraph searching
- On temporal graph exploration
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
- DAG-Width and Parity Games
- Parameterized Algorithms
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
- The temporal explorer who returns to the base
This page was built for publication:
