scientific article; zbMATH DE number 7559442
From MaRDI portal
Publication:5089244
DOI10.4230/LIPICS.MFCS.2020.71MaRDI QIDQ5089244FDOQ5089244
Authors: Nils Morawietz, Carolin Rehs, Mathias Weller 
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 7724250
- Cops and an insightful robber
- Cops, robber and traps
- Cops and robbers is EXPTIME-complete
- Cops and robber with constraints
- scientific article; zbMATH DE number 6180528
- scientific article; zbMATH DE number 5241699
- Even time constraints on the watchman's walk
- COPS OR ROBBERS — A BISTABLE SOCIETY
Cites Work
- Fundamentals of parameterized complexity
- Graph searching and a min-max theorem for tree-width
- A partial k-arboretum of graphs with bounded treewidth
- Vertex-to-vertex pursuit in a graph
- Directed tree-width
- Knapsack problems: a parameterized point of view
- Directed path-width and monotonicity in digraph searching
- Graph searching games and width measures for directed graphs
- Parameterized algorithms
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- Title not available (Why is that?)
- Connectivity and inference problems for temporal networks
- DAG-Width and Parity Games
- Descriptional and computational complexity of finite automata -- a survey
- Gibbs measures and dismantlable graphs
- The smallest graph variety containing all paths
- Problems on finite automata and the exponential time hypothesis
- A game of cops and robbers on graphs with periodic edge-connectivity
- Temporal vertex cover with a sliding time window
- The temporal explorer who returns to the base
Cited In (4)
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 Q5089244)
