IPEC 2018 August 20-24, 2018 - Helsinki, Finland

13th International Symposium on Parameterized and Exact Computation (IPEC 2018)



Christophe Paul and Michal Pilipczuk (Eds.)
ISBN 978-3-95977-084-2, LIPICS Vol. 115 ISSN 1868-8969
Additional Information
License
Conference Website
Complete volume (PDF, 13 MB)
Search Publication Server

Authors
  • Agrawal, Akanksha
  • Araújo, Júlio
  • Bannach, Max
  • Barbero, Florian
  • Baste, Julien
  • Bliznets, Ivan
  • Bonnet, Édouard
  • Bousquet, Nicolas
  • Bringmann, Karl
  • Campos, Victor A.
  • Casel, Katrin
  • Charbit, Pierre
  • Chen, Hubie
  • Curticapean, Radu
  • de Kroon, Arnoud A. W. M.
  • de Oliveira Oliveira, Mateus
  • Eppstein, David
  • Fernandes dos Santos, Vinícius
  • Gavenciak, Tomás
  • Havvaei, Elham
  • Husfeldt, Thore
  • Isenmann, Lucas
  • Jaffke, Lars
  • Jain, Pallavi
  • Jansen, Bart M. P.
  • Kanesh, Lawqueen
  • Kangas, Kustaa
  • Knop, Dusan
  • Koivisto, Mikko
  • Komusiewicz, Christian
  • Koutecký, Martin
  • Kratsch, Dieter
  • Kratsch, Stefan
  • Kwon, O-joung
  • Le, Van Bang
  • Li, Shaohua
  • Lima, Carlos Vinícius G. C.
  • Lokshtanov, Daniel
  • Luo, Junjie
  • Magnusson, Måns
  • Marx, Dániel
  • Meeks, Kitty
  • Misra, Pranabendu
  • Molter, Hendrik
  • Morel, Rolf
  • Papadopoulos, Charis
  • Paul, Christophe
  • Pieterse, Astrid
  • Pilipczuk, Marcin
  • Pilipczuk, Michal
  • Roth, Marc
  • Sagunov, Danil
  • Salonen, Sami
  • Sau, Ignasi
  • Saurabh, Saket
  • Schmitt, Johannes
  • Sikora, Florian
  • Silva, Ana
  • Skerman, Fiona
  • Strømme, Torstein J. F.
  • Suchý, Ondrej
  • Tantau, Till
  • Telle, Jan Arne
  • Thiebaut, Jocelyn
  • Thilikos, Dimitrios M.
  • Thomassé, Stéphan
  • Tzimas, Spyridon
  • van Geffen, Bas A. M.
  • Wahlström, Magnus
  • Watrigant, Rémi
  • Zehavi, Meirav
    		•

    		  
    Front Matter, Table of Contents, Preface, Conference Organization
    Authors: Paul, Christophe ; Pilipczuk, Michal

    Abstract | Document (334 KB) | BibTeX

    Counting Problems in Parameterized Complexity
    Authors: Curticapean, Radu

    Abstract | Document (502 KB) | BibTeX

    A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
    Authors: Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.

    Abstract | Document (714 KB) | BibTeX

    Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
    Authors: van Geffen, Bas A. M. ; Jansen, Bart M. P. ; de Kroon, Arnoud A. W. M. ; Morel, Rolf

    Abstract | Document (686 KB) | BibTeX

    Multivariate Analysis of Orthogonal Range Searching and Graph Distances
    Authors: Bringmann, Karl ; Husfeldt, Thore ; Magnusson, Måns

    Abstract | Document (524 KB) | BibTeX

    A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
    Authors: Kangas, Kustaa ; Koivisto, Mikko ; Salonen, Sami

    Abstract | Document (488 KB) | BibTeX

    Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width
    Authors: Jaffke, Lars ; Kwon, O-joung ; Strømme, Torstein J. F. ; Telle, Jan Arne

    Abstract | Document (638 KB) | BibTeX

    A Parameterized Complexity View on Collapsing k-Cores
    Authors: Luo, Junjie ; Molter, Hendrik ; Suchý, Ondrej

    Abstract | Document (576 KB) | BibTeX

    Parameterized Complexity of Multi-Node Hubs
    Authors: Saurabh, Saket ; Zehavi, Meirav

    Abstract | Document (487 KB) | BibTeX

    The Parameterised Complexity of Computing the Maximum Modularity of a Graph
    Authors: Meeks, Kitty ; Skerman, Fiona

    Abstract | Document (502 KB) | BibTeX

    On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
    Authors: Barbero, Florian ; Isenmann, Lucas ; Thiebaut, Jocelyn

    Abstract | Document (600 KB) | BibTeX

    The Parameterized Complexity of Finding Point Sets with Hereditary Properties
    Authors: Eppstein, David ; Lokshtanov, Daniel

    Abstract | Document (423 KB) | BibTeX

    Dual Parameterization of Weighted Coloring
    Authors: Araújo, Júlio ; Campos, Victor A. ; Lima, Carlos Vinícius G. C. ; Fernandes dos Santos, Vinícius ; Sau, Ignasi ; Silva, Ana

    Abstract | Document (545 KB) | BibTeX

    Computing Kernels in Parallel: Lower and Upper Bounds
    Authors: Bannach, Max ; Tantau, Till

    Abstract | Document (463 KB) | BibTeX

    Exploring the Kernelization Borders for Hitting Cycles
    Authors: Agrawal, Akanksha ; Jain, Pallavi ; Kanesh, Lawqueen ; Misra, Pranabendu ; Saurabh, Saket

    Abstract | Document (569 KB) | BibTeX

    Best-Case and Worst-Case Sparsifiability of Boolean CSPs
    Authors: Chen, Hubie ; Jansen, Bart M. P. ; Pieterse, Astrid

    Abstract | Document (504 KB) | BibTeX

    Parameterized Leaf Power Recognition via Embedding into Graph Products
    Authors: Eppstein, David ; Havvaei, Elham

    Abstract | Document (562 KB) | BibTeX

    Parameterized Complexity of Independent Set in H-Free Graphs
    Authors: Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre ; Thomassé, Stéphan ; Watrigant, Rémi

    Abstract | Document (534 KB) | BibTeX

    Multi-Budgeted Directed Cuts
    Authors: Kratsch, Stefan ; Li, Shaohua ; Marx, Dániel ; Pilipczuk, Marcin ; Wahlström, Magnus

    Abstract | Document (754 KB) | BibTeX

    Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
    Authors: Komusiewicz, Christian ; Kratsch, Dieter ; Le, Van Bang

    Abstract | Document (424 KB) | BibTeX

    Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
    Authors: Papadopoulos, Charis ; Tzimas, Spyridon

    Abstract | Document (478 KB) | BibTeX

    Integer Programming in Parameterized Complexity: Three Miniatures
    Authors: Gavenciak, Tomás ; Knop, Dusan ; Koutecký, Martin

    Abstract | Document (604 KB) | BibTeX

    Solving Target Set Selection with Bounded Thresholds Faster than 2^n
    Authors: Bliznets, Ivan ; Sagunov, Danil

    Abstract | Document (538 KB) | BibTeX

    Resolving Conflicts for Lower-Bounded Clustering
    Authors: Casel, Katrin

    Abstract | Document (459 KB) | BibTeX

    Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
    Authors: Roth, Marc ; Schmitt, Johannes

    Abstract | Document (511 KB) | BibTeX

    A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem
    Authors: Lokshtanov, Daniel ; de Oliveira Oliveira, Mateus ; Saurabh, Saket

    Abstract | Document (537 KB) | BibTeX

    The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration
    Authors: Bonnet, Édouard ; Sikora, Florian

    Abstract | Document (529 KB) | BibTeX

    		  



    DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI