Publications:

Year 2017:

  • Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, and Sebastian Schlag. Engineering a direct k-way hypergraph partitioning algorithm. In Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017., pages 28–42, 2017

 

 

  • Benedikt Auerbach, David Cash, Manuel Fersch, and Eike Kiltz. Memory-Tight Reductions. In In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, 2017.

 

 

  • Mareike Bockholt and Katharina A. Zweig. Process-driven betweenness centrality measures. In 4th European Network Intelligence Conference. Lecture Notes on Social Networks, Springer, 2017.

 

  •  Christian Brugger, Valentin Grigorovici, Matthias Jung, Christian De Schryver, Christian Weisand Norbert Wehn, and Katharina Anna Zweig. A Memory Centric Architecture of the Link Assessment Algorithm in Large Graphs. In IEEE Design & Test, vol. PP, no. 99, pp. 1-1.

 

  • Andre Droschinsky, Nils Kriege, and Petra Mutzel. Finding largest common substructures of molecules in quadratic time. In SOFSEM 2017: Theory and Practice of Computer Science- 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings, pages 309-321, 2017.

 

 

 

  • Johannes Fischer, Florian Kurpicz, and Peter Sanders. Engineering a distributed full-text index. In Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017., pages 120-134, 2017.

 

  • Johannes Fischer and Florian Kurpicz. Dismantling DivSufSort. In In Proceedings of the Prague Stringology Conference 2017 (PSC), pages 62-76, 2017., 2017.

 

  • Johannes Fischer and Florian Kurpicz. Fast and Simple Parallel Wavelet Tree and Matrix Construction. CoRR, abs/1702.07578, 2017.

 

 

  • Michael Hamann, Eike R¨ohrs, and Dorothea Wagner. Local Community Detection Based on Small Cliques. Algorithms, 10(3):90, 2017.

 

  • Lina Humbeck and Oliver Koch. What Can We Learn from bioactivity Data? Chemoinformatics Tools and Applications in Chemical Biology Research. In ACS Chem. Biol., 2017, 12 (1), pp 23-35., 2017.

 

  • Raphael Kimmig, Henning Meyerhenke, and Darren Strash. Shared Memory Parallel Subgraph Enumeration. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2017, Orlando / Buena Vista, FL, USA, May 29 - June 2, 2017, pages 519–529, 2017.

 

 

 

 

 

  • Henning Meyerhenke, Martin Nllenburg, and Christian Schulz. Drawing large graphs by multilevel maxent-stress optimization. In Accepted by IEEE Transactions on Visualization and Computer Graphics, 2017.

 

 

  • Petra Mutzel Nils M. Kriege, Andre Droschinsky. Erratum to: A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. In Annals of Mathematics and Artificial Intelligence, 2017, 2017.

 

 

 

  • Till Schafer and Petra Mutzel. StruClus: Scalable Structural Graph Set Clustering with Representative Sampling. CoRR, abs/1609.09000, 2017.

 

 

  • Neha Sengupta, Michael Hamann, and Dorothea Wagner. Benchmark Generator for Dynamic Overlapping Communities in Networks. In Proceedings of the 2017 IEEE International Conference on Data Mining. IEEE Computer Society, 2017. Accepted for publication.

 

  • Christian L. Staudt, Michael Hamann, Alexander Gutfraind, Ilya Safro, and Henning Meyerhenke. Generating realistic scaled complex networks. Applied Network Science, 2017. Accepted for publication

 

  • Sude Tavassoli and Katharina A. Zweig. Fuzzy Centrality Evaluation in Complex and Multiplex Networks. In Workshop on Complex Networks (CompleNet). Springer, 2017.

 

 

Year 2016:

 

  • Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, and John D. Owens. GPU multisplit. In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, Barcelona, Spain, March 12-16, 2016, pages 12:1-12:13, 2016.

 

  • Johannes Bader, Simon Gog, and Matthias Petri. Practical variable length gap pattern matching. In Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, pages 1-16, 2016.

 

 

 

 

  • Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, and Henning Meyerhenke. Computing top-k closeness centrality faster in unweighted graphs. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10,2016, pages 68-80, 2016.

 

 

 

 

 

 

  • Mareike Bockholt and Katharina Anna Zweig. Clustering of Paths in Complex Networks. In Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30 - December 2, 2016., pages 183–195, 2016.

 

  • Katerina Böhmová, Yann Disser, Matúš Mihalák, and Rastislav Srámek. Scheduling transfers of resources over time: Towards car-sharing with flexible drop-offs. In LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pages 220-234, 2016.

 

  • Corinna Breusing, Arne Biastoch, Annika Drews, Anna Metaxas, Didier Jollivet, Robert C. Vrijenhoek, Till Bayer, Frank Melzner, Lizbeth Sayavedra, Jillian M. Petersen, Nicole Dubilier, Markus B. Schilhabel, Philip Rosenstiel, and Thorsten Reusch. Biophysical and population genetic models predict the presence of phantom stepping stones connecting mid-atlantic ridge vent ecosystems. 26:2257-2267, 2016.

 

 

 

 

 

 

 

 

 

  •  Alina Ene, Matthias Mnich, Marcin Pilipczuk, and Andrej Risteski. On Routing Disjoint Paths in Bounded Treewidth Graphs. In Rasmus Pagh, editor, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), volume 53 of Leibniz International Proceedings in Informatics (LIPIcs), pages 15:1–15:15, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

 

  •  Michael Etscheid and Matthias Mnich. Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation (ISAAC 2016), volume 64 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:13, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

 

 

  • Manuel Fersch, Eike Kiltz, and Bertram Poettering. On the provable security of (EC)DSA signatures. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, pages 1651-1662, 2016.

 

 

 

  •  Krzysztof Fleszar, Matthias Mnich, and Joachim Spoerhase. New Algorithms for Maximum Disjoint Paths Based on TreeLikeness. In Piotr Sankowski and Christos Zaroliagis, editors, 24th Annual European Symposium on Algorithms (ESA 2016), volume 57 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:17, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik

 

 

  • Romain Gay, Dennis Hofheinz, Eike Kiltz, and Hoeteck Wee. Tightly cca-secure encryption without pairings. In Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I, pages 1-27, 2016.

 

 

  • Simon Gog and Rossano Venturini. Fast and compact hamming distance index. In Proceedings of the 39th International ACM
    SIGIR conference on Research and Development in Information Retrieval, SIGIR 2016, Pisa, Italy, July 17-21, 2016, pages 285-294, 2016.

 

 

 

 

 

 

  • Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. How to generate and use universal samplers. In Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, pages 715-744, 2016.

 

 

 

 

  • Riko Jacob, Ulrich Meyer, and Laura Toma. List ranking. In Encyclopedia of Algorithms, pages 1117-1121. 2016.

 

  • Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke,
    Scott McMillan, Carl Yang, John D. Owens, Marcin Zalewski, Timothy G. Mattson, and José E. Moreira. Mathematical foundations of the graphblas. In 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, pages 1-9, 2016.

 

 

  • Elena Kirshanova, Alexander May, and Friedrich Wiemer. Parallel implementation of BDD enumeration for LWE. In Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Guildford, UK, June 19-22, 2016. Proceedings, pages 580-591, 2016.

 

 

 

 

  • Nils Kriege, Florian Kurpicz, Petra Mutzel : On Maximum Common Subgraph Problems in Series-Parallel Graphs. European Journal on Combinatorics (EJC), 2016, to appear

 

 

 

 

 

  • Matthias Mnich, Ignaz Rutter, and Jens M. Schmidt. LinearTime Recognition of Map Graphs with Outerplanar Witness. In Rasmus Pagh, editor, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), volume 53 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1–5:14, Dagstuhl, Germany, 2016. Schloss Dagstuhl– Leibniz-Zentrum fuer Informatik.

 

  • Matthias Mnich and Erik Jan van Leeuwen. Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. In Nicolas Ollinger and Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), volume 47 of Leibniz International Proceedings in Informatics (LIPIcs), pages 55:1–55:13, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

 

 

 

  • Mark Ortmann, Mirza Klimenta, and Ulrik Brandes. A sparse stress model. In Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pages 18-32, 2016.

 

 

 

 

  • Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, and Henning Meyerhenke. Generating Scaled Replicas of Real-World Complex Networks. In Proceedings of the 5th International Workshop on Complex Networks and their
    Applications (COMPLEX NETWORKS 2016), volume 693 of Studies in Computational Intelligence, pages 17-28. Springer, 2016.

 

 

  • Christian L. Staudt, Aleksejs Sazonovs, and Henning Meyerhenke. Networkit: A tool suite for large-scale complex network analysis. In Network Science, 4(4):508-530,, 2016.

 

 

 

 

 

  • Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten Reusch, and Philip Rosenstiel. An improved Filtering algorithm for big read datasets, 2016. Submitted to BMC Bioinformatics.

 

  • Adam Wierzbicki, Ulrik Brandes, Frank Schweitzer, and Dino Pedreschi, editors. Advances in Network Science - 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016, Proceedings, volume 9564 of Lecture Notes in Computer Science. Springer, 2016.

 

  • Norbert Zeh and Ulrich Meyer. I/o-model. In Encyclopedia of Algorithms, pages 943-947. 2016.

 

  • Katharina Anna Zweig. Network Analysis Literacy - A Practical Approach to the Analysis of Networks. Lecture Notes in Social Networks. Springer, 2016.

 

