ALGO 2018: Detailed ALGO program
Please see the ALGO schedule for a quick overview, and the conference venue page for the locations of the halls. You can also download the ALGO program as a PDF file.
All regular talks have 25-minute slots: 20 minutes for the presentation and 5 minutes for questions and for changing speakers.
Monday, 20 August 2018
session chair: Joachim Spoerhase
9:50
Coffee break
11:25
Break
11:30
hall A
hall A
12:30
Lunch
session chair: Guilherme D. Da Fonseca
Minimization of Testing Costs in Capacity-Constrained Database Migration
Community Detection via Minimum Spanning Tree Computations
Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud
session chair: Dora Souliou
15:15
Coffee break
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Multi-Commodity Flow with In-Network Processing
session chair: Martin Skutella
16:50
Break
session chair: Matthias Englert
18:15
Break
ESA business meeting
Tuesday, 21 August 2018
session chair: Martin Skutella
An Overview of Big Data Issues in Privacy-Preserving Record Linkage
Web Frameworks Metrics for Data Handling and Visualization
Algorithms for Cloud-based Smart Mobility
session chair: Vassilis Verykios
9:50
Coffee break
A Frequent Itemset Hiding Toolbox
On-line Big–Data Processing for Visual Analytics with Argus-Panoptes
session chair: Christos Zaroliagis
ALGOCLOUD business meeting
11:25
Break
11:30
hall A
hall A
12:30
Lunch
ESA track A best student paper
session chair: Yossi Azar
ESA track B best student paper
session chair: Hannah Bast
14:25
Break
15:45
Break
16:00
Walk to Market Square
17:00
19:00
Wednesday, 22 August 2018
session chair: Matthias Müller-Hannemann
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
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
session chair: Esko Ukkonen
12:30
Lunch
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
session chair: Thomas Erlebach
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:50
Break
18:00
Walk to City Hall
19:00
Thursday, 23 August 2018
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
Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks
Competitive Routing in Hybrid Communication Networks
10:15
Coffee break
Parameterized Leaf Power Recognition via Embedding into Graph Products
Parameterized Complexity of Independent Set in H-Free Graphs
session chair: Michał Pilipczuk
session chair: Leah Epstein
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
On the Maximum Connectivity Improvement problem
11:25
Break
11:30
hall A
hall A
12:30
Lunch
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
session chair: Gerhard Woeginger
Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model
Mutual Visibility by Asynchronous Robots on Infinite Grid
Optimal Gathering by Asynchronous Oblivious Robots in Hypercubes
Railway Disruption Management: State-of-the-art in practice and new research directions
session chair: Ralf Borndörfer
15:15
Coffee break
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
Schedule, Support, Adjust, and Fix: Topology Control Revolutions for Data-Aware Networks
16:50
Break
IPEC business meeting
Barrier Coverage Problem in 2D
Time- and Energy-aware Task Scheduling in Environmentally-powered Sensor Networks
Mobility-Aware, Adaptive Algorithms for Wireless Power Transfer in Ad Hoc Networks
18:15
Break
ATMOS business meeting
Friday, 24 August 2018
Distributed leader election and computation of local identifiers for programmable matter
Reaching Consensus in Ad-Hoc Diffusion Networks
Filling Arbitrary Connected Areas by Silent Robots with Minimal Visibility Range
10:15
Coffee break
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
session chair: Kim S. Larsen
Localization of MR Records with Missing RSSI Information
Orientation Estimation using Filter-Based Inertial Data Fusion for Posture Recognition
session chair: Guillaume Sagnol
11:25
Break
11:30
hall A
hall A
Some Easy and Some Not So Easy Geometric Optimization Problems
session chair: Thomas Erlebach
12:30
Lunch
15:15
Coffee break — the end of ALGO 2018