Find Academic Supervisors

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.

Christian KrattenthalerView profile

Professor

• Enumerative Combinatorics
• Algebraic Combinatorics
• Hypergeometric Series
• +3 more

Christian Krattenthaler is a retired Professor at the University of Vienna's Faculty of Mathematics, specializing in combinatorics and algebraic combinatorics. He is a member of the combinatorics group and co-leads the Arbeitsgemeinschaft für Diskrete Mathematik. His research focuses on enumerative combinatorics, hypergeometric series, and number theory, with notable contributions to lattice path enumeration, determinants, and tilings. He has developed Mathematica packages like HYP, HYPQ, and RATE for hypergeometric series manipulation and sequence guessing. Krattenthaler is an editor for journals such as the Séminaire Lotharingien de Combinatoire, Electronic Journal of Combinatorics, and Annales de l’Institut Henri Poincaré D. His work includes advancements in Pfaffian rings, Schubert varieties multiplicities, and combinatorial identities. Collaborations span across institutions like TU Wien and TU Graz within the Special Research Programme (SFB) on Discrete Random Structures. He has advised numerous students, though specific advisee names are not listed here.

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

• Algorithms
• Graph Theory
• Computational Complexity
• +2 more

Manuel Sorge is a Research Fellow in the Faculty of Informatics at Vienna University of Technology, affiliated with the Algorithms and Complexity group (E192-01). His research focuses on parameterized algorithms, graph theory, and computational complexity, with particular emphasis on graph modification problems, clustering algorithms, and combinatorial optimization. His work spans several areas including graph drawing, algorithmic game theory, and machine learning. Research interests include: Parameterized complexity and kernelization Graph algorithms and combinatorial optimization Algorithmic graph theory and discrete mathematics Computational geometry and graph drawing Supervises master's students in algorithm design and complexity theory. Current projects include Parameterized Graph Drawing (2023–2027).

Josep DíazView profile

Professor

• Theoretical Computer Science
• Randomized Techniques in Combinatorics and Graph Theory
• Complexity Theory
• +3 more

Josep Díaz is a Professor in Computer Science at the Polytechnic University of Catalonia (UPC), where he has been a Full Professor since 1984. He earned his PhD (Doctor en Ciencias) in 1982 from Universidad de Valencia and has held academic roles such as Lecturer (1979-1984) and Instructor of Mathematics at Riverside City College (1977-1979). His research spans theoretical computer science, focusing on randomized techniques in combinatorics, complexity theory, approximation algorithms, and game theory. Education: PhD in Mathematics from Universidad de Valencia (1982) Díaz's work involves theoretical models for wireless networks, graph theory, and algorithms for dynamic data spreading. His contributions have been recognized with prestigious awards, including Spain's highest computer science honor and a six-year Catalan Government research distinction. He has led major European research projects like COMBSTRU and participated in advisory committees for the Kyoto Prize and the Japanese New Horizons in Computing initiative. Scientific Awards: Distinció per a la promoció de la recerca (Catalan Government, 2002-2008) Spanish National Prize in Computer Science (2011) Member of Academia Europaea (2012) Díaz has held significant editorial roles as Editor-in-Chief of Computer Science Reviews (Elsevier) since 2006 and on the editorial board of Theoretical Computer Science (Elsevier) since 1998. He has coordinated multiple European research projects (COMBSTRU, WISEBED, FRONTS, DELIS) and served on program committees for top conferences (ICALP, ESA, RANDOM).

Leslie Ann GoldbergView profile

Professor

• Algorithms
• Complexity Theory
• Randomized Algorithms
• +6 more

Leslie Ann Goldberg is Professor of Computer Science at the University of Oxford and Senior Research Fellow at St Edmund Hall. She has held academic positions at the University of Liverpool (2006-2013) and the University of Warwick (1995-2006), and previously worked at Sandia National Labs (1992-1995). Currently serving as Head of Department (sabbatical planned for 2025-26), she leads research in theoretical computer science with focus on algorithms and complexity theory. Her research interests span algorithms for approximately counting and randomly sampling combinatorial structures , analysis of Markov-chain based sampling algorithms , complexity of counting , and stochastic processes in computer science . She specializes in randomized algorithms, particularly their mathematical analysis regarding runtime and accuracy. Current projects include contentions resolution via backoff protocols, random sampling and approximate counting algorithms, counting complexity theory, and analyzing processes on networks like the Moran process. Professor Goldberg has published over 100 papers in top theoretical computer science venues, with recent work focusing on spin systems, graph homomorphisms, subgraph counting, and network processes. Her publications show consistent output in premier venues including ICALP (where she has won three Best Paper Prizes), SODA, STOC, and RANDOM. ERC Advanced Grant 'Mapping the Complexity of Counting' (2014-2019) Best Paper Prize at ICALP 2012, 2010, and 2006 UK Distinguished Dissertations in Computer Science (1991-1992) She actively supervises PhD students and collaborates with researchers including Andreas Galanis, Marc Roth, John Lapinskas, and Paulina Smolarova. Her work bridges theoretical computer science with statistical physics, combinatorics, and network theory, with applications to database systems, evolutionary dynamics, and communication protocols.

