جستجوی استاد راهنمای دانشگاهی

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

استاد

• Parameterized Algorithms
• Kernelization
• Exact Algorithms
• +۶ مورد دیگر

Saurabh Saket is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway (since 2013), and concurrently a Professor at the Institute of Mathematical Sciences, India (since 2009). Previously, he was a Postdoctoral Fellow at the Department of Informatics, University of Bergen (2007–2009). His research focuses on parameterized algorithms, kernelization, exact algorithms, matroid algorithms, algorithmic graph minors, treewidth, and approximation algorithms. He has made breakthrough contributions to complexity theory, kernelization preprocessing, and exact exponential-time algorithms, with key results published in top venues like Journal of the ACM, SODA, FOCS, and STOC. Awards and Grants 2020: Fellow of Indian Academy of Sciences 2019: Outstanding Young Researcher Meltzer Award (Norway) 2017–2018: Swarnajayanti Fellowship (India) 2019–2024: ERC Consolidator Grant 'LOPRE' 2013–2017: ERC Starting Grant 'PARAPPROX' His work bridges parameterized complexity with approximation algorithms and has led to foundational results in algorithmic lower bounds, combinatorial optimization, and logic applications.

Fabian Kluteمشاهده پروفایل

پژوهشگر ارشد

• Graph drawing
• Automated cartography
• Map labeling
• +۳ مورد دیگر

Fabian Klute is a Research Fellow at Universitat Politècnica de Catalunya, specializing in discrete and computational geometry. His research focuses on graph drawing, automated cartography, map labeling, and geometric computing, with emphasis on theoretical foundations and algorithm development. Klute's publications demonstrate consistent focus on geometric complexity, graph visualization, and combinatorial optimization. Recent works establish hardness results for segment folding and edge insertion problems, develop algorithms for geometric set diversity, and advance boundary labeling techniques. A significant research thread explores parameterized complexity in graph modification problems. His contributions in graph drawing include innovations in confluent drawings, book embeddings, and 1-planar extensions. Cartography-related research advances automated labeling and spatial representation for complex curve arrangements.

Alexander Schrijverمشاهده پروفایل

استاد

• Discrete Optimization
• Combinatorics
• Optimization
• +۳ مورد دیگر

Alexander Schrijver is a Full Professor of Mathematics at the University of Amsterdam since 1990 and a CWI-Fellow at the National Research Institute for Mathematics and Computer Science (CWI) in Amsterdam since 2005. He previously held roles such as Leader of the Scientific Cluster PNA1 at CWI and Group Leader of the Department of Combinatorial Optimization and Algorithmics. His academic career includes professorships at the University of Tilburg (1983–1989) and early research roles at CWI. He earned his Ph.D. in Mathematics from Vrije Universiteit Amsterdam in 1977 with a thesis on 'Matroids and Linking Systems.' His research focuses on discrete mathematics, optimization, and algorithms, particularly applying classical mathematical methods—such as algebra, geometry, and invariant theory—to modern problems in combinatorics and optimization. Notable contributions include algorithms for railway planning and theoretical work linking representation theory to code bounds and statistical physics partition functions. His awards include the Spinoza Prize (2005), John von Neumann Theory Prize (2006), Franz Edelman Award (2008), and SIGMA Prize (2008). He is a member of prestigious academies, including the Royal Netherlands Academy of Sciences (since 1995) and Academia Europaea (2008). His academic activities include editorships of journals like Combinatorica and Journal of Combinatorial Theory, Series B , and leadership roles in conferences such as the 5th European Congress of Mathematicians (2006). His work bridges foundational mathematics with applied optimization, impacting both theoretical and practical domains.

Vladimir Kolmogorovمشاهده پروفایل

استاد

• Discrete Optimization
• Combinatorial Optimization
• Global Optimization
• +۳ مورد دیگر

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.

Georg Graseggerمشاهده پروفایل

پژوهشگر

• Rigidity Theory
• Symbolic Computation
• Algebraic Geometry
• +۳ مورد دیگر

Georg Grasegger is a Researcher in the Symbolic Computation group at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences. His work focuses on rigidity theory, algebraic geometry, and symbolic computation with applications to combinatorial and geometric structures. Research interests include rigidity of graphs and frameworks, algebraic differential equations, and geometric configurations. Recent work explores paradoxical motions of graphs, flexible polyhedra, and counting realizations of rigid structures using algebraic methods. Publications highlight contributions to graph rigidity, computational geometry, and algebraic combinatorics, with a focus on theoretical foundations and algorithmic approaches. His research bridges discrete mathematics and applied algebraic geometry. Contributions include software tools like FlexRiLoG for studying graph motions and RigiComp for computational rigidity analysis. No notable awards are listed, though his work is widely cited in combinatorial geometry and symbolic computation fields. Labs/Teams: Active in RICAM's Symbolic Computation group, collaborating with institutions on geometric and algebraic problems. Supervises research projects on rigidity and discrete structures.

Stefan Lendlمشاهده پروفایل

پژوهشگر

• Combinatorial Optimization
• Computational Complexity
• Graph Theory
• +۶ مورد دیگر

