Publications:

see also our Google Scholar Page

 

 

Year 2023:

 

 

 

 

 

  • Giesen, J., Kuehne, L. and Laue, S., 2023. The GENO Software Stack. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 213-228). Cham: Springer Nature Switzerland.

 

  • Bingmann, T., Dinklage, P., Fischer, J., Kurpicz, F., Ohlebusch, E. and Sanders, P., 2023. Scalable Text Index Construction. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 252-284). Cham: Springer Nature Switzerland.

 

  • Castenow, J., Feldkord, B., Hanselle, J., Knollmann, T., Malatyali, M. and Meyer auf der Heide, F., 2023. Distributed Data Streams. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 179-195). Cham: Springer Nature Switzerland.

 

  • Hofheinz, D. and Kiltz, E., 2023. Scalable Cryptography. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 169-178). Cham: Springer Nature Switzerland.

 

 

  • Albers, S., 2023. Energy-Efficient Scheduling. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 196-212). Cham: Springer Nature Switzerland.

 

 

 

 

 

Year 2022:

  • M. Blacher, J. Giesen, S. Laue, J. Klaus, and V. Leis. Machine Learning, Linear Algebra, and More: Is SQL All You Need? Proceedings of the Conference on Innovative Data Systems Research (CIDR), accepted, 2022.

 

 

 

 

 

Year 2021: 

 

 

 

 

 

 

 

 

 

  • Jager, T., Kiltz, E., Riepel, D. and Schäge, S., 2021, June. Tightly-secure authenticated key exchange, revisited. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 117-146). Cham: Springer International Publishing.

 

  • Alwen, J., Blanchet, B., Hauck, E., Kiltz, E., Lipp, B. and Riepel, D., 2021, June. Analysing the HPKE standard. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 87-116). Cham: Springer International Publishing.

 

 

 

  • Döttling, N., Hartmann, D., Hofheinz, D., Kiltz, E., Schäge, S. and Ursu, B., 2021. On the impossibility of purely algebraic signatures. In Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part III 19 (pp. 317-349). Springer International Publishing.

 

 

Year 2020:

  • Hauck, E., Kiltz, E., Loss, J. and Nguyen, N.K., 2020, August. Lattice-based blind signatures, revisited. In Annual International Cryptology Conference (pp. 500-529). Cham: Springer International Publishing.

 

 

 

 

 

 

 

 

  • Angriman, E., van der Grinten, A., Bojchevski, A., Zügner, D., Günnemann, S. and Meyerhenke, H., 2020. Group centrality maximization for large-scale graphs. In 2020 Proceedings of the twenty-second workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 56-69). Society for Industrial and Applied Mathematics.

 

 

  • Abu-Khzam, F.N., Lamm, S., Mnich, M., Noe, A., Schulz, C. and Strash, D., 2020. Recent advances in practical data reduction. Algorithms for Big Data, p.97.

 

  • Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, and Christian Schulz. High-Quality Hierarchical Process Mapping. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
    https://doi.org/10.4230/LIPIcs.SEA.2020.4

 

 

  • Bingmann, T., Sanders, P. and Schimek, M., 2020, May. Communication-efficient string sorting. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 137-147). IEEE.

 

 

  • J. Giesen, S. Laue, and M. Mitterreiter. Optimization Frameworks for Machine Learning: Examples and Case Study. it - Information Technology, 62(3-4), 169-180, 2020.

 

  • Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, and Sven Zühlsdorf. Engineering Exact Quasi-Threshold Editing. In Simone Faro and Domenico Cantone,  editors, 18th International Symposium on Experimental Algorithms (SEA 2020), volume 160 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1-10:14, Dagstuhl, Germany, 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

 

  • Lars Gottesbüren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner. Advanced Flow-Based Multilevel Hypergraph Partitioning. In Simone Faro and Domenico Cantone, editors, 18th  International Symposium on Experimental Algorithms (SEA 2020), volume 160 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:15, Dagstuhl, Germany, 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

 

 

 

  • Ulrich Meyer, Ziawasch Abedjan. Algorithms for Big Data. it-Information Technology, Vol. 62, 3-4, pp. 117–118, 2020.

 

 

 

 

 

