Special Issue: Parameterized and Exact Computation

ISSN: 0178-4617 (Print) 1432-0541 (Online)

In this topical collection (10 articles)

  1. Announcement

    Editor’s Note: Special Issue on Parameterized and Exact Computation

    Page 3843
    Download PDF (57KB) View Article

  2. OriginalPaper

    A Fixed-Parameter Perspective on #BIS

    Radu Curticapean, Holger Dell, Fedor Fomin, Leslie Ann Goldberg… Pages 3844-3864
    Download PDF (393KB) View Article

  3. OriginalPaper

    Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

    Bart M. P. Jansen, Astrid Pieterse Pages 3865-3889
    Download PDF (475KB) View Article

  4. No Access

    OriginalPaper

    Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms

    Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx Pages 3890-3935

  5. OriginalPaper

    Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

    Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna Pages 3936-3967
    Download PDF (684KB) View Article

  6. OriginalPaper

    Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

    Lech Duraj, Marvin Künnemann, Adam Polak Pages 3968-3992
    Download PDF (663KB) View Article

  7. OriginalPaper

    New Tools and Connections for Exponential-Time Approximation

    Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai… Pages 3993-4009
    Download PDF (556KB) View Article

  8. OriginalPaper

    Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

    Andreas Björklund, Petteri Kaski, Ryan Williams Pages 4010-4028
    Download PDF (493KB) View Article

  9. OriginalPaper

    An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

    Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz Pages 4029-4042
    Download PDF (645KB) View Article

  10. No Access

    OriginalPaper

    How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?

    Marin Bougeret, Ignasi Sau Pages 4043-4068