Publications:

Year 2016:

  • Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli and Richard Stotz. Scheduling on Power-Heterogeneous Processors. In 12th Latin American Theoretical Informatics Symposium (LATIN 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.

 

  • Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, and Matús Mihalák. Collaborative delivery with energy-constrained mobile robots. CoRR, abs/1608.08500, 2016.

 

  • Andreas Bartschi, Jeremie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna. Energy efficient delivery by heterogeneous mobile agents. CoRR,
    abs/1610.02361, 2016.

 

  • Hannah Bast, Bjorn Buchhold, and Elmar Haussmann. Semantic search on text and knowledge bases. Foundations and Trends in Information Retrieval, 10(2-3):119-271, 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.

 

  • Elisabetta Bergamini and Henning Meyerhenke. Approximating betweenness centrality in fully dynamic networks. Internet Mathematics, 12(5):281-314, 2016.

 

  • Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, and Henning Meyerhenke. Estimating current- flow closeness centrality with a multigrid laplacian solver. CoRR, abs/1607.02955, 2016.

 

  • Timo Bingmann, Michael Axtmann, Emanuel Jobstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, and Peter Sanders. Thrill: High-performance algorithmic distributed batch data processing with C++. CoRR, abs/1608.05634, 2016.

 

  • Timo Bingmann, Simon Gog, and Florian Kurpicz. Scalable construction of text indexes. CoRR, abs/1610.03007, 2016.

 

  • Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue. Efficient embedding of scale-free graphs in the hyperbolic plane. In 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pages 16:1-16:18, 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-o ffs. In LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pages 220-234, 2016.

 

 

  • Yann Disser, Jan Hackfeld, and Max Klimm. Undirected graph exploration with ⊝(log log n) pebbles. In Proceedings of theTwenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 25-39, 2016.

 

  • Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric,and Angelika Steger. A general lower bound for collaborative
    tree exploration. CoRR, abs/1610.01753, 2016.

 

  • Jasper de Jong, Max Klimm, and Marc Uetz. Efficiency of equilibria in uniform matroid congestion games. In Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings, pages 105-116,2016.

 

  • Andre Droschinsky, Nils Kriege, and Petra Mutzel. Faster algorithms for the maximum common subtree isomorphism problem. CoRR, abs/1602.07210, 2016.

 

  • Johannes Fischer, Dominik Köppl, and Florian Kurpicz. On the benefi t of merging suffix array intervals for parallel pattern matching. In 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel, pages 26:1-26:11, 2016.

 

  • Johannes Fischer, Florian Kurpicz, and Peter Sanders. Engineering a distributed full-text index. CoRR, abs/1610.03332, 2016.

 

  • Marc Fischlin, Felix Günther, Benedikt Schmidt, and Bogdan Warinschi. Key confi rmation in key exchange: A formal treatment and implications for TLS 1.3. In IEEE Symposium on Security and Privacy, SP 2016, San Jose, CA, USA, May 22-26, 2016, pages 452-469, 2016.

 

  • Georg Fuchsbauer, Felix Heuer, Eike Kiltz, and Krzysztof Pietrzak. Standard security does imply security against selective opening for markov distributions. In Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, pages 282-305, 2016.

 

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

 

  • Joachim Giesen and Soren Laue. Distributed convex optimization with many convex constraints. CoRR, abs/1610.02967, 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.

 

 

  • Julia Hesse, Dennis Hofheinz, and Andy Rupp. Recon gurable cryptography: A flexible approach to long-term security. In Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I,pages 416-445, 2016.

 

  • Dennis Hofheinz. Algebraic partitioning: Fully compact and (almost) tightly secure cryptography. In Theory of Cryptography- 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, pages 251-281, 2016.

 

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

 

  • Eike Kiltz, Daniel Masny, and Jiaxin Pan. Optimal security proofs for signatures from identi cation schemes. In Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, pages 33-61, 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.

 

  • Lasse Kliemann, Christian Schielke, and Anand Srivastav. A streaming algorithm for the undirected longest path problem. In 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pages 56:1-56:17, 2016.

 

  • Lasse Kliemann, Jan Schiemann, and Anand Srivastav. Finding euler tours in the strsort model. CoRR, abs/1610.03412, 2016.

 

  • Jannis Koch, Christian L. Staudt, Maximilian Vogel, and Henning Meyerhenke. An empirical comparison of big graph frameworks
    in the context of network analysis. Social Netw. Analys.Mining, 6(1):84:1-84:20, 2016.

 

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

 

  • Alexander Mäcker, Manuel Malatyali, and Friedhelm Meyer auf der Heide. On competitive algorithms for approximations of top-k-position monitoring of distributed streams. In 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 700-709, 2016.

 

  • Ulrich Meyer and Manuel Penschuck. Generating massive scalefree networks under resource constraints. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, pages 39-52, 2016.

 

  • A. Nocaj, M. Ortmann, and U. Brandes. Adaptive disentanglement based on local clustering in small-world network visualization. IEEE Transactions on Visualization and Computer Graphics, 22(6):1662-1671, June 2016.

 

  • Mark Ortmann and Ulrik Brandes. Quad census computation: Simple, efficient, and orbit-aware. In Wierzbicki et al. [WBSP16], pages 1-13.

 

  • Mark Ortmann, Mirza Klimenta, and Ulrik Brandes. A sparse stress model. CoRR, abs/1608.08909, 2016.

 

  • Mourad El Ouali, Peter Munstermann, and Anand Srivastav. Randomized approximation for the set multicover problem in hypergraphs. Algorithmica, 74(2):574-588, 2016.

 

  • Till Schafer and Petra Mutzel. Struclus: Structural clustering of large-scale graph databases. CoRR, abs/1609.09000, 2016.

 

  • Wolfgang Eugen Schlauch and Katharina Anna Zweig. Motif detection speed up by using equations based on the degree sequence. Social Netw. Analys. Mining, 6(1):47:1-47:20, 2016.

 

  • Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, and Henning Meyerhenke. Generating scaled replicas
    of real-world complex networks. CoRR, abs/1609.02121, 2016.

 

  • Christian L. Staudt and Henning Meyerhenke. Engineering parallel algorithms for community detection in massive networks. IEEE Trans. Parallel Distrib. Syst., 27(1):171-184, 2016.

 

  • Sude Tavassoli and Katharina Anna Zweig. Most central or least central? how much modeling decisions influence a node's centrality ranking in multiplex networks. CoRR, abs/1606.05468, 2016.

 

  • Moritz von Looz and Henning Meyerhenke. Querying probabilistic neighborhoods in spatial data sets eciently. In Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, pages 449-460, 2016.

 

  • Moritz von Looz, Mustafa Özdayi, Sören Laue, Henning Meyerhenke: Generating massive complex networks with hyperbolic geometry faster in practice. CoRR abs/1606.09481 (2016)

 

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

  • Sebastian Abshoff . On the complexity of fundamental problems in dynamic ad-hoc networks. PhD thesis, University of Paderborn, 2015.

 

  • Deepak Ajwani, Ulrich Meyer, and David Veith. An i/o-efficient distance oracle for evolving real-world graphs. In Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, pages 159-172, 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.

 

  • Ashwin Arulselvan, Martin Groß, and Martin Skutella. Graph orientation and flows over time. Networks, 66(3):196-209, 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, Bjorn 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.

 

  • Elisabetta Bergamini and Henning Meyerhenke. Fully-dynamic approximation of betweenness centrality. In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 155–166, 2015.

 

  • Elisabetta Bergamini, Henning Meyerhenke, and Christian Staudt. Approximating betweenness centrality in large evolving networks. In Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, pages 133–146, 2015.

 

  • Antje Bjelde, Felix A. Fischer, and Max Klimm. Impartial selection and the power of up to two choices. In Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings, pages 146-158, 2015.

 

  • Timo Bingmann, Thomas Keh, and Peter Sanders. A bulk-parallel priority queue in external memory with STXXL. In Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings, pages 28-40, 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.

 

 

  • Christian Brugger, André Lucas Chinazzo, Alexandre Flores John, Christian De Schryver, Norbert Wehn, Andreas Spitz, and Katharina A. Zweig. Exploiting phase transitions for the efficient sampling of the fixed degree sequence model. In Proceedings of the Advances of Social Network Analysis and Mining (ASONAM’15), 2015.

 

  • Christian Brugger, Valentin Grigorovici, Matthias Jung, Christian Weis, Christian De Schryver, Katharina Anna Zweig, and Norbert Wehn. A custom computing system for finding similarties in complex networks. In IEEE Computer Society Annual Symposium on VLSI, 2015.

 

  • Christina Brzuska, Pooya Farshim, and Arno Mittelbach. Random-oracle uninstantiability from indistinguishability obfuscation. In Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II, pages 428–455, 2015.

 

  • Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer. Mapping simple polygons: The power of telling convex from reflex. ACM Transactions on Algorithms, 11(4):33, 2015.

 

  • Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, and Przemyslaw Uznanski. Fast collaborative graph exploration. Inf. Comput., 243:37–49, 2015.

 

  • Yann Disser, Andreas Emil Feldmann, Max Klimm, and Matús Mihalák. Improving the hk-bound on the price of stability in undirected shapley network design games. Theor. Comput. Sci., 562:557–564, 2015.

 

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

 

  • Benjamin Dowling, Marc Fischlin, Felix Gunther, and Douglas Stebila. A cryptographic analysis of the TLS 1.3 handshake protocol candidates. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-6, 2015, pages 1197-1210, 2015.

 

  • Rolf Egert, Marc Fischlin, David Gens, Sven Jacob, Matthias Senker, and Jörn Tillmanns. Privately computing set-union and set-intersection cardinality via bloom filters. In Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Brisbane, QLD, Australia, June 29 - July 1, 2015, Proceedings, pages 413–430, 2015.

 

  • Felix A. Fischer and Max Klimm. Optimal impartial selection. SIAM J. Comput., 44(5):1263-1285, 2015.

 

  • Martin Groß and Martin Skutella. A tight bound on the speed-up through storage for quickest multi-commodity flows. Oper. Res. Lett., 43(1):93–95, 2015.

 

  • Felix Heuer, Tibor Jager, Eike Kiltz, and Sven Schage. On the selective opening security of practical public-key encryption schemes. 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 27-51, 2015.

 

  • Gottfried Herold, Elena Kirshanova, and Alexander May. On the asymptotic complexity of solving LWE. IACR Cryptology ePrint Archive, 2015:1222, 2015.

 

 

  • Slobodan Jelic, Sören Laue, Domagoj Matijevic, and Patrick Wijerama. A fast parallel implementation of a PTAS for fractional packing and covering linear programs. International Journal of Parallel Programming, 43(5):840–875, 2015.

 

  • Annamaria Kovacs, Ulrich Meyer, and Carmine Ventre. Mechanisms with monitoring for truthful RAM allocation. In Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings, pages 398-412, 2015.

 

  • Max Klimm and Daniel Schmand. Sharing non-anonymous costs of multiple resources optimally. In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pages 274–287, 2015.

 

  • Jannis Koch, Christian L. Staudt, Maximilian Vogel, and Henning Meyerhenke. Complex network analysis on distributed systems: An empirical comparison. In Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25 - 28, 2015, pages 1169-1176, 2015.

 

  • Annamária Kovács, Ulrich Meyer, Gabriel Moruz, and Andrei Negoescu. The optimal structure of algorithms for α-paging. Information Processing Letters 115(12):932-938, 2015. http://dx.doi.org/10.1016/j.ipl.2015.07.011

 

  • Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, and Dorothea Wagner. Structure-preserving sparsification of social networks. CoRR, abs/1505.00564, 2015.

 

  • Moritz von Looz, Henning Meyerhenke, and Roman Prutkin. Generating random hyperbolic graphs in subquadratic time. In Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, pages 467-478, 2015.

 

  • Alexander Mäcker, Manuel Malatyali, and Friedhelm Meyer auf der Heide. Online top-k-position monitoring of distributed data streams. In 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, pages 357–364, 2015.

 

  • Henning Meyerhenke, Martin Nöllenburg, and Christian Schulz. Drawing large graphs by multilevel maxent-stress optimization. CoRR, abs/1506.04383, 2015.

 

  • Alexander May and Ilya Ozerov. On computing nearest neighbors with applications to decoding of binary linear codes. In Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, pages 203–228, 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.

 

  • Arlind Nocaj, Mark Ortmann, and Ulrik Brandes. Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl., 19(2):595-618, 2015.

 

  • Patricia Iglesias Sanchez, EmmanuelMuller, Uwe Leo Korn, Klemens Bohm, Andrea Kappes, Tanja Hartmann, and Dorothea Wagner. Ecient algorithms for a robust modularity-driven clustering of attributed graphs. In Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30 - May 2, 2015, pages 100-108, 2015.

 

  • Wolfgang E. Schlauch, Emöke Á. Horvát, and Katharina A. Zweig. Different flavors of randomness. Social Network Analysis and Mining, 5(1), 2015.

 

  • Wolfgang E. Schlauch and Katharina A. Zweig. Influence of the Null-Model on motif detection. In Proc. International Conference on Advances in Social Networks Analysis and Mining (ASONAM’15), 2015.

 

  • Moritz von Looz, Henning Meyerhenke, and Roman Prutkin. Generating random hyperbolic graphs in subquadratic time. In Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings,pages 467-478, 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 Baurle, Bjorn 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 Baurle, Bjorn 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.

 

  • Timo Bingmann, Andreas Eberle, and Peter Sanders. Engineering parallel string sorting. CoRR, abs/1403.2056, 2014.

 

  • Christina Brzuska, Pooya Farshim, and Arno Mittelbach. Indistinguishability obfuscation and uces: The case of computationally unpredictable sources. In Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I, pages 188–205, 2014.

 

  • Hannah Bast and Elmar Haussmann. More informative open information extraction via simple inference. In Advances in Information Retrieval - 36th European Conference on IR Research, ECIR 2014, Amsterdam, The Netherlands, April 13-16, 2014. Proceedings, pages 585-590, 2014.

 

  • Christina Brzuska and Arno Mittelbach. Indistinguishability obfuscation versus multi-bit point obfuscation with auxiliary input. In Advances in Cryptology - ASIACRYPT 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 142–161, 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.

 

  • Andre Droschinsky, Bernhard Heinemann, Nils Kriege, and Petra Mutzel. Enumeration of maximum common subtree isomorphisms with polynomial-delay. In Algorithms and Computation
    - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 81–93, 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.

 

  • Christoph Hansknecht, Max Klimm, and Alexander Skopalik.Approximate pure nash equilibria in weighted congestion games. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain, pages 242–257, 2014.

 

  • Riko Jacob, Tobias Lieber, and Matthias Mnich. Treewidth computation and kernelization in the parallel external memory model. In Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings, pages 78–89, 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.

 

  • Karsten Klein, Oliver Koch, Nils Kriege, Petra Mutzel, and Till Schäfer. Sca old hunter: visual analysis of biological activity data. J. Cheminformatics, 6(S-1):33, 2014.

 

  • Nils Kriege, Florian Kurpicz, and Petra Mutzel. On maximum common subgraph problems in series-parallel graphs. In Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers, pages 200–212, 2014.

 

  • Nils Kriege and Petra Mutzel. Finding maximum common biconnected subgraphs in series-parallel graphs. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014.Proceedings, Part II, pages 505–516, 2014.

 

  • Nils Kriege, Petra Mutzel, and Till Schäfer. Practical SAHN clustering for very large data sets and expensive distance metrics. J. Graph Algorithms Appl., 18(4):577–602, 2014.

 

  • Max Klimm and Andreas Schütz. Congestion games with higher demand dimensions. In Web and Internet Economics - 10th International Conference, WINE 2014, Beijing, China, December
    14-17, 2014. Proceedings, pages 453–459, 2014.

 

  • Alexander May and Ilya Ozerov. A generic algorithm for small weight discrete logarithms in composite groups. In Selected Areas in Cryptography - SAC 2014 - 21st International Conference, Montreal, QC, Canada, August 14-15, 2014, Revised Selected Papers, pages 278-289, 2014.

 

  • Arlind Nocaj, Mark Ortmann, and Ulrik Brandes. Untangling hairballs - from 3 to 14 degrees of separation. In Duncan and Symvonis [DS14], pages 101-112.

 

  • Christian Staudt, Yassine Marrakchi, and Henning Meyerhenke. Detecting communities around seed nodes in complex networks. In 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30, 2014, pages 62–69,2014.

Invited Presentations:

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

  • 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