Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications.
In: Proceedings of the 19th International Symposium on Experimental Algorithms (SEA'21), volume 190 of Leibniz International Proceedings in Informatics, June 2021.
Accepted for publication.
Joint work with Valentin Buchhold.
Fast, Exact and Scalable Dynamic Ridesharing.
In:
Proceedings of the 23rd SIAM Symposium on Algorithm Engineering and Experiments (ALENEX'21), pages 98–112. SIAM, January 2021.
Joint work with Valentin Buchhold and Peter Sanders.
[
html |
pdf ]
The Complexity of Flow Expansion and Electrical Flow Expansion.
In:
Proceedings of the 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'21), Lecture Notes in Computer Science, pages 431–441. Springer, 2021.
Joint work with Matthias Wolf.
[
html |
pdf ]
Customizable Contraction Hierarchies with Turn Costs.
In:
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'20), OpenAccess Series in Informatics (OASIcs), pages 9:1–9:15, September 2020.
Joint work with Valentin Buchhold, Tim Zeitz, and Michael Zündorf.
[
html |
pdf ]
An Efficient Solution for One-to-Many Multi-Modal Journey Planning.
In:
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'20), OpenAccess Series in Informatics (OASIcs), pages 1:1–1:15, September 2020.
Joint work with Jonas Sauer and Tobias Zündorf.
[
html |
pdf ]
Integrating ULTRA and Trip-Based Routing.
In:
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'20), OpenAccess Series in Informatics (OASIcs), pages 4:1–4:15, September 2020.
Joint work with Jonas Sauer and Tobias Zündorf.
[
html |
pdf ]
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks.
In:
Proceedings of the 28th Annual European Symposium on Algorithms (ESA'20), Leibniz International Proceedings in Informatics, September 2020.
Joint work with Ben Strasser and Tim Zeitz.
[
html ]
Zipping Segment Trees.
In:
Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of
Leibniz International Proceedings in Informatics, June 2020.
Joint work with Lukas Barth.
[
html ]
Engineering Exact Quasi-Threshold Editing.
In:
Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of
Leibniz International Proceedings in Informatics, pages 10:1–10:14, June 2020.
Joint work with Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, and Sven Zühlsdorf.
[
html |
pdf ]
Advanced Flow-Based Multilevel Hypergraph Partitioning.
In:
Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of
Leibniz International Proceedings in Informatics, pages 11:1–11:15, June 2020.
Joint work with Lars Gottesbüren, Michael Hamann, and Sebastian Schlag.
[
html |
pdf ]
Faster Multi-Modal Route Planning with Bike Sharing Using ULTRA.
In:
Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of
Leibniz International Proceedings in Informatics, pages 16:1–16:14, June 2020.
Joint work with Jonas Sauer and Tobias Zündorf.
[
html |
pdf ]
Engineering Top-Down Weight-Balanced Trees.
In:
Proceedings of the 22nd Symposium on Algorithm Engineering and Experiments (ALENEX'20). SIAM, January 2020.
Joint work with Lukas Barth.
[
pdf ]
Negative Cycle Canceling with Neighborhood Heuristics for the Wind Farm Cabling Problem.
In:
Proceedings of the Eleventh ACM International Conference on Future Energy Systems (ACM e-Energy '20), pages 299–307. ACM Press, 2020.
Joint work with Sascha Gritzbach and Matthias Wolf.
[
html |
pdf ]
Preventing Critical Edges when Designing Transmission Networks.
In:
Proceedings of the Eleventh ACM International Conference on Future Energy Systems (ACM e-Energy '20), pages 264–278. ACM Press, 2020.
Joint work with Matthias Wolf.
[
html |
pdf ]
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort.
In:
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL'19), pages 379–388. ACM Press, November 2019.
Joint work with Valentin Buchhold and Peter Sanders.
[
html ]
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA.
In:
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL'19). ACM Press, November 2019.
Joint work with Jonas Sauer and Tobias Zündorf.
[
html |
pdf ]
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution.
In:
Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of
Leibniz International Proceedings in Informatics, pages 14:1–14:16, September 2019.
Joint work with Moritz Baum, Valentin Buchhold, Jonas Sauer, and Tobias Zündorf.
[
html |
pdf ]
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
In:
Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of
Leibniz International Proceedings in Informatics, pages 52:1–52:17, September 2019.
Joint work with Lars Gottesbüren and Michael Hamann.
[
html ]
Engineering Negative Cycle Canceling for Wind Farm Cabling.
In:
Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of
Leibniz International Proceedings in Informatics, pages 55:1–55:16, September 2019.
Joint work with Sascha Gritzbach, Torsten Ueckerdt, Franziska Wegner, and Matthias Wolf.
[
html ]
Shaving Peaks by Augmenting the Dependency Graph.
In:
Proceedings of the Tenth ACM e-Energy International Conference on Future Energy Systems (e-Energy '19). ACM Press, 2019.
Joint work with Lukas Barth.
[
html |
pdf ]
Industrial Demand-Side Flexibility: A Benchmark Data Set.
In:
Proceedings of the Tenth ACM e-Energy International Conference on Future Energy Systems (e-Energy '19). ACM Press, 2019.
Joint work with Nicole Ludwig, Lukas Barth, and Veit Hagenmeyer.
[
html |
pdf ]
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.
In:
Proceedings of the 17th International Symposium on Experimental Algorithms (SEA'18), volume 103 of
Leibniz International Proceedings in Informatics, pages 27:1–27:15, June 2018.
Joint work with Valentin Buchhold and Peter Sanders.
[
html |
pdf ]
How much demand side flexibility do we need?: Analyzing where to exploit flexibility in industrial processes.
In:
Proceedings of the 9th ACM e-Energy International Conference on Future Energy Systems (ACM e-Energy'18). ACM Press, 2018.
Joint work with Lukas Barth, Veit Hagenmeyer, and Nicole Ludwig.
[
pdf ]
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
In:
Proceedings of the 26th Annual European Symposium on Algorithms (ESA'18), Leibniz International Proceedings in Informatics, pages 11:1–11:15, 2018.
Joint work with Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
[
html |
pdf ]
The Maximum Transmission Switching Flow Problem.
In:
Proceedings of the 9th ACM e-Energy International Conference on Future Energy Systems (ACM e-Energy'18), pages 340–360. ACM Press, 2018.
Joint work with Alban Grastien, Ignaz Rutter, Franziska Wegner, and Matthias Wolf.
[
html ]
Towards negative cycle canceling in wind farm cable layout optimization.
In:
Proceedings of the 7th DACH+ Conference on Energy Informatics, volume 1 (Suppl 1). Springer, 2018.
Joint work with Sascha Gritzbach, Torsten Ueckerdt, Franziska Wegner, and Matthias Wolf.
[
html ]
Distributed Graph Clustering Using Modularity and Map Equation.
In:
Proceedings of the 24th International Conference on Parallel Processing (Euro-Par 2018), volume 11014 of
Lecture Notes in Computer Science, pages 688–702. Springer, 2018.
Joint work with Michael Hamann, Ben Strasser, and Tim Zeitz.
[
html ]
A Geometric Heuristic for Rectilinear Crossing Minimization.
In:
Proceedings of the 20th Meeting on Algorithm Engineering and Experiments (ALENEX'18), pages 129–138. SIAM, 2018.
Joint work with Marcel Radermacher, Klara Reichard, and Ignaz Rutter.
[
html ]
Time-Dependent Route Planning for Truck Drivers.
In:
Proceedings of the 8th International Conference on Computational Logistics (ICCL'17), volume 10572 of
Lecture Notes in Computer Science, pages 110–126. Springer, October 2017.
Joint work with Alexander Kleff, Christian Bräuer, Frank Schulz, Valentin Buchhold, and Moritz Baum.
[
html ]
Exploiting flexibility in smart grids at scale.
In:
Proceedings of the 6th DACH+ Conference on Energy Informatics, Computer Science - Research and Development. Springer, September 2017.
Joint work with Lukas Barth.
[
html |
pdf ]
Efficient Traffic Assignment for Public Transit Networks.
In:
Proceedings of the 16th International Symposium on Experimental Algorithms (SEA'17), volume 75 of
Leibniz International Proceedings in Informatics, pages 20:1–20:14, 2017.
Joint work with Lars Briem, H. Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, and Tobias Zündorf.
[
html |
pdf ]
Integrating public transport into mobiTopp.
In:
Proceedings of the 6th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS'17), pages 855–860. Elsevier B.V., 2017.
Joint work with Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, and Tobias Zündorf.
[
html |
pdf ]
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles.
In:
Proceedings of the 25th Annual European Symposium on Algorithms (ESA'17), volume 87 of
Leibniz International Proceedings in Informatics, pages 11:1–11:16, 2017.
Joint work with Moritz Baum, Julian Dibbelt, and Tobias Zündorf.
[
html |
pdf ]
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications.
In:
Proceedings of the 16th International Symposium on Experimental Algorithms (SEA'17), volume 75 of
Leibniz International Proceedings in Informatics, pages 19:1–19:18, 2017.
Joint work with Moritz Baum, Jonas Sauer, and Tobias Zündorf.
[
html |
pdf ]
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
In:
Proceedings of the 19th Meeting on Algorithm Engineering and Experiments (ALENEX'17), pages 58–72. SIAM, 2017.
Joint work with Michael Hamann, Ulrich Meyer, and Manuel Penschuck.
[
html ]
Improved Oracles for Time-Dependent Road Networks.
In:
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'17), volume 59 of
OpenAccess Series in Informatics (OASIcs), pages 4:1–4:17, 2017.
Joint work with Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, and Christos Zaroliagis.
[
html |
pdf ]
A Simulated-Annealing-Based Approach for Wind Farm Cabling.
In:
Proceedings of the 8th ACM e-Energy International Conference on Future Energy Systems (ACM eEnergy'17), pages 203–215. ACM Press, 2017.
Joint work with Sebastian Lehmann, Ignaz Rutter, and Franziska Wegner.
[
html ]
Benchmark Generator for Dynamic Overlapping Communities in Networks.
In:
Proceedings of the 2017 IEEE International Conference on Data Mining, pages 415–424. IEEE Computer Society, 2017.
Joint work with Neha Sengupta and Michael Hamann.
[
html |
pdf ]
Public Transit Routing with Unrestricted Walking.
In:
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'17), volume 59 of
OpenAccess Series in Informatics (OASIcs), pages 7:1–7:14, 2017.
Joint work with Tobias Zündorf.
[
html |
pdf ]
Hierarchical Oracles for Time-Dependent Networks.
In:
27th International Symposium on Algorithms and Computation (ISAAC'16), Leibniz International Proceedings in Informatics, pages 47:1–47:13, December 2016.
Joint work with Spyros Kontogiannis and Christos Zaroliagis.
[
html |
pdf ]
Fast Exact Computation of Isochrones in Road Networks.
In:
Proceedings of the 15th International Symposium on Experimental Algorithms (SEA'16), volume 9685 of
Lecture Notes in Computer Science, pages 17–32. Springer, June 2016.
Joint work with Moritz Baum, Valentin Buchhold, and Julian Dibbelt.
[
html ]
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences.
In:
Proceedings of the 15th International Symposium on Experimental Algorithms (SEA'16), volume 9685 of
Lecture Notes in Computer Science, pages 33–49. Springer, June 2016.
Joint work with Moritz Baum, Julian Dibbelt, and Thomas Pajor.
[
html ]
Engineering Oracles for Time-Dependent Road Networks.
In:
Proceedings of the 18th Meeting on Algorithm Engineering and Experiments (ALENEX'16), pages 1–14. SIAM, 2016.
Joint work with Spyros Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, and Christos Zaroliagis.
[
html |
pdf ]
Towards Realistic Pedestrian Route Planning.
In:
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'15), volume 48 of
OpenAccess Series in Informatics (OASIcs), pages 1–15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, September 2015.
Joint work with Simeon Danailov Andreev, Julian Dibbelt, Martin Nöllenburg, and Thomas Pajor.
[
pdf ]
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles.
In:
Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 44:1–44:10. ACM Press, 2015.
Joint work with Moritz Baum, Julian Dibbelt, Andreas Gemsa, and Tobias Zündorf.
[
html |
pdf ]
Fast Quasi-Threshold Editing.
In: Proceedings of the 23rd Annual European Symposium on Algorithms (ESA'15), volume 9294 of Lecture Notes in Computer Science, pages 251–262. Springer, 2015.
Joint work with Ulrik Brandes, Michael Hamann, and Ben Strasser.
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs.
In:
Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 66:1–66:4. ACM Press, 2015.
Joint work with Julian Dibbelt and Ben Strasser.
[
pdf ]
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
In: Proceedings of the 17th Meeting on Algorithm Engineering and Experiments (ALENEX'15), pages 147–158. SIAM, 2015.
Joint work with Spyros Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, and Christos Zaroliagis.
Operating Power Grids with few Flow Control Buses.
In:
Proceedings of the 6th ACM e-Energy International Conference on Future Energy Systems, pages 289–294. ACM Press, 2015.
Full version available at
http://arxiv.org/abs/1505.05747.
Joint work with Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, and Franziska Wegner.
[
html ]
Structure-Preserving Sparsification of Social Networks.
In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE, 2015.
Joint work with Gerd Lindner, Christian Staudt, Michael Hamann, and Henning Meyerhenke.
Towards Realistic Flow Control in Power Grid Operation.
In:
Proceedings of the 4th D-A-CH Conference on Energy Informatics, volume 9424 of
Lecture Notes in Computer Science, pages 192–199. Springer, 2015.
Joint work with Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, and Franziska Wegner.
[
html ]
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
In:
Proceedings of the 2015 SIAM International Conference on Data Mining, pages 100–108. SIAM, 2015.
Joint work with Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, and Tanja Hartmann.
[
html ]
Local Broadcasting with Arbitrary Transmission Power in the SINR Model.
In: Proceedings of the 21th International Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, pages 180–193. Springer, July 2014.
Joint work with Fabian Fuchs.
Speed-Consumption Tradeoff for Electric Vehicle Route Planning.
In:
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'14), volume 42 of
OpenAccess Series in Informatics (OASIcs), pages 138–151. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.
Joint work with Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, and Thomas Pajor.
[
html |
pdf ]
Online Dynamic Power Management with Hard Real-Time Guarantees.
In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS'14), Leibniz International Proceedings in Informatics, pages 226–238, 2014.
Joint work with Jian-Jia Chen, Mong-Jen Kao, Der-Tsai Lee, and Ignaz Rutter.
Customizable Contraction Hierarchies.
In:
Proceedings of the 13th International Symposium on Experimental Algorithms (SEA'14), volume 8504 of
Lecture Notes in Computer Science, pages 271–282. Springer, 2014.
Joint work with Julian Dibbelt and Ben Strasser.
[
pdf ]
Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time.
In:
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'14), volume 42 of
OpenAccess Series in Informatics (OASIcs), pages 2:1–2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.
Joint work with Julian Dibbelt and Ben Strasser.
[
pdf ]
Graph Clustering with Surprise: Complexity and Exact Solutions.
In:
Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'14), volume 8327 of
Lecture Notes in Computer Science, pages 223–234. Springer, 2014.
Joint work with Tobias Fleck and Andrea Kappes.
[
html ]
Connection Scan Accelerated.
In: Proceedings of the 16th Meeting on Algorithm Engineering and Experiments (ALENEX'14), pages 125–137. SIAM, 2014.
Joint work with Ben Strasser.
Algorithmische Herausforderungen bei der multimodalen Routenplanung.
In: Heureka 2014, 2014.
Search-Space Size in Contraction Hierarchies.
In: Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13), volume 7965 of Lecture Notes in Computer Science, pages 93–104. Springer, 2013.
Joint work with Reinhard Bauer, Tobias Columbus, and Ignaz Rutter.
Column-based Graph Layouts.
In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 236–247. Springer, 2013.
Joint work with Gregor Betz, Christof Doll, Andreas Gemsa, and Ignaz Rutter.
Energy-Optimal Routes for Electric Vehicles.
In:
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 54–63. ACM Press, 2013.
Joint work with Moritz Baum, Julian Dibbelt, and Thomas Pajor.
[
html ]
Optimal Orthogonal Graph Drawing with Convex Bend Costs.
In: Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13), volume 7965 of Lecture Notes in Computer Science, pages 184–195. Springer, 2013.
Joint work with Thomas Bläsius and Ignaz Rutter.
Computing Multimodal Journeys in Practice.
In:
Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of
Lecture Notes in Computer Science, pages 260–271. Springer, 2013.
Joint work with Daniel Delling, Julian Dibbelt, Thomas Pajor, and Renato F. Werneck.
[
pdf ]
Intriguingly Simple and Fast Transit Routing.
In:
Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of
Lecture Notes in Computer Science, pages 43–54. Springer, 2013.
Joint work with Julian Dibbelt, Thomas Pajor, and Ben Strasser.
[
pdf ]
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.
In:
Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13), pages 170–184, 2013.
Joint work with Fabian Fuchs.
[
pdf ]
Efficient Computation of Jogging Routes.
In:
Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of
Lecture Notes in Computer Science, pages 272–283. Springer, 2013.
Joint work with Andreas Gemsa, Thomas Pajor, and Tobias Zündorf.
[
html |
pdf ]
Complete Hierarchical Cut-Clustering: A Case Study on Expansion and Modularity.
In:
Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge, volume 588 of
DIMACS Book, pages 157–170. American Mathematical Society, 2013.
Joint work with Michael Hamann and Tanja Hartmann.
[
html ]
Hierarchies of Predominantly Connected Communities.
In:
Algorithms and Data Structures, 13th International Symposium (WADS'13), volume 8037 of
Lecture Notes in Computer Science, pages 365–377. Springer, 2013.
Full version available at
http://arxiv.org/abs/1305.0757.
Joint work with Michael Hamann and Tanja Hartmann.
[
html ]
A Practical Approach for Finding Small Independent, Distance Dominating Sets in Large-Scale Graphs.
In: 13th International Conference on Algorithms and Architectures for Parallel Processing , volume 8286 of Lecture Notes in Computer Science, pages 157–164. Springer, 2013.
Joint work with Liang Zhao and Hiroshi Kadowaki.
Higher Order City Voronoi Diagrams .
In: Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12), volume 7357 of Lecture Notes in Computer Science, pages 59–70. Springer, July 2012.
Joint work with Andreas Gemsa, Der-Tsai Lee, and Chih-Hung Liu.
On the Complexity of Partitioning Graphs for Arc-Flags.
In:
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12), volume 25 of
OpenAccess Series in Informatics (OASIcs), pages 71–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.
Joint work with Reinhard Bauer, Moritz Baum, and Ignaz Rutter.
[
html |
pdf ]
Generalizing Geometric Graphs.
In:
Proceedings of the 19th International Symposium on Graph Drawing (GD'11), Lecture Notes in Computer Science, pages 179–190. Springer, 2012.
Joint work with Edith Brunel, Andreas Gemsa, Marcus Krug, and Ignaz Rutter.
[
html ]
User-Constrained Multi-Modal Route Planning.
In:
Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), pages 118–129. SIAM, 2012.
Joint work with Julian Dibbelt and Thomas Pajor.
[
pdf ]
Simulation-based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks.
In:
Proceedings of the 1st Mediterranean Conference on Algorithms, pages 188–202. Springer, 2012.
Joint work with Fabian Fuchs and Markus Völker.
[
html |
pdf ]
An Efficient Generator for Clustered Dynamic Random Networks.
In: Proceedings of the 1st Mediterranean Conference on Algorithms, pages 219–233. Springer, 2012.
Joint work with Robert Görke, Roland Kluge, Andrea Schumm, and Christian Staudt.
Higher Order City Voronoi Diagrams.
In: Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12), pages 245–248, 2012.
Joint work with Andreas Gemsa, Der-Tsai Lee, and Chih-Hung Liu.
Experiments on Density-Constrained Graph Clustering.
In:
Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), pages 1–15. SIAM, 2012.
Joint work with Robert Görke and Andrea Schumm.
[
html |
pdf ]
Fast and Simple Fully-Dynamic Cut Tree Construction.
In:
Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12), volume 7676 of
Lecture Notes in Computer Science, pages 95–104. Springer, 2012.
Full version available at
http://digbib.ubka.uni-karlsruhe.de/volltexte/1000030004.
Joint work with Tanja Hartmann.
[
html ]
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
In: Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12), volume 7676 of Lecture Notes in Computer Science, pages 75–84. Springer, 2012.
Joint work with Mong-Jen Kao, Jian-Jia Chen, Der-Tsai Lee, and Ignaz Rutter.
Static and Dynamic Aspects of Scientific Collaboration Networks.
In: Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pages 522–526. IEEE Computer Society, 2012.
Joint work with Christian Staudt, Andrea Schumm, Henning Meyerhenke, and Robert Görke.
Force-Directed Tracking in Wireless Networks using Signal Strength and Step Recognition.
In:
Proceedings of the International Conference on Localization and GNSS (ICL-GNSS '12), pages 1–8. IEEE Computer Society, 2012.
Joint work with Markus Völker, Johannes Schmid, Tobias Gädeke, and K.D. Müller-Glaser.
[
html |
pdf ]
Orthogonal Graph Drawing with Flexibility Constraints.
In:
Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of
Lecture Notes in Computer Science, pages 92–104. Springer, 2011.
Joint work with Thomas Bläsius, Marcus Krug, and Ignaz Rutter.
[
html ]
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
In:
Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of
Lecture Notes in Computer Science, pages 338–349. Springer, 2011.
Full version available at
http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022456.
Joint work with Christof Doll and Tanja Hartmann.
[
html ]
Density-Constrained Graph Clustering.
In:
Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of
Lecture Notes in Computer Science, pages 679–690. Springer, 2011.
Joint work with Robert Görke and Andrea Schumm.
[
html ]
Connecting Two Trees with Optimal Routing Cost.
In:
Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11), pages 43–47. University of Toronto Press, 2011.
Joint work with Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, and Ignaz Rutter.
[
html |
pdf ]
The Density Maximization Problem in Graphs.
In: Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11), volume 6842 of Lecture Notes in Computer Science, pages 25–36. Springer, 2011.
Joint work with Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, and Ignaz Rutter.
Constructing Optimal Shortcuts in Directed Weighted Paths and Trees.
In: Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11), 2011.
Joint work with Rolf Klein, Marcus Krug, Elmar Langetepe, and Der-Tsai Lee.
Speed Dating: An Algorithmic Case Study Involving Matching and Scheduling.
In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of Lecture Notes in Computer Science, pages 292–303. Springer, 2011.
Joint work with Bastian Katz, Ignaz Rutter, and Ben Strasser.
An Experimental Study on Generating Planar Graphs.
In:
Proceedings of the 7th International Conference on Algorithmic Aspects in Information and Management (AAIM'11), volume 6681 of
Lecture Notes in Computer Science, pages 375–387. Springer, 2011.
Joint work with Sascha Meinert.
[
html ]
Generating Time Dependencies in Road Networks.
In:
Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of
Lecture Notes in Computer Science, pages 434–446. Springer, 2011.
Joint work with Sascha Meinert.
[
html ]
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks.
In:
Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of
Lecture Notes in Computer Science, pages 388–399. Springer, 2011.
Joint work with Dennis Schieferdecker and Markus Völker.
[
html |
pdf ]
Algorithm Engineering for Route Planning – An Update –.
In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11), volume 7074 of Lecture Notes in Computer Science, pages 1–5. Springer, 2011.
Space-Efficient SHARC-Routing.
In:
Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of
Lecture Notes in Computer Science, pages 47–58. Springer, May 2010.
Joint work with Edith Brunel, Daniel Delling, and Andreas Gemsa.
[
pdf ]
Modularity-Driven Clustering of Dynamic Graphs.
In:
Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of
Lecture Notes in Computer Science, pages 436–448. Springer, May 2010.
Joint work with Robert Görke, Pascal Maillard, and Christian Staudt.
[
html |
pdf ]
Gateway Decompositions for Constrained Reachability Problems.
In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science, pages 449–461. Springer, May 2010.
Joint work with Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, and Gregor Snelting.
Preprocessing Speed-Up Techniques is Hard.
In:
Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10), volume 6078 of
Lecture Notes in Computer Science, pages 359–370. Springer, 2010.
Joint work with Reinhard Bauer, Tobias Columbus, Bastian Katz, and Marcus Krug.
[
pdf ]
Synthetic Road Networks.
In:
Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10), volume 6124 of
Lecture Notes in Computer Science, pages 46–57. Springer, 2010.
Joint work with Reinhard Bauer, Marcus Krug, and Sascha Meinert.
[
html |
pdf ]
Enumerating and Generating Labeled k-Degenerate Graphs.
In: Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO '10), pages 90–98. SIAM, 2010.
Joint work with Reinhard Bauer and Marcus Krug.
Energy Efficient Scheduling with Power Control for Wireless Networks.
In:
Proceedings of the 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'10), pages 144–153. IEEE Computer Society, 2010.
Joint work with Bastian Katz and Markus Völker.
[
html |
pdf ]
Accelerating Multi-Modal Route Planning by Access-Nodes.
In:
Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), volume 5757 of
Lecture Notes in Computer Science, pages 587–598. Springer, September 2009.
Joint work with Daniel Delling and Thomas Pajor.
[
pdf ]
Dynamic Graph Clustering Using Minimum-Cut Trees.
In:
Algorithms and Data Structures, 11th International Symposium (WADS'09), volume 5664 of
Lecture Notes in Computer Science, pages 339–350. Springer, August 2009.
Full version available at
http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011476.
Joint work with Robert Görke and Tanja Hartmann.
[
html |
pdf ]
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
In:
Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), volume 5526 of
Lecture Notes in Computer Science, pages 51–62. Springer, June 2009.
Joint work with Reinhard Bauer.
[
pdf ]
ORCA Reduction and ContrAction Graph Clustering.
In:
Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09), volume 5564 of
Lecture Notes in Computer Science, pages 152–165. Springer, June 2009.
Joint work with Daniel Delling, Robert Görke, and Christian Schulz.
[
html |
pdf ]
Pareto Paths with SHARC.
In:
Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), volume 5526 of
Lecture Notes in Computer Science, pages 125–136. Springer, June 2009.
Joint work with Daniel Delling.
[
pdf ]
The Shortcut Problem – Complexity and Approximation.
In:
Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), volume 5404 of
Lecture Notes in Computer Science, pages 105–116. Springer, January 2009.
Joint work with Reinhard Bauer, Gianlorenzo D'Angelo, and Daniel Delling.
[
pdf ]
Efficient Route Planning in Flight Networks.
In:
Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), OpenAccess Series in Informatics (OASIcs), 2009.
Joint work with Daniel Delling, Thomas Pajor, and Christos Zaroliagis.
[
pdf ]
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09), volume 5878 of Lecture Notes in Computer Science, pages 872–881. Springer, 2009.
Joint work with Robert Franke and Ignaz Rutter.
Engineering Time-Expanded Graphs for Faster Timetable Information.
In:
Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08), OpenAccess Series in Informatics (OASIcs), September 2008.
Joint work with Daniel Delling and Thomas Pajor.
[
pdf ]
Engineering Label-Constrained Shortest-Path Algorithms.
In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), volume 5034 of Lecture Notes in Computer Science, pages 27–37. Springer, June 2008.
Joint work with Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, and Madhav V. Marathe.
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
In:
Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of
Lecture Notes in Computer Science, pages 303–318. Springer, June 2008.
Joint work with Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, and Dominik Schultes.
[
pdf ]
Engineering Comparators for Graph Clusterings.
In:
Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), volume 5034 of
Lecture Notes in Computer Science, pages 131–142. Springer, June 2008.
Joint work with Daniel Delling, Marco Gaertler, and Robert Görke.
[
pdf ]
-
LunarVis - Analytic Visualizations of Large Graphs.
In:
Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of
Lecture Notes in Computer Science, pages 352–364. Springer, January 2008.
Joint work with Robert Görke and Marco Gaertler.
[
html |
pdf ]
Efficient Scheduling of Data Harvesting Trees.
In:
Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08), volume 5389 of
Lecture Notes in Computer Science, pages 43–56, 2008.
Joint work with Bastian Katz and Steffen Mecke.
[
html |
pdf ]
Link Scheduling in Local Interference Models.
In:
Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08), volume 5389 of
Lecture Notes in Computer Science, pages 57–71, 2008.
Joint work with Bastian Katz and Markus Völker.
[
html |
pdf ]
Minimizing the Area for Planar Straight-Line Grid Drawings.
In:
Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of
Lecture Notes in Computer Science, pages 207–212. Springer, January 2008.
Joint work with Marcus Krug.
[
pdf ]
On Finding Graph Clusterings with Maximum Modularity.
In:
Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), volume 4769 of
Lecture Notes in Computer Science, pages 121–132. Springer, October 2007.
Joint work with Ulrik Brandes, Daniel Delling, Martin Höfer, Marco Gaertler, Robert Görke, and Zoran Nikoloski.
[
html |
pdf ]
Generating Graphs with Predefined k-Core Structure.
In:
Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
Joint work with Michael Baur, Marco Gaertler, Robert Görke, and Marcus Krug.
[
pdf ]
Evaluating Clustering Techniques - An Engineering Approach Inspired by Unit-Tests.
In:
Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
Poster.
Joint work with Daniel Delling, Marco Gaertler, Robert Görke, and Zoran Nikoloski.
[
html |
pdf ]
Engineering Comparators for Graph Clusterings.
In:
Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
as poster.
Joint work with Daniel Delling, Marco Gaertler, and Robert Görke.
[
html |
pdf ]
Landmark-Based Routing in Dynamic Graphs.
In:
Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of
Lecture Notes in Computer Science, pages 52–65. Springer, June 2007.
Joint work with Daniel Delling.
[
html |
pdf ]
Significance-Driven Graph Clustering.
In:
Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), Lecture Notes in Computer Science, pages 11–26. Springer, June 2007.
Joint work with Marco Gaertler and Robert Görke.
[
html |
html |
pdf ]
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.
In:
Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), volume 4362 of
Lecture Notes in Computer Science, pages 330–341. Springer, January 2007.
Joint work with Marco Gaertler and Bastian Katz.
[
html |
pdf ]
Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), pages 36–45. SIAM, 2007.
Joint work with Sebastian Knopp, Peter Sanders, Dominik Schultes, and Frank Schulz.
Multi-scale Anchor-free Distributed Positioning in Sensor Networks.
In:
Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07), pages 64–74, 2007.
Joint work with Bastian Katz.
[
pdf ]
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks.
In:
Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), volume 4362 of
Lecture Notes in Computer Science, pages 410–421. Springer, January 2007.
Joint work with Markus Maier and Steffen Mecke.
[
pdf ]
High-Performance Multi-Level Graphs.
In:
The Shortest Path Problem: Ninth DIMACS Implementation Challenge -, November 2006.
Joint work with Daniel Delling, Martin Holzer, Kirill Müller, and Frank Schulz.
[
html |
pdf ]
Highway Hierarchies Star.
In:
The Shortest Path Problem: Ninth DIMACS Implementation Challenge -, November 2006.
Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
[
html |
pdf ]
Generating Significant Graph Clusterings.
In:
Proceedings of the European Conference of Complex Systems (ECCS'06), September 2006.
Joint work with Daniel Delling and Marco Gaertler.
[
html |
pdf ]
-
Analysis of Overlay-Underlay Topology Correlation using Visualization.
In:
Proceedings of the 5th IADIS International Conference WWW/Internet Geometry, 2006.
awarded as outstanding paper.
Joint work with Vinay Aggarwal, Anja Feldmann, Marco Gaertler, and Robert Görke.
[
html ]
A Hybrid Model for Drawing Dynamic and Evolving Graphs.
In:
Proceedings of the 13th International Symposium on Graph Drawing (GD'05), volume 3843 of
Lecture Notes in Computer Science, pages 189–200. Springer, January 2006.
Joint work with Marco Gaertler.
[
DOI |
html |
pdf ]
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), pages 156–170. SIAM, 2006.
Joint work with Martin Holzer and Frank Schulz.
Station Location – Complexity and Approximation.
In:
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05), OpenAccess Series in Informatics (OASIcs), 2006.
Joint work with Steffen Mecke and Anita Schöbel.
[
html |
pdf ]
Drawing the AS Graph in 2.5 Dimensions.
In:
Proceedings of the 12th International Symposium on Graph Drawing (GD'04), volume 3383 of
Lecture Notes in Computer Science, pages 43–48. Springer, January 2005.
Joint work with Michael Baur, Ulrik Brandes, and Marco Gaertler.
[
html |
pdf ]
Engineering Planar Separator Algorithms.
In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05), volume 3669 of Lecture Notes in Computer Science, pages 628–639. Springer, 2005.
Joint work with Martin Holzer, Grigorios Prasinos, Frank Schulz, and Christos Zaroliagis.
Partitioning Graphs to Speed Up Dijkstra's Algorithm.
In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), volume 3503 of Lecture Notes in Computer Science, pages 189–202. Springer, 2005.
Joint work with Rolf H. Möhring, Heiko Schilling, Birk Schütz, and Thomas Willhalm.
Finding, Counting and Listing all Triangles in Large Graphs, an Experimental Study.
In:
Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), volume 3503 of
Lecture Notes in Computer Science, pages 606–609. Springer, 2005.
Joint work with Thomas Schank.
[
html |
pdf ]
Drawing Graphs to Speed Up Shortest-Path Computations.
In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05), pages 15–24. SIAM, 2005.
Joint work with Thomas Willhalm.
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
In: Proceedings of the 11th International Symposium on Graph Drawing (GD'03), volume 2912 of Lecture Notes in Computer Science, pages 357–368. Springer, January 2004.
Joint work with Ulrik Brandes and Sabine Cornelsen.
The Station Location Problem on Two Intersecting Lines.
In:
Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03), volume 92 of
Electronic Notes in Theoretical Computer Science, pages 52–64, 2004.
Joint work with Flavia Mammana and Steffen Mecke.
[
html |
html |
pdf ]
Experimental Comparison of Shortest Path Approaches for Timetable Information.
In:
Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04), pages 88–99. SIAM, 2004.
Joint work with Evangelia Pyrga, Frank Schulz, and Christos Zaroliagis.
[
https://i11www.iti.kit.edu/extra/publications/people ]
</li>
<li>
<b>Towards Realistic Modeling of Time-Table Information through the
Time-Dependent Approach</b>.<br>
In: <em>Proceedings of the 3rd Workshop on Algorithmic Methods and
Models for Optimization of Railways (ATMOS'03)</em>, volume 92 of <em>
Electronic Notes in Theoretical Computer Science</em>, pages 85--103, 2004.<br>
Joint work with Evangelia Pyrga, Frank Schulz, and Christos
Zaroliagis.
</li>
<li>
<b>Dynamic Shortest Path Containers</b>.<br>
In: <em>Proceedings of the 3rd Workshop on Algorithmic Methods and
Models for Optimization of Railways (ATMOS'03)</em>, volume 92 of <em>
Electronic Notes in Theoretical Computer Science</em>, pages 65--84, 2004.<br>
Joint work with Thomas Willhalm and Christos Zaroliagis.
<br>[ <a href=
Sketch-Driven Orthogonal Graph Drawing.
In: Proceedings of the 10th International Symposium on Graph Drawing (GD'00), volume 2528 of Lecture Notes in Computer Science, pages 1–11. Springer, January 2003.
Joint work with Ulrik Brandes, Markus Eiglsperger, and Michael Kaufmann.
Experiments on Graph Clustering Algorithms.
In:
Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of
Lecture Notes in Computer Science, pages 568–579. Springer, 2003.
Joint work with Ulrik Brandes and Marco Gaertler.
[
html ]
-
Algorithms and Models for Railway Optimization.
In:
Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03), volume 2748 of
Lecture Notes in Computer Science, pages 198–206. Springer, 2003.
Invited Talk.
[
html ]
Analysis and Visualization of Social Networks.
In: Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03), volume 2647 of Lecture Notes in Computer Science, pages 261–266. Springer, 2003.
Invited Talk.
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 776–787. Springer, 2003.
Joint work with Thomas Willhalm.
visone - Software for Visual Social Network Analysis.
In:
Proceedings of the 9th International Symposium on Graph Drawing (GD'01), volume 2265 of
Lecture Notes in Computer Science, pages 463–464. Springer, January 2002.
Joint work with Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, and Jürgen Lerner.
[
html |
pdf ]
Using Multi-Level Graphs for Timetable Information in Railway Systems.
In:
Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02), volume 2409 of
Lecture Notes in Computer Science, pages 43–59. Springer, 2002.
Joint work with Frank Schulz and Christos Zaroliagis.
[
pdf ]
How to Draw the Minimum Cuts of a Planar Graph.
In:
Proceedings of the 8th International Symposium on Graph Drawing (GD'00), volume 1984 of
Lecture Notes in Computer Science, pages 103–114. Springer, January 2001.
Joint work with Ulrik Brandes and Sabine Cornelsen.
[
html |
html |
html |
html |
html |
pdf ]
-
Dynamic web structures in 3d.
In:
Proceedings of the 6th International Symposium on Graph Drawing (GD'98), volume 1547 of
Lecture Notes in Computer Science, pages 423–435. Springer, January 1999.
“Honorable Mention” beim
Graph Drawing Contest 1998, s. Graph-Drawing Contest Report by P. E.
Joint work with Ulrik Brandes, Vanessa Kääb, Andres Löh, and Thomas Willhalm.
[
html ]
Using Graph Layout to Visualize Train Interconnection Data.
In:
Proceedings of the 6th International Symposium on Graph Drawing (GD'98), volume 1547 of
Lecture Notes in Computer Science, pages 44–56. Springer, January 1999.
Joint work with Ulrik Brandes.
[
html |
pdf ]
On the Hardness of Recognizing Bundles in Time Table Graphs.
In:
Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), volume 657 of
Lecture Notes in Computer Science, pages 325–337. Springer, 1999.
Joint work with Annegret Liebers and Karsten Weihe.
[
html ]
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
In:
Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99), volume 1668 of
Lecture Notes in Computer Science, pages 110–123. Springer, 1999.
Joint work with Frank Schulz and Karsten Weihe.
[
html ]
Empirical Design of Geometric Algorithms.
In:
Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99), pages 86–94. ACM Press, 1999.
Joint work with Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller–Hannemann, and Thomas Willhalm.
[
html |
html ]
Dynamic Grid Embedding with Few Bends and Changes.
In:
Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98), volume 1533 of
Lecture Notes in Computer Science, pages 89–98. Springer, 1998.
Joint work with Ulrik Brandes.
[
html |
html ]
A linear time algorithm for edge-disjoint paths in planar graphs.
In: Proceedings of the 1st European Symposium on Algorithms (ESA'93), volume 726 of Lecture Notes in Computer Science, pages 744–750, 1993.
Joint work with Karsten Weihe.
Wiring knock-knee layouts: a global approach.
In: Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92), volume 650 of Lecture Notes in Computer Science, pages 388–399. Springer, 1992.
Joint work with Majid Sarrafzadeh, Frank Wagner, and Karsten Weihe.
Routing through a Dense Channel with Minimum Total Wire Length.
In: Proceedings of the 2nd Annual ACM–SIAM Symposium on Discrete Algorithms (SODA'91), pages 475–482. ACM Press, 1991.
Joint work with Michael Formann and Frank Wagner.
A new approach to knock-knee channel routing.
In: Proceedings of the 2nd International Symposium on Algorithms (ISA'91), volume 557 of Lecture Notes in Computer Science, pages 83–93. Springer, 1991.
Area-Optimal Three-Layer Channel Routing.
In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89), pages 506–511, October 1989.
Joint work with Ruth Kuchem and Frank Wagner.
