scientific article; zbMATH DE number 7525484
From MaRDI portal
Publication:5075790
DOI10.4230/LIPIcs.ESA.2019.47MaRDI QIDQ5075790
Daniel Lokshtanov, Saket Saurabh, Fahad Panolan, Petr A. Golovach, Fedor V. Fomin, Meirav Zehavi
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A randomized algorithm for long directed cycle
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Vertex cover problem parameterized above and below tight bounds
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Parameterizing above or below guaranteed values
- Long directed \((s,t)\)-path: FPT algorithm
- Faster deterministic parameterized algorithm for \(k\)-path
- The linear arrangement problem parameterized above guaranteed value
- Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- On maximal paths and circuits of graphs
- Faster Algebraic Algorithms for Path and Packing Problems
- Divide-and-Color
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Smallest-last ordering and clustering and graph coloring algorithms
- A Characterization of Block-Graphs
- On Linear Time Minor Tests with Depth-First Search
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
- Problems remaining NP-complette for sparse or dense graphs
- Faster Parameterized Algorithms Using Linear Programming
- Finding a long directed cycle
- Parameterized Algorithms
- Parameterized Traveling Salesman Problem: Beating the Average
- Some Theorems on Abstract Graphs
This page was built for publication:
