Volume 81, Issue 10

Search all Algorithmica articles

October 2019

Special Issues on "Parameterized and Exact Computation" and "Algorithms and Data Structures"

Filter by

Volume:

Sort by

Date published:

New to old Old to new

15 articles in this issue

Editor’s Note: Special Issue on Parameterized and Exact Computation
Announcement 19 August 2019 Pages: 3843 - 3843
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
A Fixed-Parameter Perspective on #BIS
Radu Curticapean
Holger Dell
John Lapinskas
OriginalPaper Open access 18 July 2019 Pages: 3844 - 3864
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
Bart M. P. Jansen
Astrid Pieterse
OriginalPaper Open access 03 May 2019 Pages: 3865 - 3889
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
Édouard Bonnet
Nick Brettell
Dániel Marx
OriginalPaper 25 April 2019 Pages: 3890 - 3935
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
Bart M. P. Jansen
Marcin Pilipczuk
Marcin Wrochna
OriginalPaper Open access 03 August 2019 Pages: 3936 - 3967
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Lech Duraj
Marvin Künnemann
Adam Polak
OriginalPaper Open access 23 July 2018 Pages: 3968 - 3992
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
New Tools and Connections for Exponential-Time Approximation
Nikhil Bansal
Parinya Chalermsook
Jesper Nederlof
OriginalPaper Open access 05 September 2018 Pages: 3993 - 4009
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Andreas Björklund
Petteri Kaski
Ryan Williams
OriginalPaper Open access 18 September 2018 Pages: 4010 - 4028
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Nikolai Karpov
Marcin Pilipczuk
Anna Zych-Pawlewicz
OriginalPaper Open access 23 August 2018 Pages: 4029 - 4042
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
Marin Bougeret
Ignasi Sau
OriginalPaper 21 June 2018 Pages: 4043 - 4068
Part of 2 collections:

Special Issue: Parameterized and Exact Computation

Special Issue: Parameterized and Exact Computation
Preface: Special Issue on WADS 2017
Announcement 19 August 2019 Pages: 4069 - 4069
Part of 3 collections:

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures
Approximating Small Balanced Vertex Separators in Almost Linear Time
Sebastian Brandt
Roger Wattenhofer
OriginalPaper 07 August 2018 Pages: 4070 - 4097
Part of 2 collections:

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures
Modular Circulation and Applications to Traffic Management
Philip Dasler
David M. Mount
OriginalPaper 13 August 2018 Pages: 4098 - 4117
Part of 2 collections:

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures
A Faster Algorithm for Truth Discovery via Range Cover
Ziyun Huang
Hu Ding
Jinhui Xu
OriginalPaper 25 March 2019 Pages: 4118 - 4133
Part of 2 collections:

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
Klaus Jansen
Marten Maack
OriginalPaper 10 May 2019 Pages: 4134 - 4164
Part of 2 collections:

Special Issue: Algorithms and Data Structures

Special Issue: Algorithms and Data Structures

Volume 81, Issue 10

Search

Navigation