Special Issue on Parameterized and Exact Computation, IPEC 2018

Articles (11 in this collection)

1. Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation

   Authors

   • Christophe Paul
   • Michał Pilipczuk

   • Content type: Foreword
   • Published: 25 July 2020

   • Pages: 2133 - 2134

2. Parameterized Complexity of Independent Set in H-Free Graphs

   Authors (first, second and last of 5)

   • Édouard Bonnet
   • Nicolas Bousquet
   • Rémi Watrigant

   • Content type: OriginalPaper
   • Published: 17 June 2020

   • Pages: 2360 - 2394

   

3. Parameterized Leaf Power Recognition via Embedding into Graph Products

   Authors

   • David Eppstein
   • Elham Havvaei

   • Content type: OriginalPaper
   • Published: 29 May 2020

   • Pages: 2337 - 2359

   

4. Multivariate Analysis of Orthogonal Range Searching and Graph Distances

   Authors

   • Karl Bringmann
   • Thore Husfeldt
   • Måns Magnusson

   • Content type: OriginalPaper
   • Open Access
   • Published: 14 March 2020

   • Pages: 2292 - 2315

   

5. Dual Parameterization of Weighted Coloring

   Authors (first, second and last of 6)

   • Júlio Araújo
   • Victor A. Campos
   • Ana Silva

   • Content type: OriginalPaper
   • Published: 13 February 2020

   • Pages: 2316 - 2336

   

6. On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs

   Authors

   • Florian Barbero
   • Lucas Isenmann
   • Jocelyn Thiebaut

   • Content type: OriginalPaper
   • Published: 27 January 2020

   • Pages: 2243 - 2266

   

7. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness

   Authors

   • Marc Roth
   • Johannes Schmitt

   • Content type: OriginalPaper
   • Open Access
   • Published: 22 January 2020

   • Pages: 2267 - 2291

   

8. Best-Case and Worst-Case Sparsifiability of Boolean CSPs

   Authors

   • Hubie Chen
   • Bart M. P. Jansen
   • Astrid Pieterse

   • Content type: OriginalPaper
   • Published: 10 January 2020

   • Pages: 2200 - 2242

   

9. The Parameterised Complexity of Computing the Maximum Modularity of a Graph

   Authors

   • Kitty Meeks
   • Fiona Skerman

   • Content type: OriginalPaper
   • Open Access
   • Published: 08 November 2019

   • Pages: 2174 - 2199

   

10. A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions

    Authors

    • Kustaa Kangas
    • Mikko Koivisto
    • Sami Salonen

    • Content type: OriginalPaper
    • Open Access
    • Published: 03 October 2019

    • Pages: 2156 - 2173

    

11. Multi-budgeted Directed Cuts

    Authors (first, second and last of 5)

    • Stefan Kratsch
    • Shaohua Li
    • Magnus Wahlström

    • Content type: OriginalPaper
    • Open Access
    • Published: 02 August 2019

    • Pages: 2135 - 2155