Succinct Data Structures Professors and Supervisors in Germany

Cristina G. FernandesView profile

Associate Professor

Max Planck Institute for Software SystemsGermany

Cristina G. Fernandes is an Associate Professor in the Department of Computer Science at the Institute of Mathematics and Statistics, University of São Paulo (IME-USP), where she conducts research in theoretical computer science, combinatorial optimization, and graph theory. She teaches advanced courses such as Advanced Data Structures and Topics in Algorithm Analysis. Her research interests include algorithms, combinatorial optimization, graph theory, approximation algorithms, data structures (persistent, retroactive, kinetic, succinct), and computational geometry. She applies theoretical methods to solve complex problems in network design, clustering, and discrete structures. The recent publications reflect a strong focus on structural and extremal graph theory, approximation algorithms, and combinatorial optimization. Key themes include tree and path packing, dominating sets, Steiner-type problems, and combinatorial properties of graphs. Her work often involves deep structural analysis and algorithmic design for NP-hard problems. Cristina G. Fernandes has not been mentioned with any specific scientific awards in the provided texts. She has supervised numerous postdoctoral researchers, PhD, MSc, and undergraduate students, many funded by FAPESP, CAPES, and CNPq. She leads significant research projects, including CAPES/MATH/STIC/CLIMAT-AMSU on energy efficiency in distributed computing and CNPq Universal projects on partitioning and connectivity. She is actively involved in academic advising and grant-funded research. She leads or participates in the Research Group in Theoretical Computer Science, Combinatorics and Combinatorial Optimization at IME-USP, fostering collaborative research in algorithms and discrete mathematics.

Official University Profile

Volker HeunView profile

Professor

Ludwig Maximilian University of MunichGermany

Volker Heun is a Professor of Bioinformatics at Ludwig-Maximilians-Universität München (LMU), holding positions within the Faculty of Mathematics, Computer Science, and Statistics since 2003. He currently serves as Vice Dean of the faculty and holds various academic coordination roles, including Bioinformatics program coordination and ERASMUS coordination. His academic journey includes a Ph.D. from TU München (1996) and research fellowships at the International Computer Science Institute (Berkeley, 1997–1998). Education: Studied Computer Science and Mathematics at Johann Wolfgang Goethe-Universität Frankfurt (1984–1991), followed by research roles at TU München and other institutions. Professional roles include Research Assistant (1991–1996) and Research Associate (1996–2003). Research focuses on algorithmic bioinformatics, protein folding, data structures, and computational biology. Key contributions include work on RNA sequence-structure analysis, chemical shift correction tools (e.g., CheckShift), and efficient algorithms for range queries and suffix arrays. He has authored multiple influential books on algorithms and bioinformatics. Publications span over two decades, emphasizing algorithm design, bioinformatics applications, and parallel computing. Supervised PhD students include Benjamin Albrecht (2016), Luca Chiarabini (2009), and Simon W. Ginzinger (2008). Teaching includes courses on Algorithmic Bioinformatics, Algorithms on Sequences, and bioinformatics-related seminars. Administrative roles include serving as Vice Dean (2004–2007, 2013–2017, 2019–present) and Dean (2011–2013, 2017–2019). His work bridges theoretical computer science and applied bioinformatics, with a focus on interdisciplinary research.

Official University Profile

Michael ElberfeldView profile

Professor

Technical University of MittelhessenGermany

Prof. Dr. Michael Elberfeld is a faculty member at the Technical University of Central Hesse , affiliated with the Department of Mathematics, Natural Sciences and Computer Science . His research focuses on theoretical computer science, particularly in computational and parameterized complexity, logic in computer science, and algorithmic meta-theorems. Education : Doctorate in Theoretical Computer Science from the University of Lübeck (2012); Diploma (MSc) in Computer Science from the University of Lübeck (2007). His work explores the intersection of graph theory , logic , and space-bounded computation , with groundbreaking contributions to problems on bounded tree-width structures and order-invariant logics . He has developed logspace algorithms for graph canonization and studied succinctness tradeoffs in logical formalisms. Key publications include analyses of parameterized space complexity , algorithmic meta-theorems , and applications to bioinformatics like haplotype inference and network orientation. His research is supported by the European Commission through grants 648276 and P 28699 . He collaborates extensively with researchers such as Martin Grohe , Pascal Schweitzer , and Till Tantau , bridging theoretical logic with practical applications in staff rostering and biological network analysis .

