Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
From MaRDI portal
Publication:6116185
DOI10.1016/j.ic.2023.105049OpenAlexW3134283540MaRDI QIDQ6116185
Petr A. Golovach, Dimitrios M. Thilikos, Fedor V. Fomin
Publication date: 17 July 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2023.105049
Cites Work
- Unnamed Item
- 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
- Strong computational lower bounds via parameterized complexity
- 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
- Algorithmic graph theory and perfect graphs
- Cops and robbers is EXPTIME-complete
- Deterministic rendezvous in graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Graph Theory
- Parameterized Algorithms for Modular-Width
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Graph Classes: A Survey
- 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
