Q5075790
type: Item
instance of: scholarly article
author: Fedor V. Fomin
author: Petr A. Golovach
author: Daniel Lokshtanov
author: Fahad Panolan
author: Saket Saurabh
author: Meirav Zehavi
publication date: 2022-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7525484
zbMATH Keywords: longest path
zbMATH Keywords: longest cycle
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: above guarantee parameterization
MaRDI profile type: MaRDI publication profile
cites work: Q5417644
cites work: Q5111385
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
cites work: Q2934608
cites work: Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
cites work: Parameterized Algorithms
cites work: Some Theorems on Abstract Graphs
cites work: On maximal paths and circuits of graphs
cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
cites work: Long directed \((s,t)\)-path: FPT algorithm
cites work: Finding a long directed cycle
cites work: Q4198056
cites work: Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
cites work: Vertex cover problem parameterized above and below tight bounds
cites work: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
cites work: Parameterized Traveling Salesman Problem: Beating the Average
cites work: The linear arrangement problem parameterized above guaranteed value
cites work: A Characterization of Block-Graphs
cites work: Algorithm engineering for color-coding with applications to signaling pathway detection
cites work: Divide-and-Color
cites work: Faster Algebraic Algorithms for Path and Packing Problems
cites work: Faster Parameterized Algorithms Using Linear Programming
cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut
cites work: Parameterizing above or below guaranteed values
cites work: Smallest-last ordering and clustering and graph coloring algorithms
cites work: Q3740256
cites work: Problems remaining NP-complette for sparse or dense graphs
cites work: Faster deterministic parameterized algorithm for \(k\)-path
cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
cites work: A randomized algorithm for long directed cycle
DOI: 10.4230/LIPICS.ESA.2019.47
description: scientific article; zbMATH DE number 7525484