Algorithms for BIG DATA | DFG Schwerpunktprogramm 1736

 

Publications:

see also our Google Scholar Page

 

 

Year 2023:

• Giesen, J., Kahlmeyer, P., Laue, S., Mitterreiter, M., Nussbaum, F., & Staudt, C. (2023). Mixed membership Gaussians. Journal of Multivariate Analysis, 195, 105141. https://doi.org/https://doi.org/10.1016/j.jmva.2022.105141

 

• Allendorf, D., Meyer, U., Penschuck, M. and Tran, H., 2023. Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. Journal of Parallel and Distributed Computing, 174, pp.118-129.

 

• Brandes, U., Hamann, M., Häuser, L. and Wagner, D., 2023. Skeleton-Based Clustering by Quasi-Threshold Editing. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 134-151). Cham: Springer Nature Switzerland.

 

• Srivastav, A., Wedemeyer, A., Schielke, C. and Schiemann, J., 2023. Algorithms for Big Data Problems in de Novo Genome Assembly. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 229-251). Cham: Springer Nature Switzerland.

 

• Disser, Y. and Klimm, M., 2023. The Space Complexity of Undirected Graph Exploration. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 152-166). Cham: Springer Nature Switzerland.

 

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

 

• Chinazzo, A., Schryver, C.D., Zweig, K. and Wehn, N., 2023. A Custom Hardware Architecture for the Link Assessment Problem. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 57-75). 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.

 

• Angriman, E., van der Grinten, A., Hamann, M., Meyerhenke, H. and Penschuck, M., 2023. Algorithms for large-scale network analysis and the networkit toolkit. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 3-20). Cham: Springer Nature Switzerland.

 

• Meyer, U. and Penschuck, M., 2023. Generating Synthetic Graph Data from Random Network Models. In Algorithms for Big Data: DFG Priority Program 1736 (pp. 21-38). Cham: Springer Nature Switzerland.

 

• Droschinsky, A., Humbeck, L., Koch, O., Kriege, N.M., Mutzel, P. and Schäfer, T., 2023. Graph-Based Methods for Rational Drug Design. Algorithms for Big Data, p.76.

 

• Mitterreiter, M., Koch, M., Giesen, J., & Laue, S. (2023). Why capsule neural networks do not scale: challenging the dynamic parse-tree assumption. Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence. https://doi.org/10.1609/aaai.v37i8.26104

 

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.

 

• Laue, S., Blacher, M. and Giesen, J. (2022) “Optimization for Classical Machine Learning Problems on the GPU”, Proceedings of the AAAI Conference on Artificial Intelligence, 36(7), pp. 7300-7308. doi: 10.1609/aaai.v36i7.20692.

 

• Abu-Khzam, F.N., Lamm, S., Mnich, M., Noe, A., Schulz, C., Strash, D., 2022. Recent Advances in Practical Data Reduction. Algorithms for Big Data: DFG Priority Program 1736, 13201, p.97.

 

• Allendorf, D., Meyer, U., Penschuck, M., Tran, H. and Wormald, N., 2022. Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence∗. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) (pp. 27-40). Society for Industrial and Applied Mathematics.

 

• Bast, H., Korzen, C., Meyer, U. and Penschuck, M., 2022. Algorithms for Big Data: DFG Priority Program 1736 (p. 285). Springer Nature.

 

Year 2021: 

• Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, and Henning Meyerhenke. Group-harmonic and group-closeness maximization - approximation and engineering. ALENEX. SIAM, 2021.

 

• M. Blacher, J. Giesen and L. Kühne. Fast and Robust Vectorized In-Place Sorting of Primitive Types. Proceedings of the 19th Symposium on Experimental and Efficient Algorithms (SEA), 3:1-3:16, 2021.

 

• Gerth S. Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran. An Experimental Study of External Memory Algorithms for Connected Components. 19th International Symposium on Experimental Algorithms (SEA 2021), 2021.

 

• J. Giesen, P. Kahlmeyer, S. Laue, M. Mitterreiter, F. Nussbaum, C. Staudt and S. Zarriess. Method of Moments for Topic Models with Mixed Discrete and Continuous Features. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), 2418-2424, 2021.

 

• F. Nussbaum and J. Giesen. Robust Principle Component Analysis for Generalized Multi-View Models. Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI), 2021.

 

• Duman, J., Hövelmanns, K., Kiltz, E., Lyubashevsky, V., & Seiler, G. (2021). Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, 2722–2737. https://doi.org/10.1145/3460120.3484819

 

• Han, S., Jager, T., Kiltz, E., Liu, S., Pan, J., Riepel, D. and Schäge, S., 2021, August. Authenticated key exchange and signatures with tight security in the standard model. In Annual International Cryptology Conference (pp. 670-700). Cham: Springer International Publishing.

 

• Dinklage, P., Ellert, J., Fischer, J., Kurpicz, F. and Löbel, M., 2021. Practical wavelet tree construction. Journal of Experimental Algorithmics (JEA), 26, pp.1-67.

 

• Humbeck, L., Pretzel, J., Spitzer, S., & Koch, O. (2021). Discovery of an Unexpected Similarity in Ligand Binding between BRD4 and PPARγ. ACS Chemical Biology, 16(7), 1255–1265. https://doi.org/10.1021/acschembio.1c00323

 

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

 

