scientific article; zbMATH DE number 7765417
From MaRDI portal
Publication:6065468
DOI10.4230/lipics.isaac.2020.59MaRDI QIDQ6065468
Shao-hua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge, Thomas Bellitto
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- The structure of graphs not admitting a fixed immersion
- Chinese postman problem on edge-colored multigraphs
- Two-factors in orientated graphs with forbidden transitions
- On the parameterized complexity of multiple-interval graph problems
- The directed subgraph homeomorphism problem
- Alternating cycles in edge-partitioned graphs
- Hamiltonian circuits determining the order of chromosomes
- A note on alternating cycles in edge-coloured graphs
- On minimum connecting transition sets in graphs
- Separating codes and traffic monitoring
- Properly edge-colored theta graphs in edge-colored complete graphs
- Finding paths in graphs avoiding forbidden transitions
- Complexity of trails, paths and circuits in arc-colored digraphs
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Two disjoint shortest paths problem with non-negative edge length
- The undirected two disjoint shortest paths problem
- The directed 2-linkage problem with length constraints
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Paths and trails in edge-colored graphs
- Cycle extension in edge-colored complete graphs
- Finding Paths in Grids with Forbidden Transitions
- On s-t paths and trails in edge-colored graphs
- Algorithmic Applications of Tree-Cut Width
- Properly Coloured Cycles and Paths: Results and Open Problems
- Trees in Graphs with Conflict Edges or Forbidden Transitions
- Finding Detours is Fixed-Parameter Tractable
- Immersions in Highly Edge Connected Graphs
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
- The Directed Disjoint Shortest Paths Problem
- Alternating Hamiltonian cycles in $2$-edge-colored multigraphs
- Shortest Paths Avoiding Forbidden Subpaths
- Parameterized Algorithms
- Digraphs
This page was built for publication:
