Helsinki · Finland

20–24 August 2018

ALGO2018

IPEC 2018: Program

13th International Symposium on Parameterized and Exact Computation

Please see the ALGO 2018 web pages for the full ALGO program and for a quick overview of the ALGO schedule.

Wednesday, 22 August 2018
9:00
hall D
Julien Baste · Ignasi Sau · Dimitrios M. Thilikos
A complexity dichotomy for hitting small planar minors parameterized by treewidth
Bas A.M. van Geffen · Bart M. P. Jansen · Arnoud A. W. M. de Kroon · Rolf Morel
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
session chair: Magnus Wahlström
9:50
Coffee break
10:10
hall D
Karl Bringmann · Thore Husfeldt · Måns Magnusson
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
Juho-Kustaa Kangas · Mikko Koivisto · Sami Salonen
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Lars Jaffke · O-Joung Kwon · Torstein J. F. Strømme · Jan Arne Telle
Generalized distance domination problems and their complexity on graphs of bounded mim-width
session chair: Christophe Paul
11:25
Break
11:30
hall A
Mihai Pop
From Clustering to Variant Discovery: Algorithmics Opportunities in Microbiome Research
12:30
Lunch
14:00
hall D
Junjie Luo · Hendrik Molter · Ondrej Suchy
A Parameterized Complexity View on Collapsing k-Cores
Saket Saurabh · Meirav Zehavi
Parameterized Complexity of Multi-Node Hubs
Kitty Meeks · Fiona Skerman
The parameterised complexity of computing the maximum modularity of a graph
session chair: Christian Komusiewicz
15:15
Coffee break
15:35
hall D
Lucas Isenmann · Florian Barbero · Jocelyn Thiebaut
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
David Eppstein · Daniel Lokshtanov
The Parameterized Complexity of Finding Point Sets with Hereditary Properties
Júlio Araújo · Victor A. Campos · Carlos Vinícius G. C. Lima · Vinícius Fernandes Dos Santos · Ignasi Sau · Ana Silva
Dual parameterization of Weighted Coloring
session chair: Erik Jan van Leeuwen
16:50
Break
17:00
hall D
17:50
Break
18:00
Walk to City Hall
Thursday, 23 August 2018
9:00
hall A
Max Bannach · Till Tantau
Computing Kernels in Parallel: Lower and Upper Bounds
Akanksha Agrawal · Pallavi Jain · Lawqueen Kanesh · Pranabendu Misra · Saket Saurabh
Exploring the Kernelization Borders for Hitting Cycles
Hubie Chen · Bart M. P. Jansen · Astrid Pieterse
Best-case and Worst-case Sparsifiability of Boolean CSPs
session chair: Marcin Pilipczuk
10:15
Coffee break
10:35
hall A
David Eppstein · Elham Havvaei
Parameterized Leaf Power Recognition via Embedding into Graph Products
Édouard Bonnet · Nicolas Bousquet · Pierre Charbit · Stéphan Thomassé · Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs
session chair: Michał Pilipczuk
11:25
Break
11:30
hall A
Stefan Kratsch · Magnus Wahlström
session chair: Christophe Paul
12:30
Lunch
14:00
hall A
Stefan Kratsch · Shaohua Li · Dániel Marx · Marcin Pilipczuk · Magnus Wahlström
Multi-budgeted directed cuts
Christian Komusiewicz · Dieter Kratsch · Van Bang Le
Matching Cut: Kernelization, Single-Exponential FPT, and Exact Exponential Algorithms
Charis Papadopoulos · Spyridon Tzimas
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
session chair: Danny Hermelin
15:15
Coffee break
15:35
hall A
Tomáš Gavenčiak · Dušan Knop · Martin Koutecky
Integer Programming in Parameterized Complexity: Three Miniatures
Ivan Bliznets · Danil Sagunov
Solving Target Set Selection with Bounded Thresholds Faster than 2n
Katrin Casel
Resolving Conflicts for Lower-Bounded Clustering
session chair: Stefan Kratsch
16:50
Break
17:00
hall A
IPEC business meeting
Friday, 24 August 2018
9:00
hall A
Radu Curticapean
Counting Problems in Parameterized Complexity
session chair: Michał Pilipczuk
10:15
Coffee break
10:35
hall A
Marc Roth · Johannes Schmitt
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
Mateus De Oliveira Oliveira · Daniel Lokshtanov · Saket Saurabh
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem
session chair: Radu Curticapean
11:25
Break
11:30
hall A
Gerhard Woeginger
Some Easy and Some Not So Easy Geometric Optimization Problems
12:30
Lunch

PACE challenge

IPEC 2018 will have a session presenting the results of the 3rd Parameterized Algorithms and Computational Experiments Challenge (PACE 2018).