Multistage \(s-t\) path: confronting similarity with dissimilarity
From MaRDI portal
Publication:6107891
DOI10.1007/s00453-022-01077-warXiv2002.07569OpenAlexW3005658287MaRDI QIDQ6107891
Carsten Schubert, Till Fluschnik, Rolf Niedermeier, Philipp Zschoche
Publication date: 28 June 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.07569
shortest pathsparameterized complexitykernelizationtemporal graphsrepresentative sets in temporal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incremental list coloring of graphs, parameterized by conservation
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Infeasibility of instance compression and succinct PCPs for NP
- Some consequences of non-uniform conditions on uniform classes
- Multistage graph problems on a global budget
- On problems without polynomial kernels
- A parameterized view on matroid optimization problems
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Enumerating maximal cliques in link streams with durations
- The complexity of routing with collision avoidance
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- LP-based algorithms for multistage minimization problems
- Multistage vertex cover
- The parameterized complexity of the minimum shared edges problem
- Topology of series-parallel networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- A multistage view on 2-satisfiability
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- New Limits to Classical and Quantum Instance Compression
- Incremental Clustering and Dynamic Information Retrieval
- Kernelization Lower Bounds by Cross-Composition
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Temporal Network Theory
- Deterministic methods to find primes
- The complexity of satisfiability problems
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Connectivity and inference problems for temporal networks
- Parameterized Algorithms for Diverse Multistage Problems
