جست‌وجوی استاد و پژوهشگر

Archontia C. Giannopoulouمشاهده پروفایل

دانشیار

• Graph Algorithms
• Structural Graph Theory
• Parameterized Algorithms and Complexity
• +۳ مورد دیگر

Archontia C. Giannopoulou is an Associate Professor at the Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Greece. Her research focuses on Graph Algorithms, Structural Graph Theory, and Parameterized Algorithms and Complexity. She explores advanced topics such as matching minors, tree-cut width, immersion minors, and kernelization. Her work emphasizes algorithmic design and structural graph theory with applications in combinatorial optimization. Giannopoulou’s academic contributions include seminal papers on edge deletion problems, cutwidth obstructions, and polynomial kernelization. Notable publications include studies on bipartite graphs and their structural properties, as well as algorithmic advancements in parameterized complexity. Her research bridges theoretical foundations with practical algorithmic solutions. Her contact information includes an email at archontia.giannopoulou@gmail.com and a postal address at the University of Athens. Her work spans international collaborations, reflected in co-authored articles with leading researchers in the field.

• Graph Theory
• Algorithm Design
• Parameterized Complexity
• +۳ مورد دیگر

Giannopoulou Archontia is an Associate Professor at the Department of Informatics and Telecommunications of the National and Kapodistrian University of Athens. Her research focuses on theoretical informatics, particularly in graph theory, algorithm design, and parameterized complexity. She explores structural properties of graphs and their algorithmic implications, including graph minors, tree decompositions, and kernelization techniques. Her work emphasizes applications of graph searching, perfect matchings, and combinatorial optimization. Recent research trends include studies on flat wall theorems, matching minors in bipartite graphs, and directed tangle tree-decompositions. Her publications reflect contributions to both foundational theory and practical algorithm design in these areas. Giannopoulou has no listed scientific awards in the provided materials. Her advising and grant activities are not detailed here, though her extensive publication history suggests active research involvement. No lab or team affiliations are specified in the text.

• Algorithm Design
• Approximation Algorithms
• Fixed-Parameter Tractability
• +۱ مورد دیگر

Michael Lampis is an Associate Professor at Université Paris Dauphine, specializing in theoretical computer science with a focus on algorithm design, approximation algorithms, and fixed-parameter tractability. His research bridges computational complexity and practical algorithmic solutions for NP-hard problems. His work explores structural graph parameters, approximation schemes, and parameterized complexity, with applications in game theory, social choice, and combinatorial optimization. Research interests include: Design of sub-exponential and parameterized approximation algorithms Fine-grained complexity analysis Algorithmic meta-theorems for graph width parameters Lampis has supervised multiple PhD students and leads research projects funded by ANR and international collaborations. His publications demonstrate consistent focus on bridging theoretical foundations with computational efficiency across diverse domains including voting systems, hedonic games, and network design.

• Theoretical Computer Science
• Algorithms
• Approximation Algorithms
• +۳ مورد دیگر

Kolliopoulos Stavros is a Professor in the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens. His work focuses on theoretical computer science, algorithms, and combinatorial optimization. He has contributed to scheduling theory, network optimization, and approximation algorithms. His research addresses problems like resource allocation, disjoint paths in graphs, and facility location. Key research interests include the design and analysis of algorithms for NP-hard problems, with applications to scheduling, network flow, and operations research. He explores techniques such as linear programming relaxations and greedy algorithms to achieve approximation guarantees. His recent publications (2023–2025) emphasize time-sharing scheduling, linear-time graph algorithms, and IoT resource management. Earlier work (1997–2013) includes foundational contributions to unsplittable flow, facility location, and selfish routing in networks. His work bridges theoretical insights with practical algorithmic solutions. Notably, he has developed FPTAS algorithms for tardiness minimization and established tight bounds for Lovász-Schrijver rank in facility location problems. His research often combines graph theory with optimization principles to solve real-world network and scheduling challenges.

Giorgio Lucarelliمشاهده پروفایل

مدرس

• Algorithms and Complexity
• Approximation and Online Algorithms
• Power-Aware Scheduling
• +۳ مورد دیگر

Giorgio Lucarelli is a Teaching and Research Associate at ENSIMAG, Grenoble Institute of Technology, and a member of the DataMove team at INRIA and LIG. He earned his PhD in Theoretical Computer Science from Athens University of Economics and Business in 2009, preceded by an M.Sc. in Computer Science (2005) and a B.Sc. in Informatics (2003). PhD Advisor: Professor Ioannis Milis Key Research Areas: Algorithms and Complexity, Power-Aware Scheduling, Graph Theory, Online Optimization His work focuses on energy-efficient scheduling in large-scale systems, with applications to heterogeneous architectures , optical networks , and MapReduce jobs . Recent publications explore online scheduling, dual-fitting methods, and geometric constraints in resource allocation. Collaborations span institutions like INRIA , LIG , and University of Illinois . Notable trends in his research include speed-scaling algorithms , non-preemptive scheduling , and primal-dual optimization . While no explicit awards are listed, his contributions to exact and approximation algorithms for problems like max-edge coloring and densest k-subgraph highlight his expertise in combinatorial optimization. As an educator, he teaches modules on Unix , Imperative Programming , Operating Systems , and Algorithm Design at ENSIMAG, and contributes to the MSc in Informatics (MOSIG) at Grenoble.

Parosh Aziz Abdullaمشاهده پروفایل

استاد

• Concurrency
• Distributed Systems
• Program Verification
• +۵ مورد دیگر

Parosh Aziz Abdulla is a Chaired Professor at the Department of Information Technology, Uppsala University, Sweden. He is a prominent researcher in the field of theoretical computer science with a focus on formal methods, concurrency, and program verification. His work bridges theoretical foundations with practical applications in software and hardware verification. Professor Abdulla's primary research interests include Concurrency, Distributed Systems, Program Verification, Model Checking, Automata, and Logic. His work spans both theoretical aspects of computer science and practical verification techniques for concurrent and distributed systems. He has made significant contributions to the understanding of memory models, particularly in the context of modern architectures like x86 with persistent memory. His research has evolved from foundational work on infinite-state systems to practical verification techniques for concurrent programs and string constraints. Professor Abdulla has served on numerous program committees for top-tier conferences including PLDI, POPL, CAV, CONCUR, and TACAS, demonstrating his standing in the research community. He has been PC co-Chair for TACAS'11 and has contributed to many other conferences over the years. As an advisor, Professor Abdulla has supervised numerous PhD students to completion, with graduates working on topics ranging from verification of networks of communicating processes to caches, transactions, and memory models. His students have gone on to successful careers in academia and industry. Professor Abdulla maintains an active research agenda, with recent work focusing on verification of quantum circuits, efficient linearizability monitoring, and verification under Intel-x86 with persistency. His research continues to address fundamental challenges in program verification while adapting to new computing paradigms and hardware architectures.

Ioannis Tollisمشاهده پروفایل

استاد

• Graph Analytics
• Network Visualization
• Data Science
• +۲ مورد دیگر

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.

• Graph Theory
• Parameterized Complexity
• Algorithms
• +۸ مورد دیگر

Dimitris Zoros serves as an External Instructor in the Department of Mathematics at the National and Kapodistrian University of Athens, specializing in theoretical computer science and discrete mathematics with emphasis on graph-theoretic approaches. His academic credentials include: Bachelor's degree in Mathematics from the National and Kapodistrian University of Athens (NKUA) Master's degree in Logic, Algorithms and Computation from MPLA (NKUA Graduate Program) PhD in Logic and Algorithms from NKUA under Prof. Dimitrios M. Thilikos, thesis titled Obstructions and Algorithms for Graph Layout Problems Dr. Zoros' research integrates combinatorial structures with algorithmic frameworks through multiple interconnected domains: Core focus on Graph Theory and Parameterized Complexity Specialized work in Graph Obstruction Sets and Graph Searching methodologies Theoretical foundations in Computability, Logic, and Set Theory Applications in Discrete Mathematics and Computational Complexity analysis No scientific awards were documented in available sources. Information regarding student supervision, research grants, or laboratory affiliations was not provided in the source materials.

Theodoula N. Grapsaمشاهده پروفایل

دانشیار

• Numerical Analysis
• Optimization Methods
• Systems of Nonlinear Equations
• +۳ مورد دیگر

Theodoula N. Grapsa is an Associate Professor in the Department of Mathematics at the University of Patras, Greece. She is affiliated with the Division of Computational Mathematics and Informatics within the department. Her office is located at B/M 243, and she can be reached at grapsa@math.upatras.gr or theodoula.grapsa@gmail.com. Dr. Grapsa's research focuses on several key areas in computational mathematics: Numerical Analysis and Optimization Methods Systems of Nonlinear Equations Interval Analysis and Global Optimization Neural Networks and Machine Learning Algorithms Computational Mathematics and Numerical Algorithms Her recent work shows a strong emphasis on developing and improving optimization algorithms, particularly for unconstrained optimization problems. She has made significant contributions to Newton's method modifications, conjugate gradient approaches, and hybrid techniques that combine forecasting with optimization. Her research bridges theoretical mathematics with practical computational applications, particularly in the areas of neural network training and solving complex nonlinear systems. Dr. Grapsa has supervised numerous graduate students throughout her career, including PhD candidates and MSc students. Her past PhD students include Dimitris G. Sotiropoulos, John A. Nikas, and Aristotelis E. Kostopoulos. Current PhD students under her supervision are Eleftheria N. Malihoutsaki, Athanasia N. Papanikolaou, and Christina D. Nikolakakou. She has authored two books: "Εισαγωγή στην Ανάλυση Διαστημάτων - Interval Analysis" (2012) "Προγραμματίζοντας με Fortran'90" (2012) Dr. Grapsa is actively involved in teaching, including the course "Basic Principles of Programming," for which she organized an educational visit to the Patras Science Centre in Rio for first-year mathematics students in April 2013.

