IPEC 2017 September 6-8, 2017 - Vienna, Austria

12th International Symposium on Parameterized and Exact Computation (IPEC 2017)



Daniel Lokshtanov and Naomi Nishimura (Eds.)
ISBN 978-3-95977-051-4, LIPICS Vol. 89 ISSN 1868-8969
Additional Information
License
Conference Website
Complete volume (PDF, 16 MB)
Search Publication Server


Authors
  • Agrawal, Akanksha
  • Arvind, Vikraman
  • Baste, Julien
  • Björklund, Andreas
  • Bodlaender, Hans L.
  • Bonnet, Édouard
  • Bottesch, Ralph
  • Bougeret, Marin
  • Brettell, Nick
  • Cardinal, Jean
  • Chandrasekaran, Karthekeyan
  • Curticapean, Radu
  • de Berg, Mark
  • Dell, Holger
  • Della Croce, Federico
  • Duraj, Lech
  • Eppstein, David
  • Fichte, Johannes K.
  • Fomin, Fedor V.
  • Gözüpek, Didem
  • Garraffa, Michele
  • Giannopoulos, Panos
  • Goldberg, Leslie Ann
  • Golovach, Petr A.
  • Hecher, Markus
  • Heggernes, Pinar
  • Hlineny, Petr
  • Hols, Eva-Maria C.
  • Jaffke, Lars
  • Jansen, Bart M. P.
  • Köbler, Johannes
  • Künnemann, Marvin
  • Karpov, Nikolai
  • Kaski, Petteri
  • Kisfaludi-Bak, Sándor
  • Kobayashi, Yasuaki
  • Komusiewicz, Christian
  • Kratsch, Stefan
  • Kuhnert, Sebastian
  • Kurz, Denis
  • Kwon, O-joung
  • Lampis, Michael
  • Lapinskas, John
  • Lima, Paloma T.
  • Lokshtanov, Daniel
  • Manoussakis, George
  • Marx, Dániel
  • Mitsou, Valia
  • Montealegre, Pedro
  • Morak, Michael
  • Mozaffari, Sahand
  • Nishimura, Naomi
  • Nummenpalo, Jerri
  • Ohtsuka, Hiromu
  • Paul, Christophe
  • Pieterse, Astrid
  • Pilipczuk, Marcin
  • Pokrývka, Filip
  • Polak, Adam
  • Roy, Bodhayan
  • Sau, Ignasi
  • Saurabh, Saket
  • Shalom, Mordechai
  • Shang, Lei
  • T'Kindt, Vincent
  • Tale, Prafullkumar
  • Talmon, Nimrod
  • Tamaki, Hisao
  • Telle, Jan Arne
  • Thilikos, Dimitrios M.
  • Torán, Jacobo
  • van der Zanden, Tom C.
  • Weller, Mathias
  • Welzl, Emo
  • Williams, Ryan
  • Woeginger, Gerhard
  • Woltran, Stefan
  • Wrochna, Marcin
  • Zych-Pawlewicz, Anna

  •   
    Front Matter, Table of Contents, Preface, Conference Organization
    Authors: Lokshtanov, Daniel ; Nishimura, Naomi

    Abstract | Document (312 KB) | BibTeX

    On the Parameterized Complexity of Contraction to Generalization of Trees
    Authors: Agrawal, Akanksha ; Saurabh, Saket ; Tale, Prafullkumar

    Abstract | Document (533 KB) | BibTeX

    Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
    Authors: Arvind, Vikraman ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo

    Abstract | Document (601 KB) | BibTeX

    Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter
    Authors: Baste, Julien ; Gözüpek, Didem ; Paul, Christophe ; Sau, Ignasi ; Shalom, Mordechai ; Thilikos, Dimitrios M.

    Abstract | Document (710 KB) | BibTeX

    Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
    Authors: Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.

    Abstract | Document (741 KB) | BibTeX

    Contraction-Bidimensionality of Geometric Intersection Graphs
    Authors: Baste, Julien ; Thilikos, Dimitrios M.

    Abstract | Document (1,190 KB) | BibTeX

    Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants
    Authors: Björklund, Andreas ; Kaski, Petteri ; Williams, Ryan

    Abstract | Document (502 KB) | BibTeX

    Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms
    Authors: Bonnet, Édouard ; Brettell, Nick ; Kwon, O-joung ; Marx, Dániel

    Abstract | Document (604 KB) | BibTeX

    On the Parameterized Complexity of Red-Blue Points Separation
    Authors: Bonnet, Édouard ; Giannopoulos, Panos ; Lampis, Michael

    Abstract | Document (574 KB) | BibTeX

    Relativization and Interactive Proof Systems in Parameterized Complexity Theory
    Authors: Bottesch, Ralph

    Abstract | Document (541 KB) | BibTeX

    How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
    Authors: Bougeret, Marin ; Sau, Ignasi

    Abstract | Document (779 KB) | BibTeX

    Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
    Authors: Cardinal, Jean ; Nummenpalo, Jerri ; Welzl, Emo

    Abstract | Document (533 KB) | BibTeX

    Odd Multiway Cut in Directed Acyclic Graphs
    Authors: Chandrasekaran, Karthekeyan ; Mozaffari, Sahand

    Abstract | Document (595 KB) | BibTeX

    A Fixed-Parameter Perspective on #BIS
    Authors: Curticapean, Radu ; Dell, Holger ; Fomin, Fedor V. ; Goldberg, Leslie Ann ; Lapinskas, John

    Abstract | Document (587 KB) | BibTeX

    The Dominating Set Problem in Geometric Intersection Graphs
    Authors: de Berg, Mark ; Kisfaludi-Bak, Sándor ; Woeginger, Gerhard

    Abstract | Document (783 KB) | BibTeX

    Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
    Authors: Duraj, Lech ; Künnemann, Marvin ; Polak, Adam

    Abstract | Document (635 KB) | BibTeX

    K-Best Solutions of MSO Problems on Tree-Decomposable Graphs
    Authors: Eppstein, David ; Kurz, Denis

    Abstract | Document (498 KB) | BibTeX

    DynASP2.5: Dynamic Programming on Tree Decompositions in Action
    Authors: Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan

    Abstract | Document (1,104 KB) | BibTeX

    Finding Connected Secluded Subgraphs
    Authors: Golovach, Petr A. ; Heggernes, Pinar ; Lima, Paloma T. ; Montealegre, Pedro

    Abstract | Document (529 KB) | BibTeX

    FO Model Checking of Geometric Graphs
    Authors: Hlineny, Petr ; Pokrývka, Filip ; Roy, Bodhayan

    Abstract | Document (502 KB) | BibTeX

    Smaller Parameters for Vertex Cover Kernelization
    Authors: Hols, Eva-Maria C. ; Kratsch, Stefan

    Abstract | Document (530 KB) | BibTeX

    Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width
    Authors: Jaffke, Lars ; Kwon, O-joung ; Telle, Jan Arne

    Abstract | Document (744 KB) | BibTeX

    Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
    Authors: Jansen, Bart M. P. ; Pieterse, Astrid

    Abstract | Document (616 KB) | BibTeX

    Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor
    Authors: Jansen, Bart M. P. ; Pilipczuk, Marcin ; Wrochna, Marcin

    Abstract | Document (549 KB) | BibTeX

    An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
    Authors: Karpov, Nikolai ; Pilipczuk, Marcin ; Zych-Pawlewicz, Anna

    Abstract | Document (529 KB) | BibTeX

    An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization
    Authors: Kobayashi, Yasuaki ; Ohtsuka, Hiromu ; Tamaki, Hisao

    Abstract | Document (525 KB) | BibTeX

    Treewidth with a Quantifier Alternation Revisited
    Authors: Lampis, Michael ; Mitsou, Valia

    Abstract | Document (458 KB) | BibTeX

    An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs
    Authors: Manoussakis, George

    Abstract | Document (434 KB) | BibTeX

    Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem
    Authors: Shang, Lei ; Garraffa, Michele ; Della Croce, Federico ; T'Kindt, Vincent

    Abstract | Document (684 KB) | BibTeX

    Computing Treewidth on the GPU
    Authors: van der Zanden, Tom C. ; Bodlaender, Hans L.

    Abstract | Document (492 KB) | BibTeX

    The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
    Authors: Dell, Holger ; Komusiewicz, Christian ; Talmon, Nimrod ; Weller, Mathias

    Abstract | Document (631 KB) | BibTeX

      




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