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

Thomas Schlumprechtمشاهده پروفایل

استاد

• Functional Analysis
• Banach Spaces
• Probability Theory
• +۳ مورد دیگر

Thomas Schlumprecht is a Professor at the Department of Mathematics, Texas A&M University (College of Arts & Sciences), holding a concurrent adjunct position at the Czech Technical University, Prague. He earned his Ph.D. (1988) and Diplom (1982) from Ludwig-Maximilians-Universität, München. His research focuses on Functional Analysis, Banach spaces, Probability Theory, Convex Geometry, and Mathematics in Finance. He has held various roles at Texas A&M since 1992, including Associate Head for Graduate Studies (2001–2005) and Professor since 1999. Schlumprecht’s work includes editorial roles for the Journal of Functional Analysis and Banach Journal of Mathematical Analysis . His teaching contributions span courses like Functional Analysis and Infinite Combinatorics. Recent research emphasizes metric embeddings, operator theory, and geometric functional analysis. Education: Ph.D. in Mathematics, Ludwig-Maximilians-Universität, München (1988) Diplom (M.Sc.), Mathematics, Ludwig-Maximilians-Universität, München (1982) Research Highlights: Advances in Banach space geometry and asymptotic properties Studies on metric embeddings and coarse rigidity Investigations into operator ideals and closed ideals in Banach algebras His recent publications explore topics such as greedy algorithms, transportation cost spaces, and stochastic embeddings, reflecting a deep engagement with both theoretical and applied aspects of functional analysis.

• Combinatorics
• Combinatorial Design
• Latin Squares
• +۵ مورد دیگر

Ian Wanless is a Research Professor at the School of Mathematics, Monash University. He specializes in combinatorics, with a focus on Latin squares, graph theory, and matrix permanents. His work bridges theoretical mathematics and applications in information technology, such as coding and experimental design. Wanless leads collaborative projects funded by the Australian Research Council, including studies on combinatorial structures and hypergraph matchings. He has authored over 120 peer-reviewed articles, with recent work addressing quantum states, Latin square properties, and quasigroup isomorphisms. Key Awards: Australian Mathematical Society 2009 Medal Collaborations: Global partnerships with institutions in the US, Europe, and Asia His research emphasizes universal solutions to combinatorial puzzles, such as Sudoku and the four-color theorem, while prioritizing theoretical rigor over direct applications.

• Automata Theory
• Concurrency Theory
• Formal Verification
• +۱ مورد دیگر

Slawek Lasota is a Professor at the Automata Theory Group within the Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research focuses on automata theory, concurrency theory, formal verification, and systems biology, with a strong emphasis on computational complexity and algorithmic analysis of systems with infinite-state spaces. Research Interests : Automata theory (infinite alphabets, nominal sets), concurrency theory (timed automata, vector addition systems), formal verification (reachability problems, model checking), systems biology (computational models of biological systems). Grants : Coordinator of NCN grants on data-enriched models and automatic analysis of concurrent systems; participant in ERC projects Lipa and FOX . Community Service : Managing editor of Fundamenta Informaticae (2018-), member of EATCS Council (2019-), and Rada Doskonalosci Naukowej (2019-). His work has received recognition including the STOC'19 Best Paper Award and EATCS BEST ETAPS PAPER AWARD . He supervises PhD students in topics ranging from Petri nets to timed automata and has contributed extensively to advancing verification techniques for systems with data, timed models, and concurrency.

Ecaterina Sava-Hussمشاهده پروفایل

استاد

• Stochastic Processes
• Probability Theory
• Random Walks
• +۵ مورد دیگر

Ecaterina Sava-Huss is a Full Professor in Mathematics at the University of Innsbruck, Austria, affiliated with the Department of Mathematics within the Faculty of Mathematics, Computer Science and Physics. She holds a PhD from Graz University of Technology (2010) and a Habilitation in Mathematics (2019). Previously, she served as an associate professor and tenure-track assistant professor at the University of Innsbruck, and as an assistant professor and visiting scholar at institutions including TU Graz and Cornell University. Her research focuses on stochastic processes, particularly random walks and rotor walks on graphs, fractals, and aggregation models. Key interests include the interplay between structural properties of infinite state spaces and stochastic processes. She has organized conferences such as the Austrian Stochastics Days and is the outreach coordinator for the Institute of Mathematics, engaging in public science initiatives like the MIP Day and Girls' Day. Her funding includes an FWF Grant P34129 (2021–2025) on growth models and quasi-random walks, and a prior Erwin Schrödinger Fellowship (2015–2016). She has supervised numerous PhD and Master’s students, with research topics ranging from branching processes to quantum probability. Her work has been published in journals such as Advances in Applied Probability , Bernoulli , and Journal of Fractal Geometry .

Tim Seppeltمشاهده پروفایل

پژوهشگر

• Graph Theory
• Theoretical Computer Science
• Algorithmic Complexity
• +۳ مورد دیگر

Dr. Tim Seppelt is a postdoctoral researcher at the IT University of Copenhagen , working under the mentorship of Prof. Radu Curticapean. Previously, he earned his PhD from RWTH Aachen University with supervisors Prof. Martin Grohe and Prof. Michael Schaub. His research focuses on theoretical computer science, specifically homomorphism indistinguishability , a framework connecting graph isomorphism, quantum information, and logical equivalences. Current Role: Postdoc in Theoretical Computer Science, ITU Education: PhD in Computer Science, RWTH Aachen University Tim's work addresses algorithmic meta-theorems for homomorphism indistinguishability over minor-closed and treewidth-bounded graph classes. He has extended Lovász-type results to CMSO2 logic, resolved complexity conjectures for the Lasserre hierarchy, and classified quantum group-induced indistinguishability relations. His research spans quantum computing , graph algorithms , and descriptive complexity , often intersecting with applications in machine learning and finite model theory. Recent publications include a 2025 paper on quantum group-driven homomorphism indistinguishability and a 2024 journal article on logical equivalences and forbidden minors. He presented at workshops like the Graph Learning Meets TCS (Simons Institute, 2025) and delivered tutorials on finite model theory at Finite and Algorithmic Model Theory 2025 (Les Houches, France).

Adolfo Pipernoمشاهده پروفایل

دانشیار

• Formal Methods
• Functional Programming
• Lambda Calculus
• +۳ مورد دیگر

Adolfo Piperno is an Associate Professor in the Department of Computer Science at Sapienza University of Rome. He has been serving as Assistant Professor since 1991 (K05B) and was promoted to Associate Professor in 1998 (INF/01). His teaching responsibilities for Academic Year 2024-25 include Models of Computation (Master Degree), Mathematical Methods for Computer Science, and General IT/C programming courses. Professor Piperno's research focuses on formal methods in computer science, with particular expertise in functional programming, lambda calculus, type theory, and graph algorithms. His current research centers on practical aspects of graph isomorphism, which aligns with his involvement in the development of nauty and Traces - programs for computing automorphism groups of graphs and producing canonical labels. His publication record demonstrates expertise across theoretical computer science, particularly in areas related to formal verification and graph theory. His work shows a consistent focus on foundational aspects of computation and practical algorithmic approaches to complex problems in graph theory. Professor Piperno holds a Degree in Mathematics (1986) and a PhD in Computer Engineering (1991, 3rd cycle). His office is located in the Department of Computer Science, Viale Regina Elena, 295 (Building E), 3rd floor, room 306, with office hours available by appointment.

Patrick Basمشاهده پروفایل

استاد پژوهشی

• Steganography
• Steganalysis
• Digital Watermarking
• +۲ مورد دیگر

Patrick Bas serves as Research Director and Thematic Group Facilitator for the Data Intelligence Group (DatInG) at the University of Lille, France, where he leads the Signal and Images team within the CRISTAL laboratory. His office is located at ESPRIT in Lille's Scientific City, and he holds membership on the institution's Scientific Council. Bas earned his Electrical Engineering degree (1997) and Ph.D. in Signal and Image Processing (2000) from the Institut National Polytechnique de Grenoble. His academic journey includes postdoctoral work at Université Catholique de Louvain, CNRS research at Gipsa-Lab (2001-2009), and a visiting position at Helsinki University of Technology (2005-2008). His primary research centers on steganography, steganalysis, and digital watermarking, with significant contributions to image manipulation detection and neural network applications in multimedia security. He has organized major initiatives including the BOSS steganalysis contest (2010) and served as co-coordinator for the Ecrypt European NoE's watermarking virtual lab (2004-2008). While his Google Scholar profile indicates recent publications in graph theory and combinatorics (2021-2025), these appear inconsistent with his documented research focus on multimedia security as evidenced by his thesis supervision and professional activities. Bas has supervised seven doctoral theses including Rony Abecidan's work on robust image manipulation detection (2024) and Solène Bernard's research on neural network steganography (2021). He has held editorial roles for the Eurasip Journal on Information Security (since 2011) and IEEE Transactions on Information Forensics and Security (2013-2016), and co-organized the International Workshop on Information Hiding (IH07).

• Molecular Biology
• Neurobiology
• Machine Learning
• +۲ مورد دیگر

Prof. Frank Müller is a Universitätsprofessor at Forschungszentrum Jülich GmbH , leading the Molecular Sensory and Neurobiology research group. His work bridges computational methods and biological systems. Research focuses on: Graph-based machine learning for biological networks Transformer architectures for molecular data Computational approaches to sensory neuroscience Parameter-efficient models for multi-task learning Key article trends show expertise in graph transformers , molecular foundation models , and multi-agent reasoning systems . No awards explicitly mentioned. Current affiliation: IBI (Institute of Biological Information Processing), Forschungszentrum Jülich

Saket Saurabhمشاهده پروفایل

استاد

• Parameterized Complexity
• Exact Exponential Algorithms
• Graph Theory
• +۵ مورد دیگر

Saket Saurabh is a Professor at the Institute of Mathematical Sciences (IMSc), Chennai, India, and an Adjunct Faculty at the University of Bergen, Norway. He holds a PhD in Theoretical Computer Science (TCS) from IMSc (2008). His research focuses on Parameterized Complexity, Exact Exponential Algorithms, Graph Theory, Algorithmic Game Theory, and Theoretical Foundations of Machine Learning. Before joining IMSc, he held postdoctoral positions at the University of Bergen (2007–2009) and was a Research Assistant there (2006–2007). He teaches advanced courses such as Parameterized Complexity, Kernelization, and Algorithms for Big Data. His work emphasizes developing efficient algorithms for NP-hard problems through techniques like kernelization and fixed-parameter tractability. His publications primarily address graph algorithms, parameterized complexity, and algorithm design, with contributions to meta-kernelization frameworks, representative families, and lower bounds for clique-width parameterizations. Notable collaborations include seminal work on graph isomorphism for bounded treewidth graphs and the fixed-parameter tractability of minimum bisection.

Andrzej Dudekمشاهده پروفایل

استاد

• Extremal combinatorics
• Probabilistic combinatorics
• Random graph theory
• +۳ مورد دیگر

Andrzej Dudek is Professor of Mathematics at Western Michigan University, specializing in extremal and probabilistic combinatorics. His research examines Ramsey theory, random graphs, hypergraph problems, and combinatorial optimization through mathematical analysis. Funded by multiple Simons Foundation and NSA grants, he investigates threshold behaviors in generalized Ramsey numbers and structure emergence in random ordered graphs. His publications demonstrate consistent focus on bridging extremal combinatorics with probabilistic methods. Recent work establishes new bounds for Erdős-Gyárfás problems, analyzes Hamiltonian cycles in Dirac graphs, and characterizes unavoidable substructures in random matchings. Collaborative projects frequently address Ramsey-type questions at linear and quadratic thresholds. Supervised four PhD dissertations in combinatorics. Education includes PhD from Emory University (2008) and habilitation from Adam Mickiewicz University (2013). Recognitions include the Open Mind Prize (2010) and solution prize for an Erdős problem (2008). Organizes the Lake Michigan Workshop on Combinatorics and Graph Theory with NSF support.

• Computational Social Science
• Data Science
• Multivariate Social Networks
• +۱۰ مورد دیگر

Termeh Shafie is a full-time Professor in the Department of Politics and Public Administration at the University of Konstanz, specializing in Computational Social Science and Data Science. With a strong statistical foundation, she develops advanced methodologies for analyzing multivariate social networks while bridging archaeological network reconstruction with modern data science techniques through projects like NEXUS 1492. Key Research Areas: Multigraph modeling, network entropy analysis, isotope geoprovenance, and hypergraph representations Projects: NEXUS 1492 archaeological network reconstruction Her 15 most recent publications demonstrate significant contributions to network methodology (random multigraph models, centrality index analysis), archaeological applications (Caribbean attack networks, Iroquoian settlement patterns), and data privacy frameworks. Articles span 2012–2025 with interdisciplinary focus on statistical sociology, archaeological theory, and computational modeling. Current teaching includes courses on social network analysis, data science, and statistical learning. Office hours available via ILIAS booking system. Contact details provided for both academic and administrative correspondence.

• Algebra
• Representation Theory
• Semigroup Theory
• +۳ مورد دیگر

Marianne Johnson is a Senior Lecturer in the School of Mathematics at the University of Manchester. She is a core member of the tropical mathematics research group and collaborates with institutions including Birmingham, Queen Mary University of London, and Warwick through an LMS Joint Research Network. Her research focuses on algebra and combinatorics, including free Lie algebras, representation theory, semigroup theory, and tropical algebra/geometry. She has contributed to EPSRC-funded projects such as 'Multiplicative Structure of Tropical Matrix Algebra' and 'Modular Lie Powers and Applications,' and participated in the CICADA interdisciplinary project. Her research interests span a wide array of algebraic topics: free Lie algebras explore the structure of non-associative algebras, while representation theory examines how algebraic structures act on vector spaces. Semigroup theory and tropical algebra involve studying combinatorial and geometric properties of matrices and monoids over semirings. Recent work includes studies on plactic-like monoids, tropical matrix identities, and linear functions preserving Green's relations. Johnson has co-authored over 29 publications, with recent trends emphasizing tropical algebra's applications to geometric and algorithmic problems, such as tropical matrix groups and hyperplane arrangements. Her work bridges pure mathematics with interdisciplinary fields like computational dynamics and healthcare through collaborations like CICADA. Notable projects include analyzing upper triangular tropical matrices and exploring NP-completeness in gossip monoids. She has advised three research students and contributed to grants involving EPSRC-funded projects. Her affiliations include the Data Science Institute, Algebra research group, and Tropical Mathematics cluster at Manchester. Her work also intersects with Digital Futures initiatives, reflecting her commitment to advancing computational and theoretical mathematics.

Alice Devillersمشاهده پروفایل

دانشیار

• Group Theory
• Graph Theory
• Combinatorics
• +۴ مورد دیگر

Alice Devillers is an Associate Professor (part-time) in the Department of Mathematics and Statistics at the University of Western Australia (UWA), within the School of Physics, Maths and Computing. She holds a doctorate in science from the Université Libre de Bruxelles (2002) and has held postdoctoral positions at Michigan State University and the Fonds National de la Recherche Scientifique (FNRS) in Belgium. Her research focuses on group theory, graph theory, combinatorics, finite geometry, and Tits' buildings. She is a member of the Centre for the Mathematics of Symmetry and Computation. Dr. Devillers' academic journey includes roles as a Research Fellow with the FNRS (1998–2002), a Belgian American Education Foundation fellow (2002–2003), and a Research Associate at UWA (2008–2011) before becoming a Senior Lecturer in 2011 and Associate Professor in 2022. She has been actively involved in mathematics outreach, particularly with the Western Australian Junior Olympiad (WAJO) and national senior competitions. Her research explores symmetry in combinatorial structures, including automorphism groups of designs and graphs, with a focus on imprimitive actions and transitivity properties. She collaborates internationally, contributing to algebraic combinatorics and finite geometries. She has secured grants, including an ARC project on exceptionally symmetric combinatorial designs (2020–2024) and another on permutation groups and graph symmetry (2013–2017). Teaching responsibilities include first-year mathematics units and a third-year geometry course. Her work balances research, education, and community engagement, reflecting her commitment to advancing mathematical understanding and accessibility.

Heiko Dietrichمشاهده پروفایل

استاد

• Computational Group Theory
• Algebra
• Group Theory
• +۳ مورد دیگر

Heiko Dietrich is a Professor in the School of Mathematics at Monash University and serves as the Associate Dean Graduate Education in the Faculty of Science. His roles include overseeing graduate education, research leadership, and editorial board memberships. He holds a doctoral degree from the University of Braunschweig (2009) and has held positions at institutions including the University of Trento and University of Auckland. Research Interests His research focuses on computational group theory , computational algebra , finite groups , and Lie algebras . He applies computational methods to problems in algebra and has contributed to areas such as Hadamard matrices and classification of quantum states. Recent Research Trends Recent work includes studies on maximal subgroups of the Monster group, coclass theory, and algorithmic approaches to group isomorphism. His publications span theoretical advances and applications in quantum information and combinatorics. Awards: Australian Research Council Discovery Early Career Researcher Award (2013) Cheryl E. Praeger Visiting Research Fellowship (2022) 2019 Victorian Tall Poppy Award Advising & Grants He has supervised over 20 students, including HDR candidates and Master’s researchers. Notable projects include investigations into finite p-groups, computational group theory, and combinatorial identities. He led research initiatives funded by ARC and international collaborations, such as the Computing with Lie groups and algebras project (2019–2023). Labs & Affiliations Editorial roles include Associate Editorships at Mathematische Nachrichten , Journal of Computational Algebra , and Beiträge zur Algebra und Geometrie . He contributes to STEM education through CSIRO’s STEM Professionals in Schools program.

Alfredo Pulvirentiمشاهده پروفایل

استاد

• Bioinformatics
• Biomedicine
• RNA Interference
• +۹ مورد دیگر

Alfredo Pulvirenti is a Full Professor of Computer Science at the University of Catania, Italy. He holds a joint appointment with the Department of Clinical and Experimental Medicine and the Department of Mathematics and Computer Science. Born in 1974, he earned his Laurea (1999, summa cum laude), PhD (2003), and post-doc (2004) in Computer Science from the University of Catania. His academic career includes roles as Assistant Professor (2005-2014), Associate Professor (2014-2023), and Full Professor since 2023. His research bridges Bioinformatics and Biomedicine , focusing on RNA interference (microRNAs, long non-coding RNAs) via stochastic and network-based inference methods. Key contributions include subgraph matching , motif finding , and multiple network alignment using Monte Carlo techniques for analyzing biological networks . He also applies time series analysis to seismic and infrasonic signals through collaborations with Italy's National Institute of Geophysics and Volcanology (INGV). Recent publications highlight advancements in graph algorithms (e.g., MultiGraphMatch, ArcMatch) and systems biology tools like MITHrIL and SPECifIC. He co-directs the Jacob T. Schawartz International School for Scientific Research and leads national/regional projects on Bioinformatics and Big Data in Cancer . His group includes 3 researchers, 1 post-doc, and 3 PhD students in Complex Systems. Awards and Leadership : Best Paper Award at CBS 2009 Guest Editor for BMC Bioinformatics, Briefings in Bioinformatics, Elsevier Program Committee Member for major international conferences International Collaborations span institutions like NYU, Ohio State University Wexner Medical Center, Brown University, Tel Aviv University, Toronto University, and Università di Ancona.