Charis Papadopoulosمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Graph Algorithms
• +۵ مورد دیگر

Charis Papadopoulos is a Professor at the Department of Mathematics, University of Ioannina, Greece. He holds a PhD in Computer Science (2005) and MSc (2001) from the University of Ioannina, and conducted postdoctoral research at the University of Bergen, Norway (2005-2007). His academic activities include visiting researcher positions at the University of Ioannina (2008-2010) before joining the faculty in 2011. Education: MSc and PhD in Computer Science, University of Ioannina Postdoc: Algorithms Research Group, University of Bergen (2005-2007) His research interests focus on Theoretical Computer Science, particularly: Design and analysis of algorithms Algorithmic graph theory Graph modification problems Width parameters and graph layouts Combinatorial enumeration Algorithm engineering Recent publications address structural parameterization of cluster deletion, subset feedback vertex set problems, avoidable vertex/path enumeration, and connectivity-preserving subgraphs. His work spans both journal publications (e.g., Algorithmica , Theory of Computing Systems ) and conference proceedings (e.g., WALCOM , SODA ). He has served on program committees for major conferences including: CIAC 2025 EuroCG 2025 WADS 2023 WALCOM 2023 Current projects include FANTA (Efficient Algorithms for Network Analysis) funded by H.F.R.I. and Separators and Cut Problems under HFRI grants. He has supervised PhD and Master's dissertations and collaborated with European research institutions.

• Graph Theory
• Parameterized Complexity
• Graph Algorithms
• +۴ مورد دیگر

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.

Mohamed Faouzi Atigمشاهده پروفایل

استاد

• Formal Verification
• Concurrency
• Model Checking
• +۴ مورد دیگر

Mohamed Faouzi Atig is a Professor in Computer Systems at Uppsala University's Department of Information Technology since July 2021, following a progression from Assistant Professor (2014-2018) to Associate Professor (2018-2021). His academic career began with a post-doctoral position at Uppsala University (2010-2012) after earning his PhD from University of Paris Diderot-Paris 7 in 2010, followed by a docent degree (habilitation equivalent) from Uppsala University in 2017. His research focuses on formal verification of concurrent and infinite-state systems, with particular expertise in model checking , weak memory models (including x86-TSO, Release-Acquire), and automata theory applied to string constraints. His work bridges theoretical foundations with practical verification techniques for modern hardware and programming language semantics. Analysis of his publication record reveals a sustained focus on verification challenges in concurrent systems, evolving from foundational work on memory models (2015) to sophisticated techniques for string constraints (2017) and persistent memory (2024-2025). His research demonstrates consistent contributions to top venues like PLDI and POPL, with increasing complexity in handling real-world memory models while maintaining theoretical rigor. At Uppsala University, he has served on program committees for major conferences including POPL, VMCAI, and SPLASH, demonstrating active engagement with the programming languages research community.

Sam Lindleyمشاهده پروفایل

دانشیار

• Programming Languages
• Type Systems
• Effect Handlers
• +۵ مورد دیگر

Sam Lindley is a Reader in Programming Language Design and Implementation at the Laboratory for Foundations of Computer Science within the School of Informatics at The University of Edinburgh. He holds a prestigious UKRI Future Leaders Fellowship focused on Effect Handler Oriented Programming. His academic career spans multiple institutions including Heriot-Watt University and Imperial College London. His research interests center on programming language theory and implementation, with specific expertise in type systems, effect handlers, session types, and functional programming. Lindley's work bridges theoretical foundations with practical implementation, particularly in compiler design and language semantics. His research has significant implications for language safety, efficiency, and expressiveness. Lindley's publication record demonstrates consistent contributions to top programming languages venues including PLDI, POPL, ICFP, and OOPSLA. His recent work explores modal effect types, scoped effects, and the application of effect handlers to systems programming and WebAssembly. The trend shows increasing focus on practical applications of theoretical concepts in real-world language implementations. Major Awards: UKRI Future Leaders Fellowship in Effect Handler Oriented Programming Lindley has served in significant leadership roles including ICFP 2023 Program Chair and PLDI 2025 Area Chair. He actively participates in the programming languages community through numerous program committees and workshop organization. His research is conducted within the Laboratory for Foundations of Computer Science, a leading center for theoretical computer science research at Edinburgh.