Parameterized temporal exploration problems

DOI10.4230/LIPICS.SAND.2022.15MaRDI QIDQ7395551zbMATH OpenFDO

Authors Thomas Erlebach, Jakob T. Spooner

Publication date 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAND.2022.15

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A Remark on Stirling's Formula
• An introduction to temporal graphs: an algorithmic perspective
• Color-coding
• Computing maximum matchings in temporal graphs.
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Edge exploration of temporal graphs
• Finding temporal paths under waiting time constraints
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 727573 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• Non-strict Temporal Exploration
• On exploring always-connected temporal graphs of small pathwidth
• On temporal graph exploration
• Online and offline algorithms for the time-dependent TSP with time zones
• Parameterized algorithms
• Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
• Temporal flows in temporal networks
• Temporal vertex cover with a sliding time window
• The complexity of finding small separators in temporal graphs
• The temporal explorer who returns to the base
• Traveling salesman problems in temporal graphs

This page was built for publication: Parameterized temporal exploration problems

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