Temporal explorability games

DOI10.4230/LIPICS.CONCUR.2025.7MaRDI QIDQ7310276zbMATH OpenFDO

Authors Pete Austin, Sougata Bose, Nicolas Mazzocchi, Patrick Totzke

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.7

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A theory of timed automata
• An introduction to temporal graphs: an algorithmic perspective
• Automata, logics, and infinite games. A guide to current research
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• Complexity of Subcases of Presburger Arithmetic
• Computational Complexity
• Computing maximum matchings in temporal graphs
• Context-free commutative grammars with integer counters and resets
• Cops \& robber on periodic temporal graphs: characterization and improved bounds
• Distributed computation in dynamic networks
• Edge exploration of temporal graphs
• Explorable families of graphs
• Exploration of periodically varying graphs
• On temporal graph exploration
• On the synthesis of discrete controllers for timed systems
• Online graph exploration with advice
• Online Graph Exploration: New Results on Old and New Algorithms
• Parity games on temporal graphs
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability-Time Games on Timed Automata
• Semigroups, Presburger formulas, and languages
• Sliding window temporal graph coloring
• Temporal network theory
• Temporal vertex cover with a sliding time window
• The temporal explorer who returns to the base
• Timed Parity Games: Complexity and Robustness
• Traveling salesman problems in temporal graphs

This page was built for publication: Temporal explorability games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310276)