جستجوی استاد راهنمای دانشگاهی

• Algorithms on strings
• Formal language theory
• Bioinformatics
• +۳ مورد دیگر

Chiara Epifanio is a researcher (INFO-01/A) at the University of Palermo , based in the Department of Mathematics and Computer Science . She holds regular office hours on Tuesdays 14:30–17:00 in Room 104, first floor, Via Archirafi 34, and can be reached at chiara.epifanio@unipa.it . Over the past fifteen years she has designed and taught a diverse portfolio of courses spanning Programming , Bioinformatics , Advanced Programming , Teaching Methodologies and Techniques for Computer Science and Pattern Discovery for Life Sciences . These offerings serve degree programmes in Mathematics, Computer Science, Statistics & Data Science, and the recently launched curricula in Data, Algorithms & Machine Intelligence and Computer Science & Artificial Intelligence . Her research lies at the intersection of combinatorics on words , string algorithms , and bioinformatics . She has made sustained contributions to the design of alignment-free distances for biological data, the theory of Sturmian words and their associated graphs, suffix automata tolerant to mismatches, and compact data structures such as linear-size suffix tries. The work repeatedly draws on deep results from formal language theory, automata theory, and discrete mathematics to solve practical problems in sequence analysis. Publications trend: From 2004 onward she has produced a steady stream of peer-reviewed articles that move from foundational combinatorial results on Sturmian words and critical factorization theorems toward application-driven studies on approximate string matching and genomic data mining. A marked acceleration is visible in the 2023 publications addressing k-Hamming and k-edit distances, reflecting current demands in large-scale biological data analytics. Scientific awards: None explicitly mentioned in the provided material. Advising & grants: No PhD or Master’s students are listed in the supplied pages, and no funded project descriptions are available. Laboratories & teams: While no specific lab is named, her teaching and research are embedded within the Department of Mathematics and Computer Science, which hosts groups in algorithms, discrete mathematics, and bioinformatics, and provides access to the university’s ATeN Center and other research infrastructures.

Florin Silviu Maneaمشاهده پروفایل

استاد

• String Algorithms and Combinatorics
• String Solving
• Efficient Algorithms and Data Structures
• +۶ مورد دیگر

Florin Silviu Manea is a Professor for Theoretical Computer Science at the Institute of Computer Science, University of Göttingen, Germany. He has held this W3-Professor position since 2022, funded by the Heisenberg programme of the DFG. Prior to this, he was a W2-Professor for Fundamentals of Computer Science at the same university (2019-2022). His academic career includes research positions at Kiel University (2011-2019) and an Alexander von Humboldt fellowship at the University of Magdeburg (2009-2011). Dr. Manea received his PhD in December 2007 from the University of Bucharest with the distinction Summa cum Laude. His PhD thesis was titled "Networks of bio-processors" and was supervised by Victor Mitrana. He also earned a Master of Science (2005) and Bachelor of Science in Computer Science (2003) from the University of Bucharest, both with perfect GPA scores of 10/10. Professor Manea's research focuses on the theoretical foundations of computer science, with particular emphasis on string algorithms and combinatorics. His work explores the intricate relationships between formal language theory, automata theory, and practical applications in string solving. He has made significant contributions to understanding pattern matching with variables, combinatorial properties of strings, and the computational aspects of word equations. His research bridges theoretical concepts with practical applications in areas like bioinformatics and programming language theory. Analysis of Professor Manea's recent publications reveals a strong focus on string algorithms, particularly in the areas of pattern matching, word equations, and combinatorics on words. His work often explores the computational complexity of string problems while developing efficient algorithms to solve them. A recurring theme is the investigation of repetitions, palindromes, and gapped structures in strings, with applications ranging from DNA sequence analysis to programming language design. His research demonstrates a consistent pattern of advancing both the theoretical understanding and practical applications of string algorithms. Professor Manea has received several prestigious awards for his contributions to computer science: Lehrpreis 2020 (Teaching Award) by CS-students from Göttingen The "Tudor Tanasescu" Prize of the Romanian Academy (2009) Honorable Mention at ACM International Collegiate Programming Contest World Finals (2004, 2007) As an advisor, Professor Manea has successfully supervised multiple PhD students to completion with highest honors, including Maria Kosche (2023), Stefan Siemer (2024), and Tore Koß (2024), all achieving Summa cum Laude distinctions. He currently leads a research group focused on theoretical computer science at the University of Göttingen. His research is supported by significant funding, including a DFG grant for "String Constraint Solving: Combinatorial, Algorithmic, and Language-Theoretic Approaches" and continued Heisenberg-programme funding until 2027 for his project "Combinatorial String Solving." Professor Manea leads the Theoretical Computer Science research group at the University of Göttingen, which focuses on string algorithms, combinatorics, and computational models. His group actively collaborates with researchers worldwide and has organized several major conferences including DLT 2024, NCMA 2024, and CSL 2022. The group offers supervision for BSc and MSc theses on both theoretical and applied topics related to their research areas.

• Constraint Programming
• Algorithm Selection
• String Constraint Solving
• +۴ مورد دیگر

Roberto Amadini is an Associate Professor in the Department of Computer Science and Engineering at the University of Bologna. His work focuses on constraint programming, algorithm selection, and string constraint solving, with applications in cloud-edge computing and IoT systems. He leads research in deploying microservices over hybrid infrastructures and optimizing solver portfolios for constraint satisfaction problems. Research interests include advanced constraint solving techniques, formal methods for software analysis, and energy-efficient resource allocation. Amadini’s contributions span the design of frameworks like FREEDA and SUNNY-as2, which enhance deployment resilience and algorithm selection efficiency. His work bridges theoretical foundations with practical implementations in programming languages and verification tools. Recent publications explore sustainable cloud-edge applications, failure-resilient systems, and dynamic symbolic execution. He actively contributes to open-source projects like JSetL and participates in international solver challenges. No awards are explicitly listed in the provided materials. Amadini’s research group addresses cutting-edge challenges in distributed computing and constraint-based methodologies. Ongoing projects focus on optimizing solver portfolios for real-world computational tasks and advancing string analysis techniques in programming paradigms.