Apostolos Papadopoulos is an Associate Professor at the Department of Informatics , Aristotle University of Thessaloniki , Greece. His research focuses on databases, data mining, and big data analytics. Born in Eleftheroupolis, Greece Diploma in Computer Engineering and Informatics (University of Patras) PhD in Informatics (Aristotle University of Thessaloniki) Research Interests: Spanning DATABASES and DATA MINING , his work includes: Efficient query processing in multidimensional and spatio-temporal databases Graph mining algorithms (dense subgraphs, frequent patterns, probabilistic graphs) Parallel/distributed systems (Spark, Hadoop) for massive datasets Real-time data stream analysis Scientific Recognition: Best Paper at EDBT 2014 (selected for ACM Transactions on Database Systems) Best Knowledge Discovery Paper at ECML/PKDD 2008 Google Scholar h-index: 25 PhD Supervision: Mentoring 4 ongoing PhD students and one graduated candidate (Eleftherios Tiakas).
Arthur Azevedo de Amorim is an Assistant Professor in the Department of Computer Science at the Rochester Institute of Technology's College of Computing. His research focuses on making software more secure and reliable using techniques based on formal verification, programming languages, and type systems. Previously, he held postdoctoral positions at Boston University and Carnegie Mellon University after completing his Ph.D. at the University of Pennsylvania under Benjamin Pierce and co-advised by Cătălin Hrițcu. His educational background includes undergraduate studies in computer science and engineering at Unicamp and Polytechnique. He is also one of the authors of Software Foundations, an introductory textbook to the Coq proof assistant, and maintains an active blog about Coq. Dr. de Amorim's research spans several critical areas in programming languages and security. His work on cryptographic protocols leverages recent advances in program verification (particularly separation logic) to verify cryptographic protocols. His research on compartmentalization analyzes formal guarantees of techniques for limiting the scope of vulnerabilities in low-level languages like C and C++. These research areas reflect his commitment to bridging theoretical foundations with practical security applications. His recent publications demonstrate strong activity across multiple top-tier conferences including POPL, PLDI, CCS, and ICALP, with research spanning formal verification, secure compilation, differential privacy, and programming language theory. His work consistently combines theoretical rigor with practical applications in security and reliability. Dr. de Amorim has served on numerous program committees for major programming languages conferences including POPL, PLDI, ICFP, and CoqPL, demonstrating his active engagement with the research community. He has also contributed to important educational resources through his work on Software Foundations. He currently advises several graduate students at RIT working on various aspects of programming languages and security. His lab develops multiple open-source software projects including Cryptis (for verifying cryptographic protocols), Deriving (a Coq library for automating class instances), and Extructures (a Coq library of finite data structures).
Panagiotis Stamatopoulos is an Assistant Professor at the Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, where he has been employed since 1993. He holds a PhD in Computer Science (1988) and a Diploma in Physics (1982) from the University of Athens. His research spans artificial intelligence, constraint programming, natural language processing, machine learning, and optimization. Specific interests include: Hybrid approaches combining constraint programming with operations research Natural language understanding for database access Parallel processing and distributed constraint solving Multi-agent systems and web intelligence applications His publications show consistent focus on constraint satisfaction algorithms, text summarization techniques, educational timetabling systems, and AI applications in diverse domains like sports analytics and robotics. Recent works demonstrate increased attention to NLP evaluation metrics and multimodal learning. He has supervised numerous diploma theses and led projects funded by the European Union (EDS, APPLAUSE, PARACHUTE, PARROT), University of Athens, and Olympic Airways. Stamatopoulos teaches undergraduate courses in Introduction to Programming and Logic Programming, plus postgraduate courses in Advanced Artificial Intelligence. He previously taught Artificial Intelligence, System Programming, and Expert Systems.
Georgia Koloniari is an Associate Professor at the Department of Applied Informatics, School of Information Sciences, University of Macedonia. She holds a PhD in Computer Science from the University of Ioannina (2009), along with an MSc (2003) and BSc (2001) in Computer Science from the same institution. Her research focuses on distributed systems, graph databases, and peer-to-peer (P2P) systems, with notable contributions to social network analysis, XML data management, and privacy-preserving techniques. She has led or participated in multiple funded research projects, including the Cloud9 project (2011–2014) and the Self-Peer initiative (2005–2008). Her teaching roles include instructing courses such as Distributed Systems , Data Structures , and Advanced Information Systems at the undergraduate level, and IT Infrastructure and Databases at the graduate level. She has also contributed to online educational initiatives, including the development of the Data Structures course in the Open Digital Courses project. Dr. Koloniari’s research interests span social network evolution, graph database management, and distributed data processing. She has published extensively on topics like clustered overlay networks, privacy-preserving record linkage, and temporal query processing. Her work integrates game-theoretic approaches and algorithmic solutions to address challenges in P2P systems and cloud computing. Her recent publications highlight advancements in privacy-preserving techniques (e.g., PRIVATEER toolkit) and time-aware social search systems. She remains active in academic service, serving on program committees for conferences like WWW and EDBT, and reviewing for journals such as IEEE Transactions on Parallel and Distributed Systems. Labs/Teams: Her involvement with the DMOD Lab (Digital Media, Data Management, and Distributed Systems Lab) reflects her focus on interdisciplinary research in data management and distributed computing.
Evangelos Bartzos is a researcher affiliated with the ΕρΓΑ Lab , a collaborative unit under the AROMATH team (joint with INRIA Sophia-Antipolis ) and the ATHENA Research Center . He earned his PhD in Telecommunications and Informatics from the National and Kapodistrian University of Athens under Prof. Ioannis Z. Emiris, as part of the ARCADES Marie Skłodowska-Curie Innovative Training Network . Education: PhD in Telecommunications and Informatics (University of Athens) His research focuses on algebraic modeling , graph rigidity theory , and distance geometry . His work investigates the maximal number of graph embeddings under length constraints in Euclidean spaces and spheres, leveraging real and complex algebraic geometry to bridge theoretical bounds and practical applications in computational mathematics. The 13 publications in his profile span 2015–2023 and reveal a trajectory from early computational biology modeling to advanced rigidity theory research. Key trends include the use of multi-homogeneous Bézout bounds, hypergraph orientations, and algebraic systems to analyze minimally rigid graphs and their realizations across dimensions. Evangelos has participated in numerous conferences and workshops including ISSAC , CASC , and the French Computational Geometry Days , presenting results on rigidity bounds and geometric constraint systems. His collaborations extend to institutions in France (ENS Lyon, Université Lyon 1), Austria, and Russia, particularly through the HEVEA project’s isometric reduction research.
Spyros Sioutas is a Professor at the University of Patras, Division of Computer Software, Department of Computer Engineering and Informatics. His research focuses on multidimensional data structures, decentralized big data management, spatio-temporal databases, distributed systems for cloud computing, and machine learning. His recent publications highlight trends in IoT systems, federated learning, TinyML, and NoSQL database optimization. Key areas include LoRa-based data transmission, graph embeddings for fraud detection, and energy-efficient distributed algorithms. He contributes to the academic community through leadership in the Division of Computer Software and collaboration with research labs such as the Database Laboratory and High-Performance Information Systems Laboratory at the University of Patras.
Kavvadias Dimitris is an Assistant Professor in the Department of Mathematics at the University of Patras, specializing in Computational Mathematics and Informatics. His academic journey includes a B.Sc. in Electrical and Computer Engineering from the National Technical University of Athens (1983), M.Sc. in Computer Science from Columbia University (1984), and a Ph.D. in Computer Engineering & Informatics from the University of Patras (1989). He has been affiliated with the University of Patras since 1992, initially as a Lecturer and then as an Assistant Professor since 1997. His research focuses on Algorithms and Complexity, Graph Theory and Applications, Computer Networks, and Scientific Computing. He has contributed to numerous research projects, including studies on parallel algorithms, network reliability, and data mining. His work spans theoretical computer science and practical applications, with a strong emphasis on algorithm design and computational methods. Kavvadias has taught extensively at both undergraduate and postgraduate levels, covering courses such as Discrete Mathematics, Operating Systems, and Algorithm Analysis. He has supervised doctoral theses and diploma projects, including those of H. Staurovoulos and Angeliki Panagopoulou. His involvement in academic organizations includes roles in the ACM, EATCS, and the Hellenic Open University. His publications reflect expertise in hypergraph algorithms, transversal generation, and numerical root finding, with contributions to journals like SIAM and theoretical computer science forums. He has also participated in international conferences and served as a referee for prominent journals and events.
Raptopoulos Christoforos is an Assistant Professor at the Department of Mathematics of the University of Patras , Greece. His academic qualifications include a Ph.D. (2009), M.Sc. (2005), and B.Sc. (2002) in Computer Engineering & Informatics from the same university. His research focuses on Random Graphs , Design of Algorithms , and Evolutionary Dynamics on Networks , with applications spanning computer science, probability theory, and computational biology. Key contributions include work on temporal graph algorithms, network majority determination, and evolutionary processes on graphs. His teaching portfolio covers Discrete Mathematics , Numerical Solutions of Ordinary Differential Equations , and Data Structures at the undergraduate level, alongside Algorithm Analysis and Data Structures for the MSc in Computational and Analytical Statistics in Data Science. While no specific scientific awards are listed, his 35+ publications since 2004 in journals like Theoretical Computer Science and Journal of Computer and System Sciences highlight his prolific output. He has collaborated extensively with Paul Spirakis, Sotiris Nikoletseas, and George Mertzios.
Loukas Georgiadis is a Professor at the Department of Computer Science & Engineering, University of Ioannina, Greece. He has held previous academic positions including Assistant Professor at the University of Western Macedonia (2008-2011) and visiting roles at LUISS, Italy (2023-2024) and Università di Roma Tor Vergata (2016). His research focuses on design and analysis of algorithms , graph algorithms , combinatorial optimization , and computational geometry . Education includes a B.Sc. from the University of Patras (1999), M.A. and Ph.D. in Computer Science from Princeton University (2002, 2005). Professional experience includes roles at HP Laboratories (2007-2008) and the University of Aarhus (2005-2006). His recent work emphasizes faster algorithms for graph connectivity , fault-tolerant systems , and experimental algorithm analysis . He co-organized the 14th International Conference on Algorithms and Complexity (CIAC 2025) in Rome. Research trends include advancing linear-time algorithms for graph decomposition and exploring dynamic graph properties like dominators and low-high orders. Grants and advising details are not explicitly stated, but his visiting professorships and conference organizing roles highlight active collaborations. His research lab focuses on theoretical and applied aspects of algorithm design, with contributions to both foundational theory and practical implementations.
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.
Evangelos F. Magirou is a Professor of Operations Research at the Department of Informatics of Athens University of Economics and Business (AUEB). He holds a BS in Electrical Engineering from Princeton University (1971), an MSc in Decision and Control Sciences from Harvard University (1972), and a Ph.D. in Decision and Control Sciences from Harvard (1976). His research focuses on theoretical and applied Operations Research, with specializations in Finance, Shipping, and Energy Policy. He has held significant administrative roles, including Deputy Chairman of the Department of Informatics at AUEB and Chairman of the Hellenic Procurement Institute (1994–1997). Education: BS in Electrical Engineering, Princeton University (1971) MSc in Decision and Control Sciences, Harvard University (1972) Ph.D. in Decision and Control Sciences, Harvard University (1976) Research Interests: Operations Research applications in Finance, Shipping, and Energy Policy Optimization, Game Theory, and Decision Theory Algorithm design and dynamic optimization Recent Publications Trends: Magirou’s work spans theoretical contributions to graph theory, kernel enumeration, and default logic, alongside applied research in shipping logistics, energy policy, and financial modeling. His 2000s publications emphasize computational finance and policy iteration methods, reflecting a shift toward quantitative finance and algorithmic innovation. Awards and Grants: No specific awards are listed, but his extensive involvement in energy policy research and industry partnerships (e.g., Public Power Corporation) highlights impactful applied work. Teaching and Advising: He teaches courses in mathematics of finance, operations research, and algorithms. His academic leadership includes directing the MSc Program in Business Mathematics (jointly with the University of Athens). Labs/Teams: Collaborates with the Center for Economic Research at AUEB and has contributed to shipping industry studies through collaborative projects with industry experts.
Panagiotis Liakos is a Researcher at the University of Athens (Department of Informatics and Telecommunications), specializing in graph mining for large-scale networks. He holds a Ph.D. in Distributed and Streaming Graph Processing (2015-2018), an M.Sc. in Computer Systems Technology (2008-2011), and a Ptychion in Informatics and Telecommunications (2004-2008), all from the University of Athens. His research focuses on developing scalable algorithms for graph processing, compression, and community detection in dynamic networks. Research interests include: Graph mining : Community detection, temporal graph analysis Large-scale systems : Distributed processing, cloud-based solutions Data optimization : Lossless compression, storage efficiency Stream processing : Real-time network analysis, dynamic algorithms His publications demonstrate strong focus on graph algorithms and data efficiency, with recent work on time-series compression (Chimp, Sim-Piece) and temporal graph processing. He has received multiple awards including: IEEE Big Data Travel Grants (2016, 2017) SIGIR Travel Grant (2016) WSDM Data Challenge 1st Place (2013) Greek State Scholarship (2006-2007) He has supervised 9 Master's students on topics spanning recommendation systems, MongoDB optimization, sports analytics, and traffic modeling. Contributed to European projects including GALENA, Interact, EarthServer, iMarine, and PERNASVIP. Leads the Hive Server project for distributed services and teaches Large Scale Data Management .
Nikolaos M. Missirlis is a Professor at the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens (NKUA) since 1995. He earned his BSc in Applied Mathematics from the University of Ioannina, Greece in 1974 and his PhD in Numerical Analysis from Loughborough University of Technology, UK in 1978. He has held visiting positions at Rutgers University (1986-1987), Cyprus University (2006-2008), and SUNY Stony Brook (2013). His research focuses on Scientific Computing , particularly parallel solution of Partial Differential Equations and load balancing algorithms. His work bridges theoretical mathematics with high-performance computing applications in meteorology and fluid dynamics. His publications demonstrate consistent output in parallel algorithms and numerical methods, with recent work emphasizing GPU acceleration and diffusion-based load balancing techniques. Research trends show evolution from foundational iterative methods to applications in heterogeneous computing environments. Teaching activities include undergraduate courses: Numerical Analysis Numerical Linear Algebra Algorithms and Complexity Introduction to Programming Data Structures Graduate courses: Scientific Computing (Numerical Solution of PDEs) Parallel Algorithms He has advised five PhD students and led major projects including: PYTHAGORAS (Distributed iterative methods for weather prediction) SKIRON (Parallelization of Eta model for Hellenic Meteorology Service) Princeton Ocean Model parallelization Contact: nmis@di.uoa.gr | +30 210 7275103 | Department of Informatics and Telecommunications, NKUA, Panepistimiopolis 157 84, Athens, Greece.
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.
Panos Rondogiannis is a Professor in the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens, focusing on Theoretical Informatics. His research spans logic programming semantics, fixpoint theory, and non-monotonic reasoning with contributions to higher-order constructs and formal frameworks for preference representation. His research interests include logic programming semantics, fixpoint theory, non-monotonic reasoning, and the application of higher-order constructs in programming. He explores many-valued logics for preference representation and has contributed to game-theoretic and categorical approaches in formal semantics. Rondogiannis’s recent work (2020–2024) addresses recursive functions in TensorFlow, non-monotonic fixpoint theories, and stable model semantics for higher-order logic programs. Earlier contributions (2017–2019) include advancements in approximation fixpoint theory, extensional semantics for logic programs, and the expressive power of higher-order datalog systems. No scientific awards mentioned. No advising or grant information provided in the available texts. No specific labs or collaborative teams are detailed in the provided information.
