Find Academic Supervisors

Kazuo IwamaView profile

Professor

• Stable Matchings
• Boolean Satisfiability
• Auction algorithms
• +13 more

Kazuo Iwama is a Professor at the School of Informatics, Kyoto University, where he has been employed since 1997. He previously served as a Professor at Kyushu University's Department of Information Science (1992–1997) and held various academic positions, including Associate Professor and Visiting Associate Professor, at institutions such as Kyoto Sangyo University and UC Berkeley's Computer Science Division. Education Ph.D., Electrical Engineering, Kyoto University (1980) M.E., Electrical Engineering, Kyoto University (1975) B.E., Electrical Engineering, Kyoto University (1980) His research spans theoretical computer science, with a focus on algorithms, computational complexity, and quantum computing. Key areas include stable matchings, approximation algorithms, Boolean satisfiability, and quantum network coding. Scientific Awards 2008 Honorary Doctorate from University of Latvia 2005 Member, Science Council of Japan

Bastiaan BloemView profile

Professor

• Movement Disorders
• Parkinson's Disease
• Gait and Balance
• +2 more

Bastiaan Bloem is Professor of Movement Disorder Neurology at Radboud University Medical Center's Department of Neurology in Nijmegen, The Netherlands. He serves as Secretary-elect of the International Parkinson and Movement Disorder Society and member of the Michael J Fox Foundation's Executive Advisory Board. Founder of both the Parkinson Centre Nijmegen (ParC) and nationwide ParkinsonNet healthcare network, his work integrates clinical practice with systemic innovation. Education: Medical Degree, Leiden University Medical Centre (1993, with honors) PhD (1994) Movement Disorders Fellowship, The Parkinson's Institute, California Clinical Fellowship, MRC Human Movement Unit, Queen Square, London (2000-2001) His research centers on cerebral compensatory mechanisms for gait/balance in Parkinson's disease and healthcare innovation for patient-centered collaborative care. The ParkinsonNet model—connecting 70 Dutch professional networks—demonstrates evidence-based quality improvement with significant cost reduction. He emphasizes clinical observations in single patients as valuable research contributions. With over 675 publications (510+ peer-reviewed), his scholarly output reveals consistent focus on movement disorder mechanisms and care delivery systems. Key trends include freezing of gait pathophysiology, cerebral compensation strategies, and scalable healthcare innovations. His work bridges clinical neurology, rehabilitation science, and health policy with exceptional translational impact. Scientific Awards: Hippocrates Prize (1992) National Healthcare Hero (2011) Citizen of Year for Nijmegen (2012) Value Based Health Care Award (2015) Koninklijke Hollandsche Maatschappij der Wetenschappen membership (2018) Tom Isaacs Memorial Award (2018) His ParkinsonNet initiative has secured recognition as a national center of excellence since 2005 and attracted major funding through awards like the Value Based Health Care Prize. As former ZonMw board member (2009-2017) and current Michael J Fox Foundation advisor, he shapes research priorities in movement disorders. The IMPACT trial demonstrates his commitment to evidence-based multidisciplinary care models. He directs the Parkinson Centre Nijmegen (ParC) and leads Radboudumc's 'Disorders of Movement' research theme. ParkinsonNet—his signature innovation—operates as a nationwide network of 70 specialized professional teams covering all Netherlands. His laboratory environment emphasizes translational research connecting basic gait mechanics with real-world care delivery.

• Wireless Networks
• Telecommunications
• Stochastic Analysis
• +3 more

