Program
Every regular talk time slot consists of a 20 minutes talk plus 5 minutes discussion.
Monday, 26.09.2016
12:00 - 12:30 | Registration |
12:30 - 12:45 | Welcome |
12:45 - 13:10 | The Analysis of Big Molecule Data and their Scaffolds based on Maximum Similar Subgraphs Oliver Koch, TU Dortmund Graph-Based Methods for Rational Drug Design |
13:10 - 13:35 | Progress on Algorithmic Foundation of Genome Assembly Anand Srivastav, Christian-Albrechts-Universität zu Kiel Algorithmic Foundation of Genome Assembly |
13:35 - 14:00 | Break |
14:00 - 15:00 | Big Data and Small Devices Katharina Morik, TU Dortmund Invited |
15:00 - 15:25 | Break |
15:25 - 15:50 | Approximate k-List Algorithm Leif Both, Ruhr-Universität Bochum Security-Preserving Operations on Big Data |
17:00 - 17:45 | Social Event: Hövels Brewery |
Tuesday, 27.09.2016
09:00 - 09:25 | A Distributed Perspective on Preprocessing Matthias Mnich, Universität Bonn Kernelization for Big Data |
09:25 - 09:50 | Scaling Up Generic Optimization Soeren Laue, Friedrich-Schiller-Universitaet Jena Scaling Up Generic Optimization |
09:50 - 10:15 | Fast Saddle-Point Optimization for the Ordered Dantzig Selector Sangkyun Lee, TU Dortmund Guest |
10:15 - 10:45 | Break |
10:45 - 11:10 | Approximation and Quick Computation of Centrality Measures in Large Graphs Elisabetta Bergamini, Karlsruhe Institute of Technology Fast Inexact Combinatorial and Algebraic Solvers for Massive Networks |
11:10 - 11:35 | Fast and Memory-Efficient Algorithms for Evacuation Problems Miriam Schlöter, TU Berlin Algorithms for Solving Time-Dependent Routing Problems with Exponential Output Size |
11:35 - 12:00 | I/O-efficient Generation of Massive Graphs Following the LFR Benchmark Manuel Penschuck, Goethe University Frankfurt Big-Data-DynAmO: Dynamic, Approximate, and Online Methods for Big Data |
12:00 - 13:45 | Lunch |
13:45 - 14:10 | Semantic Search on Text and Knowledge Bases Hannah Bast, Universität Freiburg Efficient Semantic Search on Big Data |
14:10 - 14:35 | Security of Schnorr’s Signature in the Multi-User Setting Jiaxin Pan, Ruhr-Universität Bochum Scalable Cryptography |
14:35 - 15:00 | Break |
15:00 - 16:00 | How Faithful is my Visualization? Peter Eades, University of Sydney Invited |
16:00 - 16:15 | Break |
16:15 - 17:15 | Business Meeting |
18:00 - | Lift: Florianturm |
19:00 - 22:00 | Dinner: Florianturm |
Wednesday, 28.09.2016
09:00 - 09:25 | Cooperative Exploration Jan Hackfeld, TU Berlin Competitive Exploration of Large Networks |
09:25 - 09:50 | Analysing Paths in Complex Networks Katharina Zweig, TU Kaiserslautern Local Identification of Central Nodes, Clusters, and Network Motifs in Very Large Complex Networks |
09:50 - 10:15 | Skeleton-based Clustering in Visualizations Mark Ortmann, Universität Konstanz Skeleton-based Clustering in Big and Streaming Social Networks |
10:15 - 10:45 | Break |
10:45 - 11:10 | 3D+T Terabyte Image Analysis (associated) Peter Sanders, Karlsruhe Institute of Technology Massive Text Indices / 3D+T Terabyte Image Analysis |
11:10 - 11:35 | Competitive Algorithms for Monitoring Distributed Data Streams Manuel Malatyali, Paderborn University, Heinz Nixdorf Institute Distributed Data Streams in Dynamic Environments |
11:35 - 12:00 | Engineering a Distributed Full Text Index, Thrill Johannes Fischer, TU Dortmund and Timo Bingmann, Karlsruhe Institute of Technology Massive Text Indices |
12:00 - 12:30 | Closing |
Invited Speakers
Katharina Morik (TU Dortmund)
Big Data and Small Devices
Image source
Peter Eades (University of Sydney)
How faithful is my visualization?
© David Eppstein, CC BY-SA 3.0
Social Events
Excursion
26th of September
Public domain stock photo, CC0
We will visit the Hövels Brewery in Dortmund including an excursion to the production facilities and a final beer tasting.
Dinner
27th of September
© by Lucas Kaufmann, CC-BY-SA 4.0
The dinner will take place at the observation deck (137,54 meters above the ground) of the Florianturm Dortmund.