• Dinklage, P., Fischer, J., & Herlez, A. (2021). Engineering Predecessor Data Structures for Dynamic Integer Sets. In D. Coudert & E. Natale (Eds.), 19th International Symposium on Experimental Algorithms (SEA 2021) (Vol. 190, p. 7:1-7:19). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SEA.2021.7

 

• Menke, J., Massa, J. and Koch, O., 2021. Natural product scores and fingerprints extracted from artificial neural networks. Computational and Structural Biotechnology Journal, 19, pp.4593-4602.

 

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

 

• Giesen, J., Kahlmeyer, P., Laue, S., Mitterreiter, M., Nussbaum, F., Staudt, C. and Zarrieß, S., 2021. Method of Moments for Topic Models with Mixed Discrete and Continuous Features. In IJCAI (pp. 2418-2424).

 

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.

 

• Takamiya, M., Stegmaier, J., Kobitski, A.Y., Schott, B., Weger, B.D., Margariti, D., Cereceda Delgado, A.R., Gourain, V., Scherr, T., Yang, L. and Sorge, S., 2020. Pax6 organizes the anterior eye segment by guiding two distinct neural crest waves. PLoS Genetics, 16(6), p.e1008774.

 

• van der Grinten, A., Angriman, E. and Meyerhenke, H., 2020. Scaling up network centrality computations–A brief overview. it-Information Technology, 62(3-4), pp.189-204.

 

• Auerbach, B., Giacon, F. and Kiltz, E., 2020, May. Everybody’sa target: scalability in public-key encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 475-506). Cham: Springer International Publishing.

 

• Eugenio Angriman, Maria Predari, Alexander van der Grinten, and Henning Meyerhenke. Approximation of the diagonal of a laplacian's pseudoinverse for complex network analysis. In ESA, volume 173 of LIPIcs, pages 6:1-6:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

 

• Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, and Henning Meyerhenke. Group centrality maximization for largescale graphs. In ALENEX, pages 56-69. SIAM, 2020.

 

• Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran. Simulating population protocols in sub-constant time per interaction. arXiv preprint arXiv:2005.03584, 2020.

• Dinklage, P., Fischer, J. and Kurpicz, F., 2020. Constructing the wavelet tree and wavelet matrix in distributed memory. In 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 214-228). Society for Industrial and Applied Mathematics.

 

• Dinklage, P., Fischer, J., Herlez, A., Kociumaka, T. and Kurpicz, F., 2020. Practical performance of space efficient data structures for longest common extensions. In 28th Annual European Symposium on Algorithms (ESA 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

 

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

 

• Penschuck, M., 2020. Scalable generation of random graphs (Doctoral dissertation, Universitätsbibliothek Johann Christian Senckenberg).

 

• 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., Marianczuk, J. and Sanders, P., 2021. Engineering faster sorters for small sets of items. Software: Practice and Experience, 51(5), pp.965-1004.

 

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

 

• M. Blacher, J. Giesen, S. Laue, J. Klaus, M. Mitterreiter: Fast Entity Resolution With Mock Labels and Sorted Integer Sets. Proceedings of the 2nd International Workshop on Challenges and Experiences from Data Integration to Knowledge Graphs (DI2KG), 2020.

 

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

 

• Alexander van der Grinten, Eugenio Angriman, and Henning Meyerhenke. Scaling up network centrality computations - a brief overview. it - Information Technology, 62(3-4):189 - 204, 01  Jun. 2020.

 

• Alexander van der Grinten and Henning Meyerhenke. Scaling betweenness approximation to billions of edges by mpi-based adaptive sampling. In IPDPS, pages 527-535. IEEE, 2020.

 

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

 

• Ulrich Meyer, Manuel Penschuck. Large-scale graph generation: Recent results of the SPP 1736‐Part II. it-Information Technology, Vol. 62, 3-4, pp. 135–144, 2020.

 

• Frank Nussbaum and Joachim Giesen. Pairwise sparse + low-rank models for variables of mixed type. Journal of Multivariate Analysis, 178:104601, 2020.

 

• Penschuck, M., Brandes, U., Hamann, M., Lamm, S., Meyer, U., Safro, I., Sanders, P., & Schulz, C. (2020). Recent Advances in Scalable Network Generation. CoRR, abs/2003.00736. https://arxiv.org/abs/2003.00736

 

• Mehmet Şimşek and Henning Meyerhenke. Combined centrality measures for an improved characterization of influence spread in social networks. Journal of Complex Networks, 8(1), 02 2020.

 

Year 2019:

• Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava. Fragile Complexity of Comparison-Based Algorithms. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 2:1-2:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
  https://doi.org/10.4230/LIPIcs.ESA.2019.2

 

• Susanne Albers and Leon Ladewig. New Results for the k-Secretary Problem. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 18:1-18:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
  https://doi.org/10.4230/LIPIcs.ISAAC.2019.18

 

• Maier, T., Sanders, P. and Walzer, S., 2019. Dynamic space efficient hashing. Algorithmica, 81(8), pp.3162-3185.

 

• Sanders, P., Mehlhorn, K., Dietzfelbinger, M. and Dementiev, R., 2019. Sequential and Parallel Algorithms and Data Structures (pp. 403-404). Springer.

 

• Bast, H., Brosi, P. and Storandt, S., 2019. Efficient generation of geographically accurate transit maps. ACM Transactions on Spatial Algorithms and Systems (TSAS), 5(4), pp.1-36.

 

• Ellert, J. and Kurpicz, F., 2019, October. Parallel external memory wavelet tree and wavelet matrix construction. In International Symposium on String Processing and Information Retrieval (pp. 392-406). Cham: Springer International Publishing.

 

• Buchhold, V., Sanders, P. and Wagner, D., 2019. Real-time traffic assignment using engineered customizable contraction hierarchies. Journal of Experimental Algorithmics (JEA), 24, pp.1-28.

 

• Eugenio Angriman, Alexander van der Grinten, and Henning Meyerhenke. Local search for group closeness maximization on big graphs. In BigData, pages 711-720. IEEE, 2019.

 

• Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nollenburg, Maria Predari, and Charilaos Tzovas. Guidelines for experimental algorithmics: A case study in network analysis. Algorithms, 12(7):127, 2019.

 

• Yaroslav Akhremtsev. Parallel and External High Quality Graph Partitioning. PhD thesis, Karlsruhe Institute of Technology, Germany, 2019.

 

• Susanne Albers. On energy conservation in data centers. ACM Transactions on Parallel Computing (TOPC), 6(3):1-26, 2019.

 

• I. Baar, L. Hübner, P. Oettig, A. Zapletal, S. Schlag, A. Stamatakis, and B. Morel. Data distribution for phylogenetic inference with site repeats via judicious hypergraph partitioning. In 18th International Workshop on High Performance Computational Biology, (HiCOMB). IEEE, 2019. in press.

 

• Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, and Henning Meyerhenke. Computing top-k closeness centrality faster in unweighted graphs. ACM Trans.
  Knowl. Discov. Data, 13(5):53:1-53:40, 2019.

 

• Gregor Betz, Michael Hamann, Tamara Mchedlidze, and Sophie von Schmettow. Applying argumentation to structure and visualize multi-dimensional opinion spaces. Argument & Computation, (Preprint):1-18, 2019.

 

• Schlöter, M., 2019, April. Earliest Arrival Transshipments in Networks with Multiple Sinks. In International Conference on Integer Programming and Combinatorial Optimization (pp. 370-384). Cham: Springer International Publishing.

 

• Auerbach, B., Kiltz, E., Poettering, B. and Schoenen, S., 2019, February. Lossy trapdoor permutations with improved lossiness. In Cryptographers’ Track at the RSA Conference (pp. 230-250). Cham: Springer International Publishing.

 

• Albers, S. and Passen, A., 2019. New online algorithms for story scheduling in web advertising. Algorithmica, 81(1), pp.1-25.

 

• Wood, T.R., Kyrsting, A., Stegmaier, J., Kucinski, I., Kaminski, C.F., Mikut, R. and Voiculescu, O., 2019. Tissue mechanics determines cell fate in the axial stem zones. BioRxiv.

 

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

 

• Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand. Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 21:1-21:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
  https://doi.org/10.4230/LIPIcs.ESA.2019.21

 

• Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, and Manuel Penschuck. Bidirectional Text Compression in External Memory. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
  https://doi.org/10.4230/LIPIcs.ESA.2019.41

 

• Alexander Eckl, Luisa Peter, Maximilian Schiffer, Susanne Albers. Minimization of Weighted Completion Times in Path-based Coflow Scheduling. arXiv preprint arXiv:1911.1308, 2019.

 

• Rolf Fagerberg, David Hammer, Ulrich Meyer. On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019.

• Ferizovic, D., Hespe, D., Lamm, S., Mnich, M., Schulz, C. and Strash, D., 2020. Engineering kernelization for maximum cut. In 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 27-41). Society for Industrial and Applied Mathematics.

 

• Johannes Fischer and Florian Kurpicz. Lightweight distributed suffix array construction. In 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), pages 27-38. SIAM, 2019.

 

• Daniel Funke, Peter Sanders, Vincent Winkler. Load-Balancing for Parallel Delaunay Triangulations. European Conference on Parallel Processing. pp. 156–169, 2019.

 

• Joachim Giesen and Sören Laue. Combining admm and the augmented lagrangian method for eciently handling many constraints. In IJCAI, pages 4525-4531, 2019.

 

• Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, and Dorothea Wagner. Faster and better nested dissection orders for customizable contraction hierarchies. Algorithms, 12(9):196, 2019.

 

• Lars Gottesbüren, Michael Hamann, and Dorothea Wagner. Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 52:1-52:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
  https://doi.org/10.4230/LIPIcs.ESA.2019.52

 

• Alexander Göke , Dániel Marx, and Matthias Mnich. Parameterized algorithms for generalizations of directed feedback vertex set. In International Conference on Algorithms and Complexity, pages 249-261. Springer, 2019.

 

• Alexander van der Grinten, Eugenio Angriman, and Henning Meyerhenke. Parallel adaptive sampling with almost no synchronization. In Euro-Par, volume 11725 of Lecture Notes in Computer Science, pages 434-447. Springer, 2019.

 

• Alexander van der Grinten and Henning Meyerhenke. Scaling up network centrality computations *. In DATE, pages 1319-1324. IEEE, 2019.

 

