Bücher
Titel	Autoren	Quelle
Algorithms and Data Structures: The Basic Toolbox	K. Mehlhorn, P. Sanders	2008, Springer-Verlag, ISBN 978-3540779773
Algorithms - ESA 2009 Proceedings	P. Sanders, A. Fiat (eds.)	2009, 17th Annual European Symposium on Algorithms ESA, Springer-Verlag, ISBN 978-3-642-04127-3
Sequential and Parallel Algorithms and Data Structures	P. Sanders, K. Mehlhorn, M. Dietzfelbinger, R. Dementiev	2019, Springer-Verlag, ISBN 978-3-030-25208-3

Dissertationen
Titel	Autor	Datum
Parallel and External High Quality Graph Partitioning	Yaroslav Akhremtsev	Mai 2019
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools	Timo Bingmann	Juli 2018
Theory and Engineering of Scheduling Parallel Jobs	Jochen Matthias Speck	Dezember 2017
Engineering Aggregation Operators for Relational In-Memory Database Systems	Ingo Müller	Februar 2016
Alternative Route Techniques and their Applications to the Stochastics on-time Arrival Problem	Moritz Kobitzsch	November 2015
Time-Dependent Route Planning with Contraction Hierarchies	Gernot Veit Eberhard Batz	Juli 2014
An Algorithmic View on Sensor Networks - Surveillance, Localization, and Communication	Dennis Schieferdecker	Juli 2014
Algorithm Engineering for fundamental Sorting and Graph Problems	Vitaly Osipov	April 2014
High Quality Graph Partitioning	Christian Schulz	Juli 2013
Building Blocks for Mapping Services	Dennis Luxen	Juni 2013
Efficient Algorithms for Large-Scale Image Analysis	Jan Wassenberg	März 2012
Advanced Route Planning in Transportation Networks	Robert Geisberger	Februar 2011
Algorithm Libraries for Multi-Core Processors	Johannes Singler	Juli 2010
Algorithms and Data Structures for In-Memory Text Search Engines	Frederik Transier	Januar 2010
Route Planning in Road Networks	Dominik Schultes	Februar 2008
Algorithm Engineering for Large Data Sets	Roman Dementiev	Dezember 2006
Lastverteilungsalgorithmen für parallele Tiefensuche	Peter Sanders	November 1996

Publikationsliste

2019

Zeitschriftenaufsätze

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice.
Gog, S.; Kärkkäinen, J.; Kempa, D.; Petri, M.; Puglisi, S. J.
2019. Algorithmica, 81 (4), 1370–1391. doi:10.1007/s00453-018-0475-9

Scalable Kernelization for Maximum Independent Sets.
Hespe, D.; Schulz, C.; Strash, D.
2019. Journal of experimental algorithmics, 24 (1), Article: 1.16. doi:10.1145/3355502

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.
Heuer, T.; Sanders, P.; Schlag, S.
2019. Journal of experimental algorithmics, 24 (1), Article: 2.3. doi:10.1145/3329872

Dynamic Space Efficient Hashing.
Maier, T.; Sanders, P.; Walzer, S.
2019. Algorithmica, 81 (8), 3162–3185. doi:10.1007/s00453-019-00572-x

Communication-free massively distributed graph generation.
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; von Looz, M.
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011

Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks.
Alam, M.; Perumalla, K. S.; Sanders, P.
2019. Data science and engineering, 4 (1), 61–75. doi:10.1007/s41019-019-0088-6

Concurrent hash tables: Fast and General(?)!.
Maier, T.; Sanders, P.; Dementiev, R.
2019. ACM Transactions on Parallel Computing, 5 (4), Art. Nr.: a16. doi:10.1145/3309206

Proceedingsbeiträge

More Hierarchy in Route Planning Using Edge Hierarchies.
Hespe, D.; Sanders, P.
2019. 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019), München, 12.-13. September 2019, 10:1–10:14. doi:10.4230/OASIcs.ATMOS.2019.10

Data Distribution for Phylogenetic Inference with Site Repeats via Judicious Hypergraph Partitioning.
Baar, I.; Hübner, L.; Oettig, P.; Zapletal, A.; Schlag, S.; Stamatakis, A.; Morel, B.
2019. IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Rio de Janeiro, Brazil, Brazil, 20-24 May 2019, 175–184, IEEE, Piscataway )NJ). doi:10.1109/IPDPSW.2019.00038

Finding Optimal Longest Paths by Dynamic Programming in Parallel.
Fieger, K.; Balyo, T.; Schulz, C.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 61–69, AAAI Press, Menlo Park, CA

PASAR - Planning as Satisfiability with Abstraction Refinement.
Froleyks, N.; Balyo, T.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 70–78, AAAI Press, Menlo Park, CA

Tree-REX: SAT-based Tree Exploration for Efficient and High-Quality HTN Planning.
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), Berkeley, CA, July 11-15, 2019, Ed.: J. Benton, 382–390, AAAI Press, Palo Alto, CA

Efficient SAT Encodings for Hierarchical Planning.
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 11th International Conference on Agents and Artificial Intelligence (ICAART 2019), Prague, CZ, February 19-21, 2019. Ed.: J. van den Herik. Vol. 2, 531–538, SCITEPRESS, Setúbal, P. doi:10.5220/0007343305310538

Parallel Weighted Random Sampling [in press].
Hübschle-Schneider, L.; Sanders, P.
2019. 27th European Symposium on Algorithms, Munich/Garching, Germany, 9th - 11th September 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs.
Lamm, S.; Schulz, C.; Strash, D.; Williger, R.; Zhang, H.
2019. 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), San Diego, California, USA, January 7 - 8, 2019. Ed.: S. Kobourov, 144–158, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. doi:10.1137/1.9781611975499.12

Scalable Edge Partitioning.
Schlag, S.; Schulz, C.; Seemaier, D.; Strash, D.
2019. Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), San Diego, CA, January 7-8, 2019, 211–225. doi:10.1137/1.9781611975499.17

Faster Support Vector Machines.
Schlag, S.; Schmitt, M.; Schulz, C.
2019. 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: S. Kobourov, 199–210, Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611975499.16

Buchaufsätze

COBS: A Compact Bit-Sliced Signature Index.
Bingmann, T.; Bradley, P.; Gauger, F.; Iqbal, Z.
2019. String Processing and Information Retrieval – 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings. Ed.: N. Brisaboa, 285–303, Springer, Cham. doi:10.1007/978-3-030-32686-9_21

Forschungsdaten/Bilder

Benchmark Sets used in the Dissertation of Sebastian Schlag.
Schlag, S.
2019, Oktober 16. doi:10.5445/IR/1000098881

2018

Zeitschriftenaufsätze

Drawing Large Graphs by Multilevel Maxent-Stress Optimization.
Meyerhenke, H.; Nollenburg, M.; Schulz, C.
2018. IEEE transactions on visualization and computer graphics, 24 (5), 1814–1827. doi:10.1109/TVCG.2017.2689016

Efficient Parallel Random Sampling : Vectorized, Cache-Efficient, and Online.
Sanders, P.; Lamm, S.; Hübschle-Schneider, L.; Schrade, E.; Dachsbacher, C.
2018. ACM transactions on mathematical software, 44 (3), 29:1–29:14. doi:10.1145/3157734

Proceedingsbeiträge

Scalable Construction of Text Indexes with Thrill.
Bingmann, T.; Gog, S.; Kurpicz, F.
2018. 2018 IEEE International Conference on Big Data (Big Data 2018), Seattle, WA, December 10-13, 2018, 634–643, IEEE, Piscataway, NJ. doi:10.1109/BigData.2018.8622171

Relational Equivalence Proofs Between Imperative and MapReduce Algorithms.
Beckert, B.; Bingmann, T.; Kiefer, M.; Sanders, P.; Ulbrich, M.; Weigl, A.
2018. Verified Software: Theories, Tools, and Experiments; 10th International Conference, VSTTE 2018; Oxford, UK, July 18–19, 2018; Revised Selected Papers. Ed.: R. Piskac, 248–266, Springer Nature, Cham. doi:10.1007/978-3-030-03592-1_14

An equal opportunity concept for the coordinated research effort AESC.
Koziolek, A.; Sanders, P.; Wagner, D.
2018. 12th European Conference on Software Architecture, ECSA 2018; Madrid; Spain; 24 September 2018 through 28 September 2018, Art. Nr.: a16, ACM, New York (NY). doi:10.1145/3241403.3241421

Lightweight MPI communicators with applications to perfectly balanced quicksort.
Axtmann, M.; Wiebigke, A.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018; Vancouver; Canada; 21 May 2018 through 25 May 2018, 254–265, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2018.00035

Communication Efficient Checking of Big Data Operations.
Hübschle-Schneider, L.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 650–659, IEEE, Picataway (NJ). doi:10.1109/IPDPS.2018.00074

Communication-free Massively Distributed Graph Generation.
Funke, D.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von.
2018. 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 336–347, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2018.00043

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.
Heuer, T.; Sanders, P.; Schlag, S.
2018. 17th International Symposium on Experimental Algorithms (SEA), June 27-29, 2018, L’Aquila, Italy. Ed.: G. D’Angelo, 1:1–1:19, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Wadern, Saarbrücken/Wadern. doi:10.4230/LIPIcs.SEA.2018.1

High-Quality Shared-Memory Graph Partitioning.
Akhremtsev, Y.; Sanders, P.; Schulz, C.
2018. Euro-Par 2018: parallel processing : 24th International Conference on Parallel and Distributed Computing, Turin, Italy, August 27- 31, 2018. Ed.: M. Aldinucci, 659–671, Springer, 2018. doi:10.1007/978-3-319-96983-1_47

Memetic multilevel hypergraph partitioning.
Andre, R.; Schlag, S.; Schulz, C.
2018. GECCO ’18 Proceedings of the Genetic and Evolutionary Computation Conference, Kyoto, J, July 15-19, 2018, 347–354, ACM Press, New York (NY). doi:10.1145/3205455.3205475

Proving equivalence between imperative and MapReduce implementations using program transformations.
Beckert, B.; Bingmann, T.; Kiefer, M.; Sanders, P.; Ulbrich, M.; Weigl, A.
2018. 3rd Workshop on Models for Formal Analysis of Real Systems and 6th International Workshop on Verification and Program Transformation, MARSVPT 2018; Thessaloniki; Greece; 20 April 2018. Ed.: R. van Glabbeek, 185–199, Open Publishing Association. doi:10.4204/EPTCS.268.7

Optimizing energy consumption and user experience in a mobile video streaming scenario.
Breitbach, T.; Sanders, P.; Schultes, D.
2018. 15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018; Las Vegas; United States; 12 January 2018 through 15 January 2018, 1–9, IEEE, Piscataway (NJ). doi:10.1109/CCNC.2018.8319166

Practical Minimum Cut Algorithms.
Henzinger, M.; Noe, A.; Schulz, C.; Strash, D.
2018. ALENEX18 : Proceedings of the 20th Meeting on Algorithm Engineering & Experiments, New Orleans, Louisiana, USA, 7th - 8th January 2018. Ed.: R. Pagh, 48–61, Society for Industrial and Applied Mathematics Publications. doi:10.1137/1.9781611975055.5

Scalable Kernelization for Maximum Independent Sets.
Hespe, D.; Schulz, C.; Strash, D.
2018. ALENEX18 : Proceedings of the 20th Meeting on Algorithm Engineering & Experiments, New Orleans, Louisiana, USA, 7th - 8th January 2018. Ed.: R. Pagh, 223–237, Society for Industrial and Applied Mathematics Publications. doi:10.1137/1.9781611975055.19

2017

Zeitschriftenaufsätze

Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner.
Kabiljo, I.; Karrer, B.; Pundir, M.; Pupyrev, S.; Shalita, A.; Akhremtsev, Y.; Presta, A.
2017. Proceedings of the VLDB Endowment, 10 (11), 1418–1429. doi:10.14778/3137628.3137650

Parallel Graph Partitioning for Complex Networks.
Meyerhenke, H.; Sanders, P.; Schulz, C.
2017. IEEE transactions on parallel and distributed systems, 28 (9), 2625–2638. doi:10.1109/TPDS.2017.2671868

Lempel–Ziv-78 Compressed String Dictionaries.
Arz, J.; Fischer, J.
2017. Algorithmica, 1–36. doi:10.1007/s00453-017-0348-7

Finding near-optimal independent sets at scale.
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2017. Journal of heuristics, 23 (4), 207–229. doi:10.1007/s10732-017-9337-x

Inducing enhanced suffix arrays for string collections.
Louza, F. A.; Gog, S.; Telles, G. P.
2017. Theoretical computer science, 678, 22–39. doi:10.1016/j.tcs.2017.03.039

Optimal suffix sorting and LCP array construction for constant alphabets.
Louza, F. A.; Gog, S.; Telles, G. P.
2017. Information processing letters, 118, 30–34. doi:10.1016/j.ipl.2016.09.010

Engineering Parallel String Sorting.
Bingmann, T.; Eberle, A.; Sanders, P.
2017. Algorithmica, 77 (1), 235–286. doi:10.1007/s00453-015-0071-1

Proceedingsbeiträge

Using an Algorithm Portfolio to Solve Sokoban.
Froleyks, N.; Balyo, T.
2017. Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017), Pittsburgh, PA, June 16-17, 2017. Ed.: A. Fukunaga, 165–166, AAAI press, Palo Alto (CA)

Fast Construction of Compressed Web Graphs.
Broß, J.; Gog, S.; Hauck, M.; Paradies, M.
2017. String Processing and Information Retrieval, 24th International Symposium, SPIRE 2017, Proceedings, Palermo, Italy, 26th - 29th September 2017, 116–128, Springer, Cham. doi:10.1007/978-3-319-67428-5_11

Accelerating sat based planning with incremental sat solving.
Gocht, S.; Balyo, T.
2017. Proceedings of the 27th International Conference on Automated Planning and Scheduling, Pittsburgh, United States, 18th - 23th June 2017. Ed.: L. Barbulescu, 135–139, AAAI Press, Palo Alto

Dynamic space efficient hashing.
Maier, T.; Sanders, P.
2017. 25th European Symposium on Algorithms, Vienna, Austria, 4th - 6th September 2017, Art.Nr.: 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.ESA.2017.58

In-Place Parallel Super Scalar Samplesort (IPSSSSo).
Axtmann, M.; Witt, S.; Ferizovic, D.; Sanders, P.
2017. 25th European Symposium on Algorithms : (ESA 2017) Vienna, Austria, September 4-6, 2017. Ed.: K. Pruhs, C. Sohler, Art.Nr. 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken / Wadern. doi:10.4230/LIPIcs.ESA.2017.9

Better process mapping and sparse quadratic assignment.
Schulz, C.; D’Ambrosio, C.
2017. 16th Symposium on Experimental Algorithms, London, United Kingdom, 21st - 23rd June 2017, Art.Nr.: 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.SEA.2017.4

Graph partitioning with acyclicity constraints.
Moreira, O.; Popp, M.; Schulz, C.
2017. 16th Symposium on Experimental Algorithms, London, United Kingdom, 21st - 23rd June 2017. Ed.: C. Iliopoulos, Art.Nr.: 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.SEA.2017.30

Practical range minimum queries revisited.
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.SEA.2017.12

The quantile index : Succinct self-index for top-k document retrieval.
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.SEA.2017.15

Shared memory parallel subgraph enumeration.
Kimmig, R.; Meyerhenke, H.; Strash, D.
2017. Proceedings- 31st IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2017; Orlando; United States; 29 May 2017 through 2 June 2017, 519–529, IEEE, Piscataway (NJ). doi:10.1109/IPDPSW.2017.133

Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure.
Heuer, T.; Schlag, S.
2017. 16th International Symposium on Experimental Algorithms (SEA 2017), London, UK, 21th - 23rd June 2017. Ed.: C. Iliopoulos, Art. Nr. 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern. doi:10.4230/LIPIcs.SEA.2017.21

Distributed Evolutionary k-way Node Separators.
Sanders, P.; Strash, D.; Schulz, C.; Williger, R.
2017. GECCO ’17 : Proceedings of the Genetic and Evolutionary Computation Conference, Berlin, Germany, 15th - 19th July 2017, 345–352, ACM, New York. doi:10.1145/3071178.3071204

Engineering a distributed full-text index.
Fischer, J.; Kurpicz, F.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 120–134, SIAM Publ., Philadelphia (PA)

CSA++: Fast pattern search for large alphabets.
Gog, S.; Moffat, A.; Petri, M.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 73–82, SIAM Publ., Philadelphia (PA). doi:10.1137/1.9781611974768.6

Robust massively parallel sorting.
Axtmann, M.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 83–97, SIAM Publ., Philadelphia (PA). doi:10.1137/1.9781611974768.7

Engineering a direct k-way hypergraph partitioning algorithm.
Akhremtsev, Y.; Heuer, T.; Sanders, P.; Schlag, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 28–42, SIAM Publ., Philadelphia (PA). doi:10.1137/1.9781611974768.3

Parallel d-D delaunay triangulations in shared and distributed memory.
Funke, D.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 207–217, SIAM Publ., Philadelphia (PA). doi:10.1137/1.9781611974768.17

Elias-fano meets single-term top-k document retrieval.
Labeit, J.; Gog, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 135–145, SIAM Publ., Philadelphia (PA)

Forschungsberichte

Fast OLAP Query Execution in Main Memory on Large Data in a Cluster.
Hespe, D.; Weidner, M.; Dees, J.; Sanders, P.
2017

Buchaufsätze

Algorithm Engineering for Large Data Sets.
Sanders, P.
2017. Helmholtz Portfolio Theme Large-Scale Data Management and Analysis (LSDMA). Ed.: C. Jung, 199–214, KIT Scientific Publishing, Karlsruhe

Peppher : Performance Portability and Programmability for Heterogeneous Many-Core Architectures.
Benkner, S.; Pllana, S.; Träff, J. L.; Tsigas, P.; Richards, A.; Russell, G.; Thibault, S.; Augonnet, C.; Namyst, R.; Cornelius, H.; Keler, C.; Moloney, D.; Sanders, P.
2017. Programming multi-core and many-core computing systems. Ed.: S. Pllana, 241–260, Wiley, New York. doi:10.1002/9781119332015.ch12

Vorträge

A new framework for interactive knowledge discovery in large-scale trajectory data of zebrafish embryos.
Schott, B.; Traub, M.; Antritter, T.; Schlagenhauf, C.; Takamiya, M.; Barschat, A.; Otte, J. C.; Kobitski, A.; Nienhaus, G. U.; Sanders, P.; Strähle, U.; Mikut, R.; Stegmaier, J.
2017. 10th European Zebrafish Meeting, Budapest, H, July 3-7, 2017

Poster

Interactive knowledge discovery in large-scale trajectory data of zebrafish embryos.
Schott, B.; Traub, M.; Antritter, T.; Schlagenhauf, C.; Takamiya, M.; Barschat, A.; Otte, J. C.; Kobitski, A.; Nienhaus, G. U.; Sanders, P.; Strähle, U.; Mikut, R.; Stegmaier, J.
2017. Seeing is Believing - Imaging the Processes of Life, EMBO/EMBL Symposium, Heidelberg, October 4-7, 2017