Year: 2015:

 

 

  • Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz. Practical massively parallel sorting. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, pages 13-23, 2015.

 

 

  • Christoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, and Yong Li. Tightly-secure authenticated key exchange. In Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, pages 629-658, 2015.

 

  • Hannah Bast, Bj¨rn Buchhold, and Elmar Haussmann. Relevance scores for triples from type-like relations. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, Santiago, Chile, August 9-13, 2015, pages 243-252, 2015.

 

  • Hannah Bast and Elmar Haussmann. More accurate question answering on freebase. In Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, VIC, Australia, October 19 - 23, 2015, pages 1431-1440, 2015.

 

 

 

 

 

  • Olivier Blazy, Saqib A. Kakvi, Eike Kiltz, and Jiaxin Pan. Tightly-secure signatures from chameleon hash functions. In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, pages 256-279, 2015.

 

 

  • Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen. Parameterized Complexity Dichotomy for Steiner Multicut. In Ernst W. Mayr and Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), volume 30 of Leibniz International Proceedings in Informatics (LIPIcs), pages 157–170, Dagstuhl, Germany, 2015. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik

 

 

 

 

 

 

 

  • Yann Disser and Martin Skutella. The simplex algorithm is np-mighty. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 858–872, 2015.

 

 

 

  • Michael Etscheid, Stefan Kratsch, Matthias Mnich, and Heiko Rglin. Polynomial Kernels for Weighted Problems. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS ’15), Leibniz International Proceedings in Informatics 30, 2015.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  • Henning Meyerhenke, Peter Sanders, and Christian Schulz. Parallel graph partitioning for complex networks. In 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, pages 1055–1064, 2015.

 

 

 

 

 

 

Year: 2014

  • Ashwin Arulselvan, Martin Groß, and Martin Skutella. Graphorientation and flows over time. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 741–752, 2014.

 

  • Sebastian Abshoff and Friedhelm Meyer auf der Heide. Continuous aggregation in dynamic ad-hoc networks. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014.Proceedings, pages 194–209, 2014.

 

  • Hannah Bast, Florian Bäurle, Björn Buchhold, and Elmar Haußmann. Easy access to the freebase dataset. In 23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume, pages 95-98, 2014.

 

  • Hannah Bast, Florian Bäurle, Björn Buchhold, and Elmar Haußmann. Semantic full-text search with broccoli. In The 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '14, Gold Coast , QLD, Australia - July 06 - 11, 2014, pages 1265-1266, 2014.

 

 

 

 

 

  • Christina Brzuska and Arno Mittelbach. Using indistinguishability obfuscation via uces. In Advances in Cryptology - ASI- ACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014, Proceedings, Part II, pages 122–141, 2014.

 

 

  • Christian A. Duncan and Antonios Symvonis, editors. Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers, volume 8871 of Lecture Notes in Computer Science. Springer, 2014.

 

 

  • Tobias Harks, Max Klimm, and Britta Peis. Resource competition on integral polymatroids. In Web and Internet Economics - 10th International Conference, WINE 2014, Beijing, China,December 14-17, 2014. Proceedings, pages 189–202, 2014.

 

 

 

  • Elena Kirshanova. Proxy re-encryption from lattices. In Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings, pages 77-94, 2014.

 

 

 

 

 

 

 

 

 

 

 

 

Invited Presentations:

  • Alexander May, 15th IMA International Conference on Cryptography and Coding (IMACC 2015), University of Oxford

  • Anand Srivastav, Algorithm Engineering for Big Data Problems, Indo-German Workshop DEI-CAU Research and Education Connect (RECON 2015), Dayalbagh Educational Institute, Agra, India, 15.-20.02.2015

  • Susanne Albers, Euro-Par 2016, Grenoble

  • Susanne Albers,  MPI-INF -25th Anniversary, September 2015

  • Dorothea Wagner. 7th International Network Optimization Conference, May 2016, Warzaw, Poland

  • Dorothea Wagner. Indo-German Spring School on Algorithms for Big Data, February 2016, IIT Madras, Chennai, India

  • Dorothea Wagner. 9th Annual Meeting of Asian Association for Algorithms and Computation, May 2016, Taipeh, Taiwan

  • Dorothea Wagner. EuroCG 2016, May 2016, Lugano, Switzerland