• Michael Hamann and Ben Strasser. Correspondence between multilevel graph partitions and tree decompositions. Algorithms, 12(9):198, 2019.

 

• Tobias Heuer, Peter Sanders, and Sebastian Schlag. Network flow-based refinement for multilevel hypergraph partitioning. ACM J. Exp. Algorithmics, 24, September 2019.

 

• Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, and Huashuo Zhang. Exactly solving the maximum weight independent set problem on large real-world graphs. In Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019, pages 144-158, 2019.

 

• F. Nussbaum and J. Giesen. Ising Models with Latent Conditional Gaussian Variables. Proceedings of the 30th International Conference on Algorithmic Learning Theory (ALT), 669-681, 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.

 

• Oskar Taubert, Ines Reinartz, Henning Meyerhenke, and Alexander Schug. distruct v1.0: generating biomolecular structures from distance constraints. Bioinform., 35(24):5337-5338, 2019.

 

Year 2018:

• Thomas Agrikola and Dennis Hofheinz. Interactively secure groups from obfuscation. In IACR International Workshop on Public Key Cryptography, pages 341-370. Springer, 2018.

 

• Jasper, J.B., Humbeck, L., Brinkjost, T. and Koch, O., 2018. A novel interaction fingerprint derived from per atom score contributions: exhaustive evaluation of interaction fingerprint performance in docking based virtual screening. Journal of Cheminformatics, 10(1), pp.1-13.

 

• Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, and Alexander Schickedanz. An empirical comparison of k-shortest simple path algorithms on multicores. In Proceedings of the 47th International Conference on Parallel Processing, page 78. ACM, 2018.
  
  
  
• Yaroslav Akhremtsev, Peter Sanders, and Christian Schulz. High-quality shared-memory graph partitioning. In European Conference on Parallel Processing, pages 659-671. Springer, 2018.

 

• Susanne Albers and Dario Frascaria. Quantifying competitiveness in paging with locality of reference. Algorithmica, 80(12):3563-3596, 2018.

 

• Susanne Albers and Jens Quedenfeld. Optimal algorithms for right-sizing data centers. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pages 363-372, 2018.

 

• Robin Andre, Sebastian Schlag, and Christian Schulz. Memetic multilevel hypergraph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 347-354. ACM, 2018.

 

• Benedikt Auerbach, Mihir Bellare, and Eike Kiltz. Publickey encryption resistant to parameter subversion and its realization from eciently-embeddable groups. In IACR International Workshop on Public Key Cryptography, pages 348-377. Springer, 2018.

 

• Evangelos Bampas, Jémérie Chalopin, Shantanu Das, Jan Hackfeld, and Christina Karousatou. Maximal exploration of trees with energy-constrained agents. arXiv preprint arXiv:1802.06636, 2018.

 

• Mahyar Behdju and Ulrich Meyer. Dfg priority programme spp 1736: Algorithms for big data. KI-Künstliche Intelligenz, 32(1):77-84, 2018.

 

• Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'angelo, Henning Meyerhenke, Lorenzo Severini, and Yllka Velaj. Improving the betweenness centrality of a node by adding links. Journal of Experimental Algorithmics (JEA), 23:1-5, 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.

 

• Rudolf Biczok, Peter Bozsoky, Peter Eisenmann, Johannes Ernst, Tobias Ribizel, Fedor Scholz, Axel Trefzer, Florian Weber, Michael Hamann, and Alexandros Stamatakis. Two C++ libraries for counting trees on a phylogenetic terrace. Bioinformatics, 34(19):3399-3401, 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

 

• Bingmann, T., 2018. Scalable string and suffix sorting: Algorithms, techniques, and tools. arXiv preprint arXiv:1808.00963.

 

• Timo Bingmann, Simon Gog, and Florian Kurpicz. Scalable construction of text indexes with thrill. In 2018 IEEE International Conference on Big Data (Big Data), pages 634-643. IEEE, 2018.

 

• Patrick Bisenius, Elisabetta Bergamin, Eugenio Angriman, and Henning Meyerhenke. Computing top-k closeness centrality in fully-dynamic graphs. In 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 21-35. SIAM, 2018.

 

• Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue. Efficient embedding of scale-free graphs in the hyperbolic plane. IEEE/ACM Transactions on Networking, 26(2):920-933, 2018.

 

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

 

• Ulrik Brandes, Michael Hamann, Mark Ortmann, and Dorothea Wagner. On the persistence of strongly embedded ties, 2018.

 

• Christian Brugger, Valentin Grigorovici, Matthias Jung, Christian De Schryver, Christian Weis, Norbert Wehn, and Katharina Anna Zweig. A memory centric architecture of the link assessment algorithm in large graphs. IEEE Design & Test, 35(1):7-15, 2018.

 

• Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, and Henning Meyerhenke. Scalable katz ranking computation in large static and dynamic graphs. In ESA,  volume 112 of LIPIcs, pages 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 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.

 

• Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Largest Weight Common Subtree Embeddings with Distance Penalties. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 54:1-54:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
  https://doi.org/10.4230/LIPIcs.MFCS.2018.54

 

• Léo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehle. Crystals-dilithium: a lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(1):238-268, 2018.

 

• Michael Etscheid and Matthias Mnich. Linear kernels and linear-time algorithms for finding large cuts. Algorithmica, 80(9):2574-.615, 2018.

 

• Pooya Farshim, Julia Hesse, Dennis Hofheinz, and Enrique Larraia. Graded encoding schemes from obfuscation. In IACR International Workshop on Public Key Cryptography, pages 371-400. Springer, 2018.

 

• Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer auf der Heide. A dynamic distributed data structure for top-k and k-select queries. In Adventures Between Lower Bounds and Higher Altitudes, pages 311-329. Springer, 2018.

 

• Johannes Fischer, Florian Kurpicz, and Marvin Löbel. Simple, fast and lightweight parallel wavelet tree construction. In 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 9-20. SIAM, 2018.

 

• Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Moritz von Looz. Communication-free massively distributed graph generation. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 336-347. IEEE, 2018.

 

• Georg Fuchsbauer, Eike Kiltz, and Julian Loss. The algebraic group model and its applications. In Annual International Cryptology Conference, pages 33-62. Springer, 2018.

 

• Romain Gay, Dennis Hofheinz, Lisa Kohl, and Jiaxin Pan. More efficient (almost) tightly secure structure-preserving signatures. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 230-258. Springer, 2018.

 

• Federico Giacon, Eike Kiltz, and Bertram Poettering. Hybrid encryption in a multi-user setting, revisited. In IACR International Workshop on Public Key Cryptography, pages 159-189. Springer, 2018.

 

• Roland Glantz and Henning Meyerhenke. Many-to-many correspondences between partitions: Introducing a cut-based approach. In Proceedings of the 2018 SIAM International Conference on Data Mining, pages 1-9. SIAM, 2018.

 

• Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A Bader, and Henning Meyerhenke. Scalable katz ranking computation in large static and dynamic graphs. arXiv preprint arXiv:1807.03847, 2018.

 

• Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner. I/o-efficient generation of massive graphs following the lfr benchmark. Journal of Experimental Algorithmics (JEA), 23(2):2-5, 2018.

 

• Michael Hamann, Ben Strasser, Dorothea Wagner, and Tim Zeitz. Distributed Graph Clustering Using Modularity and Map Equation. In Proceedings of the 24th International Conference on Parallel Processing (Euro-Par 2018), volume 11014 of Lecture Notes in Computer Science, pages 688-702. Springer, 2018.

 

• Michael Hamann and Ben Strasser. Graph bisection with pareto optimization. Journal of Experimental Algorithmics (JEA), 23(1):1-2, 2018.

 

• Alexandra Henzinger, Alexander Noe, and Christian Schulz. ILP-based Local Search for Graph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
  https://doi.org/10.4230/LIPIcs.SEA.2018.4

 

• Meyerhenke, H., Peng, R. and Safro, I., 2018. High-Performance Graph Algorithms (Dagstuhl Seminar 18241). In Dagstuhl Reports (Vol. 8, No. 6). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

 

• Gottfried Herold, Elena Kirshanova, and Alexander May. On the asymptotic complexity of solving lwe. Designs, Codes and Cryptography, 86(1):55-83, 2018.

 

• Lina Humbeck, Sebastian Weigang, Till Schäfer, Petra Mutzel, and Oliver Koch. Chipmunk: A virtual synthesizable small-molecule library for medicinal chemistry, exploitable for protein-protein interaction modulators. ChemMedChem, 13(6):532-539, 2018

 

• Saqib A Kakvi and Eike Kiltz. Optimal security proofs for full domain hash, revisited. Journal of Cryptology, 31(1):276-306, 2018.

 

• Kristian Kersting and Ulrich Meyer. From big data to big artificial intelligence? Springer, 2018.

 

• Eike Kiltz, Vadim Lyubashevsky, and Christian Schaner. A concrete treatment of fiat-shamir signatures in the quantum random-oracle model. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 552-586. Springer, 2018.

 

• Kriege, N. M., Droschinsky, A., & Mutzel, P. (2018). A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. Journal of Graph Algorithms and Applications, 22(4), 607–616. https://doi.org/10.7155/jgaa.00480

 

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

 

• Nils Kriege, Florian Kurpicz, and Petra Mutzel. On maximum common subgraph problems in series-parallel graphs. European Journal of Combinatorics, 68:79-95, 2018.

 

• Moritz von Looz and Henning Meyerhenke. Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. J. Exp. Algorithmics, 23:1.6:1-1.6:30, November 2018.

 

• Friedhelm Meyer auf der Heide. A communication-efficient distributed data structure for top-k and k-select queries. In Approximation and Online Algorithms: 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, volume 10787, page 285. Springer, 2018.

 

• Henning Meyerhenke, Martin Nöllenburg, and Christian Schulz. Drawing large graphs by multilevel maxent-stress optimization. IEEE transactions on visualization and computer graphics, 24(5):1814-1827, 2018.

 

• Henning Meyerhenke, Richard Peng, and Ilya Safro. Highperformance graph algorithms (dagstuhl seminar 18241). Dagstuhl Reports, 8(6):19-39, 2018.

 

• Matthias Mnich. Big data algorithms beyond machine learning. KI-Künstliche Intelligenz, 32(1):9-17, 2018.

 

• Matthias Mnich, Heiko Röglin, and Clemens Rösner. New deterministic algorithms for solving parity games. Discrete Optimization, 2018.

 

