Parameterized analysis of the cops and robber problem
From MaRDI portal
Cites work
- A better bound for the cop number of general graphs
- A bound for the cops and robbers problem
- A comparison of structural CSP decomposition methods
- A faster algorithm for vertex cover parameterized by solution size
- A game of cops and robbers
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Algorithmic meta-theorems for restrictions of treewidth
- Bounding the cop number of a graph by its genus
- Catching a fast robber on the grid
- Cop and robber game and hyperbolicity
- Cop and robber games when the robber can hide and ride
- Cops and robber on some families of oriented graphs
- Cops and robbers from a distance
- Cops and robbers in a random graph
- Cops and robbers in graphs with large girth and Cayley graphs
- Cops and robbers is EXPTIME-complete
- Cops and robbers on directed and undirected abelian Cayley graphs
- Cops and robbers on geometric graphs
- Cops and robbers on graphs based on designs
- Cops and Robbers on Planar‐Directed Graphs
- Cops that surround a robber
- Cops, a fast robber and defensive domination on interval graphs
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Cops-robber games and the resolution of Tseitin formulas
- Directed tree-width
- Evacuating robots via unknown exit in a disk
- Fine-grained Lower Bounds on Cops and Robbers
- Fully active cops and robbers
- Game of cops and robbers in oriented quotients of the integer grid
- Graph searching and a min-max theorem for tree-width
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 67464 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 3204219 (Why is no real title available?)
- Incompressibility through Colors and IDs
- Kernelization. Theory of parameterized preprocessing
- Lazy Cops and Robbers on generalized hypercubes
- Lazy cops and robbers played on random graphs and graphs on surfaces
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Marshals, monotone marshals, and hypertree-width
- Meyniel's conjecture holds for random \(d\)-regular graphs
- Meyniel's conjecture holds for random graphs
- Meyniel's conjecture on graphs of bounded degree
- Meyniel's conjecture on the cop number: a survey
- On a pursuit game played on graphs for which a minor is excluded
- On Meyniel's conjecture of the cop number
- On the complexity of connection games
- On the computational complexity of a game of cops and robbers
- On the cop number of a graph
- On the cop number of string graphs
- On the cop number of toroidal graphs
- Parameterized algorithms
- Parameterized analysis of the Cops and Robber game
- Parameterized pursuit-evasion games
- Pursuing a fast robber on a graph
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- The complexity of acyclic conjunctive queries
- The cops and robber game on graphs with forbidden (induced) subgraphs
- The design of approximation algorithms
- The game of cops and robbers on graphs
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- The one-cop-moves game on graphs with some special structures
- The one-cop-moves game on planar graphs
- The parameterized complexity of positional games
- The vertex separation and search number of a graph
- Variations of cops and robber on the hypercube
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
This page was built for publication: Parameterized analysis of the cops and robber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845952)
