scientific article; zbMATH DE number 7559227
From MaRDI portal
Publication:5088957
DOI10.4230/LIPIcs.SoCG.2019.27MaRDI QIDQ5088957
Vincent Cohen-Addad, Arnaud de Mesmay, Dániel Marx, De Verdière Éric Colin
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.08603
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimally cutting a surface into a disk
- Which problems have strongly exponential complexity?
- Multicuts in planar and bounded-genus graphs with bounded number of terminals
- Genus characterizes the complexity of certain graph problems: Some tight results
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- A separator theorem for graphs of bounded genus
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The Complexity of Multiterminal Cuts
- Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
- When is the evaluation of conjunctive queries tractable?
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
- Parameterized Algorithms
This page was built for publication:
