Eirini Kouvela is a Lecturer and Researcher at the Institute of Mathematics & Statistics, part of the University of Applied Sciences Wiener Neustadt. She holds academic qualifications including a BSc, MSc, and a PhD (denoted by her 'Dr.' title). Her work focuses on mathematical and statistical methodologies, with research interests spanning applied mathematics, data analysis, and quantitative problem-solving. Though no specific publications are listed in the provided text, her role suggests involvement in educational and research activities within her department. She is reachable via eirini.kouvela@fhwn.ac.at and located at the main campus in Wiener Neustadt.
Prof. Kalss is a Professor leading the Corporate Law I department at the Vienna University of Economics and Business (WU). His academic focus centers on corporate law, capital markets, and legal commentary on business regulations. He oversees a team of researchers and lecturers, including Dr. Thomas Barth, Sarah Fernbach, and Alexander Leonhartsberger. His work includes editorial roles in major legal commentaries like the Commentary on the Stock Corporation Act and contributions to conferences such as the Vienna Corporate Law Day. Research interests include corporate governance, digitalization in securities law, and practical legal problem-solving through case studies. Notable contributions include analyses of pandemic-era corporate resolutions under the COVID-19 Company Act and foundational work on fiduciary duties in corporate settings. Prof. Kalss collaborates with institutions like the Austrian Blockchain Center and has authored/co-authored over 15 key articles since 2017, focusing on legal frameworks, digital innovation, and corporate strategy. He is reachable at lehrstuhl.kalss@wu.ac.at for inquiries related to teaching and research.
Nicolas Amat is a postdoctoral researcher at the IMDEA Software Institute , specializing in theoretical computer science with a focus on model checking, Presburger arithmetic, and Petri net analysis. PhD in Model Checking from INSA Toulouse / LAAS-CNRS (2020-2023) MSc in MoSIG - HECS from Univ. Grenoble Alpes (2019-2020) Engineering Degree in Computer Science from ENSIMAG - Grenoble (2017-2020) His research explores polyhedral abstraction techniques combined with SMT-based verification to solve reachability problems in Petri nets. He develops tools like SMPT, Reductron, and Octant that implement these methods. Awarded Bronze Medals in the Model Checking Contest (2023, 2022) with 100% confidence recognition in 2022, and received the Persyval-lab Excellence Scholarship (2019). His work has been published in journals like Fundamenta Informaticae , and conferences including VMCAI , Petri Nets , and TACAS .
Todd Wimpfheimer serves as a Professor in the Department of Chemistry and Physics at Salem State University, teaching courses including General Chemistry, Organic Chemistry, and Physical Chemistry from his office in Meier Hall 425C. He is reachable at 978.542.6238 or todd.wimpfheimer@salemstate.edu. His academic foundation includes: B.A. in Chemistry from Colgate University (1987) Ph.D. in Physical Chemistry from UCLA (1992) Professor Wimpfheimer specializes in chemical education innovation, focusing on student-active learning techniques like Guided Inquiry and ConcepTests. His research pioneers microscale laboratory methods to enhance accessibility and environmental sustainability in chemistry education, particularly targeting conceptual barriers in physical chemistry through hands-on, collaborative approaches that transform passive lectures into dynamic learning experiences. His publication trajectory since 2015 reveals a strategic shift toward gamified pedagogy, exemplified by chemistry-themed escape rooms that merge problem-solving challenges with core chemical principles. These immersive activities cultivate teamwork and critical thinking within time-constrained laboratory settings, demonstrating how game mechanics can demystify complex topics like quantum mechanics through applied scenarios such as the Schrödinger's Cat paradox. No major scientific awards (prizes, medals, or fellowships) were documented in the source material. His grant portfolio demonstrates sustained institutional investment in educational transformation: $70,000 Massachusetts Board of Higher Education grant (1999-2000) for campus-wide microscale laboratory conversion Salem State College Teaching and Learning Summer Grants (1999, 2007) totaling $1,750 for active-learning material development $2,400 Vice-President's Fund award (1999-2000) for community lead-paint analysis He has engineered specialized learning environments including microscale chemistry labs and narrative-driven escape rooms, where students apply theoretical knowledge to solve chemistry-based puzzles, effectively bridging abstract concepts with tangible experimental outcomes.
Alessio Mansutti is an Assistant Professor at IMDEA Software Institute, Madrid, where he conducts research in logic and formal methods in computer science. Prior to this, he was a Research Associate in the Automated Verification Group at the University of Oxford. His research focuses on decision procedures for arithmetic theories, separation logic, modal logics, and proof theory. Key areas include Presburger arithmetic with non-linear operations (exponentiation, GCD), quantifier elimination, complexity analysis, and logical expressiveness. He has made significant contributions to the decidability and complexity of extended arithmetic and spatial logics. The recent publications show a strong trend in developing quantifier elimination techniques for linear-exponential and counting extensions of arithmetic, analyzing reachability in separation logic, and designing internal calculi for modal and spatial logics. His work bridges theoretical logic with practical verification and optimization problems. Scientific Awards : None mentioned in the text. Advising and Grants : Alessio Mansutti is currently leading independent research funded by the Madrid Regional Government under the César Nombela grant 2023-T1/COM-29001. There is no mention of formal students or advisees, suggesting he may be early in his independent career. He was previously involved in the ERC project ARiAT (2020–2024) led by Christoph Haase, focusing on advanced reasoning in arithmetic theories. Labs and Teams : He is affiliated with the IMDEA Software Institute and was part of the Automated Verification Group at the University of Oxford. His research is deeply collaborative within the formal methods and logic communities, particularly in decision procedures and logical foundations for program verification.
Wojciech Czerwiński is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research lies at the intersection of automata theory, logic, and computational complexity, with a focus on infinite-state systems such as vector addition systems (VASS) and Petri nets. His research interests include: Automata and logic Infinite-state systems Reachability and separability problems Complexity of computational models Formal verification and concurrency theory His recent work has significantly advanced the understanding of the complexity of reachability in VASS, proving it to be Ackermann-complete. This line of research has been published in top venues including FOCS, STOC, LICS, and CONCUR, where several papers received Best Paper Awards. His publications reflect a strong trend toward resolving long-standing open problems in decidability, complexity, and logical definability in infinite-state models. Scientific awards include: Best Paper Award, CONCUR 2022 Best Paper Award, STOC 2019 He leads an ERC-funded project and is actively recruiting PhD students and post-docs. He organizes the Friday Afternoon Seminar and co-organized the Infinite Automata Workshop (2024). He has also contributed to public understanding of science as an editor and author for the journal Delta from 2013 to 2022. His work involves collaboration with leading researchers such as Sławomir Lasota, Jérôme Leroux, Georg Zetzsche, and others. He has made foundational contributions to problems like bisimilarity, language equivalence, and regular separability in various automata models.
Mahsa Shirmohammadi is a CNRS researcher at Institut de Recherche en Informatique Fondamentale (IRIF) , Université de Paris. Her research focuses on verification, probabilistic models, infinite-state systems, automata theory, and numerical computation. Education : PhD from LSV, ENS de Cachan (France) and ULB (Belgium). Previous Affiliation : Postdoctoral researcher at University of Oxford (UK). Her work addresses stochastic games , timed automata , matrix groups , and algebraic computation . Recent publications analyze strategy complexity, synchronization in decision processes, and parametric algebraic problems. Key collaborators include Stefan Kiefer, Richard Mayr, James Worrell, and Patrick Totzke. Her research has been published in venues like ACM SIGLOG News, ICALP, LICS, and ISSAC. Contact: mahsa@irif.fr , +33 (0)1 57 27 92 29, Office 4017 (Sophie Germain building, Paris).
James Worrell is a Professor of Computer Science at the University of Oxford , with a focus on logic in computer science , linear dynamical systems , and automated verification . He is also a Fellow of Green Templeton College. His research spans theoretical computer science and formal methods , including work on metric temporal logic , probabilistic semantics , and category theory . His publications address decision problems , verification of linear dynamical systems , and automata theory . James has received the EPSRC Established-Career Fellowship for his work in linear dynamical systems verification . His recent papers include polynomial invariants , polyhedral escape problems , and skolem problem solutions . He has advised students such as Mehran Hosseini , Pascale Gourdeau , and Ventsislav Chonev , and teaches courses like Computational Learning Theory and Logic and Proof . His work appears in venues like ICALP , LICS , and SODA .
Marcin Jurdzinski is a Professor at the Department of Computer Science, University of Warwick, with a focus on algorithms, games, automata, and logic. His career spans institutions like the University of Aarhus, University of Paris 7, and UC Berkeley. Research interests include Parity games Stochastic games Timed automata Formal verification Game theory . Recent articles highlight work on parity games, stochastic systems, and timed automata, published in venues like SIAM Journal on Computing, LICS, and CAV. Keywords span Computer Science , Game Theory , and Formal Methods . PhD students mentored include Thejaswini K. S., Michail Fasoulakis, and Ashutosh Trivedi. Funded projects such as Solving Parity Games in Theory and Practice (2017-2021) reflect his research priorities.
Neng-Fa Zhou is a Professor of Computer and Information Science at Brooklyn College and the Graduate Center of the City University of New York (CUNY). He holds a BS from Nanjing University (1984), and MS and PhD from Kyushu University (1988, 1991). Before joining CUNY, he served as an Associate Professor at Kyushu Institute of Technology (1991-1999) and held visiting positions at Yale, Alberta, Tokyo Tech, and Melbourne. Specializes in programming languages, constraint logic programming, and compiler design Developed Picat and B-Prolog languages with constraint-based graphics libraries Contributed to SAT encodings, multi-agent pathfinding, and declarative programming Scientific Awards: Most Practical Paper Award at PADL 2017 Award in ASP Solver Competition for BPSolver (2011)
Heli Hagfors is a Researcher at the Unit of Social Research within the Faculty of Social Sciences at Tampere University. Her work focuses on gambling behaviors, addictive tendencies, and the sociocultural factors influencing risk-taking activities. She is affiliated with the City Centre Campus and reachable via heli.hagfors@tuni.fi. Her research employs longitudinal and mixed-methods approaches, often analyzing population-level data to identify trends in problem gambling, gambling motives, and the interplay between technology and behavioral health. Her research interests center on understanding the root causes of gambling-related harms, including the role of loneliness, escapism, and online communities. She examines how digital platforms (e.g., social media, blockchain) mediate risky behaviors and explores gender differences in gambling attitudes. Her studies often highlight preventive measures and policy implications for public health. Her articles frequently analyze longitudinal datasets spanning decades, revealing shifts in gambling prevalence, motives, and societal attitudes. Key themes include the link between materialism and mental health in gambling problems, the impact of marketing on gambling behavior, and the overlap between gambling and gaming harms. Notable work includes studies on affected others in gambling harm contexts and the sociocultural dynamics of cannabis use motives. Dr. Hagfors has not yet been associated with formal student advisement roles, and her profile lacks mention of scientific awards or grants. Her research consistently emphasizes Finland’s demographic context, leveraging national surveys and register-based investigations to inform evidence-based interventions.
Jérôme Leroux is a Directeur de Recherche (DR CNRS) at the Laboratoire Bordelais de Recherche en Informatique (LaBRI) , affiliated with the University of Bordeaux , France. His research focuses on formal verification of infinite-state systems, vector addition systems, Presburger arithmetic, and acceleration techniques for symbolic computation. Key research themes include: Vector Addition Systems (VASS) and Petri Nets Automata-based representations for Presburger arithmetic Abstract interpretation and CEGAR frameworks Verification of asynchronous distributed systems His recent publications highlight work on acceleration techniques for convex binary relations, serialized digit automata, and regular acceleration methods for number decision diagrams. These contributions are implemented in tools like the Talence Presburger Arithmetic Suite (TAPAS) and the FAST tool for symbolic verification. Scientific awards include a Best Paper Award at TURING'100 . He has advised several Ph.D. students and postdoctoral researchers, including Alexander Heußner and Thibault Hilaire (current Ph.D. candidate). Leroux is actively involved in organizing conferences like MFCS'23 and serving on program committees for venues such as VMCAI'26 .
Eleni Akrida is an Associate Professor in the Department of Computer Science at Durham University and serves as Deputy Executive Dean (Academic Student Experience) in the Faculty of Science. She joined Durham in 2019 after studying Mathematics at Patra, Greece, and Computer Science at Liverpool, UK. Between 2020-2025, she held the role of Director of Undergraduate Studies for Computer Science. Research Focus Her research bridges theoretical computer science and education, with primary interests in: Computer Science Education : Pedagogical frameworks, neurodiversity inclusion, and abstraction skill development Algorithms & Complexity : Temporal networks, graph optimization, and stochastic processes Applied AI : Paraphrase generation/identification using deep learning She leads the Pedagogical Innovations in Computer Science and Algorithms & Complexity research groups. Publication Trends Recent works (2022-2025) demonstrate a dual focus: education research (developing pedagogical frameworks and addressing multi-track programming challenges) and technical innovations (temporal graph algorithms and NLP applications for plagiarism detection). Earlier work (2016-2021) established expertise in temporal network optimization and stochastic graph theory. Grants & Supervision Awarded grants include: CPHC Special Project (2025/26): Exploring Neurodivergent Student Experiences in UK CS Education CPHC Special Project (2022/23): Building a Theoretical CS Commons for hybrid learning She currently supervises postgraduate students Arwa Al saqaabi and Saira Richardson.
Piotr Hofman is an Assistant Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics , University of Warsaw. His research focuses on theoretical computer science, particularly automata theory, formal verification, and computational complexity related to systems with infinite alphabets and data constraints. PhD in Computer Science (2014) from the University of Warsaw under Sławomir Lasota. Postdoc (2013-2014) at University of Bayreuth with Wim Martens. Postdoc (2014-2016) at LSV de Cachan with Stefan Göller. His work explores algorithmic problems in automata over infinite alphabets, including one-counter nets, Petri nets with data, and unambiguous vector addition systems (VASS). Key contributions include decidability results for bisimulation and simulation problems, complexity bounds for equivalence checking, and novel techniques for reachability and coverability analysis. Recent publications address orbit-finite linear equations, Parikh's theorem for infinite alphabets, and lower bounds for coverability in pushdown VAS. He has received grants like NCN UMO-2016/21/D/ST6/01368 for algebraic invariants in data nets. He supervises research projects and collaborates with institutions in Poland, France, and India. His teaching includes concurrency theory and software engineering courses.
Ján Mazák serves as Associate Professor in the Department of Computer Science at the Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava. His office (M 255) is located at Mlynská dolina campus, reachable via phone 02/602 95 224. He maintains an active academic profile with current teaching duties and recent publications. Professor Mazák's research centers on Graph Theory with specialized focus on cubic graphs and snarks. His work investigates structural properties including cycle covers, oddness, resistance, and circumference deficit. This theoretical research bridges combinatorial mathematics and computer science, addressing fundamental problems in graph optimization and structural analysis. His publication record (2015-2022) demonstrates consistent output in top-tier journals like Electronic Journal of Combinatorics and Discrete Applied Mathematics . The research shows thematic continuity in cubic graph analysis, with increasing sophistication from 2015's snark studies to 2022's morphological investigations. Collaborative patterns indicate strong departmental ties with researchers Lukoťka, Mačajová, and Škoviera. No scientific awards are documented in the provided materials. Professor Mazák actively teaches Database Systems and Mathematical Propedeutics courses, maintaining a substantial teaching load with multiple weekly sessions across campus locations. While specific grant funding isn't mentioned, his sustained publication output suggests active research support. Prospective students should note his theoretical research orientation and contact him directly for supervision opportunities. The departmental structure provides standard academic resources, though no dedicated research laboratory is referenced in available information.