Phokion KolaitisView profile

Professor

• Principles of database systems
• Computational complexity
• Logic in computer science

Phokion Kolaitis is a Professor of Computer Science at the University of California Santa Cruz (UC Santa Cruz) and a Principal Research Staff Member (part-time) at the IBM Almaden Research Center. He has held leadership roles as Chair of UC Santa Cruz's Computer Science Department (1997-2001, 2014-2015) and Senior Manager at IBM's Computer Science Principles and Methodologies Department (2004-2008). His research bridges database systems, computational complexity, and logic in computer science, with significant contributions to schema mappings, data exchange, and constraint satisfaction problems. His work spans foundational studies in database theory, logic, and algorithms, influencing both academic research and industrial applications. Kolaitis has received numerous accolades, including two ACM PODS Alberto Mendelzon Test-of-Time Awards, IBM Research Division Outstanding Innovation and Technical Achievement Awards, and Best Paper Awards at top conferences like ICDT and FCT. He is a Fellow of AAAS and ACM, a Foreign Member of the Finnish Academy of Science and Letters, and holds an Honorary Doctorate from the University of Athens, Greece. 2017 Best Paper Award (FCT 2017) 2015 IBM Outstanding Innovation Award 2014 Honorary Doctorate (University of Athens) 2008 IBM Outstanding Technical Achievement Award Fellow of AAAS and ACM Foreign Member, Finnish Academy of Science Kolaitis collaborates extensively, co-authoring with researchers like D. Burdick, R. Fagin, and M.Y. Vardi. At UC Santa Cruz, he advises on database systems and logic, while his part-time role at IBM focuses on theoretical advancements in data management and complexity.

Philipp SprüsselView profile

Senior Lecturer

• Random Graphs
• Enumerative Combinatorics
• Phase Transitions
• +3 more

Philipp Sprüssel is a Senior Lecturer at Graz University of Technology's Institute of Discrete Mathematics. His research focuses on Random Graphs , Enumerative Combinatorics , and Phase Transitions , with particular emphasis on graphs on surfaces, hypergraphs, and simplicial complexes. He has organized conferences like the Random Structures and Algorithms and contributed to workshops on enumerative combinatorics and phase transitions. His academic career includes roles as a Postdoctoral Researcher at the University of Haifa and the University of Oxford, and a DAAD-funded position at the University of Hamburg. He holds a PhD from the University of Hamburg (2010). Teaching responsibilities span courses in Analytic Combinatorics , Discrete Mathematics , and Mathematics for Engineering , with recent activities in 2023. Research grants include an FWF-funded project on graphs on surfaces. Key contributions include studies on cohomology groups of random simplicial complexes, phase transitions in graph evolution, and symmetry characterization of unlabelled triangulations. His Erdős number is 2.

Bernhard GittenbergerView profile

Associate Professor

• Enumerative Combinatorics
• Analysis of Algorithms
• Probability Theory
• +4 more

Bernhard Gittenberger is an Associate Professor at the Institute of Discrete Mathematics and Geometry at TU Wien. His research focuses on enumerative combinatorics, analysis of algorithms, and probability theory, particularly stochastic processes in combinatorial structures. He has advised numerous Master's and PhD students, contributing to advancements in discrete mathematics and algorithmic analysis. Affiliation: TU Wien, Institute of Discrete Mathematics and Geometry Roles: Academic Researcher, Educator, PhD Advisor His work encompasses lattice paths, tree structures, phylogenetic networks, and analytic combinatorics. He has been involved in multiple research projects, including FWF-funded initiatives and collaborations with institutions like Université de Versailles and Academia Sinica. Key contributions include studies on asymptotic enumeration, probabilistic methods in combinatorics, and algorithmic analysis of discrete structures. His scientific achievements include the Jubiläums-Studienpreis from the Austrian Mathematical Society in 1996.

Benedikt StuflerView profile

Professor

• Combinatorics
• Probability Theory
• Random Structures
• +5 more