• Matthias Mnich, Ignaz Rutter, and Jens M Schmidt. Linear-time recognition of map graphs with outerplanar witness. Discrete Optimization, 28:63-77, 2018.

 

• Orlando Moreira, Merten Popp, and Christian Schulz. Evolutionary multi-level acyclic graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 332-339. ACM, 2018.

 

• Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, and Pawel Gawrychowski. Average-case behavior of k-shortest path algorithms. In International Conference on Complex Networks and their Applications, pages 28-40. Springer, 2018.

 

• Benjamin Schott, Manuel Traub, Cornelia Schlagenhauf, Masanari Takamiya, Thomas Antritter, Andreas Bartschat, Katharina Löffler, Denis Blessing, Jens C Otte, Andrei Y Kobitski, et al. Embryominer: A new framework for interactive knowledge discovery in large-scale cell tracking data of developing embryos. PLoS computational biology, 14(4):e1006128, 2018.

 

• Johannes Stegmaier, Thiago V Spina, Alexandre X Falcao, Andreas Bartschat, Ralf Mikut, Elliot Meyerowitz, and Alexandre Cunha. Cell segmentation in 3d confocal images using supervoxel merge-forests with cnn-based hypothesis selection. In Biomedical Imaging (ISBI 2018), 2018 IEEE 15th Interna-tional Symposium on, pages 382-386. IEEE, 2018.

 

• Tavassoli, S., 2018. Analyzing Centrality Indices in Complex Networks: an Approach Using Fuzzy Aggregation Operators (Doctoral dissertation, Technische Universität Kaiserslautern).

 

 

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

 

• Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, and Richard Stotz. Scheduling on power-heterogeneous processors. Information and Computation, 257:22-33, 2017.

 

• Josh Alman, Matthias Mnich, Virginia Vassilevska Williams. Dynamic Parameterized Problems and Algorithms. ICALP 2017: 41:1-41:16

 

• Benedikt Auerbach, David Cash, Manuel Fersch, and Eike Kiltz. Memory-tight reductions. In Annual International Cryptology Conference, pages 101-132. Springer, 2017.

 

• Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, and Maús Mihalák. Collaborative delivery with energy-constrained mobile robots. Theoretical Computer Science, 2017.

   

• Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, et al. Monitoring of domain-related problems in distributed data streams. In International Colloquium on Structural Information and Communication Complexity, pages 212-226. Springer, 2017.

 

• Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, and Arie Slobbe. Faster Betweenness Centrality Updates in Evolving Networks. In 16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, pages 23:1–23:16, 2017.

 

• Felix Biermeier, Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer auf der Heide. A communication-ecient distributed data structure for top-k and k-select queries. In International Workshop on Approximation and Online Algorithms, pages 285-300. 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.

 

• Antje Bjelde, Felix Fischer, and Max Klimm. Impartial selection and the power of up to two choices. ACM Transactions on Economics and Computation (TEAC), 5(4):21, 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.

 

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

   

• Zdenek Dvorak and Matthias Mnich. Large independent sets in triangle-free planar graphs. SIAM Journal on Discrete Mathematics, 31(2):1355-1373, 2017.

 

• Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, and Jorge Luis Villar. An algebraic framework for Diffie-Hellman assumptions. J. Cryptology, 30(1):242-288, 2017.

   

• Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, and Morteza Monemizadeh. Prophet secretary. SIAM Journal on Discrete Mathematics, 31(3):1685-1701, 2017.

 

• Michael Etscheid, Stefan Kratsch, Matthias Mnich, and Heiko Röglin. Polynomial kernels for weighted problems. Journal of Computer and System Sciences, 84:1-10, 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.

 

• Christian Glazik, Jan Schiemann, and Anand Srivastav. Finding euler tours in one pass in the w-streaming model with o(n log(n)) RAM. CoRR, abs/1710.04091, 2017.

 

• Michael Hamann, Ulrich Meyer, Manuel Penschuck, and Dorothea Wagner. I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. In Proceedings of the 19th Meeting on Algorithm Engineering and Experiments (ALENEX'17), pages 58-72. SIAM, 2017.

 

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

   

• Tobias Heuer and Sebastian Schlag. Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In LIPIcs-Leibniz International Proceedings in Informatics, volume 75. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 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.

   

• Eike Kiltz, Julian Loss, and Jiaxin Pan. Tightly-secure signatures from five-move identification protocols. In International Conference on the Theory and Application of Cryptology and Information Security, pages 68-94. Springer, 2017.

 

• Eike Kiltz, Adam ONeill, and Adam Smith. Instantiability of rsa-oaep under chosen-plaintext attack. Journal of Cryptology, 30(3):889-919, 2017.

 

• Eike Kiltz, Krzysztof Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. Efficient authentication from hard learning problems. Journal of Cryptology, 30(4):1238-1275, 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.

 

• Dusan Knop, Martin Koutecky, and Matthias Mnich. Combinatorial n-fold integer programming and applications. arXiv preprint arXiv:1705.08657, 2017.

 

• Martin Koutecky, Dusan Knop, Matthias Mnich. Combinatorial n-fold Integer Programming and Applications. Proceedings of the European Symposium on Algorithms (ESA '17), to appear.

 

• Martin Koutecky, Dusan Knop, Matthias Mnich. Voting and Bribing in Single Exponential Time. Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS '17), LIPIcs 66, pp. 46:1–46:14.

 

• Ulrich Meyer, Manuel Penschuck, The Algorithmics Column by Gerhard J Woeginger. Large-scale Graph Generation and Big Data: An Overview on Recent Results. In 122nd issue of the EATCS Bulletin 2017.

 

• Ulrich Meyer, Manuel Penschuck, et al. Large-scale graph generation and big data: an overview on recent results. Bulletin of EATCS, 2(122), 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.

 

• Henning Meyerhenke, Peter Sanders, and Christian Schulz. Parallel graph partitioning for complex networks. IEEE Trans- actions on Parallel and Distributed Systems, 28(9):2625-2638, 2017.

 

• Matthias Mnich, Erik Jan van Leeuwen. Polynomial Kernels for Deletion to Classes of Acyclic Digraphs.
  Discrete Optimization 25: 48-76 (2017) .

 

• Orlando Moreira, Merten Popp, and Christian Schulz. Graph partitioning with acyclicity constraints. arXiv preprint arXiv:1704.00705, 2017.

 

• Mark Ortmann and Ulrik Brandes. Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied Network Science, 2(1):13, 2017.

   

• Pan Peng, Christian Sohler, Morteza Monemizadeh, S. Muthukrishnan. Testable bounded degree graph properties are random order streamable. In ICALP, pages 131-1, 2017.

 

• Manuel Penschuck. Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory. In 16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, pages 26:1-26:21, 2017.

 

• Till Schäfer, Nils Kriege, Lina Humbeck, Karsten Klein, Oliver Koch, and Petra Mutzel. Scaffold Hunter: a comprehensive visual analytics framework for drug discovery. J. Cheminformatics, 9(1):28:1–28:18, 2017.

 

• Ashkiani, S., Davidson, A., Meyer, U. and Owens, J.D., 2017. GPU Multisplit: an extended study of a parallel algorithm. ACM Transactions on Parallel Computing (TOPC), 4(1), pp.1-44.

 

• Schäfer, T. and Mutzel, P., 2017, October. Struclus: scalable structural graph set clustering with representative sampling. In International conference on advanced data mining and applications (pp. 343-359). Cham: Springer International Publishing.

 

• Miriam Schlöter and Martin Skutella. Fast and memory-efficient algorithms for evacuation problems. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 821-840, 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, pages 415-424. IEEE Computer Society, 2017.

 

• Peter Sanders, Christian Schulz, Darren Strash, and Robert Williger. Distributed evolutionary k-way node separators. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 345-352. ACM, 2017.

 

• Wolfgang Schlauch. Analysis of different random graph models in the identification of network motifs in complex networks. 2017.

 

• Christian Schulz and Jesper Larsson Träff. Better process mapping and sparse quadratic assignment problems. 2017.

 

• Christian Staudt, Michael Hamann, Alexander Gutfraind, Ilya Safro, and Henning Meyerhenke. Generating realistic scaled complex networks. Applied Network Science, 2(1):36, 2017.

 

• Hofheinz, D., Hövelmanns, K. and Kiltz, E., 2017, November. A modular analysis of the Fujisaki-Okamoto transformation. In Theory of Cryptography Conference (pp. 341-371). Cham: Springer International Publishing.

 

• Johannes Stegmaier. New Methods to Improve Large-Scale Microscopy Image Analysis with Prior Knowledge and Uncertainty. KIT Scientific Publishing, 2017.

 

• Johannes Stegmaier and Ralf Mikut. Fuzzy-based propagation of prior knowledge to improve large-scale image analysis pipelines. PloS one, 12(11):e0187535, 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.

 

• Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B Reusch, and Philip Rosenstiel. An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC bioinformatics, 18(1):324, 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.

 

• Fersch, M., Kiltz, E. and Poettering, B., 2017. On the one-per-message unforgeability of (EC) DSA and its variants. In Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II 15 (pp. 519-534). Springer International Publishing.

 

• Michael Wegner, Oskar Taubert, Alexander Schug, and Henning Meyerhenke. Maxent-Stress Optimization of 3D Biomolecular Models. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 70:1-70:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
  https://doi.org/10.4230/LIPIcs.ESA.2017.70

 

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 Bärtschi, Jérémie 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, Björn 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.

 

• Bergamini, E., Wegner, M., Lukarski, D. and Meyerhenke, H., 2016. Estimating current-flow closeness centrality with a multigrid laplacian solver. In 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing (pp. 1-12). Society for Industrial and Applied Mathematics.

 

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

 

• Schäfer, T. and Mutzel, P., 2016. StruClus: structural clustering of large-scale graph databases. arXiv preprint arXiv:1609.09000.

 

• Stegmaier, J., Schott, B., Hübner, E., Traub, M., Shahid, M., Takamiya, M., Kobitski, A., Hartmann, V., Stotzka, R., van Wezel, J. and Streit, A., 2016. Automation strategies for large-scale 3D image analysis. at-Automatisierungstechnik, 64(7), pp.555-566.

 

• Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, 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++. In 2016 IEEE International Conference on Big Data, BigData 2016, Washington DC, USA, December 5-8, 2016, pages 172-183, 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.

 

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

 

• Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen. Parameterized Complexity Dichotomy for Steiner Multicut. In Journal of Computer and System Sciences 82(6), 2016.

 

• Christian Brugger, Andre Lucas Chinazzo, Alexandre Flores John, Christian de Schryver, Norbert Wehn, Wolfgang Eugen Schlauch, and Katharina Anna Zweig. Increasing sampling efficiency for the fixed degree sequence model with phase transitions.
  Social Netw. Analys. Mining, 6(1):100:1-100:14, 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.

 

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

 

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

 

• Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Krakow, Poland, pages 33:1-33:14, 2016.

 

• El Ouali, M., Munstermann, P. and Srivastav, A., 2016. Randomized approximation for the set multicover problem in hypergraphs. Algorithmica, 74, pp.574-588.

 

•  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, Stefan Kratsch, Matthias Mnich, and Heiko Rglin. Polynomial kernels for weighted problems. In Journal of Computer and System Sciences 84, 2016.

 

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

 

• Johannes Fischer, Dominik Köppl, and Florian Kurpicz. On the benefit 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.

 

• Marc Fischlin, Felix Günther, Benedikt Schmidt, and Bogdan Warinschi. Key confirmation 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.

 

•  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

 

• 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 Sören 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.

 

• Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, and Dorothea Wagner. Structure-preserving sparsification methods for social networks. Social Netw. Analys. Mining, 6(1):22:1-22:22, 2016.

 

• Michael Hamann and Ben Strasser. Graph bisection with pareto-optimization. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, pages 90-102, 2016
   
   

• Julia Hesse, Dennis Hofheinz, and Andy Rupp. Reconfigurable 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.

 

• Felix Heuer, Tibor Jager, Sven Schäge, and Eike Kiltz. Selective opening security of practical public-key encryption schemes. IET Information Security, 10(6):304-318, 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.

 

• Dennis Hofheinz and Tibor Jager. Tightly secure signatures and public-key encryption. Des. Codes Cryptography, 80(1):29-61, 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.

 

• Dennis Hofheinz, Tibor Jager, and Andy Rupp. Public-key encryption with simulation-based selective-opening security and compact ciphertexts. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, pages 146-168, 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.

 

• Dennis Hofheinz, Vanishree Rao, and Daniel Wichs. Standard security does not imply indistinguishability under selective opening. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November
  3, 2016, Proceedings, Part II, pages 121-145, 2016.

 

• Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, and Michael Wegner. Engineering a combinatorial laplacian solver: Lessons learned. Algorithms, 9(4):72, 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.

 

• Eike Kiltz, Daniel Masny, and Jiaxin Pan. Optimal security proofs for signatures from identification 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.

 

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

 

•  Matthias Mnich. Large Independent Sets in Subquartic Planar Graphs. In Proceedings of the International Workshop on Algorithms and Computation (WALCOM ’16), 2016.

 

• Matthias Mnich, Heiko Rglin, and Clemens Rsner. New Deterministic Algorithms for Solving Parity Games. In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN ’16), Lecture Notes in Computer Science 9644, 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.

 

• 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. In Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pages 18-32, 2016.

 

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

 

• Peter Sanders and Christian Schulz. Scalable generation of scale-free graphs. Inf. Process. Lett., 116(7):489–491, 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. 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 and Henning Meyerhenke. Engineering parallel algorithms for community detection in massive networks. IEEE Trans. Parallel Distrib. Syst., 27(1):171-184, 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.

 

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

 

• Sude Tavassoli and Katharina Anna Zweig. Analyzing Multiple Rankings of Influential Nodes in Multiplex 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 135–146, 2016.

 

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

 

• Moritz von Looz, Mustafa Safa Özdayi, Sören Laue, and Henning Meyerhenke. Generating massive complex networks with hyperbolic geometry faster in practice. In 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, pages 1-6, 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:

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

 

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

 

• 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

 

• 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 Günther, 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.

 

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

 

• 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 Schäge. 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.

 

• Dennis Hofheinz, Jessica Koch, and Christoph Striecks. Identity-based encryption with (almost) tight security in the multiinstance, multi-ciphertext setting. 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 799-822, 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.

 

• Annamáriá Kovács, 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.

 

• 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

 

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

 

• 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 Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, Tanja Hartmann, and Dorothea Wagner. Efficient 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 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.

 

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

 

• von Looz, M., Staudt, C.L., Meyerhenke, H. and Prutkin, R., 2014. Fast generation of dynamic complex networks with underlying hyperbolic geometry. KIT, Fakultät für Informatik.

 

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

 

• Zdenk Dvok and Matthias Mnich. Large Independent Sets in Triangle-Free Planar Graphs. In Proceedings of the European Symposium on Algorithms (ESA ’14), Lecture Notes in Computer Science 8737, 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. Scaffold 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.

 

• Matthias Mnich and Andreas Wiese. Scheduling and FixedParameter Tractability. In Mathematical Programming Series B 154(1), 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.

 

• Ren van Bevern, Matthias Mnich, Rolf Niedermeier, and Mathias Weller. Interval Scheduling and Colorful Independent Sets. In Journal of Scheduling 18(5), 2014.

 

•  Andreas Wiese, Matthias Mnich. Scheduling and fixed-parameter tractability. In Mathematical Programming Series B 154(1), 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