IPEC 2019 September 11-13, 2019, Munich, Germany

14th International Symposium on Parameterized and Exact Computation (IPEC 2019)



Bart M. P. Jansen and Jan Arne Telle (Eds.)
ISBN 978-3-95977-129-0, LIPICS Vol. 148 ISSN 1868-8969
Additional Information
License
Conference Website
Complete volume (PDF, 14 MB)
Search Publication Server

Authors
  • Berendsohn, Benjamin Aram
  • Bessy, Stéphane
  • Bläser, Markus
  • Blum, Johannes
  • Bonnet, Édouard
  • Bougeret, Marin
  • Bressan, Marco
  • Carneiro, Alan D. A.
  • Chitnis, Rajesh
  • C. M. Gomes, Guilherme
  • Cormode, Graham
  • Da Lozzo, Giordano
  • Dreier, Jan
  • Duarte, Gabriel L.
  • Dzulfikar, M. Ayaz
  • Engels, Christian
  • Eppstein, David
  • Eto, Hiroshi
  • Feldmann, Andreas Emil
  • Fichte, Johannes K.
  • Fluschnik, Till
  • Foucaud, Florent
  • Fuchs, Janosch
  • Gao, Jiawei
  • Göke, Alexander
  • Golovach, Petr A.
  • Goodrich, Michael T.
  • Gupta, Siddharth
  • Hamm, Thekla
  • Hanaka, Tesshu
  • Hartmann, Tim A.
  • Hecher, Markus
  • Hocquard, Hervé
  • Husic, Edin
  • Iwata, Yoichi
  • Jansen, Bart M. P.
  • Kobayashi, Yasuaki
  • Kobayashi, Yusuke
  • Kozma, László
  • Kuinke, Philipp
  • Lajou, Dimitri
  • Lokshtanov, Daniel
  • Marx, Dániel
  • Mendoza Cadena, Lydia Mirabel
  • Mitsou, Valia
  • Mnich, Matthias
  • Niedermeier, Rolf
  • Novotná, Jana
  • Okrasa, Karolina
  • Pedrosa, Lehilton L. C.
  • Pierron, Théo
  • Pilipczuk, Michal
  • Protti, Fábio
  • Purohit, Nidhi
  • Rohm, Valentin
  • Rosenthal, Gregory
  • Rossmanith, Peter
  • Rzazewski, Pawel
  • Sau, Ignasi
  • Schouery, Rafael C. S.
  • Souza, Uéverton S.
  • Tauer, Bjoern
  • Telle, Jan Arne
  • Thilikos, Dimitrios M.
  • Thomassé, Stéphan
  • Trotignon, Nicolas
  • van Leeuwen, Erik Jan
  • Walczak, Bartosz
  • Wang, Hung-Lung
  • Zschoche, Philipp
    		•

    		  
    Front Matter, Table of Contents, Preface, Conference Organization
    Authors: Jansen, Bart M. P. ; Telle, Jan Arne

    Abstract | Document (328 KB) | BibTeX

    Finding and Counting Permutations via CSPs
    Authors: Berendsohn, Benjamin Aram ; Kozma, László ; Marx, Dániel

    Abstract | Document (538 KB) | BibTeX

    Width Parameterizations for Knot-Free Vertex Deletion on Digraphs
    Authors: Bessy, Stéphane ; Bougeret, Marin ; Carneiro, Alan D. A. ; Protti, Fábio ; Souza, Uéverton S.

    Abstract | Document (956 KB) | BibTeX

    Parameterized Valiant's Classes
    Authors: Bläser, Markus ; Engels, Christian

    Abstract | Document (478 KB) | BibTeX

    Hierarchy of Transportation Network Parameters and Hardness Results
    Authors: Blum, Johannes

    Abstract | Document (531 KB) | BibTeX

    Metric Dimension Parameterized by Treewidth
    Authors: Bonnet, Édouard ; Purohit, Nidhi

    Abstract | Document (534 KB) | BibTeX

    Faster Subgraph Counting in Sparse Graphs
    Authors: Bressan, Marco

    Abstract | Document (767 KB) | BibTeX

    Towards a Theory of Parameterized Streaming Algorithms
    Authors: Chitnis, Rajesh ; Cormode, Graham

    Abstract | Document (671 KB) | BibTeX

    FPT Inapproximability of Directed Cut and Connectivity Problems
    Authors: Chitnis, Rajesh ; Feldmann, Andreas Emil

    Abstract | Document (674 KB) | BibTeX

    C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
    Authors: Da Lozzo, Giordano ; Eppstein, David ; Goodrich, Michael T. ; Gupta, Siddharth

    Abstract | Document (1,517 KB) | BibTeX

    The Complexity of Packing Edge-Disjoint Paths
    Authors: Dreier, Jan ; Fuchs, Janosch ; Hartmann, Tim A. ; Kuinke, Philipp ; Rossmanith, Peter ; Tauer, Bjoern ; Wang, Hung-Lung

    Abstract | Document (794 KB) | BibTeX

    Hardness of FO Model-Checking on Random Graphs
    Authors: Dreier, Jan ; Rossmanith, Peter

    Abstract | Document (505 KB) | BibTeX

    Computing the Largest Bond of a Graph
    Authors: Duarte, Gabriel L. ; Lokshtanov, Daniel ; Pedrosa, Lehilton L. C. ; Schouery, Rafael C. S. ; Souza, Uéverton S.

    Abstract | Document (518 KB) | BibTeX

    Parameterized Algorithms for Maximum Cut with Connectivity Constraints
    Authors: Eto, Hiroshi ; Hanaka, Tesshu ; Kobayashi, Yasuaki ; Kobayashi, Yusuke

    Abstract | Document (658 KB) | BibTeX

    Multistage Vertex Cover
    Authors: Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp

    Abstract | Document (587 KB) | BibTeX

    Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
    Authors: Foucaud, Florent ; Hocquard, Hervé ; Lajou, Dimitri ; Mitsou, Valia ; Pierron, Théo

    Abstract | Document (573 KB) | BibTeX

    On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs
    Authors: Gao, Jiawei

    Abstract | Document (641 KB) | BibTeX

    Resolving Infeasibility of Linear Systems: A Parameterized Approach
    Authors: Göke, Alexander ; Mendoza Cadena, Lydia Mirabel ; Mnich, Matthias

    Abstract | Document (653 KB) | BibTeX

    Clustering to Given Connectivities
    Authors: Golovach, Petr A. ; Thilikos, Dimitrios M.

    Abstract | Document (693 KB) | BibTeX

    Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
    Authors: C. M. Gomes, Guilherme ; Sau, Ignasi

    Abstract | Document (564 KB) | BibTeX

    Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time
    Authors: Hamm, Thekla

    Abstract | Document (589 KB) | BibTeX

    The Independent Set Problem Is FPT for Even-Hole-Free Graphs
    Authors: Husic, Edin ; Thomassé, Stéphan ; Trotignon, Nicolas

    Abstract | Document (601 KB) | BibTeX

    Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
    Authors: Iwata, Yoichi ; Kobayashi, Yusuke

    Abstract | Document (506 KB) | BibTeX

    Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
    Authors: Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michal ; Rzazewski, Pawel ; van Leeuwen, Erik Jan ; Walczak, Bartosz

    Abstract | Document (706 KB) | BibTeX

    Beating Treewidth for Average-Case Subgraph Isomorphism
    Authors: Rosenthal, Gregory

    Abstract | Document (593 KB) | BibTeX

    The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
    Authors: Dzulfikar, M. Ayaz ; Fichte, Johannes K. ; Hecher, Markus

    Abstract | Document (910 KB) | BibTeX

    		  



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