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
hall D
A complexity dichotomy for hitting small planar minors parameterized by treewidth
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
session chair: Magnus Wahlström
9:50
Coffee break
10:10
hall D
hall D
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Generalized distance domination problems and their complexity on graphs of bounded mim-width
session chair: Christophe Paul
11:25
Break
11:30
hall A
hall A
From Clustering to Variant Discovery: Algorithmics Opportunities in Microbiome Research
12:30
Lunch
14:00
hall D
hall D
A Parameterized Complexity View on Collapsing k-Cores
Parameterized Complexity of Multi-Node Hubs
The parameterised complexity of computing the maximum modularity of a graph
session chair: Christian Komusiewicz
15:15
Coffee break
15:35
hall D
hall D
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
The Parameterized Complexity of Finding Point Sets with Hereditary Properties
Dual parameterization of Weighted Coloring
session chair: Erik Jan van Leeuwen
16:50
Break
17:00
hall D
hall D
17:50
Break
18:00
Walk to City Hall
19:00
Thursday, 23 August 2018
9:00
hall A
hall A
Computing Kernels in Parallel: Lower and Upper Bounds
Exploring the Kernelization Borders for Hitting Cycles
Best-case and Worst-case Sparsifiability of Boolean CSPs
session chair: Marcin Pilipczuk
10:15
Coffee break
10:35
hall A
hall A
Parameterized Leaf Power Recognition via Embedding into Graph Products
Parameterized Complexity of Independent Set in H-Free Graphs
session chair: Michał Pilipczuk
11:25
Break
11:30
hall A
hall A
12:30
Lunch
14:00
hall A
hall A
Multi-budgeted directed cuts
Matching Cut: Kernelization, Single-Exponential FPT, and Exact Exponential Algorithms
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
session chair: Danny Hermelin
15:15
Coffee break
15:35
hall A
hall A
Integer Programming in Parameterized Complexity: Three Miniatures
Solving Target Set Selection with Bounded Thresholds Faster than 2n
Resolving Conflicts for Lower-Bounded Clustering
session chair: Stefan Kratsch
16:50
Break
17:00
hall A
hall A
IPEC business meeting
Friday, 24 August 2018
9:00
hall A
hall A
10:15
Coffee break
10:35
hall A
hall A
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
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
hall A
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).