Journal: Algorithmica

Volume 81, Issue 10

3843 -- 0. Editor's Note: Special Issue on Parameterized and Exact Computation
3844 -- 3864Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas. A Fixed-Parameter Perspective on #BIS
3865 -- 3889Bart M. P. Jansen, Astrid Pieterse. Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
3890 -- 3935Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx. Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
3936 -- 3967Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna. Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
3968 -- 3992Lech Duraj, Marvin Künnemann, Adam Polak. Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
3993 -- 4009Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof. New Tools and Connections for Exponential-Time Approximation
4010 -- 4028Andreas Björklund, Petteri Kaski, Ryan Williams 0001. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
4029 -- 4042Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz. An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
4043 -- 4068Marin Bougeret, Ignasi Sau. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
4069 -- 0. Preface: Special Issue on WADS 2017
4070 -- 4097Sebastian Brandt 0002, Roger Wattenhofer. Approximating Small Balanced Vertex Separators in Almost Linear Time
4098 -- 4117Philip Dasler, David M. Mount. Modular Circulation and Applications to Traffic Management
4118 -- 4133Ziyun Huang, Hu Ding, Jinhui Xu 0001. A Faster Algorithm for Truth Discovery via Range Cover
4134 -- 4164Klaus Jansen, Marten Maack. An EPTAS for Scheduling on Unrelated Machines of Few Different Types