|
ALGO 2016
[ Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
all ]
Monday 22/8 |
|
ESA 1 |
ESA 2 |
WABI |
ALGOCLOUD |
08:30-09:00 |
Registration |
09:00-10:15 |
Session 1A: Online
Algorithms I
Chair: Guy Even |
Session 1B: Geometry I
Chair: Piotr Sankowski |
Session 1C
Chair: Christian N. S. Pedersen |
Session 1D
Chair: T. Sellis |
09:00 |
Dror
Rawitz, Adi Rosén
Online Budgeted Maximum Coverage |
Erin Chambers, Irina Kostitsyna, Maarten Löffler, Frank
Staals
Homotopy Measures for Representative Trajectories |
Lianrong Pu, Daming Zhu and Haitao Jiang:
A New Approximation Algorithm for Unsigned Translocation Sorting |
ALGOCLOUD
invited
Volker Markl
Big Data
Management
and
Scalable Data
Science:
Key Challenges
and (Some)
Solutions |
09:25 |
Thomas Kesselheim, Andreas Tönnis
Think Eternally: Improved Algorithms for the Temp Secretary Problem and
Extensions |
Quirijn W. Bouts, Irina Irina Kostitsyna, Marc van Kreveld,
Wouter Meulemans, Willem Sonke, Kevin Verbeek
Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance |
Diego P. Rubert, Pedro Feijao, Marilia Braga, Jens
Stoye and Fábio V. Martinez:
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with
Bounded Number of Duplicates |
09:50 |
Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon
Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias
Friedrich
Probabilistic Routing for On-Street Parking Search |
Kiril Solovey, Dan Halperin
Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching |
Guillaume Fertin, Geraldine Jean and Eric
Tannier:
Genome Rearrangements on Both Gene Order and Intergenic Regions |
10:15-10:35 |
Coffee Break |
10:35-11:25 |
Session 2A: Clustering
Chair: Kasper Green Larsen |
Session 2B: Parametrized
Distances
Chair: Piotr Sankowski |
Session 2C
Chair: Martin Frith |
Session 2D: Software Tools
and Distributed Architectures for Cloud-based Data Management I.
Chair: T. Sellis |
10:35 |
Pavel Kolev, Kurt Mehlhorn
A Note On Spectral Clustering |
Ely Porat, Eduard Shahbazian, Roei Tov
New Parameterized Algorithms for APSP in Directed Graphs |
Marius Erbert, Steffen Rechner and Matthias
Müller-Hannemann:
Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support |
Ioannis Kokotinis, Marios
Kendea, Nikolaos Nodarakis, Angeliki Rapti, Spyros Sioutas, Athanasios
Tsakalidis, Dimitrios Tsolis and Yannis Panagis:
NSM-Tree: Efficient Indexing on Top of NoSQL Databases |
11:00 |
Tim Roughgarden, Joshua R. Wang
The Complexity of the k-means Method |
Davide Bilo, Luciano Guala, Stefano Leucci, Guido
Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances |
Yaron Orenstein, David Pellow, Guillaume Marcais,
Ron Shamir and Carl Kingsford:
Compact Universal k-mer Hitting Sets |
Alexandros Baltas, Andreas
Kanavos and Athanasios Tsakalidis:
An Apache Spark Implementation for Sentiment Analysis on Twitter Data |
11:25-11:30 |
Break |
11:30-12:30 |
ESA Invited
Ola Svennson
Algorithms with provable guarantees for clustering
Chair: Piotr Sankowski |
12:30-14:00 |
Lunch |
14:00-15:15 |
Session 3A: Distributed
Algorithms
Chair: Dorothea Wagner |
Session 3B: Exponential
Algorithms
Chair: Bart M. P. Jansen |
Session 3C
Chair: Paola Bonizzoni |
Session 3D:
Algorithmic Aspects of Large-Scale Data Stores I.
Chair: Y. Panagis |
14:00 |
Moran Feldman, Moshe Tennenholtz, Omri Weinstein
Distributed Signaling Games |
Jesper Nederlof
Finding Large Set Covers Faster via the Representation Method |
Broňa Brejová, Askar Gafurov, Dana Pardubska, Michal
Sabo and Tomas Vinar:
Isometric Gene Tree Reconciliation Revisited |
Vasileios Kassiano,
Anastasios Gounaris, Apostolos N. Papadopoulos and Kostas Tsichlas:
Mining Uncertain Graphs: An Overview |
14:25 |
Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik
Mallmann-Trenn, Chris Wastell
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load
Balancing |
Andrew Drucker, Jesper Nederlof, Rahul Santhanam
Exponential Time Paradigms Through the Polynomial Time Lens |
Daniel Doerr, Pedro Feijao, Metin Balaban and Cedric
Chauve:
The Gene Family-Free Median of Three |
Ioannis Giannakopoulos,
Ioannis Konstantinou, Dimitrios Tsoumakos and Nectarios Koziris:
Recovering from Cloud Application Deployment Failures through Re-execution |
14:50 |
Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega,
Andrew Winslow, Tim Wylie
Optimal Staged Self-Assembly of General Shapes |
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter
Rote, Antonis Thomas, Takeaki Uno
Approximation and Hardness of Token Swapping |
Riccardo Dondi, Nadia El-Mabrouk and Manuel
Lafond:
Correction of Weighted Orthology and Paralogy Relations - Complexity and
Algorithmic Results |
Nikolaos Korasidis, Ioannis
Giannakopoulos, Katerina Doka, Dimitrios Tsoumakos and Nectarios
Koziris:
Fair, Fast and Frugal Large-Scale Matchmaking for VM Placement |
15:15-15:30 |
Break |
15:30-16:45 |
Session 4A: Optimization
I
Chair: Ola Svensson |
Session 4B: Algorithmic Game
Theory
Chair: Hiro Ito |
Session 4C
Chair: Martin Frith |
Session 4D:
Algorithmic Aspects of Large-Scale Data Stores II
Chair: I. Giannakopoulos |
15:30 |
Markus Chimani, Tilo Wiedera
An ILP-based Proof System for the Crossing Number Problem |
George Christodoulou, Martin Gairing, Sotiris Nikoletseas,
Christoforos Raptopoulos and Paul Spirakis:
Strategic Contention Resolution with Limited Feedback |
Qiang Kou, Si Wu, Nikola Tolic, Ljiljana
Pasa-Tolic and Xiaowen Liu:
Mass graphs and their applications in top-down proteomics |
Spyros Sioutas, Phivos
Mylonas, Alexandros Panaretos, Panagiotis Gerolymatos, Dimitrios Vogiatzis,
Eleftherios Karavaras, Thomas Spitieris and Andreas Kanavos:
Survey of machine learning algorithms on Spark over DHT-based Structures |
15:55 |
Matthias Mnich, Virginia Vassilevska Williams, László A.
Végh
A 7/3-Approximation for Feedback Vertex Sets in Tournaments |
Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn
Computing Equilibria in Markets with Budget-Additive Utilities |
Matthieu David, Guillaume Fertin and Dominique
Tessier:
SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra
Identification |
Yannis Panagis and Evangelos
Sakkopoulos:
Scaling out to become doctrinal: Using Hadoop to study the case-law of
international courts |
16:20 |
Riley Murray, Megan Chao, Samir
Khuller
Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and
LP-based Approximation Algorithms |
Ruta Mehta, Ioannis Panageas, Georgios
Piliouras, Sadra Yazdanbod
The Computational Complexity of Genetic Diversity |
Ludovic Gillet, Simon Rösch, Thomas
Tschager and Peter Widmayer:
A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric
Difference Between Explained and Measured Masses |
Ioannis Karydis, Spyros Sioutas, Markos Avlonitis, Phivos Mylonas
and Andreas Kanavos:
A Survey on Big Data and Collective Intelligence |
16:45-17:00 |
Break |
17:00-18:15 |
Session 5A: Graph
Matchings
Chair: Piotr Sankowski |
Session 5B: Geometry
II
Chair: Stefan Schirra |
|
Session 5D:
Software Tools and Distributed Architectures for Cloud-based Data
Management II.
Chair: A.Kanavos |
17:00 |
Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein
Esfandiari, MohammadTaghi Hajiaghayi, Mahini Hamid, Xiaowei Wu
Beating Ratio 0.5 for Weighted Oblivious Matching Problems |
Mikkel Abrahamsen, Bartosz Walczak
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and
Constant Workspace |
Nikolaos Nodarakis, Angeliki
Rapti, Spyros Sioutas, Athanasios Tsakalidis, Dimitrios Tsolis, Giannis
Tzimas and Yannis Panagis:
(A)kNN Query Processing on the Cloud: A Survey |
17:25 |
Brian Brubach, Karthik Abinav Sankararaman, Aravind
Srinivasan, Pan Xu
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic
Matching |
Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu
Roy
Packing and Covering with Non-Piercing Regions |
Kalliopi Giannakopoulou,
Spyros Kontogiannis, Georgia Papastavrou and Christos Zaroliagis:
A Cloud-based Time-Dependent Routing Service |
17:50 |
Christoph Dürr, Christian Konrad, Marc Renault
On the Power of Advice and Randomization for Online Bipartite Matching |
Édouard Bonnet, Tillmann Miltzow
Parameterized Hardness of Art Gallery Problems |
Ioannis Petalas, Ahmad
Ammari, Panagiotis Georgakis and Christopher Nwagboso:
A Big data architecture for Traffic Forecasting using Multi-source
Information |
18:15-18:30 |
Break |
18:30-... |
ESA business meeting / Welcome reception |
|
|
|
|
|