Special Issue on Parameterized and Exact Computation, IPEC 2018

In this topical collection (11 articles)

1. Foreword

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

   Christophe Paul, Michał Pilipczuk Pages 2133-2134

   Download PDF (283KB) View Article

2. OriginalPaper

   Multi-budgeted Directed Cuts

   Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström Pages 2135-2155

   Download PDF (526KB) View Article

3. OriginalPaper

   A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions

   Kustaa Kangas, Mikko Koivisto, Sami Salonen Pages 2156-2173

   Download PDF (405KB) View Article

4. OriginalPaper

   The Parameterised Complexity of Computing the Maximum Modularity of a Graph

   Kitty Meeks, Fiona Skerman Pages 2174-2199

   Download PDF (464KB) View Article

5. 

   OriginalPaper

   Best-Case and Worst-Case Sparsifiability of Boolean CSPs

   Hubie Chen, Bart M. P. Jansen, Astrid Pieterse Pages 2200-2242

6. 

   OriginalPaper

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

   Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut Pages 2243-2266

7. OriginalPaper

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

   Marc Roth, Johannes Schmitt Pages 2267-2291

   Download PDF (2985KB) View Article

8. OriginalPaper

   Multivariate Analysis of Orthogonal Range Searching and Graph Distances

   Karl Bringmann, Thore Husfeldt, Måns Magnusson Pages 2292-2315

   Download PDF (3173KB) View Article

9. 

   OriginalPaper

   Dual Parameterization of Weighted Coloring

   Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima… Pages 2316-2336

10. 

    OriginalPaper

    Parameterized Leaf Power Recognition via Embedding into Graph Products

    David Eppstein, Elham Havvaei Pages 2337-2359

11. 

    OriginalPaper

    Parameterized Complexity of Independent Set in H-Free Graphs

    Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé… Pages 2360-2394