Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
From MaRDI portal
Publication:2672445
DOI10.1007/978-3-030-86838-3_24OpenAlexW3204269757MaRDI QIDQ2672445
Fedor V. Fomin, Dimitrios M. Thilikos, Petr A. Golovach
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2102.13409
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The guarding game is E-complete
- Cop-robber guarding game with cycle robber-region
- Guard games on graphs: keep the intruder out!
- How to guard a graph?
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- A short note about pursuit games played on a graph with a given genus
- An application of simultaneous diophantine approximation in combinatorial optimization
- The theory of search games and rendezvous.
- Which problems have strongly exponential complexity?
- Algorithmic meta-theorems for restrictions of treewidth
- Vertex-to-vertex pursuit in a graph
- Cops and robbers is EXPTIME-complete
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Parameterized Algorithms for Modular-Width
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- The Rendezvous Search Problem
- Network Flow Algorithms
- Parameterized Algorithms
- On the complexity of \(k\)-SAT
This page was built for publication: Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
