David Auger

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Generalized ARRIVAL problem for rotor walks in path multigraphs	2024-10-23	Paper
Nonatomic non-cooperative neighbourhood balancing games	2024-10-07	Paper
Polynomial time algorithm for ARRIVAL on tree-like multigraphs	2024-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q6168423	2023-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090455	2022-07-18	Paper
Maximum size of a minimum watching system and the graphs achieving the bound	2015-09-22	Paper
Watching systems in graphs: an extension of identifying codes	2014-04-16	Paper
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games	2014-04-16	Paper
Sphere coverings and identifying codes	2014-02-25	Paper
Identifying codes in trees and planar graphs	2013-10-10	Paper
Watching systems in the King grid	2013-06-26	Paper
THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES	2013-06-06	Paper
Combinatorial identification problems and graph powers	2012-03-23	Paper
On the sizes of graphs and their powers: the undirected case	2011-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q3001191	2011-05-31	Paper
Complexity results for identifying codes in planar graphs	2011-05-20	Paper
On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph	2011-05-09	Paper
Minimal identifying codes in trees and planar graphs with large girth	2010-06-17	Paper
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs	2010-03-10	Paper
Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.	2010-03-08	Paper
Induced paths in twin-free graphs	2009-04-07	Paper

Research outcomes over time

This page was built for person: David Auger