×

13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. (English) Zbl 1407.68042

LIPIcs – Leibniz International Proceedings in Informatics 115. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-084-2). xiv, 26 articles, not consecutively paged, electronic only, open access (2019).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1387.68026].
Indexed articles:
Curticapean, Radu, Counting problems in parameterized complexity, Article 1, 18 p. [Zbl 1520.68047]
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M., A complexity dichotomy for hitting small planar minors parameterized by treewidth, Article 2, 13 p. [Zbl 1520.68109]
van Geffen, Bas A. M.; Jansen, Bart M. P.; De Kroon, Arnoud A. W. M.; Morel, Rolf, Lower bounds for dynamic programming on planar graphs of bounded cutwidth, Article 3, 14 p. [Zbl 1520.68128]
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns, Multivariate analysis of orthogonal range searching and graph distances, Article 4, 13 p. [Zbl 1520.68115]
Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami, A faster tree-decomposition based algorithm for counting linear extensions, Article 5, 13 p. [Zbl 1520.68218]
Jaffke, Lars; Kwon, O-Joung; Strømme, Torstein J. F.; Telle, Jan Arne, Generalized distance domination problems and their complexity on graphs of bounded mim-width, Article 6, 14 p. [Zbl 1520.05073]
Luo, Junjie; Molter, Hendrik; Suchý, Ondřej, A parameterized complexity view on collapsing \(k\)-cores, Article 7, 14 p. [Zbl 1503.68228]
Saurabh, Saket; Zehavi, Meirav, Parameterized complexity of multi-node hubs, Article 8, 14 p. [Zbl 1520.68051]
Meeks, Kitty; Skerman, Fiona, The parameterised complexity of computing the maximum modularity of a graph, Article 9, 14 p. [Zbl 1520.68050]
Barbero, Florian; Isenmann, Lucas; Thiebaut, Jocelyn, On the distance identifying set meta-problem and applications to the complexity of identifying problems on graphs, Article 10, 14 p. [Zbl 1520.68107]
Eppstein, David; Lokshtanov, Daniel, The parameterized complexity of finding point sets with hereditary properties, Article 11, 14 p. [Zbl 1520.68048]
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; Fernandes, Dos Santos Viníícius; Sau, Ignasi; Silva, Ana, Dual parameterization of weighted coloring, Article 12, 14 p. [Zbl 1520.68106]
Bannach, Max; Tantau, Till, Computing kernels in parallel: lower and upper bounds, Article 13, 14 p. [Zbl 1520.68044]
Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu; Saurabh, Saket, Exploring the kernelization borders for hitting cycles, Article 14, 14 p. [Zbl 1520.68043]
Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid, Best-case and worst-case sparsifiability of Boolean CSPs, Article 15, 13 p. [Zbl 1520.68177]
Eppstein, David; Havvaei, Elham, Parameterized leaf power recognition via embedding into graph products, Article 16, 14 p. [Zbl 1520.68121]
Bonnet, Édouard; Bousquet, Nicolas; Charbit, Pierre; Thomassé, Stéphan; Watrigant, Rémi, Parameterized complexity of independent set in \(H\)-free graphs, Article 17, 13 p. [Zbl 1520.68045]
Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus, Multi-budgeted directed cuts, Article 18, 14 p. [Zbl 1477.68237]
Komusiewicz, Christian; Kratsch, Dieter; Van Bang Le, Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms, Article 19, 13 p. [Zbl 1516.68067]
Papadopoulos, Charis; Tzimas, Spyridon, Subset feedback vertex set on graphs of bounded independent set size, Article 20, 14 p. [Zbl 1520.68127]
Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin, Integer programming in parameterized complexity: three miniatures, Article 21, 16 p. [Zbl 1520.68049]
Bliznets, Ivan; Sagunov, Danil, Solving target set selection with bounded thresholds faster than \(2^n\), Article 22, 14 p. [Zbl 1520.68110]
Casel, Katrin, Resolving conflicts for lower-bounded clustering, Article 23, 14 p. [Zbl 1520.68220]
Roth, Marc; Schmitt, Johannes, Counting induced subgraphs: a topological approach to #W[1]-hardness, Article 24, 14 p. [Zbl 1502.68135]
Lokshtanov, Daniel; De Oliveira, Oliveira Mateus; Saurabh, Saket, A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem, Article 25, 13 p. [Zbl 1520.68123]
Bonnet, Édouard; Sikora, Florian, The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration, Article 26, 15 p. [Zbl 1520.68114]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q25 Analysis of algorithms and problem complexity
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1387.68026
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] and Worst-Case Sparsifiability of Boolean CSPs Hubie Chen, Bart M. P. Jansen, and Astrid Pieterse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15:1-15:13
[2] Parameterized Complexity of Independent Set in H-Free Graphs Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, and Rémi Watrigant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17:1-17:13
[3] Magnus Wahlström . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18:1-18:14
[4] Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms Christian Komusiewicz, Dieter Kratsch, and Van Bang Le . . . . . . . . . . . . . . . . . . . . . . . 19:1-19:13 · Zbl 1516.68067
[5] Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size Charis Papadopoulos and Spyridon Tzimas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1-20:14
[6] Integer Programming in Parameterized Complexity: Three Miniatures Tomáš Gavenčiak, Dušan Knop, and Martin Koutecký . . . . . . . . . . . . . . . . . . . . . . . . . . . 21:1-21:16 · Zbl 1520.68049
[7] Solving Target Set Selection with Bounded Thresholds Faster than 2 n Ivan Bliznets and Danil Sagunov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22:1-22:14 · Zbl 1520.68110
[8] Resolving Conflicts for Lower-Bounded Clustering Katrin Casel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23:1-23:14 · Zbl 1520.68220
[9] Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness · Zbl 1452.68086
[10] Marc Roth and Johannes Schmitt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24:1-24:14 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem Daniel Lokshtanov, Mateus de Oliveira Oliveira, and Saket Saurabh . . . . . . . . . . . . . . 25:1-25:13
[11] The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration Édouard Bonnet and Florian Sikora . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26:1-26:15
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.