Year 2019:

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  • Albers, S. and Kraft, D., 2019. Motivating time-inconsistent agents: A computational approach. Theory of computing systems, 63, pp.466-487.

 

  • Timo Bingmann, Phelim Bradley, Florian Gauger, and Zamin Iqbal. COBS: A compact bit-sliced signature index. In String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings, pages 285-303, 2019.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  • S. Schlag, M. Schmitt, and C. Schulz. Faster support vector machines. In 21st Workshop on Algorithm Engineering and Experiments (ALENEX), pages 199-210. SIAM, 01 2019.

 

  • S. Schlag, C. Schulz, D. Seemaier, and D. Strash. Scalable edge partitioning. In 21st Workshop on Algorithm Engineering and Experiments (ALENEX), pages 211-225. SIAM, 01 2019.

 

 

Year 2018:

 

 

 

 

 

 

 

 

 

 

  • Elisabetta Bergamini, Tanya Gonser, and Henning Meyerhenke. Scaling up group closeness maximization. In 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 209-222. SIAM, 2018.

 

 

  • Sonja Biedermann, Monika Henzinger, Christian Schulz, and Bernhard Schuster. Memetic Graph Clustering. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 3:1-3:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
    https://doi.org/10.4230/LIPIcs.SEA.2018.3

 

 

 

 

 

  • Joppe Bos, Léo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, John M Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehle. Crystals-kyber: a cca-secure modulelattice-based kem. In 2018 IEEE European Symposium on Security and Privacy (EuroS&P), pages 353-367. IEEE, 2018.

 

 

 

 

  • Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner. Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. In Yossi Azar, Hannah Bast, and Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms (ESA 2018), volume 112 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:15, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  • Nils M Kriege, Lina Humbeck, and Oliver Koch. Chemical similarity and substructure searches. 2018.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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 Annual International Cryptology Conference, pages 101-132. Springer, 2017.

 

 

 

 

  • Timo Bingmann, Andreas Eberle, and Peter Sanders. Engineering parallel string sorting. Algorithmica, 77(1):235-286, 2017.

     

  • Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meiner, Kevin Schewior, Miriam Schlöter, and Leen Stougie. Tight bounds for online tsp on the line. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 994-1005. Society for Industrial and Applied Mathematics, 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.

     

  • Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, and Angelika Steger. A general lower bound for collaborative tree exploration. In International Colloquium on Structural Information and Communication Complexity, pages 125-139. Springer, 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.

 

 

 

 

 

 

 

  • 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.

     

  • Dusan Knop, Martin Koutecky, and Matthias Mnich. Voting and bribing in single-exponential time. In LIPIcs-Leibniz International Proceedings in Informatics, volume 66. Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik, 2017.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

 

  • Vladimír Ulman, Martin Maška, Klas EG Magnusson, Olaf Ronneberger, Carsten Haubold, Nathalie Harder, Pavel Matula, Petr Matula, David Svoboda, Miroslav Radojevic, et al. An objective comparison of cell-tracking algorithms. Nature methods, 14(12):1141, 2017.

 

 

  • Brandes, U., Heine, M., Müller, J. and Ortmann, M., 2017. Positional dominance: Concepts and algorithms. In Algorithms and Discrete Applied Mathematics: Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings 3 (pp. 60-71). Springer International Publishing.

 

 

 

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.

 

 

 

  • Fischlin, M., Herzberg, A., Bin-Noon, H. and Shulman, H., 2016, July. Obfuscation combiners. In Annual International Cryptology Conference (pp. 521-550). Berlin, Heidelberg: Springer Berlin Heidelberg.

 

 

 

 

 

 

  • 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.

 

 

 

  • David Cash, Eike Kiltz, and Stefano Tessaro. Two-round man-in-the-middle security from LPN. In Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, pages 225-248, 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.

 

 

  • 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.

 

 

  • Schlag, S., Henne, V., Heuer, T., Meyerhenke, H., Sanders, P. and Schulz, C., 2016. K-way hypergraph partitioning via n-level recursive bisection. In 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 53-67). Society for Industrial and Applied Mathematics.

 

 

 

  • 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.

 

 

 

 

 

 

 

 

  • 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.

 

  • Ulrik Brandes, Michael Hamann, Ben Strasser, and Dorothea Wagner. Fast quasi-threshold editing. In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 251-262, 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

We use cookies on our website. Some of them are essential for the operation of the site, while others help us to improve this site and the user experience (tracking cookies). You can decide for yourself whether you want to allow cookies or not. Please note that if you reject them, you may not be able to use all the functionalities of the site.

Ok