2016

Zeitschriftenaufsätze

Introduction to Special Issue ALENEX 2013.
Zeh, N.; Sanders, P.
2016. Journal of experimental algorithmics - Special Issue (SEA), 21, 2.1. doi:10.1145/2966922

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.
Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Journal of heuristics, 22 (5), 759–782. doi:10.1007/s10732-016-9315-8

Inducing suffix and LCP arrays in external memory.
Bingmann, T.; Fischer, J.; Osipov, V.
2016. Journal of experimental algorithmics, 21 (2), Art.Nr.:2.3. doi:10.1145/2975593

Tree-based coarsening and partitioning of complex networks.
Glantz, R.; Meyerhenke, H.; Schulz, C.
2016. Journal of experimental algorithmics, 21 (2), Art.Nr.:1.6. doi:10.1145/2851496

Scalable generation of scale-free graphs.
Sanders, P.; Schulz, C.
2016. Information processing letters, 116 (7), 489–491. doi:10.1016/j.ipl.2016.02.004

An improved algorithm for the all-pairs suffix-prefix problem.
Tustumi, W. H. A.; Gog, S.; Telles, G. P.; Louza, F. A.
2016. Journal of Discrete Algorithms, 37, 34–43. doi:10.1016/j.jda.2016.04.002

Constraint-based large neighborhood search for machine reassignment.
Brandt, F.; Speck, J.; Völker, M.
2016. Annals of operations research, 242 (1), 63–91. doi:10.1007/s10479-014-1772-6

Proceedingsbeiträge

Finding Near-Optimal Independent Sets at Scale.
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Arlington, VA, January 10, 2016, 138–150, Society for Industrial and Applied Mathematics, Philadelphia (PA). doi:10.1137/1.9781611974317.12

Thrill: High-performance algorithmic distributed batch data processing with C++.
Bingmann, T.; Axtmann, M.; Jobstl, E.; Lamm, S.; Nguyen, H. C.; Noe, A.; Schlag, S.; Stumpp, M.; Sturm, T.; Sanders, P.
2016. IEEE International Conference on Big Data (Big Data), Washington DC, USA, 5–8 December 2016, 172–183, IEEE, Piscataway (NJ). doi:10.1109/BigData.2016.7840603

Practical Variable Length Gap Pattern Matching.
Bader, J.; Gog, S.; Petri, M.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation; 5 June 2016 through 8 June 2016. Ed.: A. Goldberg, 1–16, Springer International Publishing, Cham. doi:10.1007/978-3-319-38851-9_1

Accelerating Local Search for the Maximum Independent Set Problem.
Dahlum, J.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation. Ed.: A. Goldberg, 118–133, Springer International Publishing, Cham. doi:10.1007/978-3-319-38851-9_9

On the Power of Simple Reductions for the Maximum Independent Set Problem.
Strash, D.
2016. 22nd International Conference on Computing and Combinatorics, COCOON 2016; Ho Chi Minh City; Viet Nam; 2 August 2016 through 4 August 2016. Ed.: T. Dinh, 345–356, Springer International Publishing, Cham. doi:10.1007/978-3-319-42634-1_28

Advanced Multilevel Node Separator Algorithms.
Sanders, P.; Schulz, C.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation; 5 June 2016 through 8 June 2016. Ed.: A. V. Goldberg, 294–309, Springer International Publishing, Cham. doi:10.1007/978-3-319-38851-9_20

Communication Efficient Algorithms for Top-k Selection Problems.
Hübschle-Schneider, L.; Sanders, P.
2016. 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Chicago, IL, USA, 23–27 May 2016, 659–668, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2016.45

Succinct data structures in information retrieval: Theory and practice.
Gog, S.; Venturini, R.
2016. 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2016, Pisa, Italy, 17 - 21 July 2016, 1231–1233, ACM, New York (NY). doi:10.1145/2911451.2914802

Faster, Minuter.
Gog, S.; Karkkainen, J.; Kempa, D.; Petri, M.; Puglisi, S. J.
2016. 2016 Data Compression Conference, DCC 2016, Snowbird, United States, 29. March - 1. April, 2016, 53–62, IEEE, Piscataway (NJ). doi:10.1109/DCC.2016.94

Induced Suffix Sorting for String Collections.
Louza, F. A.; Gog, S.; Telles, G. P.
2016. 2016 Data Compression Conference, DCC 2016, Snowbird, United States, 29. March - 1. April, 2016, 43–52, IEEE, Piscataway (NJ). doi:10.1109/DCC.2016.27

Temporal map labeling: A new unified framework with experiments.
Barth, L.; Niedermann, B.; Nöllenburg, M.; Strash, D.
2016. GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, San Francisco, CA, October 31 - November 3, 2016. Ed.: M. Renz, Article 23, ACM, NY. doi:10.1145/2996913.2996957

Fast Parallel Operations on Search Trees.
Akhremtsev, Y.; Sanders, P.
2016. HiPC 2016, the 23rd IEEE International Conference on High Performance Computing, Data, and Analytics, Hyderabad, India, December, 19-22, 291–300, IEEE, Piscataway (NJ). doi:10.1109/HiPC.2016.042

Trip-Based Public Transit Routing Using Condensed Search Trees.
Witt, S.
2016. 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Aarhus, Denmark, August 25, 2016. Ed.: M. Goerigk, 10.1–10.12, Dagstuhl Publishing, Saarbrücken. doi:10.4230/OASIcs.ATMOS.2016.10

Parallel Computation for the All-Pairs Suffix-Prefix Problem.
Louza, F. A.; Gog, S.; Zanotto, L.; Araujo, G.; Telles, G. P.
2016. String Processing and Information Retrieval : 23rd International Symposium, SPIRE 2016, Beppu, J, October 18-20, 2016, Proceedings. Ed.: S. Inenaga, 122–132, Springer International Publ., Cham. doi:10.1007/978-3-319-46049-9_12

Fast and Compact Hamming Distance Index.
Gog, S.; Venturini, R.
2016. 39th International ACM SIGIR conference on Research and Development in Information Retrieval (SIGIR), Pisa, Italy, July 17 - 21, 2016, 285–294, ACM, New York (NY). doi:10.1145/2911451.2911523

K-way hypergraph partitioning via n-level recursive bisection.
Schlag, S.; Henne, V.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Proceedings of the 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, Arlington, United States. Ed.: M. Goodrich, 53–67. doi:10.1137/1.9781611974317.5

Concurrent hash tables: Fast and general?(!).
Maier, T.; Sanders, P.; Dementiev, R.
2016. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2016, Barcelona, Art.Nr. 34, ACM. doi:10.1145/2851141.2851188

2015

Zeitschriftenaufsätze

Location-free detection of network boundaries.
Schieferdecker, D.
2015. ACM Transactions on sensor networks, 11 (4), Art.Nr.:58. doi:10.1145/2795232

Industry-Specific Firm Growth and Agglomeration.
Duschl, M.; Scholl, T.; Brenner, T.; Luxen, D.; Raschke, F.
2015. Regional studies, 49 (11), 1822–1839. doi:10.1080/00343404.2013.861059

Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP.
Papenfuß, H.; Sanders, P.; Schulz, C.
2015. Java Spektrum, (1), 48–51

Work-Efficient Matrix Inversion in Polylogarithmic Time.
Sanders, P.; Speck, J.; Steffen, R.
2015. ACM Transactions on Parallel Computing - Special Issue for SPAA 2013, 2 (3), Art.Nr. 15. doi:10.1145/2809812

Proceedingsbeiträge

Trip-Based Public Transit Routing.
Witt, S.
2015. Algorithms - ESA 2015. 23rd Annual European Symposium Patras, Greece, September 14–16, 2015. Proceedings. Ed.: N. Bansal, 1025–1036, Springer Berlin Heidelberg, Berlin, Heidelberg. doi:10.1007/978-3-662-48350-3_85

Drawing Large Graphs by Multilevel Maxent-Stress Optimization.
Meyerhenke, H.; Nöllenburg, M.; Schulz, C.
2015. Graph Drawing and Network Visualization. Ed.: E. Di Giacomo, 30–43, Springer International Publishing, Cham, CH. doi:10.1007/978-3-319-27261-0_3

MultiQueues: Simple Relaxed Concurrent Priority Queues.
Rihani, H.; Sanders, P.; Dementiev, R.
2015. SPAA ’15 Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures : Portland, United States; 13 June 2015 through 15 June 2015, 80–82, ACM, New York (NY). doi:10.1145/2760000/2755616

Tree Compression with Top Trees Revisited.
Hübschle-Schneider, L.; Raman, R.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 15–27, Springer International Publishing, Cham. doi:10.1007/978-3-319-20086-6_2

On Minimizing Crossings in Storyline Visualizations.
Kostitsyna, I.; Nöllenburg, M.; Polishchuk, V.; Schulz, A.; Strash, D.
2015. Graph Drawing and Network Visualization : 23rd International Symposium, {GD} 2015, Los Angeles, USA, September 24-26, 2015. Hrsg.: E. Di Giacomo, 192–198, Springer International Publishing, Cham. doi:10.1007/978-3-319-27261-0_16

Incorporating Road Networks into Territory Design.
Ahuja, N.; Bender, M.; Sanders, P.; Schulz, C.; Wagner, A.
2015. GIS ’15 Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, Bellevue, WA, USA, November 03 - 06, 2015, Art.Nr.: 4, ACM, New York (NY). doi:10.1145/2820783.2820800

Improved Single-Term Top-k Document Retrieval.
Gog, S.; Navarro, G.
2015. Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, 24–32. doi:10.1137/1.9781611973754.3