Stefan Lendl is a Researcher at the Institute of Discrete Mathematics of Graz University of Technology , Austria. His work focuses on combinatorial optimization, computational complexity, and graph theory, with applications in operations research and robust optimization. Research Interests: Robust optimization, graph algorithms, scheduling, facility location, transportation problems, and computational complexity of NP-hard problems. Key Collaborations: Frequent co-authorship with researchers like L. Wulf, M. Goerigk, G.J. Woeginger, and others. Grants: Involved in projects like FFG Basisprogramm (Kleinprojekt) for robust tactical transport planning and WTZ Scientific & Technological Cooperation with Slovenia. Recent Publications analyze problems in robust optimization, graph algorithms, and NP-hardness, with a focus on transportation, scheduling, and facility location. He has submitted manuscripts on rescheduling, obnoxious facility dispersion, and complexity of multi-stage robustness.

• Algorithms
• Graph Theory
• Matroid algorithms
• +۸ مورد دیگر

Fedor Fomin is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway, since 2002. His research focuses on fundamental problems in computer science and mathematics, particularly in algorithm design and graph theory. Research Interests: His work spans advanced algorithmic techniques such as Matroid algorithms Algorithmic graph minors Treewidth and its applications Exact and exponential time algorithms Pursuit-evasion games and graph searching Parameterized algorithms and kernelization Graph coloring Publications: He has authored over 150 peer-reviewed journal articles in venues like J. ACM, SIAM J. Computing, and Combinatorica, alongside 160 conference papers in top-tier events including FOCS, STOC, and AAAI. His research demonstrates expertise in bridging theoretical computer science and discrete mathematics. Scientific Awards: EATCS Fellow (2019) ERC Advanced Investigator Grant (2010) EATCS-IPEC Nerode Prize 2017 (with F. Grandoni and D. Kratsch) EATCS-IPEC Nerode Prize 2015 (with E. D. Demaine, M. T. Hajiaghayi, and D. M. Thilikos) Norway's Outstanding Young Investigator Award (2005) Grants: He has secured major grants from The Research Council of Norway (NFR), the Russian Ministry of Education and Science (mega-grant), and the European Research Council (ERC) as Principal Investigator.

Chellappa Ramaمشاهده پروفایل

استاد

• Computer Vision
• Machine Learning
• Artificial Intelligence
• +۵ مورد دیگر

Rama Chellappa is the Bloomberg Distinguished Professor at Johns Hopkins University (JHU), holding primary appointments in the departments of Electrical and Computer Engineering and Biomedical Engineering, under the Whiting School of Engineering and School of Medicine, respectively. He is affiliated with the Center for Imaging Science, Center for Language and Speech Processing, Institute for Assured Autonomy, and Mathematical Institute for Data Science. Previously, he spent 29 years at the University of Maryland as a College Park Professor and held roles at the University of Southern California and Purdue University. His research focuses on computer vision, machine learning, artificial intelligence, pattern recognition, and biometrics, with applications in smart cars, forensics, 2D/3D facial modeling, and medical diagnostics. Notable contributions include work on Markov random fields, 3D structure recovery, deep learning for face recognition, and gait recognition. He has published over 900 papers, achieving an h-index of 140. Rama Chellappa has been honored with prestigious awards, including the US National Academy of Engineering membership (2023), IEEE Jack S. Kilby Medal (2020), and K.S. Fu Prize (2012). He is a Fellow of multiple organizations, including IEEE, IAPR, and AAAS. His current collaborations at JHU School of Medicine involve applying computer vision to analyze facial expressions for monitoring stroke/dementia patients, autism detection in children, and digital pathology.

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

استاد

• Computer Science
• Theoretical Computer Science
• Algorithms
• +۷ مورد دیگر

Saket Saurabh is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway, since 2013, and a Professor at the Institute of Mathematical Sciences, India, since 2009. His research focuses on fundamental areas of algorithms and graph theory, particularly parameterized algorithms and kernelization. Research Interests: Parameterized algorithms, kernelization, exact exponential time algorithms, matroid algorithms, algorithmic graph minors, treewidth, and approximation algorithms. Scientific Awards: He has been recognized with the Fellow of Indian Academy of Sciences (2020), the Meltzer Award for Outstanding Young Researcher in Norway (2019), and the Swarnajayanti Fellowship in Mathematical Sciences (2017-18) from the Government of India. Grants: Principal Investigator (PI) for the European Research Council (ERC) Starting Grant 'PARAPPROX' (2013-2017) and the ERC Consolidator Grant 'LOPRE' (2019-2024). His scholarly output includes over 140 articles in top-tier journals like Journal of ACM, SIAM Journal on Computing, and ACM Transactions on Algorithms, as well as 220 conference papers at venues such as FOCS, STOC, and AAAI. As of recent data, his work has garnered 7508 citations (5003 in the last 5 years) with an H-index of 44.

• Combinatorial Optimization
• Network Flow Problems
• Efficiently Solvable Cases of NP-hard Optimization Problems
• +۳ مورد دیگر

Bettina Klinz is an Associate Professor at the Institute for Discrete Mathematics within Graz University of Technology , Austria. Her academic background includes a Diplom Ingenieur (M.Sc.) and Dr. techn. (Ph.D.) in Technical Mathematics from TU Graz, with a habilitation in Applied Mathematics. Research Interests: Combinatorial optimization, network flow problems, graph algorithms, and efficiently solvable cases of NP-hard optimization problems. Teaching: Regular instructor of courses like Combinatorial Optimization 1 and Optimization 1 , focusing on polynomially solvable problems, matroids, shortest paths, and flow problems. Supervision: Advised numerous diploma/master's and Ph.D. theses on topics ranging from spanning trees to nurse shift scheduling and MAX-SAT algorithms. Contact: Emails klinz@opt.math.tu-graz.ac.at (primary) and bettina.klinz@tugraz.at , with office in Steyrergasse 30/II, Graz.