|
ALGO 2016
[ Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
all ]
Wednesday 24/8 |
|
ESA 1 |
ESA 2 |
WABI |
IPEC |
| 08:30-09:00 |
Registration |
| 09:00-10:15 |
Session 11A: Sorting and
Matching
Chair: Ulrich Meyer |
Session 11B: FPT
Chair: Michał Pilipczuk |
Session 11C
Chair: Thomas Mailund |
Session 11D
Chair: Christian Komusiewicz |
| 09:00 |
Stefan Edelkamp, Armin WeißBlockQuicksort:
Avoiding Branch Mispredictions in Quicksort |
Karl Bringmann, László Kozma, Shay Moran,
N. S. Narayanaswamy
Hitting Set for Hypergraphs of Low VC-dimension |
Anna Bomersbach, Marco Chiarandini and
Fabio Vandin
An Efficient Branch and Cut Algorithm to Find Frequently Mutated
Subnetworks in Cancer |
Akanksha Agrawal,
Sushmita Gupta, Saket Saurabh and Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback
Vertex Set |
| 09:25 |
Juha Kärkkäinen, Dominik Kempa
Faster External Memory LCP Array Construction |
Krzysztof Fleszar, Matthias Mnich, Joachim
Spoerhase
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness |
Alexander Loboda, Maxim Artyomov and
Alexey Sergushichev:
Solving Generalized Maximum-Weight Connected Subgraph Problem for Network
Enrichment Analysis |
Eva--Lotta Teutrine
and Matthias Mnich:
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments |
| 09:50 |
Shay Golan, Tsvi Kopelowitz, Ely
Porat
Streaming Pattern Matching with d Wildcards |
Édouard Bonnet, László Egri, Dániel
Marx
Fixed-Parameter Approximability of Boolean MinCSPs |
Sven Jager, Benjamin Schiller, Thorsten
Strufe and Kay Hamacher:
StreAM-Tg: Algorithms for Analyzing Coarse Grained RNA Dynamics Based on
Markov Models of Connectivity-Graphs |
Diptapriyo
Majumdar:
Structural Parameterizations of Feedback Vertex Set |
| 10:15-10:35 |
Coffee Break |
| 10:35-11:25 |
Session 12A: Optimization
II
Chair: Andreas Karrenbauer |
Session 12B: Geomery
IV
Chair: Nodari Sitchinava |
Session 12C
Chair: Michal Ziv-Ukelson |
Session 12D
Chair: Matthias Mnich |
| 10:35 |
Ralf Borndörfer, Heide Hoppmann, Marika
Karbstein
Separation of Cycle Inequalities for the Periodic Timetabling Problem |
Huck Bennett, Daniel Dadush, Noah
Stephens-Davidowitz
On the Lattice Distortion Problem |
Yannis Almirantis, Panagiotis
Charalampopoulos, Jia Gao, Costas Iliopoulos, Manal Mohamed, Solon Pissis and
Dimitris Polychronopoulos: Optimal Computation of Avoided Words |
Michal
Wlodarczyk:
Clifford algebras meet tree decompositions |
| 11:00 |
Alantha Newman, Heiko Röglin, Johanna
Seif
The Alternating Stock Size Problem and the Gasoline Puzzle |
Haitao Wang
On the Geodesic Centers of Polygonal Domains |
Brian Brubach:
Further Improvement in Approximating the Maximum Duo-Preservation String
Mapping Problem |
Willem Pino, Hans
L. Bodlaender and Johan M. M. Van Rooij:
Cut and Count and Representative Sets on Branch Decompositions |
| 11:25-11:30 |
Break |
| 11:30-12:30 |
ESA Invited
Giuseppe Italiano
2-Connectivity in Directed Graphs
Chair: Gerth Stølting Brodal |
| 12:30-14:00 |
Lunch |
| 14:00-15:15 |
Session 13A: Online
Algorithms II
Chair: Monaldo Mastrolilli |
Session 13B: Graph
Classes
Chair: Stefan Kratsch |
Session 13C
Chair: Christian N. S. Pedersen |
Session 13D
Chair: Danny Hermelin |
| 14:00 |
Marcin Bienkowski, Martin Böhm, Jaroslaw
Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri
Sgall, Nguyen Kim Thang, Pavel Vesely
Online Algorithms for Multi-Level Aggregation |
Hiro Ito
Every Property Is Testable on a Natural Class of Scale-Free Multigraphs |
Christopher Schröder and Sven
Rahmann:
A Hybrid Parameter Estimation Algorithm for Beta Mixtures and Applications
to Methylation State Classification |
Archontia
Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios Thilikos
and Marcin Wrochna: Cutwidth:
obstructions and algorithmic aspects |
| 14:25 |
Chris Schwiegelshohn, Uwe
Schwiegelshohn
The Power of Migration for Online Slack Scheduling |
Daniel Neuen
Graph Isomorphism for Unit Square Graphs |
Emilie Renard, Samuel Branders and
Pierre-Antoine Absil:
Independent Component Analysis to Remove Batch Effects from Merged
Microarray Datasets |
Serge Gaspers,
Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele:
Turbocharging Treewidth Heuristics |
| 14:50 |
Giorgio Lucarelli, Nguyen Kim Thang,
Abhinav Srivastav, Denis Trystram
Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on
Duality |
Thomas Bläsius, Tobias Friedrich, Anton
Krohmer
Hyperbolic Random Graphs: Separators and Treewidth |
Dan Deblasio and John Kececioglu:
Predicting Core Columns of Protein Multiple Sequence Alignments for
Improved Parameter Advising |
Yasuaki Kobayashi
and Hisao Tamaki:
Treedepth parameterized by vertex cover number |
| 15:15-15:30 |
Break |
| 15:30-17:10 |
Session 14A: Dynamic
Algorithms
Chair: Gerth Stølting Brodal |
Session 14B: Geometry V
Chair: Nodari Sitchinava |
|
Session 14D
Chair: Thore Husfeldt |
| 15:30 |
Casper Kejlberg-Rasmussen, Tsvi
Kopelowitz, Seth Pettie, Mikkel Thorup
Faster Worst Case Deterministic Dynamic Connectivity |
Clément Maria,
Jonathan Spreer
Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type
Invariants |
Hans L. Bodlaender,
Hirotaka Ono and Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion |
| 15:55 |
Monika Henzinger, Stefan Neumann
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning |
Moritz Baum, Thomas
Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
Scalable Exact Visualization of Isocontours in Road Networks via
Minimum-Link Paths |
Andrew van der Poel
and Blair D. Sullivan:
A Fast Parameterized Algorithm for Co-Path Set |
| 16:20 |
Gramoz Goranci,
Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time |
Jian Li, Wei Zhan
Almost All Even Yao-Yao Graphs Are Spanners |
Marcin Pilipczuk,
Michał Pilipczuk and Marcin Wrochna:
Edge Bipartization faster than 2^k |
| |
| 16:45 |
Greg Bodwin,
Sebastian Krinninger
Fully Dynamic Spanners with Worst-Case Update Time |
*CANCELLED TALK*
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen,
Marcel Roeloffzen, Shakhar Smorodinsky
On Interference Among Moving Sensors and Related Problems |
Mithilesh Kumar and
Daniel Lokshtanov:
A 2lk Kernel for l-Component Order Connectivity |
| 17:10-17:25 |
|
Break |
| 17:25-18:15 |
PACE 2016
Winner Announcement
Chair: Bart Jansen |
| |
|
| 18:00-... |
Barbecue (Mathematics canteen) |
|
|
|
|
|