Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
Authors:
- Emmanuel ArrighiEAEmmanuel Arrighi
- Niels GrüttemeierNGNiels Grüttemeier
- Nils MorawietzNMNils Morawietz
- Frank SommerFSFrank Sommer
- Petra WolfPWPetra Wolf
Open Access
- 15 July 2025
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 378, 102-119
Abstract
No abstract availableFunding Information
- Norges Forskningsråd (274526)
- Deutsche Forschungsgemeinschaft
- Deutscher Akademischer Austauschdienst (309319)
- Deutscher Akademischer Austauschdienst (57525246)
- Agence Nationale de la Recherche
- Bundesministerium für Umwelt, Naturschutz, nukleare Sicherheit und Verbraucherschutz
- German Academic Exchange Service
- Alexander von Humboldt-Stiftung
This publication has 26 references indexed in Scilit:
- Cluster Editing for Multi-Layer and Temporal GraphsTheory of Computing Systems, 2024
- How fast can we reach a target vertex in stochastic temporal graphs?Journal of Computer and System Sciences, 2020
- Temporal vertex cover with a sliding time windowJournal of Computer and System Sciences, 2020
- Temporal Network Optimization Subject to Connectivity ConstraintsAlgorithmica, 2018
- Connectivity and Inference Problems for Temporal NetworksJournal of Computer and System Sciences, 2002
- Vulnerability of scheduled networks and a generalization of Menger's TheoremNetworks, 1996
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976