Program for stream Graphs and Networks

WC-13: Applications of Networks
Stream: Graphs and Networks
Room: ZEU/147/Z
Chair(s): Bernard Fortz

• Power potential, power and dominance in social networks – an entropy-driven approach
  Andreas Dellnitz
• Influence maximization with competition in social networks
  Michael Kahr, Markus Leitner, Mario Ruthmair, Markus Sinnl
• Dynamic Adaptive Discretization Techniques for the Pooling Problem
  Sascha Kuhnke, Akshay Gupte, Arie Koster
• New models and preprocessing techniques for segment routing optimization
  Bernard Fortz

WD-13: Heuristics for Graph Problems
Stream: Graphs and Networks
Room: ZEU/147/Z
Chair(s): Sascha Gritzbach

• Usage of Uniform Deployment for Heuristic Design of Emergency System
  Marek Kvet, Jaroslav Janacek
• Uniform deployment of the p-location problem solutions
  Jaroslav Janacek, Marek Kvet
• Negative Cycle Canceling for the Wind Farm Cabling Problem
  Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf

TA-13: Network Models
Stream: Graphs and Networks
Room: ZEU/147/Z
Chair(s): Christoph Helmberg

• Algorithms and Complexity for the Almost Equal Flow Problem
  Till Heller, Rebekka Haese, Sven Krumke
• On Location Interdiction Problems in Networks
  Nicolas Fröhlich, Stefan Ruzika
• Robust Network Optimization with Consistent Flow Constraints
  Sabrina Schmitz, Christina Büsing, Arie Koster
• Dynamic Aggregation of Time-expanded Network Flows
  Anja Hähle, Christoph Helmberg

TE-13: Special Graph Structures
Stream: Graphs and Networks
Room: ZEU/147/Z
Chair(s): Markus Sinnl

• Exact Solutions for the Steiner Path Problem on Special Graph Classes
  Jochen Rethmann, Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Egon Wanke
• Subset Sum Problems with Special Digraph Constraints
  Frank Gurski, Dominique Komander, Carolin Rehs
• On algorithmic approaches for the S-labeling problem
  Markus Sinnl