Udo Schilcher is a researcher affiliated with the University of Klagenfurt’s Institute for Networked and Embedded Systems, part of the Faculty of Technical Sciences. His primary research focuses on wireless networks, telecommunications, and stochastic analysis, with particular emphasis on swarmalator systems, pulse-coupled oscillators, and network performance optimization. He contributes to the Information Technology Curricular Commission, shaping academic standards in his field. His work explores topics like LoRa network energy efficiency, interference dynamics in wireless systems, and self-organizing synchronization mechanisms. Schilcher’s publications span over a decade, addressing theoretical and applied challenges in IoT, network reliability, and adaptive systems. His research often bridges mathematical modeling with real-world applications in communication systems and smart infrastructure. Recent projects involve collaborative efforts on IoT applications, including LoRa network enhancements and cooperative relaying strategies. His interdisciplinary approach combines stochastic processes with engineering principles to address complex network challenges. Schilcher’s contributions to academic curricula and technical research highlight his role as both an educator and innovator in networked systems.

Daniel KrennView profile

Assistant Professor

• Discrete Mathematics
• Asymptotic Enumeration
• Analysis of Algorithms
• +5 more

Daniel Krenn is an Assistant Professor in the Mathematics Department at Paris Lodron University of Salzburg. He holds a Ph.D. in Technical Mathematics from TU Graz (2013) and a Habilitation in Mathematics from Alpen-Adria Universität Klagenfurt (2019). His research focuses on discrete mathematics, including asymptotic enumeration, analysis of algorithms, analytic combinatorics, digit expansions, and graph theory. He has contributed to software development in SageMath, particularly in automata and transducer modules. Education: 2003–2009: Diploma in Electrical Engineering (TU Graz) 2005–2008: Bachelor's in Technical Mathematics (TU Graz) 2008–2010: Master's in Mathematical Computer Science (TU Graz) 2010–2013: Ph.D. in Technical Mathematics (TU Graz) 2019: Habilitation in Mathematics (Alpen-Adria Universität Klagenfurt) Research Interests: Discrete Mathematics Analysis of Algorithms and Data Structures Digit Expansions and Cryptography Combinatorics and Analytic Number Theory Key Awards: Promotio sub auspiciis Praesidentis rei publicae (2013) Austrian Mathematical Society Study Prize (2013) Austrian Federal Ministry of Science and Research Prize (2013) Professional Contributions: Coordinator of the doctoral program “Discrete Mathematics” at TU Graz (2015) Contributions to SageMath software development Over 30 peer-reviewed publications in journals like Algorithmica, Theoretical Computer Science, and Journal of Number Theory

• Automated Software Verification
• Formal Methods
• Model Checking
• +7 more

Georg Weissenbacher is a Full Professor in the Institute of Logic and Computation at TU Wien, leading the Formal Methods in Systems Engineering group. His research focuses on automated software verification, formal methods, and concurrency bug analysis. He holds a DPhil from Oxford and has held positions at Princeton and ETH Zurich. Education: TU Wien (since 2010), Postdoctoral Researcher at Princeton University (2010–2012), PhD from Oxford University (2008–2010), Research Assistant at ETH Zürich (2005–2010), Master's at TU Graz (until 2003). Research Interests: Automated software verification, formal methods, model checking, concurrency bug detection, logic and automated reasoning, symbolic simulation, and test case generation. His work addresses challenges like Heisenbugs in concurrent systems and robustness verification of neural networks. Grants & Projects: Lead projects such as AutoTest (Vienna Science Fund), LogiCS-Scholarships (2017–2025), and contributions to the National Research Network 'Rigorous Systems Engineering' (FWF). Active in the FWF-funded doctoral college 'Automated Reasoning' (2025). Advising: Supervised over 20 PhD and master's students, including notable works on Heisenbugs, mutation testing, and neural network verification. Current advisees include Thomas Hader and Sarah Sallinger. Labs & Teams: FORSYTE Group at TU Wien, collaborating on formal methods and automated reasoning. Engaged in international conferences like CAV and FMCAD as program chair/co-chair.

Regino CriadoView profile

Professor

• Complex Networks
• Discrete Mathematics
• Cybersecurity
• +4 more

Dr. Regino Criado is Full Professor of Applied Mathematics at Rey Juan Carlos University (URJC), where he has held academic positions since June 2000. He currently serves as Academic Director of the Data, Complex Networks and Cybersecurity Sciences Institute (since March 2017) and was elected to the Academia Europaea in May 2023. His career spans European research projects (ESPRIT II/III) and interdisciplinary collaborations at the intersection of mathematics, computer science, and cybersecurity. His research focuses on Complex Networks , including hyper-networks, multiplex networks, and mesoscale structures, with applications to cybersecurity, intentional risk management, and synchronization phenomena. Key innovations include: A game theory-based intentional risk model integrating accessibility, anonymity, and value metrics Hybrid network mining algorithms for credit card fraud detection PageRank extensions to multiplex networks Framework for discrete resilience analysis in technological systems His work on the 2014 Physics Reports monograph The structure and dynamics of multilayer networks (3,500+ citations) established foundational concepts in multilayer network theory. Current research explores linguistic pattern analysis through multilayer hypergraphs for automatic text summarization. Member of Academia Europaea (2023) Chaos Journal Best Paper Award (2011) Academic Entrepeneurs Prize (2002) EUROPA-1992 Prize (1992) As director of the DCNC Institute (2017-present) and BBVA-URJC Chair (2017-2018), he has led major academic-industry collaborations. His 180+ publications (6,500+ citations) demonstrate sustained impact across network science, applied mathematics, and cybersecurity.

Ezio BartocciView profile

Professor

• Cyber-Physical Systems
• Formal Methods
• Runtime Verification
• +5 more

Univ. Prof. Dr. Ezio Bartocci is a Professor at TU Wien, leading the Forschungsbereich Cyber-Physical Systems . His research focuses on formal methods, runtime verification, and probabilistic systems in Cyber-Physical Systems (CPS). He leads projects like 'Distribution Recovery for Invariant Generation of Probabilistic' and 'Trustworthy IoT for CPS'. Key interests include specification mining, probabilistic hyperproperties, and developing tools like MoonLight for spatio-temporal monitoring. Recent work explores reinforcement learning ethics, neural network verification, and adaptive testing frameworks. His contributions span conferences such as HSCC and RV, with notable publications on parameter synthesis, fault localization in CPS, and moment-based analysis of probabilistic loops. Research Interests : Cyber-Physical Systems (CPS) design and validation Formal specification and verification techniques Probabilistic systems and hyperproperties Runtime monitoring and adaptive testing Neural networks and ethical AI Labs/Teams : Active in TU Wien's Cyber-Physical Systems research unit, collaborating with industry and academia on CPS security and autonomous systems.

Horst BischofView profile

Associate Professor

• Computer Vision
• Medical Imaging
• Pattern Recognition
• +3 more

Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Horst Bischof is an Associate Professor at Vienna University of Technology (TU Wien). His work focuses on computer vision, medical imaging, and pattern recognition. He has contributed to projects in automated medical diagnosis (e.g., rheumatoid arthritis assessment), 3D reconstruction, and cultural heritage preservation through advanced segmentation techniques. He has supervised numerous students including S. Veigl, A. Belbachir, and G. Langs. Bischof has edited proceedings like the 2005 Computer Vision Winter Workshop and published extensively on topics like Markov Random Fields, Active Appearance Models, and Canonical Correlation Analysis. His research bridges computer science and biomedical applications, with notable contributions to anatomical structure localization and robust model learning. He collaborates with institutions like the European Society of Musculoskeletal Radiology and has developed systems such as the RheumaCoachCAD for automated scoring of bone erosions. Education: Dipl.-Ing. (Master of Engineering) and Dr.techn. (Doctor of Technical Sciences) from TU Wien. Key Projects: CAD systems for rheumatoid arthritis, 3D rock-art segmentation, and MRF-based medical image analysis. Research interests emphasize integrating computational methods into clinical diagnostics and heritage conservation. His work on sparse MRF models and group-wise learning has advanced automated medical image processing techniques.

Chris DowdenView profile

Research Fellow

• Graph Theory
• Random Graphs
• Combinatorics
• +2 more

Chris Dowden is a Research Fellow at the Institute of Discrete Mathematics, Graz University of Technology. His research project 'Asymptotic properties of graphs on a surface', funded by the Austrian Science Fund (FWF Grant P27290), investigates combinatorial and probabilistic aspects of graphs embeddable on 2-dimensional surfaces. Key focus areas include random planar graphs, genus evolution, and extremal graph properties. Recent publications analyze topological constraints in random graphs, with works examining genus evolution in Erdős-Rényi models, surface embedding phase transitions, and extremal problems for cycle-free planar graphs. Research employs combinatorial probability, asymptotic analysis, and topological graph theory to establish fundamental properties of random graph embeddings. Teaching activities include courses in Analytic Combinatorics and Probabilistic Methods in Combinatorics and Algorithmics. No awards, student advisements, or laboratory information are detailed in available sources.

Vladimir KolmogorovView profile

Professor

• Discrete Optimization
• Combinatorial Optimization
• Global Optimization
• +3 more

Vladimir Kolmogorov is a Professor at the Institute of Science and Technology Austria (IST Austria), leading the Kolmogorov Group focused on Discrete Optimization. He previously held positions as Assistant Professor at IST Austria (2011–2014), Lecturer at University College London (2005–2011), and Associate Researcher at Microsoft Research (2003–2005). His research spans algorithm development for graphical models, combinatorial optimization, and applications in computer vision. Education: M.S. in Applied Mathematics and Physics from the Moscow Institute of Physics and Technology, and Ph.D. in Computer Science from Cornell University (2003). Research interests include complexity classifications, algorithm design for discrete optimization problems (e.g., max-flow, min-cost matching), and applications in computer vision. Notable contributions include the 'Boykov-Kolmogorov' max-flow algorithm and 'Blossom V' for minimum cost perfect matching. Honors include the ERC Consolidator Grant (2014–2019), Koenderink Prize (2012), and best paper awards at CVPR and ECCV. His work on optimization algorithms and theoretical complexity has significantly impacted computer vision and combinatorial optimization fields. Advising and grants: Supervised multiple PhD students and postdocs, with current advisees including Martin Dvořák and Pavel Arkhipov. His team explores inference in graphical models, combinatorial optimization, and discrete optimization theory.

• Bioinformatics
• Machine Learning
• Spectral Library Search
• +5 more

Sebastian Dorl is a researcher at the Fachhochschule Oberösterreich (University of Applied Sciences Upper Austria) , affiliated with the Research Center Hagenberg and the ASiC (Applied Systems and Cybernetics) group. His work spans bioinformatics, machine learning, and data-driven modeling, with a focus on proteomics data analysis, spectral library search algorithms, and industrial process optimization.

Uwe SchmockView profile

Professor

• financial mathematics
• actuarial mathematics
• insurance mathematics
• +7 more

Uwe Schmock is a Full Professor at the Vienna University of Technology , leading research in Financial and Actuarial Mathematics within the Institute for Statistics and Mathematical Methods in Economics. His work bridges theoretical probability with practical financial and insurance risk modeling. Research interests include large deviations theory , risk aggregation , credit risk models , and stochastic integration . He has contributed to insurance mathematics through catastrophe bond analysis (e.g., WinCAT coupons) and annuity valuation tables. His recent publications focus on U-empirical measures , Panjer's recursion , and exotic options under market constraints. Scientific awards include the Charles A. Hachemeister Prize and the David Garrick Halmstad Memorial Prize . He actively collaborates with institutions like ETH Zurich and the American Casualty Actuarial Society.

• Operations Research
• Mathematical Optimization
• Game Theory
• +3 more

Werner Schachinger is an Associate Professor in the Department of Statistics and Operations Research at the Faculty of Business, Economics and Statistics. His research focuses on optimization theory, mathematical analysis, and game theory, with particular emphasis on completely positive matrices, quadratic optimization, and evolutionary dynamics. He has authored over 18 publications since 2007, exploring topics such as CP-rank bounds, combinatorial asymptotics, and algorithmic methods in optimization. Education background not explicitly stated but inferred through research focus and academic rank. His research interests span operations research, mathematical optimization, probability theory, and combinatorics. Notable contributions include studies on the complexity of optimization models, equilibrium analysis in game theory, and the application of copositive programming techniques. Publications highlight trends in optimization theory, with recent works addressing geometric distribution analysis (2023) and Plancherel averages (2023). Earlier contributions include work on moral play equilibrate (2021) and cp-rank lower bounds (2015–2020). No scientific awards explicitly mentioned in the texts. Advising and grants details are not provided in the text. However, activities include organizing the 2018 Workshop on Optimization, Game Theory, and Data Analysis, and contributing to talks on copositive optimization and duality in conic programming. Labs or research teams are not explicitly mentioned, though collaborations with researchers like Immanuel Bomze and Jörgen Weibull suggest active participation in interdisciplinary projects.

Christine Paulin-MohringView profile

Professor

• Program verification
• Type theory
• Interactive theorem proving
• +5 more

Christine Paulin-Mohring is a Full Professor at Université Paris-Saclay's Faculty of Science since 1997. She previously held a secondment at INRIA Futurs/Saclay Île-de-France (2006-2008), was a CNRS Researcher at ENS Lyon (1989-1997), and an assistant professor at ENS Paris (1985-1989). She earned her PhD in 1989 from Université Paris 7 under Gérard Huet's supervision at INRIA Rocquencourt and ENS Paris. Her research focuses on Program verification Type theory Interactive theorem proving Formal methods Coq proof assistant Randomized algorithms She has developed the ALEA Coq library for randomized programs and led the ProVal research group until 2011. Her award highlights include ACM Software System Award (2013) Doctor Honoris Causa from University of Gothenburg (2011) Prix Michel Monpetit (2015) Academia Europaea membership (2014) She has advised 15 PhD students and coordinated major projects like DigiCosme Labex (2007-2011). Her administrative roles include Dean of the Faculty of Science (2016-2021) and leadership in doctoral schools.

Michał KarońskiView profile

Professor

• Discrete Mathematics
• Theoretical Computer Science
• Random Discrete Structures
• +3 more

Michał Karoński is a Professor of Mathematics at Adam Mickiewicz University in Poznań, Poland, where he heads the Department of Discrete Mathematics at the Faculty of Mathematics and Computer Science. He is renowned for his work in random discrete structures, probabilistic combinatorics, graph theory, and algorithm design. Academic Leadership: Co-founded the international journal Random Structures & Algorithms in 1990 and serves as its Editor-in-Chief alongside Noga Alon and Andrzej Ruciński. International Collaborations: Active in global research, holding visiting professorships at Emory University (since 1992), Johns Hopkins University, Purdue University, and Southern Methodist University. Conducted research at institutions including Bellcore, Microsoft Research, BRICS, and the Isaac Newton Institute. Conference Organization: Chaired 17 bi-annual conferences on random structures and algorithms since 1983, hosted in Poznań, Atlanta, Tel Aviv, and Pittsburgh. Policy & Governance: Served on Poland's Committee for Scientific Research (2004-2005), the Research Council (2005-2010), and as Chairman of the National Science Centre Council (2010-2016). Research Impact: His work bridges discrete mathematics and theoretical computer science, influencing fields such as random graphs, probabilistic methods, and algorithmic design. He has authored 60 publications and delivered over 30 plenary lectures worldwide. Scientific Awards 2016: Medal Homini Vere Academico 2013: Order of Polonia Restituta Officer Cross 1990: Minister of Science and Higher Education Prize