Prof. Benedikt Stufler is a Professor of Mathematics at Technische Universität Wien's Institute of Discrete Mathematics and Geometry. His research focuses on the interplay between combinatorics and probability, particularly the analysis of random structures such as graphs, trees, and maps. He holds a Habilitation in Mathematics (2022) and a Doctorate from Ludwig-Maximilians-Universität München (2015). Education: Habilitation in Mathematics, TU Wien (2022) Doctorate in Mathematics, LMU Munich (2015) Master's (Diplom-Mathematiker), LMU Munich (2013) Study abroad at Universidad de Buenos Aires (2011) Research Interests: His work combines stochastic methods with combinatorial constructions to study models of random structures. Key areas include: Limits of random structures (Gromov-Hausdorff-Prokhorov convergence) Branching processes and random maps Enumerative combinatorics and Gibbs partition models Phase transitions in weighted graphs Algorithmic sampling of combinatorial structures Recent Grants: FWF Project 'Limits of random networks' (2024–2027, €435k) Principal Investigator in SFB 'Discrete Random Structures' (2024–2028, €3.9M total) Lab/Group: Current members include postdoc Dr. Colin Desmarais and PhD students Niccolò Bosio and Philipp Beltran. He supervises master's theses in probability theory.

Markus KubaView profile

Professor

• Theoretical Computer Science
• Analysis of Algorithms
• Analytic Combinatorics
• +4 more

Markus Kuba is a Professor (FH-Professor) at FH-Technikum Wien in Vienna, Austria, where he leads the Department of Applied Mathematics and Physics. He holds a habilitation (Privatdozent) from TU Wien's Faculty of Mathematics and Geoinformation, granting him the venia docendi. He is also a teacher at HTL-Spengergasse, a higher technical institute, specializing in mathematics and computer science. His academic journey includes a PhD in Mathematics from TU Wien (2006) and a habilitation in 2013. His research focuses on theoretical computer science, analysis of algorithms, analytic combinatorics, and random structures. Notable specializations include tree structures, urn models, multiple zeta values, and SAT-problems. His work bridges combinatorial theory with practical applications in network analysis and stochastic processes. Key contributions include studies on urn models, tree growth models, and interdisciplinary projects like integrating traffic simulation tools. His publications span prestigious journals such as Theoretical Computer Science , Combinatorics, Probability and Computing , and Journal of Combinatorial Theory . Teaching spans secondary schools and universities of applied sciences since 2009, with a focus on mathematics and programming. Collaborations include co-authors from institutions worldwide, reflecting his active role in international academic networks.

Lorenz Alexander GilchView profile

Researcher

• Random Walks
• Markov Chains
• Group Theory
• +5 more

Lorenz Alexander Gilch is a Researcher at the Chair of Stochastics and its Applications , University of Passau, and a Lecturer at Graz University of Technology (since 2018). He holds a Habilitation in Mathematics (2016) from TU Graz and has held positions including DFG Stipendium, University Assistant, and Substitute Professor roles at institutions like University of Geneva, University of Bayreuth, and Technische Hochschule Deggendorf. Educational Background: Diplom-Mathematiker (2004) from University of Passau, with a focus on Algebra, Stochastics, and Applied Statistics. Research Interests: Random Walks on Graphs and Groups, Asymptotic Entropy, Free Products, Branching Random Walks, and Statistical Data Analysis. Notable Awards: Faculty Prize, University of Passau (2004); DFG Research Stipendium (2008-2010, 2010-2011). His publications span journals like Electronic Journal of Probability , Mathematische Zeitschrift , and Random Structures & Algorithms , with articles focusing on asymptotic properties of random walks, branching processes, and group theory applications. He has presented at international workshops and conferences in Austria, Germany, Switzerland, Australia, and the US.

• Combinatorics
• Enumerative Combinatorics
• Lattice Path Enumeration
• +3 more

Markus Fulmek is an Associate Professor at the Faculty of Mathematics, University of Vienna , with a focus on combinatorial mathematics and discrete structures. He has contributed extensively to enumerative combinatorics, lattice path enumeration, and algebraic combinatorics through his research. His work centers on combinatorics , particularly in lattice path enumeration , permutation patterns , and determinant identities . He has explored tiling problems for symmetric hexagons, nonintersecting lattice paths, and bijective proofs for Schur function identities, often linking these to broader areas like graph theory and discrete geometry . Recent publications (2021–2023) emphasize tiling configurations for damaged or dented hexagons, permutation matrices, and determinant-based combinatorial identities. His methodology frequently relies on nonintersecting lattice paths and bijective combinatorics .