On Identifying Phrases Using Collection Statistics.
Gog, S.; Moffat, A.; Petri, M.
2015. Advances in Information Retrieval : 37th European Conference on IR Research, ECIR 2015, Vienna, Austria, March 29 - April 2, 2015. Proceedings. Ed.: A. Hanbury, 278–283, Springer, Cham. doi:10.1007/978-3-319-16354-3_30

Parallel Algorithms Reconsidered (Invited Talk).
Sanders, P.
2015. 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Ed.: E.W. Mayr, 10–18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern. doi:10.4230/LIPIcs.STACS.2015.10

Faster Exact Search Using Document Clustering.
Dimond, J.; Sanders, P.
2015. String Processing and Information Retrieval : 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings. Ed.: C. Iliopoulos, 141249, 12 S., Springer, Cham. doi:10.1007/978-3-319-23826-5_1

Practical Massively Parallel Sorting.
Axtmann, M.; Bingmann, T.; Sanders, P.; Schulz, C.
2015. Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 13–23, ACM, New York (NY). doi:10.1145/2755573.2755595

Cache-Efficient Aggregation: Hashing Is Sorting.
Müller, I.; Sanders, P.; Lacurie, A.; Lehner, W.; Färber, F.
2015. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, 1123–1136, ACM, New York (NY). doi:10.1145/2723372.2747644

Graph Partitioning for Independent Sets.
Lamm, S.; Sanders, P.; Schulz, C.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 68–81, Springer, Cahm. doi:10.1007/978-3-319-20086-6_6

Parallel Graph Partitioning for Complex Networks.
Meyerhenke, H.; Sanders, P.; Schulz, C.
2015. 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 1055–1064. doi:10.1109/IPDPS.2015.18

Locality Aware DAG-Scheduling for LU-Decomposition.
Maier, T.; Sanders, P.; Speck, J.
2015. 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 82–92, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2015.85

(Semi-)External Algorithms for Graph Partitioning and Clustering.
Akhremtsev, Y.; Sanders, P.; Schulz, C.
2015. Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. Ed.: U. Brandes, 33–43. doi:10.1137/1.9781611973754.4

A Bulk-Parallel Priority Queue in External Memory with STXXL.
Bingmann, T.; Keh, T.; Sanders, P.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 28–40, Springer, Cham. doi:10.1007/978-3-319-20086-6_3

Buchaufsätze

Recent Advances in Graph Partitioning. [Preprint].
Buluc, A.; Meyerhenke, H.; Safro, I.; Sanders, P.; Schulz, C.
2015. arXiv [cs.DS] : Data Structures and Algorithms, arXiv:1311.3144

n-Level Hypergraph Partitioning. [Preprint].
Henne, V.; Meyerhenke, H.; Sanders, P.; Schlag, S.; Schulz, C.
2015. arXiv [cs.DS], arXiv:1505.00693

Drawing Large Graphs by Multilevel Maxent-Stress Optimization. [Preprint].
Meyerhenke, H.; Nöllenburg, M.; Schulz, C.
2015. arXiv : Computing Research Repository (CoRR), arXiv:1506.04383

2014

Zeitschriftenaufsätze

Candidate Sets for Alternative Routes in Road Networks.
Luxen, D.; Schieferdecker, D.
2014. Journal of experimental algorithmics, 19, Article No.2.7. doi:10.1145/2674395

Firm growth and the spatial impact of geolocated external factors.
Duschl, M.; Schimke, A.; Brenner, T.; Luxen, D.
2014. Jahrbucher fur Nationalokonomie und Statistik, 234 (2-3), 234–256

Proceedingsbeiträge

Partitioning Complex Networks via Size-Constrained Clustering.
Meyerhenke, H.; Sanders, P.; Schulz, C.
2014. Experimental Algorithms - 13th International Symposium (SEA’14), Copenhagen, Denmark, June 29 - July 1, 2014. Ed.: J. Gudmundsson, 351–363, Springer, New York (NY). doi:10.1007/978-3-319-07959-2_30

Tree-Based Coarsening and Partitioning of Complex Networks.
Glantz, R.; Meyerhenke, H.; Schulz, C.
2014. Experimental Algorithms - 13th International Symposium (SEA’14), Copenhagen, Denmark, June 29 - July 1, 2014. Ed.: J. Gudmundsson, 364–375, Springer, New York (NY). doi:10.1007/978-3-319-07959-2_31

Speed-Consumption Tradeoff for Electric Vehicle Route Planning.
Baum, M.; Dibbelt, J.; Hübschle-Schneider, L.; Pajor, T.; Wagner, D.
2014. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’14), Wroclaw, Poland, September 11, 2014. Ed.: S. Funke, 138–151, Dagstuhl Publishing, Wadern. doi:10.4230/OASIcs.ATMOS.2014.138

Adaptive String Dictionary Compression in In-Memory Column-Store Database Systems.
Müller, I.; Ratsch, C.; Färber, F.
2014. Advances in database technology - EDBT 2014 : 17th International Conference on Extending Database Technology, Athens, Greece, March 24 - 28, 2014. Proceedings. Ed.: S. Amer-Yahia, 283–294, Universität Konstanz. doi:10.5441/002/edbt.2014.27

LZ-Compressed String Dictionaries.
Arz, J.; Fischer, J.
2014. Data Compression Conference (DCC’14), Snowbird, Utah/USA, March 26-28, 2014, 322–331, IEEE, Piscataway (NJ). doi:10.1109/DCC.2014.36

Retrieval and Perfect Hashing Using Fingerprinting.
Müller, I.; Sanders, P.; Schulze, R.; Zhou, W.
2014. Experimental Algorithms - 13th International Symposium (SEA’14), Copenhagen, Denmark, June 29 - July 1, 2014. Ed.: J. Gudmundsson, 138–149, Springer, New York (NY). doi:10.1007/978-3-319-07959-2_12

Buchaufsätze

Benchmarking for Graph Clustering and Partitioning.
Bader, D. A.; Meyerhenke, H.; Sanders, P.; Schulz, C.; Kappes, A.; Wagner, D.
2014. Encyclopedia of Social Network Analysis and Mining. Ed.: Prof. R. Alhajj, 73–82, Springer-Verlag, New York. doi:10.1007/978-1-4614-6170-8_23

STXXL 1.4.0 and Beyond.
Bingmann, T.; Sanders, P.
2014. Large-Scale Data Management and Analysis (LSDMA) - Big Data in Science. Hrsg.: Ch. Jung, 31, KIT, Karlsruhe

KaHIP - Karlsruhe High Quality Partitioning.
Akhremtsev, Y.; Sanders, P.; Schlag, S.; Schulz, C.
2014. Large-Scale Data Management and Analysis (LSDMA) - Big Data in Science. Hrsg.: Ch. Jung, 8, KIT, Karlsruhe

2013

Zeitschriftenaufsätze

Algorithm Engineering.
Sanders, P.; Wagner, D.
2013. Informatik-Spektrum, 36 (2), 131. doi:10.1007/s00287-013-0679-y

Proceedingsbeiträge

Malleable Sorting.
Flick, P.; Sanders, P.; Speck, J.
2013. 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2013), Boston, MA, May 20-24, 2013, 418–426, IEEE, Piscataway, NJ. doi:10.1109/IPDPS.2013.90

Vectorizing Database Column Scans with Complex Predicates.
Willhalm, T.; Oukid, I.; Müller, I.; Faerber, F.
2013. International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS 2013), Riva del Garda, Trento, I, August 26, 2013., 1–12

Efficient Parallel and External Matching.
Birn, M.; Osipov, V.; Sanders, P.; Schulz, C.; Sitchinava, N.
2013. Euro-Par 2013 - Parallel Processing. Ed.: F. Wolf, 659–670, Springer, Berlin. doi:10.1007/978-3-642-40047-6_66

An Alternative Approach to Alternative Routes: HiDAR.
Kobitzsch, M.
2013. Algorithms – ESA 2013. Ed.: H. Bodlaender, 613–624, Springer, Berlin. doi:10.1007/978-3-642-40450-4_52

Communication efficient algorithms for fundamental big data problems.
Sanders, P.; Schlag, S.; Muller, I.
2013. Proceedings of the 2013 IEEE International Conference on Big Data, Santa Clara, CA, October 6-9, 2013, 15–23, IEEE, Piscataway, NJ. doi:10.1109/BigData.2013.6691549

Work-efficient matrix inversion in polylogarithmic time.
Sanders, P.; Speck, J.; Steffen, R.
2013. SPAA’13 : proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures$dJuly 23 - 25, 2013, Montréal, Québec, Canada, 214–221, ACM, New York (NY). doi:10.1145/2486159.2486173

Transit Node Routing Reconsidered.
Arz, J.; Duxen, D.; Sanders, P.
2013. Experimental algorithms : 12th international symposium ; proceedings, SEA 2013, Rome, Italy, June 5 - 7, 2013. Ed.: V. Bonifaci, 55–66, Springer, Berlin. doi:10.1007/978-3-642-38527-8_7

Multi-Hop Ride Sharing.
Luxen, D.; Drews, F.
2013. Symposium on Combinatorial Search (SoCS’13), Leavenworth, Washington/USA, July 11-13, 2013

Candidate Sets for Alternative Routes in Road Networks.
Luxen, D.; Schieferdecker, D.
2013. Symposium on Combinatorial Search (SoCS’13), Leavenworth, Washington/USA, July 11-13, 2013

Parallel String Sample Sort.
Bingmann, T.; Sanders, P.
2013. Algorithms - 21st Annual European Symposium (ESA’13), Sophia Antipolis, France, September 2-4, 2013 - Proceedings. Ed.: H.L. Bodlaender, 169–180, Springer, Berlin. doi:10.1007/978-3-642-40450-4_15

Evolution and Evaluation of the Penalty Method for Alternative Graphs.
Kobitzsch, M.; Radermacher, M.; Schieferdecker, D.
2013. 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’13), Sophia Antipolis, France, September 5, 2013. Ed.: D. Frigioni, 94–107, Schloss Dagstuhl, Dagstuhl. doi:10.4230/OASIcs.ATMOS.2013.94

Think Locally, Act Globally: Highly Balanced Graph Partitioning.
Sanders, P.; Schulz, C.
2013. Experimental algorithms : 12th international symposium ; proceedings, SEA 2013, Rome, Italy, June 5 - 7, 2013. Ed.: V. Bonifaci, 164–175, Springer, Berlin. doi:10.1007/978-3-642-38527-8_16

Efficient many-core query execution in main memory column-stores.
Dees, J.; Sanders, P.
2013. IEEE 29th International Conference on Data Engineering (ICDE), 2013 : 8 - 12 April 2013, Brisbane, Australia ; proceedings. Ed.: Ch. S. Jensen, IEEE, Piscataway (NJ). doi:10.1109/ICDE.2013.6544838

Inducing Suffix and LCP Arrays in External Memory.
Bingmann, T.; Fischer, J.; Osipov, V.
2013. Workshop on Algorithm Engineering and Experiments (ALENEX), January 7, 2013, New Orleons, Louisiana, USA

Forschungsberichte

An Alternative Approach to Alternative Routes: HiDAR. Technical Report.
Kobitzsch, M.
2013. KIT, Karlsruhe. doi:10.5445/IR/1000035372

2012

Zeitschriftenaufsätze

The SAP HANA Database - An Architecture Overview.
Färber, F.; May, N.; Lehner, W.; Große, P.; Müller, I.; Rauhe, H.; Dees, J.
2012. Bulletin of the Technical Committee on Data Engineering / IEEE Computer Society, 35 (1), 28–33

Exact Routing in Large Road Networks Using Contraction Hierarchies.
Geisberger, R.; Sanders, P.; Schultes, D.; Vetter, C.
2012. Transportation science, 46 (3), 388–404. doi:10.1287/trsc.1110.0401

Proceedingsbeiträge

Distributed Evolutionary Graph Partitioning.
Sanders, P.; Schulz, C.
2012. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: D. Bader, 16–29, Society for Industrial and Applied Mathematics, Philadelphia, PA. doi:10.1137/1.9781611972924.2

Robust Mobile Route Planning with Limited Connectivity.
Delling, D.; Kobitzsch, M.; Luxen, D.; Werneck, R. F.
2012. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: D. Bader, 150–159, Society for Industrial and Applied Mathematics, Philadelphia, PA. doi:10.1137/1.9781611972924.15

Advanced Coarsening Schemes for Graph Partitioning.
Safro, I.; Sanders, P.; Schulz, C.
2012. Experimental Algorithms. Ed.: R. Klasing, 369–380, Springer, Berlin. doi:10.1007/978-3-642-30850-5_32

Candidate Sets for Alternative Routes in Road Networks.
Luxen, D.; Schieferdecker, D.
2012. Experimental Algorithms. Ed.: R. Klasing, 260–270, Springer, Berlin. doi:10.1007/978-3-642-30850-5_23

A Generalized Computational Framework for Accessibility: From the Pedestrian to the Metropolitan Scale.
Foti, F.; Waddell, P.; Luxen, D.
2012. Proceedings of the 4th TRB Conference on Innovations in Travel Modeling (ITM), Transportation Research Board

Engineering Graph Partitioning Algorithms.
Osipov, V.; Sanders, P.; Schulz, C.
2012. Experimental Algorithms. Ed.: R. Klasing, 18–26, Springer, Berlin. doi:10.1007/978-3-642-30850-5_3

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks.
Sanders, P.; Speck, J.
2012. Euro-Par 2012 Parallel Processing. 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Ed.: C. Kaklamanis, 167–178, Springer, Berlin. doi:10.1007/978-3-642-32820-6_18

Time-Dependent Route Planning with Generalized Objective Functions.
Batz, G. V.; Sanders, P.
2012. Algorithms - ESA 2012. Ed.: L. Epstein, 169–180, Springer, Berlin. doi:10.1007/978-3-642-33090-2_16

Efficient Route Compression for Hybrid Route Planning.
Batz, G. V.; Geisberger, R.; Luxen, D.; Sanders, P.; Zubkov, R.
2012. Design and analysis of algorithms: 1st Mediterranean Conference on Algorithms. Ed.: G. Even, 93–107, Springer, Berlin. doi:10.1007/978-3-642-34862-4_7

Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries.
Fietz, J.; Krause, M. J.; Schulz, C.; Sanders, P.; Heuveline, V.
2012. Euro-Par 2012 parallel processing : 18th International Conference, Euro-Par 2012, Rhodes Islands, Greece, August 27-31, 2012. Ed.: Ch. Kaklamanis, 818–829, Springer, Berlin. doi:10.1007/978-3-642-32820-6_81

Forschungsberichte

Doing More for Less – Cache-Aware Parallel Contraction Hierarchies Preprocessing.
Luxen, D.; Schieferdecker, D.
2012

2011

Zeitschriftenaufsätze

Space Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays.
Fischer, J.; Heun, V.
2011. SIAM journal on computing, 40 (2), 465–492. doi:10.1137/090779759

Combined data structure for previous- and next-smaller-values.
Fischer, J.
2011. Theoretical Computer Science, 412 (22), 2451–2456

Energy-efficient paths in radio networks.
Beier, R.; Funke, S.; Matijevic, D.; Sanders, P.
2011. Algorithmica, 61 (2), 298–319. doi:10.1007/s00453-010-9414-0

Stronger Quickheaps.
Navarro, G.; Paredes, R.; v. Poblete, P.; Sanders, P.
2011. International Journal of Foundations of Computer Science (IJFCS), 22 (4), 945–969

Proceedingsbeiträge

Alternative Route Graphs in Road Networks.
Bader, R.; Dees, J.; Geisberger, R.; Sanders, P.
2011. Theory and Practice of Algorithms in (Computer) Systems – 1st International ICST Conference (TAPAS 2011), Rome, I, April 18-20, 2011. Proceedings. Ed.: A. Marchetti-Spaccamela, 21–32, Springer, Berlin. doi:10.1007/978-3-642-19754-3_5

Efficient Routing in Road Networks with Turn Costs.
Geisberger, R.; Vetter, C.
2011. Experimental Algorithms. Ed.: P. M. Pardalos, 100–111, Springer, Berlin. doi:10.1007/978-3-642-20662-7_9

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks.
Schieferdecker, D.; Völker, M.; Wagner, D.
2011. Experimental Algorithms. 10th International Symposium, SEA 2011 Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings Ed.: P. Pardalos, 388–399, Springer, Berlin. doi:10.1007/978-3-642-20662-7_33

Engineering a Multi-core Radix Sort.
Wassenberg, J.; Sanders, P.
2011. Euro-Par 2011 Parallel Processing : 17th International Euro-ParConference, Bordeaux, France, August 29 - September 2, 2011, proceedings. Teil: 2. Ed.: E. Jeannot, 160–169, Springer, Heidelberg. doi:10.1007/978-3-642-23397-5_16

Efficient Parallel Scheduling of Malleable Tasks.
Sanders, P.; Speck, J.
2011. Proceedings 25th IEEE International Parallel & Distributed Processing Symposium IPDPS 2011, May,16-20, 2011, Anchorage, Alaska, USA. Ed.: F. Mueller, 1156–1166, IEEE, Piscataway (NJ)

Hierarchy Decomposition for Faster User Equilibria on Road Networks.
Luxen, D.; Sanders, P.
2011. Experimental Algorithms 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings. Ed.: P. M. Pardalos, 242–253, Springer, Berlin

Real-Time Routing with OpenStreetMap data.
Luxen, D.; Vetter, C.
2011. 9th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2011), November 1-4 2011, Chicago, Illinois. Ed.: I. Cruz, 513–516, ACM, New York

Engineering efficient error-correcting geocoding.
Jung, C.; Karch, D.; Knopp, S.; Luxen, D.; Sanders, P.
2011. Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, November 1-4 2011, Chicago, Illinois. Ed.: I.Cruz, 469–472, ACM, New York

Inducing the LCP-Array.
Fischer, J.
2011. Algorithms and data structures : 12th International Symposium, WADS 2011, New York, NY, USA, August 15 - 17, 2011; proceedings. Ed.: F. Dehne, 374–385, Springer, Berlin

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
Barbay, J.; Fischer, J.; Navarro, G.
2011. Combinatorial pattern matching : 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27 - 29, 2011; proceedings. Ed.: R. Giancarlo, 285–298, Springer, Berlin

Compact Representation of Posets.
Farzan, A.; Fischer, J.
2011. Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011; proceedings. Ed.: T. Asano, 302–311, Springer, Berlin

Engineering State-of-the-Art Graph Partitioning Libraries @KIT.
Osipov, V.; Sanders, P.; Schulz, C.; Holtgrewe, M.
2011. Computational Methods in Science and Engineering - Proceedings of the Workshop SimLabs@KIT, November 29 - 30, 2010, Karlsruhe, Germany. Ed.: I. Kondov, 117–130, KIT Scientific Publishing, Karlsruhe

Efficient Error-Correcting Geocoding.
Jung, C.; Karch, D.; Knopp, S.; Luxen, D.; Sanders, P.
2011. GIS ’11 Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Ed.: D. Agrawal, 469–472, ACM, New York (NY). doi:10.1145/2093973.2094050

Forschungsberichte

Firm growth and the spatial impact of geolocated external factors - empirical evidence for German manufacturing firms.
Duschl, M.; Schimke, A.; Brenner, T.; Luxen, D.
2011. KIT, Karlsruhe. doi:10.5445/IR/1000024923

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks.
Schieferdecker, D.; Völker, M.; Wagner, D.
2011. KIT, Karlsruhe. doi:10.5445/IR/1000022438

Buchaufsätze

Engineering Multilevel Graph Partitioning Algorithms.
Sanders, P.; Schulz, C.
2011. Algorithms – ESA 2011. 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Ed.: C. Demetrescu, 469–480, Springer, Berlin. doi:10.1007/978-3-642-23719-5_40

Shortest Paths.
Sanders, P.; Singler, J.
2011. Algorithms unplugged. Ed.: B. Vöcking, 317–324, Springer, Berlin

2010

Zeitschriftenaufsätze

Parallel geometric algorithms for multi-core computers.
Batista, V. H. F.; Millman, D. L.; Pion, S.; Singler, J.
2010. Computational geometry, 43 (8), 663–677. doi:10.1016/j.comgeo.2010.04.008

New common ancestor problems in trees and directed acyclic graphs.
Fischer, J.; Huson, D. H.
2010. Information Processing Letters, 110 (8-9), 331–335. doi:10.1016/j.ipl.2010.02.014

Wee LCP.
Fischer, J.
2010. Journal Information Processing Letters, 110 (8-9), 317–320. doi:10.1016/j.ipl.2010.02.010