Official University Profile

Kathleen FisherView profile

Adjunct Professor

Max Planck Institute for Software SystemsGermany

Kathleen Fisher is an Adjunct Professor in the Computer Science Department at Tufts University and currently serves as the Director of the Information Innovation Office at DARPA. She previously held roles as Professor and Department Chair at Tufts (2016-2021), Program Manager at DARPA, and Principal Member of Technical Staff at AT&T Labs Research. Her academic journey began with a PhD in Computer Science from Stanford University. Kathleen’s research focuses on advancing programming languages through domain-specific languages (DSLs), program synthesis, and formal methods. Her work addresses challenges in ad hoc data management, secure systems, and integrating machine learning with programming language design. Notable projects include the Hancock and PADS systems for data processing, Forest for filestore management, and verified parser generators. She has received prestigious accolades, including ACM Fellow, Hertz Foundation Fellow, and SIGPLAN Distinguished Service Award. Her service includes leadership roles in ACM SIGPLAN, CRA-W, and as General Chair for ICFP 2015. Kathleen has advised PhD student Matt Ahrens and led impactful DARPA programs like HACMS and PPAML. As co-founder of the Programming Language Mentoring Workshop (PLMW), she actively contributes to diversity initiatives in computer science. Her research group, TuPL, explores DSLs, program synthesis, and language-based security, maintaining projects such as Autobahn and PADS.

Official University Profile

Olivier CuréView profile

Professor

University of TrierGermany

Olivier Curé is a faculty member affiliated with Université Paris Est in France, specializing in semantic web technologies and knowledge engineering. His research focuses on distributed RDF processing, knowledge graph management, and edge computing adaptations of semantic technologies. Research Focus: Dr. Curé leads significant work in RDF stream processing systems (Strider engine), knowledge graph compression (LiteMat encoding), and privacy-preserving semantic data management. His recent work explores edge computing adaptations of knowledge graphs, real-time stream reasoning, and distributed SPARQL query processing. Key innovations include privacy frameworks for RDF anonymization and resource-efficient knowledge representation for IoT environments. Publication Trends: His 15 most recent publications (2020-2025) demonstrate a strong focus on: 1) Scalable RDF processing architectures, 2) Knowledge graph optimization for edge devices, 3) Privacy-enhancing techniques for semantic data, and 4) Distributed reasoning systems. This reflects an evolution from foundational RDF storage research toward adaptive, privacy-aware semantic systems for decentralized computing. Research Infrastructure: Dr. Curé contributes to multiple open-source projects including Strider (distributed RDF processing) and ZodiacEdge (Datalog engine), indicating leadership in semantic technology tooling development.

Official University Profile

Louisa Seelbach BenknerView profile

Researcher

University of SiegenGermany

Louisa Seelbach Benkner is a postdoctoral researcher at the University of Siegen , affiliated with the Faculty of Electrical Engineering and Computer Science. Her research focuses on data compression, particularly grammar-based compression, succinct data structures, universal source coding, and analytic combinatorics. She has contributed to theoretical advancements in tree compression and entropy analysis. Education: PhD in Computer Science from University of Siegen (2023). Research interests center on optimizing data compression techniques for tree structures, analyzing entropy bounds, and applying combinatorial methods to algorithm design. Her work bridges theoretical computer science and practical data encoding solutions. Selected publications highlight her expertise in hypersuccinct tree compression, empirical entropy comparisons, and fringe subtree analysis. Key collaborations include researchers like Markus Lohrey, Stephan Wagner, and Travis Gagie. Scientific awards: Capocelli Prize at DCC 2019 Best Student Paper Award at SPIRE 2020 Teaching roles include formal languages, complexity theory, logic, and algorithmics courses. She has also contributed to mathematics instruction in analysis and linear algebra.

Official University Profile

Rotem OshmanView profile

Professor

Schloss Dagstuhl - Leibniz Center for InformaticsGermany

Rotem Oshman is affiliated with Tel-Aviv University, Israel , where he contributes to research in theoretical computer science, focusing on distributed computing, communication complexity, and quantum algorithms. His work addresses fundamental challenges in network protocols, concurrent data structures, and cryptographic verification.

Official University Profile