Find Academic Supervisors

Michael A. BekosView profile

Assistant Professor

• Theoretical Computer Science
• Discrete Mathematics
• Algorithms
• +5 more

Michael A. Bekos is an Assistant Professor at the Department of Mathematics, University of Ioannina, Greece. He holds a PhD from the National Technical University of Athens (2009), and M.Sc. and B.Sc. from the University of Ioannina (2004 and 2002 respectively). His research focuses on theoretical computer science and discrete mathematics, particularly algorithms, graph drawing, graph theory, and information visualization. He has served as a postdoctoral fellow at the National Technical University of Athens and the University of Tübingen. Education: B.Sc. in Mathematics, University of Ioannina (1998-2002) M.Sc. in Computational Mathematics and Computer Science, University of Ioannina (2002-2004) Ph.D. in Computer Science and Discrete Mathematics, National Technical University of Athens (2004-2008) Research Interests: Development of algorithms for optimization and combinatorial problems in graph drawing, graph theory, information visualization, and map labeling. He has published extensively in journals and conferences, focusing on areas like planar graphs, queue layouts, and graph embeddings. Grants and Collaborations: Involved in organizing conferences (e.g., GD2023, WG2022) and guest editing special issues in journals like J. Graph Algorithms Appl. Collaborates with researchers globally, including on projects related to graph algorithms and visualization. Labs/Teams: Active in research groups at the University of Ioannina and previously at the University of Tübingen, focusing on advanced algorithmic topics and graph theory.

Ioannis TollisView profile

Professor

• Graph Analytics
• Network Visualization
• Data Science
• +2 more

Dr. Ioannis G. Tollis is Professor of Computer Science at the University of Crete, specializing in graph visualization and algorithms. His research spans graph drawing, network visualization, biomedical data modeling, and information visualization. Awarded IEEE's Young Engineer of the Year (1993) and Outstanding Service Award (1993), he has authored 8 books and 180+ publications with over 8,500 citations (h-index 40). Research focuses on algorithms for graph layouts, including dominance drawings, planar embeddings, and hierarchical visualizations. Applications extend to biomedical networks and large-scale data analytics. Previously head of FORTH's Biomedical Informatics Lab and VP at Tom Sawyer Software, he founded the Journal of Graph Algorithms and Applications.

Tsiaras VasileiosView profile

Teaching Professor

• Machine Learning
• Graph Drawing
• Analysis of Brain Signals
• +3 more

Tsiaras Vasileios is a Teaching Professor in the Department of Electrical and Computer Engineering at the Technical University of Crete. He is currently on leave and based in the School of Electrical and Computer Engineering. His office is located at 141Α-29 in the Science/ECE Building (Λ), 1st Floor. Education: Ph.D. in Computer Science, University of Crete (2009) M.Sc. in Mathematics, Queen Mary and Westfield College, University of London (1992) Undergraduate Degree in Mathematics, Aristotle University of Thessaloniki (1990) Research Interests: His research focuses on Machine Learning , Graph Drawing , Analysis of Brain Signals (including EEG and MEG), and Text-to-Speech Synthesis . These areas integrate computational methods with neuroscience and signal processing to advance artificial intelligence and biomedical applications. Professional Contributions: No specific grants or advising roles are listed in the provided information. His work primarily involves laboratory teaching and research in his stated fields.

• Graph Theory
• Parameterized Complexity
• Graph Algorithms
• +4 more

Dimitrios Zoros holds the position of Lecturer at the Department of Mathematics of the National and Kapodistrian University of Athens (NKUA). His primary affiliations include NKUA and the MPLA (MPLA's formal English name?). He is actively involved in teaching courses such as Recursion Theory and Data Structures. His research focuses on Graph Theory, Parameterized Complexity, and related areas. Education: BSc in Mathematics from NKUA, MSc in Logic, Algorithms, and Computation from MPLA, and a PhD in Logic and Algorithms from NKUA under Prof. Dimitrios M. Thilikos. Research Interests: Graph Obstruction Sets, Graph Searching, Parameterized Complexity, Computability, Algorithms, Logic/Set Theory, and Discrete Mathematics. His work contributes to theoretical foundations of algorithms and graph theory applications.

Ranjit JhalaView profile

Professor

• Programming Languages
• Formal Verification
• Software Engineering
• +3 more

Ranjit Jhala is a Professor of Computer Science Engineering in the Jacobs School of Engineering at the University of California, San Diego. His research focuses on building reliable computer systems through programming languages and software engineering techniques. His primary research interests include Programming Languages, Formal Verification, and Software Engineering. He draws from and contributes to areas such as Type Systems, Model Checking, Program Analysis, and Automated Deduction, bridging theoretical foundations with practical implementations for real-world software development. Prof. Jhala's publication record shows a consistent trajectory in refinement type systems, evolving from Liquid Haskell to Flux for Rust, while also exploring neurosymbolic approaches to error repair and type error diagnosis. His work demonstrates a commitment to making formal verification techniques accessible to practitioners. He leads the Programming Systems Group at UCSD, mentoring graduate students and collaborating with researchers across the programming languages community. His service includes General Chair roles for POPL 2018 and PLDI 2022, reflecting his leadership position in the field. Prof. Jhala is also known for his mentoring activities, including talks on academic presentation skills and participation in ICFP's mentoring programs for students and early-career researchers.