Finding Range Minima in the Middle: Approximations and Applications.
Fischer, J.; Heun, V.
2010. International Journal of Mathematics and Computer Science, 3 (1), 17–30. doi:10.1007/s11786-009-0007-8

Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra`s Algorithm.
Bauer, R.; Delling, D.; Sanders, P.; Schieferdecker, D.; Schultes, D.; Wagner, D.
2010. Journal of experimental algorithmics, 15, 1–30

Energy-Efficient Sorting using Solid State Disks.
Beckmann, A.; Meyer, U.; Sanders, P.; Singler, J.
2010. Sustainable Computing: Informatics and Systems, 1 (2), 151–163. doi:10.1016/j.suscom.2011.02.004

Proceedingsbeiträge

Contraction of Timetable Networks with Realistic Transfers.
Geisberger, R.
2010. Experimental Algorithms. Ed.: P. Festa, 71–82, Springer, Berlin. doi:10.1007/978-3-642-13193-6_7

Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns.
Bast, H.; Carlsson, E.; Eigenwillig, A.; Geisberger, R.; Harrelson, C.; Raychev, V.; Viger, F.
2010. Algorithms - ESA 2010. Ed.: M. de Berg, 290–301, Springer, Berlin. doi:10.1007/978-3-642-15775-2_25

Fast Detour Computation for Ride Sharing.
Geisberger, R.; Luxen, D.; Neubauer, S.; Sanders, P.; Volker, L.
2010. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’10), Liverpool, GB, September 9, 2010. Ed.: T. Erlebach, 88–99, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl. doi:10.4230/OASIcs.ATMOS.2010.88

Engineering Time-Dependent Many-to-Many Shortest Paths Computation.
Geisberger, R.; Sanders, P.
2010. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’10) Hrsg.: Thomas Erlebach; Marco Lübbecke, 74–87, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl. doi:10.4230/OASIcs.ATMOS.2010.74

A Comparison of High-level Approaches for Speeding Up Pathfinding.
Sturtevant, N. R.; Geisberger, R.
2010. Proceedings of the 6th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, Palo Alto, CA, October 11-13, 2010, 76–82, AAAI Press, Menlo Park, CA. doi:10.1.1.684.4177

Improved Fast Similarity Search in Dictionaries.
Karch, D.; Luxen, D.; Sanders, P.
2010. String Processing and Information Retrieval 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Ed.: E. Chavez, 173–178, Springer, Berlin

Route Planning with Flexible Objective Functions.
Geisberger, R.; Kobitzsch, M.; Sanders, P.
2010. Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010. Ed.: G. E. Blelloch, 124–137, SIAM, Philadelphia (PA)

Optimal Succinctness for Range Minimum Queries.
Fischer, J.
2010. LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Ed.: A. López-Ortiz, 158–169, Springer, Berlin

Advantages of Shared Data Structures for Sequences of Balanced Parentheses.
Gog, S.; Fischer, J.
2010. Data Compression Conference (DCC 2010), 24-26 March 2010, Snowbird, UT, USA. Ed.: J. A. Storer, 406–415, IEEE, Washington

CST++.
Ohlebusch, E.; Fischer, J.; Gog, S.
2010. String Processing and Information Retrieval : 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Ed.: E. Chavez, 322–333, Springer, Berlin

Simple and Fast Nearest Neighbor Search.
Birn, M.; Holtgrewe, M.; Sanders, P.; Singler, J.
2010. Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), Austin, Texas, USA, 16 January 2010, 43–54, Curran, Red Hook (NY)

Scalable Distributed-Memory External Sorting.
Rahn, M.; Sanders, P.; Singler, J.
2010. 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), Long Beach, California, USA, 1 - 6 March 2010. Ed.: F. Li, 685–688, IEEE, Piscataway (NJ)

GPU Sample Sort.
Leischner, N.; Osipov, V.; Sanders, P.
2010. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS 2010), Atlanta, Georgia, USA, 19 - 23 April 2010. Ed.: D. A. Bader, 05470444/1–10, IEEE, Piscataway (NJ)

Time-Dependent Contraction Hierarchies and Approximation.
Batz, G. V.; Geisberger, R.; Neubauer, S.; Sanders, P.
2010. Experimental algorithms: Proceedings of the 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Ed.: P. Festa, 166–177, Springer, Berlin

Distributed Time-Dependent Contraction Hierarchies.
Kieritz, T.; Luxen, D.; Sanders, P.; Vetter, C.
2010. Experimental algorithms: Proceedings of the 9th International Symposium (SEA 2010), Ischia Island, Naples, Italy, May 20-22, 2010. Ed.: P. Festa, 94–105, Springer, Berlin

Energy-Efficient Sorting using Solid State Disks.
Beckmann, A.; Meyer, U.; Sanders, P.; Singler, J.
2010. 2010 International Green Computing Conference, Chicago, Illinois, USA, 15 - 18 August 2010, 191–202, IEEE, Piscataway (NJ)

n-Level Graph Partitioning.
Osipov, V.; Sanders, P.
2010. Algorithms - ESA 2010: Proceedings of the 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Part I. Ed.: M. d. Berg, 278–289, Springer, Berlin

Heuristic Contraction Hierarchies with Approximation Guarantee.
Geisberger, R.; Schieferdecker, D.
2010. Proceedings of the Third International Symposium on Combinatorial Search (SoCS 2010), Atlanta, Georgia USA, 8-10 July, 2010. Ed.: N. Sturtevant, 14 S., AAAI Publications, Menlo Park (Calif.)

Lifetime Maximization of Monitoring Sensor Networks.
Schieferdecker, D.; Sanders, P.
2010. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010; Revised Selected Papers. Ed.: Ch. Scheideler, 134–147, Springer, Berlin

Forschungsberichte

Defining and Computing Alternative Routes in Road Networks.
Dees, J.; Geisberger, R.; Sanders, P.; Bader, R.
2010. doi:10.5445/IR/1000097663

Compressed Transmission of Route Descriptions.
Batz, G. V.; Geisberger, R.; Luxen, D.; Sanders, P.
2010

Buchaufsätze

Libraries.
Dementiev, R.; Singler, J.
2010. Algorithm engineering : bridging the gap between algorithm theory and practice. Ed.: M. Müller-Hannemann, 290–324, Springer, Berlin

2009

Zeitschriftenaufsätze

Faster entropy-bounded compressed suffix trees.
Fischer, J.; Makinen, V.; Navarro, G.
2009. Journal Theoretical Computer Science, 410 (51), 5354–5364

Goal directed shortest path queries using Precomputed Cluster Distances.
Maue, J.; Sanders, P.; Matijevic, D.
2009. Journal of Experimental Algorithmics, 14, 1–27

Two-tree algorithms for full bandwidth broadcast, reduction and scan.
Sanders, P.; Speck, J.; Larsson Träff, J.
2009. Parallel Computing, 35 (12), 581–594

Cache-, Hash- and Space-Efficient Bloom Filters.
Putze, F.; Sanders, P.; Singler, J.
2009. ACM Journal of Experimental Algorithmics, 14, 4.4/1–18

Online Scheduling with Bounded Migration.
Sanders, P.; Sivadasan, N.; Skutella, M.
2009. Mathematics of Operations Research, 34 (2), 481–498

Proceedingsbeiträge

Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm.
Meyer, U.; Osipov, V.
2009. 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: I. Finocchi, 85–96, Society for Industrial and Applied Mathematics, Philadelphia, PA. doi:10.1137/1.9781611972894.9

Building a parallel pipelined external memory algorithm library.
Beckmann, A.; Dementiev, R.; Singler, J.
2009. 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009), Rome, I, May 23-29, 2009, Article no: 5161001, IEEE, Piscataway, NJ. doi:10.1109/IPDPS.2009.5161001

Parallel Geometric Algorithms for Multi-Core Computers.
Batista, V. H. F.; Millman, D. L.; Pion, S.; Singler, J.
2009. Proceeding SCG ’09 Proceedings of the 25th annual symposium on Computational geometry, Aarhus University, Denmark, June 8-10, 2009, 217–226, ACM, New York

The Filter-Kruskal Minimum Spanning Tree Algorithm.
Osipov, V.; Sanders, P.; Singler, J.
2009. 11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithms and Combinatorics (ALENEX 09/ANALCO 09), New York, New York, USA, 3 January 2009, 52–61, Curran, Red Hook (NY)

An Efficient Parallel Algorithm for Graph-Based Image Segmentation.
Wassenberg, J.; Middelmann, W.; Sanders, P.
2009. Computer analysis of images and patterns: Proceedings of the 13th International Conference (CAIP 2009), Münster, Germany, September 2-4, 2009. Ed.: X. Jiang, 1003–1010, Springer, Berlin

Towards Optimal Range Medians.
Gfeller, B.; Sanders, P.
2009. Automata, languages and programming: Proceedings of the 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5 - 12, 2009. Ed.: S. Albers, 475–486, Springer, Berlin

Highway Hierarchies Star.
Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.
2009. The Shortest Path Problem - 9th DIMACS Implementation Challenge. Ed.: C. Demetrescu, 141–174, American Mathematical Society, Providence (RI)

ORCA Reduction and ContrAction Graph Clustering.
Delling, D.; Goerke, R.; Schulz, C.; Wagner, D.
2009. Algorithmic Aspects in Information and Management - Proceedings of the 5th International Conference (AAIM 2009), June 15-17, 2009, San Francisco, CA, USA. Ed.: A. V. Goldberg, 152–165, Springer, Berlin

Time-Dependent Contraction Hierarchies.
Batz, V.; Delling, D.; Sanders, P.; Vetter, C.
2009. Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX’09), January 3, 2009 New York, 97–105, SIAM, Philadelphia (PA)

Gaussian Mixture Reduction via Clustering.
Huber, M. F.; Schieferdecker, D.
2009. Proceedings of the 12th International Conference on Information Fusion (Fusion 2009), Seattle, Washington, USA, 6 - 9 July 2009

Forschungsberichte

Fast Detour Computation for Ride Sharing.
Geisberger, R.; Luxen, D.; Neubauer, S.; Sanders, P.; Volker, L.
2009. Universität Karlsruhe, Karlsruhe

Buchaufsätze

Algorithm Engineering - An Attempt at a Definition.
Sanders, P.
2009. Efficient algorithms: essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday. Ed.: S. Albers, 321–340, Springer, Berlin

Engineering Route Planning Algorithms.
Delling, D.; Sanders, P.; Schultes, D.; Wagner, D.
2009. Algorithmics of Large and Complex Networks. Ed.: J. Lerner, 117–139, Springer, Berlin

2008

Zeitschriftenaufsätze

Single-Pass List Partitioning.
Frias, L.; Singler, J.; Sanders, P.
2008. Scalable Computing: Practice and Experience, 9 (3), 179–184

Speed scaling of tasks with precedence constraints.
Pruhs, K.; Stee, R. van; Uthaisombut, P.
2008. Theory of Computing Systems, 43 (1), 67–80

An asymptotic approximation scheme for multigraph edge coloring.
Sanders, P.; Steurer, D.
2008. ACM Transactions on Algorithms (TALG), 4 (2), 897–906

STXXL: Standard template library for XXL data sets.
Dementiev, R.; Kettner, L.; Sanders, P.
2008. Software - practice and experience, 38 (6), 589–638

Better external memory suffix array construction.
Dementiev, R.; Kärkkäinen, J.; Mehnert, J.; Sanders, P.
2008. Journal of experimental algorithmics, 12 (June), Art. No. 3.4

Proceedingsbeiträge

Mobile Route Planning.
Sanders, P.; Schultes, D.; Vetter, C.
2008. Algorithms - ESA 2008. Proceedings of the 16th annual European symposium, Karlsruhe, Germany, September 15-17, 2008. Ed.: D. Halperin, 732–743, Springer, Berlin

Semi-external LTL model checking.
Edelkamp, S.; Sanders, P.; Simecek, P.
2008. Computer aided verification: Proceedings of the 20th International Conference (CAV 2008), Princeton, NJ, USA, July 7-14, 2008. Ed.: A. Gupta, 530–542, Springer, Berlin

Out of the Box Phrase Indexing.
Transier, F.; Sanders, P.
2008. String processing and information retrieval: Proceedings of the 15th International Symposium (SPIRE 2008), Melbourne, Australia, November 10-12, 2008. Ed.: A. Amir, 200–211, Springer, Berlin

Bidirectional A* Search for Time-Dependent Fast Paths.
Nannicini, G.; Delling, D.; Liberti, L.; Schultes, D.
2008. Experimental Algorithms - 7th International Workshop (WEA 2008), May 30 - June 1, 2008, Provincetown, MA, USA. Ed.: C.C. McGeoch; proceedings, 334–346, Springer, Berlin

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
Geisberger, R.; Sanders, P.; Schultes, D.; Delling, D.
2008. Experimental Algorithms. 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008, proceedings. Ed.: C.C. McGeoch, 319–333, Springer, Berlin. doi:10.1007/978-3-540-68552-4_24

Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm.
Bauer, R.; Delling, D.; Sanders, P.; Schieferdecker, D.; Schultes, D.; Wagner, D.
2008. Experimental Algorithms. 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008. proceedings Ed.: C.C. McGeoch, 303–318, Springer Berlin / Heidelberg

Intersection in integer inverted indices.
Sanders, P.; Transier, F.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 71–83, SIAM, Society for Industrial and Applied Mathematics

Computing many-to-many shortest paths using highway hierarchies.
Knopp, S.; Sanders, P.; Schultes, D.; Schulz, F.; Wagner, D.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 36–45, SIAM, Society for Industrial and Applied Mathematics

In transit to constant time shortest-path queries in road networks.
Bast, H.; Funke, S.; Matijevic, D.; Sanders, P.; Schultes, D.
2008. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007, New Orleans, Louisiana, USA, January 6, 2007, 46–59, SIAM, Society for Industrial and Applied Mathematics

Approximation schemes for packing splittable items with cardinality constraints.
Epstein, L.; Stee, R. van.
2008. 5th International Workshop on Approximation and Online Algorithms (WAOA 2007), Eilat, Israel, October 11-12, 2007, Hrsg.: C. Kaklamanis, 232–245, Springer, Berlin

On the online unit clustering problem.
Epstein, L.; Stee, R. van.
2008. 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, Eilat, Israel, October 11 - 12, 2007. Hrsg.: C. Kaklamanis, 193–206, Springer, Berlin

Compressed inverted indexes for in-memory search engines.
Transier, F.; Sanders, P.
2008. 2008 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, Ca., USA, January 19, 2008, SIAM, Philadelphia

Better approximation of betweenness centrality.
Geisberger, R.; Sanders, P.; Schultes, D.
2008. 2008 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, Ca., USA, January 19, 2008, SIAM, Philadelphia (PA)

Single-pass list partitioning.
Frias, L.; Singler, J.; Sanders, P.
2008. International Workshop on Multi-Core Computing Systems (MuCoCoS’08), Barcelona, Spain, March 7, 2008, Barcelona

The libstdc++ parallel mode: software engineering considerations.
Singler, J.; Kosnik, B.
2008. International Conference on Software Engineering - Proceedings of the 1st International Workshop on Multicore Software Engineering (IWMSE), Leipzig, 10.-18. Mai 2008, 15–22, ACM, New York (NY)

Forschungsberichte

Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas.
Batz, G. V.; Geisberger, R.; Sanders, P.
2008. Univ., Karlsruhe

Buchaufsätze

Kürzeste Wege.
Sanders, P.; Singler, J.
2008. Taschenbuch der Algorithmen, Hrsg.: B. Vöcking, 345–352, Springer, Berlin

2007

Zeitschriftenaufsätze

Online bin packing with resource augmentation.
Epstein, L.; Stee, R. van.
2007. Discrete Optimization, 4 (3), 322–333

A study of integrated document and connection caching in the WWW.
Albers, S.; Stee, R. van.
2007. Algorithmica, 47 (3), 239–252

Paging with connections: FIFO strikes again.
Epstein, L.; Kleiman, Y.; Sgall, J.; van Stee, R.
2007. Theoretical computer science, 377 (1), 55–64. doi:10.1016/j.tcs.2007.02.009

Bounds for online bounded space hypercube packing.
Epstein, L.; van Stee, R.
2007. Discrete optimization, 4 (2), 185–197. doi:10.1016/j.disopt.2006.11.005

Calculating lower bounds for caching problems.
Epstein, L.; van Stee, R.
2007. Computing, 80 (3), 275–285

Scalable parallel suffix array construction.
Kulla, F.; Sanders, P.
2007. Parallel computing, 33 (9), 605–612. doi:10.1016/j.parco.2007.06.004

Fast routing in road networks with transit nodes.
Bast, H.; Funke, S.; Sanders, P.; Schultes, D.
2007. Science, 316 (5824), 566

Proceedingsbeiträge

A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching.
Batz, G. V.; Kroll, M.; Geiß, R.
2007. Applications of Graph Transformations with Industrial Relevance Applications of Graph Transformations with Industrial Relevance Applications of Graph Transformations with Industrial Relevance Third International Symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007. Ed.: E. Schürr, 471–486, Springer, Berlin

Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
Knopp, S.; Sanders, P.; Schultes, D.; Schulz, F.; Wagner, D.
2007. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007) and the Fourth Workshop on Analytic Algorithmics and Combinatorics, January 6, 2007, New Orleans, Louisana. Ed.: D. Applegate, 36–45, SIAM, Philadelphia (PA)

Scalable parallel suffix array construction.
Kulla, F.; Sanders, P.
2007. High Performance Computing in Science and Engineering 06. Transactions of the High Performance Computing Center Stuttgart (HLRS) 2006., 22–29, Springer, Berlin

The random graph threshold for k-orientability and a fast algorithm for optimal multiple-choice allocation.
Cain, J. A.; Sanders, P.; Wormald, N.
2007. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, January 7-9, 2007., ACM Press, New York (NY)

MCSTL: the multi-core standard template library.
Putze, F.; Sanders, P.; Singler, J.
2007. Proceedings of the 2007 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP ’07), March 14 - 17, 2007, San Jose, California, USA, 144–145, ACM, New York (NY)

Engineering algorithms for approximate weighted matching.
Maue, J.; Sanders, P.
2007. Experimental Algorithms. 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007. Proceedings., 242–255, Springer, Berlin

Cache-, hash- and space efficient bloom filters.
Putze, F.; Sanders, P.; Singler, J.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 108–121, Springer, Berlin

Engineering fast route planning algorithms.
Sanders, P.; Schultes, D.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 23–36, Springer, Berlin

Dynamic highway-node routing.
Schultes, D.; Sanders, P.
2007. Experimental algorithms - 6th International Workshop (WEA 2007), June 6 - 8 2007, Rome, Italy. Ed.: C. Demetrescu, 66–79, Springer, Berlin

Improved results for a memory allocation problem.
Epstein, L.; Stee, R. van.
2007. Algorithms and data structures. 10th International Workshop, WADS 2007, Halifax, Canada, August 15 - 17, 2007. Hrsg.: F. Dehne, 362–373, Springer, Berlin

Multi-dimensional packing with conflicts.
Epstein, L.; Levin, A.; Stee, R. van.
2007. Fundamentals of computation theory. 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Hrsg.: E. Csuhaj-Varjú, 288–299, Springer, Berlin

MCSTL: The multi-core standard template library.
Singler, J.; Sanders, P.; Putze, F.
2007. Euro-Par 2007, parallel processing. 13th International Euro-Par Conference, Rennes, France, August 28 - 31, 2007. Hrsg.: A.-M.edingsKermarrec, 682–694, Springer, Berlin

Parallelization of bulk operations for STL dictionaries.
Frias, L.; Singler, J.
2007. Euro-Par 2007 workshops parallel processing. HPPC 2007, UNICORE Summit 2007, and VHPC 2007, Rennes, France, August 28 - 31, 2007. Hrsg.: L. Bougé, 49–58, Springer, Berlin

Preemptive scheduling on selfish machines.
Epstein, L.; Stee, R. van.
2007. Combinatorial and algorithmic aspects of networking. 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Hrsg.: J. Janssen, 57–70, Springer, Berlin

Full bandwidth broadcast, reduction and scan with only two trees.
Sanders, P.; Speck, J.; Träff, J. L.
2007. Recent advances in parallel virtual machine and message passing interface. 14th European PVM/MPI User’s Group Meeting, Paris, France, September 30 - October 3, 2007. Hrsg.: F. Cappello, 17–26, Springer, Berlin

Buchaufsätze

Multidimensional packing problems.
Epstein, L.; van Stee, R.
2007. Handbook of approximation algorithms and metaheuristics, Hrsg.: T. F. Gonzalez, Chapman & Hall, Boca Raton (FL)

2006

Zeitschriftenaufsätze

Optimal online algorithms for multidimensional packing problems.
Epstein, L.; Stee, R. van.
2006. SIAM journal on computing, 35 (2), 431–448

Online scheduling of splittable tasks.
Epstein, L.; Stee, R. van.
2006. ACM transactions on algorithms, 2 (1), 79–94

Linear work suffix array construction.
Kärkkäinen, J.; Sanders, P.; Burkhardt, S.
2006. Journal of the ACM, 53 (6), 1–19

This side up!.
Epstein, L.; Stee, R. van.
2006. ACM transactions on algorithms, 2 (2), 228–243

Proceedingsbeiträge

Scalable Parallel Suffix Array Construction.
Kulla, F.; Sanders, P.
2006. Recent Advances in Parallel Virtual Machine and Message Passing Interface. Ed.: B. Mohr, 22–29, Springer, Berlin. doi:10.1007/11846802_12

Goal directed shortest path queries using precomputed cluster distances.
Maue, J.; Sanders, P.; Matijevic, D.
2006. Experimental Algorithms. 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006. Proceedings., 316–327, Springer, Berlin

Paging with request sets.
Epstein, L.; van Stee, R.; Tamir, T.
2006. Algorithm Theory SWAT 2006. 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006., 124–135, Springer, Berlin

How branch mispredictions affect quicksort.
Kaligosi, K.; Sanders, P.
2006. Algorithms ESA 2006. 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings., 780–791, Springer, Berlin

Engineering and applications track - engineering highway hierarchies.
Sanders, P.; Schultes, D.
2006. Proceedings / Algorithms - ESA 2006, 14th Annual European Symposium, September 11 - 13, 2006, Zurich, Switzerland. Ed.: Y. Azar, 804–816, Springer, Berlin

Collective communication - parallel prefix (scan) algorithms for MPI.
Sanders, P.; Träff, J. L.; Larsson, J.
2006. Proceedings / Recent advances in parallel virtual machine and message passing interface - 13th European PVM/MPI User’s Group Meeting, September 17 - 20, 2006, Bonn, Germany. Ed.: B. Mohr, 49–57, Springer, Berlin

A computational study of external-memory BFS algorithms.
Ajwani, D.; Dementiev, R.; Meyer, U.
2006. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. Miami, FL., January 22 - 24, 2006, 601–610, ACM, New York (NY)

Buchaufsätze

Speed scaling of tasks with precedence constraints.
Pruhs, K.; Stee, R. van; Uthaisombut, P.
2006. Approximation and online algorithms. Ed.: T. Erlebach, 307–319, Springer, Berlin

Vorträge

Highway Hierarchies Star.
Delling, D.; Schultes, D.
2006. 9th DIMACS Implementation Challenge (2006), Piscataway, NJ, USA, 13. November 2006–14. November 2016

2005

Zeitschriftenaufsätze

Minimizing the total completion time on-line on a single machine, using restarts.
Stee, R. van; La Poutré, H.
2005. Journal of algorithms, 57 (2), 95–129

Improved competitive guarantees for QoS buffering.
Kesselman, A.; Mansour, Y.; Stee, R. van.
2005. Algorithmica: an international journal to computer science, 43 (1), 63–80

Space efficient hash tables with worst case constant access time.
Fotakis, D.; Pagh, R.; Sanders, P.; Spirakis, P.
2005. Theory of computing systems, 38 (2), 229–248

Duality between prefetching and queued writing with parallel disks.
Hutchinson, D. A.; Sanders, P.; Vitter, J. S.
2005. SIAM Journal on computing, 34 (6), 1443–1463

Polynomial time algorithms for multicast network code construction.
Jaggi, S.; Sanders, P.; Chou, P. A.; Effros, M.; Egner, S.; Jain, K.; Tolhuizen, L. M. G. M.
2005. IEEE Transactions on information theory, 51 (6), 1973–1982

Proceedingsbeiträge

Better External Memory Suffix Array Construction.
Dementiev, R.; Kärkkäinen, J.; Mehnert, J.; Sanders, P.
2005. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. Ed.: C. Demetrescu ., 86–97, SIAM, Philadelphia (PA)

Online bin packing with resource augmentation.
Epstein, L.; van Stee, R.
2005. Approximation and Online Algorithms. Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004. Revised Selected Papers., 23–35, Springer, Berlin

This side up!.
Epstein, L.; van Stee, R.
2005. Approximation and Online Algorithms. Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004. Revised Selected Papers., 48–60, Springer, Berlin

On strip packing with rotations.
Jansen, K.; van Stee, R.
2005. Proceedings of the 37th annual ACM Symposium on Theory of Computing, STOC 2005, Baltimore, MD, USA, May 22-24, 2005., 755–761, ACM, New York

Highway hierarchies hasten exact shortest path queries.
Sanders, P.; Schultes, D.
2005. Proceedings / Algorithms - 13th Annual European Symposium (ESA 2005), October 3 - 6, 2005, Palma de Mallorca, Spain. Ed.: G. S. Brodal, 568–579, Springer, Berlin

Towards optimal multiple selection.
Kaligosi, K.; Mehlhorn, K.; Munro, J.; Sanders, P.
2005. Automata, Languages and Programming. 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings., 103–114, Springer, Berlin

An asymptotic approximation scheme for multigraph edge coloring.
Sanders, P.; Steurer, D.
2005. Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, January 23 - 25, 2005, Vancouver, 897–906, Association for Computing Machinery, New York (NY)

STXXL: Standard template library for XXL data sets.
Dementiev, R.; Kettner, L.; Sanders, P.
2005. Algorithms - ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Hrgs.: G.S. Brodal, 640–651, Springer, Berlin

2004

Zeitschriftenaufsätze

Online square and cube packing.
Epstein, L.; Stee, R. van.
2004. Acta informatica, 41 (9), 595–606

1998

Proceedingsbeiträge

Tree Shaped Computations as a Model for Parallel Applications.
Sanders, P.
1998. Workshop on Application Based Load Balancing (ALV ’98), München, 25. - 26. März 1998 - Veranst. vom Sonderforschungsbereich 342 "Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen". Ed.: A. Bode, 123–132, Technische Universität, München

1996

Proceedingsbeiträge

On the Competitive Analysis of Randomized Static Load Balancing.
Sanders, P.
1996. Proceedings of the First Workshop on Randomized Parallel Algorithms, Honolulu, Hawaii, 16th April 1996. Ed.: S. Rajasekaran, 1–8

Berichte
Titel	Autor	Quelle
Communication-Efficient (Weighted) Reservoir Sampling	Lorenz Hübschle-Schneider und Peter Sanders	arXiv:1910.11069
COBS: a Compact Bit-Sliced Signature Index	Timo Bingmann, Phelim Bradley, Florian Gauger, Zamin Iqbal	arXiv:1905.09624
Linear Work Generation of R-MAT Graphs	Lorenz Hübschle-Schneider und Peter Sanders	arxiv:1905.03525