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

Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.

• Theoretical Computer Science
• Computational Geometry
• Algorithms
• +۳ مورد دیگر

Professor Vitali Wachtel of Bielefeld University's Faculty of Mathematics specializes in advanced stochastic processes, probability theory, and their applications in mathematical modeling. Since 2021, he holds a W3 Professorship and serves as Principal Investigator in CRC 1283 'Taming uncertainty and profiting from randomness and low regularity in analysis, stochastics and their applications' since 2023. Chaired Examination Boards for Bachelor & Master Business Mathematics Member, Bielefeld Graduate School in Theoretical Sciences Research focus: Markov processes, random walks in cones, branching processes Research Trends: His recent work spans critical multitype branching in random environments (2025), asymptotic expansions for conditioned random walks (2024), and invariance principles for integrated processes. He explores connections between stochastic processes, combinatorial structures, and risk modeling with level-dependent premiums. Awards: Feodor Lynen Research Fellowship (2017), Alexander von Humboldt Foundation Teaching: Coordinates modules including 'Stochastic Processes' (24-M-PT-STP) and 'Introduction to Probability Theory' (24-B-EW-5). Active in curriculum development and academic governance through multiple university committees.

• Stochastic Processes
• Probability Theory
• Mathematical Modeling
• +۴ مورد دیگر

Professor Asaf Shapira is a faculty member in the Department of Theoretical Mathematics at Tel Aviv University's School of Mathematical Sciences. He has been actively contributing to combinatorics and graph theory research for over a decade, with numerous publications in top journals including Journal of the ACM, Advances in Mathematics, and Geometric and Functional Analysis. Professor Shapira's research focuses on extremal combinatorics, graph theory, and property testing. His work explores fundamental questions in Ramsey theory, hypergraph theory, and probabilistic methods in combinatorics. He has made significant contributions to the study of graph regularity, removal lemmas, and extremal problems in dense and sparse graphs. His recent publications demonstrate a consistent focus on theoretical aspects of combinatorics with connections to theoretical computer science. A notable trend is his work on developing polynomial bounds for various combinatorial theorems and exploring connections between combinatorial structures and computational complexity. His research often bridges pure mathematics with theoretical computer science applications. Professor Shapira teaches advanced courses at Tel Aviv University including Extremal Graph Theory, Basic Combinatorics, and seminars on specialized topics in combinatorics. His teaching spans undergraduate and graduate levels, reflecting his commitment to educating the next generation of mathematicians.

• Extremal Combinatorics
• Graph Theory
• Property Testing
• +۴ مورد دیگر

Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.

• Combinatorics
• Extremal Graph Theory
• Random Structures and Algorithms
• +۵ مورد دیگر

Professor Stefan Glock is an Assistant Professor of Discrete Mathematics at the University of Passau's Faculty of Computer Science and Mathematics, a position he has held since September 2022. Prior to this appointment, he spent three years as a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, following the completion of his doctorate at the University of Birmingham. Stefan Glock received his mathematics education at Technische Universität Ilmenau from 2009 to 2014, then pursued his PhD at the University of Birmingham, which he completed in 2018. His doctoral dissertation, "Decompositions of Graphs and Hypergraphs," was the runner-up for the Richard-Rado-Preis 2018. Professor Glock's research focuses on discrete mathematical structures, with particular emphasis on their asymptotic properties. His work spans several interconnected fields of combinatorics: Extremal Combinatorics : Investigating the maximum or minimum possible size of mathematical structures satisfying certain properties Probabilistic Combinatorics : Applying probability theory to solve combinatorial problems Graph Theory : Studying properties of graphs and networks Ramsey Theory : Examining conditions under which order must appear in large structures Design Theory : Creating arrangements of elements satisfying specific balance properties Discrete Geometry : Analyzing geometric problems with discrete structures Analysis of Professor Glock's recent publications reveals a consistent focus on solving long-standing open problems in combinatorics using innovative methods that combine probabilistic techniques with structural insights. His work often bridges theoretical mathematics with applications in theoretical computer science, particularly in the analysis of algorithms and network structures. A significant portion of his research addresses fundamental questions about graph and hypergraph decompositions, which have implications for coding theory, cryptography, and network design. Professor Glock has received notable recognition for his contributions to mathematics: Runner-up for the Richard-Rado-Preis 2018 for his dissertation "Decompositions of Graphs and Hypergraphs" Awarded funding through the prestigious DFG Emmy Noether Programme in 2024 for his research group on "the interplay of structure and randomness in mathematics" As a faculty member at the University of Passau, Professor Glock leads the Discrete Mathematics research group and actively collaborates with mathematicians worldwide. He has established a strong research program that has attracted funding for academic visitors and supports multiple research projects. His approach to mathematical problems emphasizes developing new methods that have far-reaching implications beyond the specific problems being solved. Professor Glock's research group at the University of Passau focuses on the interplay between structure and randomness in discrete mathematics. The group maintains active collaborations with leading institutions including ETH Zurich, University of Birmingham, and various research centers across Europe. Through the DFG Emmy Noether Programme funding, his group is expanding its research on combinatorial structures and their applications.

• Discrete Mathematics
• Extremal Combinatorics
• Probabilistic Combinatorics
• +۴ مورد دیگر

Piotr Micek is a professor in the Theoretical Computer Science Department at the Faculty of Mathematics and Computer Science, Jagiellonian University , Kraków, Poland. He is an active researcher in combinatorics, particularly in structural graph theory and poset combinatorics, and maintains extensive international collaborations. University: Jagiellonian University School: Faculty of Mathematics and Computer Science Department: Theoretical Computer Science Department Email: firstname.lastname@gmail.com Office: Room 3151, Łojasiewicza Street 6, 30-348 Kraków Phone: +48 12 664 7594 Duty hours: Wednesdays 11:00–13:00 His main research interests include structural graph theory, combinatorics of partially ordered sets (posets), geometric intersection graphs, graph coloring and choosability, and the entropy compression method. He also works on approximation and on-line algorithms and combinatorial geometry. His work often bridges deep theoretical insights with algorithmic applications. The recent publications highlight a strong focus on graph structure and coloring problems. Key themes include product structure of planar graphs, poset dimension and its relation to height and planarity, weak coloring numbers, and adjacency labelling. His work frequently appears in top venues such as Journal of the ACM , Combinatorica , SIAM Journal on Discrete Mathematics , and SODA, indicating sustained high-impact contributions. Associate Editor, SIAM Journal on Discrete Mathematics (2025–) Former Associate Editor, Discrete Mathematics (2010–2022) Former Associate Editor, Discrete Mathematics & Theoretical Computer Science (2012–2020) He has supervised numerous students at all levels, including PhD candidates Jędrzej Hodor , Marcin Briański , and Michał T. Seweryn , and has led major research grants such as OPUS 24 and WEAVE-UNISONO funded by NCN. He has also been involved in significant trilateral projects with researchers from Belgium and Germany. His recent talks include tutorials on product structure theory and centered colorings, reflecting his leadership in these areas. He actively participates in the academic community, having served on program committees (e.g., SODA 2021, WG 2022) and organized workshops such as the Order & Geometry series. His research is supported by substantial funding, including over 900,000 PLN for current projects.

• Structural Graph Theory
• Combinatorics of Posets
• Geometric Intersection Graphs
• +۴ مورد دیگر

Maria Axenovich is a Professor at the Department of Mathematics , Karlsruhe Institute of Technology (KIT). Her research focuses on graph theory and combinatorics , emphasizing unavoidable structures in graphs, Ramsey-type problems, Turán densities, and extremal graph theory. Education : Undergraduate in Novosibirsk, Russia; Ph.D. at the University of Illinois at Urbana-Champaign under Zoltan Füredi. Positions : Previously at Iowa State University; since 2012 at KIT. Editorial Roles : Editor-in-Chief of the Electronic Journal of Combinatorics (2020–present); Associate Editor of Order (2016–present). Recent Research Trends : Her 2023–2025 publications address hypercubes , poset Ramsey numbers , interval colorings , extremal subgraphs , and canonical Ramsey theorems . Collaborations span institutions in the US, UK, Hungary, and Germany. Students and Collaborations : Supervises Ph.D., Master’s, and Bachelor students. Current advisees include Dingyuan Liu , Christian Winter , and Lea Weber . Former students like Jonathan Rollin and Torsten Ueckerdt have contributed to extremal graph theory and hypergraphs. Courses : Teaches Linear Algebra , Combinatorics , and Graph Theory at KIT. Leads seminars on Extremal Set Theory and Discrete Mathematics .

• Graph Theory
• Combinatorics
• Ramsey Theory
• +۷ مورد دیگر

Prof. Henning Bruhn-Fujimoto is a faculty member at the Institute for Optimization and Operations Research at Ulm University. His research focuses on graph theory, combinatorial optimization, and discrete mathematics , with notable contributions to Erdős-Pósa properties, cycle packing, and algorithmic graph theory. He teaches courses in mathematical foundations of machine learning and combinatorics. Academic Background: - Habilitationsschrift : Graphs and their Circuits (2009) - PhD Thesis: Infinite circuits in locally finite graphs (2005) - Diploma Thesis: Generating the cycle space by induced non-separating cycles (2001) Research Interests: - Structural graph theory and algorithm design - Optimization in discrete systems - Applications of combinatorial mathematics Thesis Supervision: He regularly oversees bachelor's and master's theses in optimization, graph theory, and related fields. Notable past thesis topics include elevator system optimization, Erdős-Posa properties in graphs, and container ship unloading algorithms. Labs/Teams: His work is centered within the Institute's optimization group, collaborating with researchers on projects involving graph algorithms and combinatorial optimization.

• Optimization
• Graph Theory
• Operations Research
• +۳ مورد دیگر

Michel Pain is a CNRS Researcher at the Toulouse Mathematics Institute (Université de Toulouse). Previously, he held a Courant Instructor position at NYU's Courant Institute of Mathematical Sciences (2019-2021) and completed his PhD in probability theory at Sorbonne Université under Zhan Shi, focusing on branching Brownian motion. His research spans log-correlated fields , including branching Brownian motion/random walks, Derrida-Retaux models, and β-ensembles. He studies extremal statistics , stochastic structures , and phase transitions in hierarchical systems. Michel has published extensively on branching processes , weighted trees , and log-correlated random matrices , with recent work on supercritical phase overlaps (2025) and height asymptotics for weighted trees (2024). His supervised students include PhD candidate Louis Chataignier and several Bachelor/Master thesis authors. He currently teaches the Master 2 course Branching Processes with Pascal Maillard, having previously taught advanced probability at Université Toulouse III, complex analysis at NYU, and integration theory at ENS Paris.

• Branching Brownian Motion
• Log-Correlated Fields
• Branching Random Walks
• +۶ مورد دیگر

Cédric Costa is a Professor at the Conservatoire National des Arts et Métiers (CNAM), conducting research at the CEDRIC Laboratory. With a publication record spanning over 30 years from 1992 to 2023, he has established himself as a leading researcher in combinatorial optimization and operations research. His research interests focus on combinatorial optimization , graph theory , and operations research , with significant contributions to network design, discrete tomography, and robust optimization. His work bridges theoretical foundations with practical applications, particularly in renewable energy systems and telecommunications networks. Analysis of his publication trends shows a consistent focus on Steiner tree problems, matching theory, and robust network design, with increasing emphasis on renewable energy applications since 2015. His recent work (2020-2023) demonstrates expertise in wind farm optimization and robust network design under uncertainty. Prix Orange de l'Innovation 2012 (catégorie Réseau) for FTTH network deployment research Professor Costa has supervised numerous researchers including Poirion P-L, Bentz C, Ridremont T, Hertz A, Cotté G, and Picouleau C, as evidenced by their frequent co-authorship on publications. His research has been supported by projects related to wind farm optimization, optical network design, and robust energy systems. He has been actively involved in the ROADEF (French Operations Research Society) community, presenting regularly at their conferences.

• Combinatorial Optimization
• Graph Theory
• Operations Research
• +۵ مورد دیگر

Dennis Clemens is a researcher in the Institute of Mathematics at Hamburg University of Technology, where he leads and contributes to research in discrete mathematics, particularly in the Chair of Discrete Mathematics. His work centers on combinatorial game theory, extremal combinatorics, and probabilistic methods in graph theory. Research Interests: His research spans positional games (Maker-Breaker, Waiter-Client, Walker-Breaker), Ramsey theory , random graphs , and graph packing . He investigates structural properties of games on random and perturbed graphs, size-Ramsey numbers, and extremal problems in hypergraphs. Publications Trends: His recent publications (2021–2024) show a strong focus on game-theoretic models over random structures, with frequent collaborations. Key themes include fast winning strategies, universality, connectivity, and Ramsey-type problems. Scientific Awards: No specific awards mentioned in the provided texts. Advising and Grants: While no explicit list of advisees or grants is given, his role as a research leader suggests involvement in mentoring students and securing research funding, likely supported by institutions such as the Simons Foundation (acknowledged in arXiv). Labs and Teams: He is affiliated with the Discrete Mathematics group at TUHH, contributing to collaborative research in combinatorics. He participates in academic networks such as the SIAM & GAMM Chapter Hamburg and workshops on Operator Theory, indicating active engagement in the mathematical community.

• Combinatorics
• Discrete Mathematics
• Positional Games
• +۷ مورد دیگر

Cristina G. Fernandes is an Associate Professor in the Department of Computer Science at the Institute of Mathematics and Statistics, University of São Paulo (IME-USP), where she conducts research in theoretical computer science, combinatorial optimization, and graph theory. She teaches advanced courses such as Advanced Data Structures and Topics in Algorithm Analysis. Her research interests include algorithms, combinatorial optimization, graph theory, approximation algorithms, data structures (persistent, retroactive, kinetic, succinct), and computational geometry. She applies theoretical methods to solve complex problems in network design, clustering, and discrete structures. The recent publications reflect a strong focus on structural and extremal graph theory, approximation algorithms, and combinatorial optimization. Key themes include tree and path packing, dominating sets, Steiner-type problems, and combinatorial properties of graphs. Her work often involves deep structural analysis and algorithmic design for NP-hard problems. Cristina G. Fernandes has not been mentioned with any specific scientific awards in the provided texts. She has supervised numerous postdoctoral researchers, PhD, MSc, and undergraduate students, many funded by FAPESP, CAPES, and CNPq. She leads significant research projects, including CAPES/MATH/STIC/CLIMAT-AMSU on energy efficiency in distributed computing and CNPq Universal projects on partitioning and connectivity. She is actively involved in academic advising and grant-funded research. She leads or participates in the Research Group in Theoretical Computer Science, Combinatorics and Combinatorial Optimization at IME-USP, fostering collaborative research in algorithms and discrete mathematics.

• Algorithms
• Combinatorial Optimization
• Graph Theory
• +۷ مورد دیگر

Dr. Maximilian Fürst is a researcher at the Institute of Optimization and Operations Research of the University of Ulm , focusing on graph theory, discrete mathematics, and algorithmic complexity. His work primarily investigates matching problems in graphs, including uniquely restricted matchings, induced matchings, and acyclic matchings, with applications in theoretical computer science and optimization. Research Interests: Graph Theory (matching theory, subcubic graphs, cycle-free graphs) Operations Research (approximation algorithms, linear programming) Computational Complexity (NP-hardness, graph invariants) Discrete Mathematics (combinatorics, degree sequences) Trends in Recent Publications: His publications emphasize theoretical analysis of graph problems, particularly matching-related algorithms and bounds. Key areas include hardness proofs, approximation methods, and extremal graph theory, with collaborations across European institutions. Teaching: He has taught courses such as Optimization and OR 2 and Graph Theory 2 at the University of Ulm since 2017. Collaborations: Regularly works with colleagues like Dr. Julien Baste, Prof. Dieter Rautenbach, and Prof. Michael A. Henning on graph theory and optimization challenges.

• Graph Theory
• Operations Research
• Discrete Mathematics
• +۳ مورد دیگر

Dr. Michael Gentner is a researcher at the Institute of Optimization and Operations Research, Ulm University, where he teaches courses including Angewandte Diskrete Mathematik (Combinatorics) and Advanced Discrete Algorithms. His institutional contact details include office Helmholtzstr. 18, Room 1.47, with Thursday office hours (14:00-16:00) and phone number +49 731 50-23637. His primary research focuses on structural graph theory and combinatorics, with expertise in domination theory, independence number, zero forcing sets, and extremal graph problems. Gentner investigates properties of graphs through degree sequences, clustering coefficients, and dynamic monopolies, particularly in specialized graph classes like forests and graphs without short cycles. Analysis of his 2015-2018 publications reveals consistent emphasis on establishing bounds and extremal values for graph invariants. His work bridges theoretical combinatorics with applications in network science, frequently collaborating with Dieter Rautenbach and other researchers in the field. Scientific Awards No scientific awards or honors were mentioned in the provided information. Advising and Grants No details regarding student supervision, PhD advisees, or research grants were found in the source material. Labs and Teams Gentner operates within Ulm University's Institute of Optimization and Operations Research, though specific laboratory structures or research team compositions are not detailed in the available text.

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +۲ مورد دیگر

Professor Christoph Thäle is a faculty member in the Faculty of Mathematics at Ruhr-Universität Bochum . His research focuses on stochastic geometry, geometric probability, limit theorems for random structures, and applications of Malliavin calculus and Stein's method. He has supervised numerous PhD and master's students, including Tristan Schiller, Nils Heerten, and Kathrin Meier. His work bridges theoretical probability with geometric analysis, particularly in high-dimensional spaces. Research Interests: Stochastic Geometry, Convex Geometry, Limit Theorems, Random Structures in High Dimensions Team Members: Postdocs (Panagiotis Spanos, Ercan Sönmez), PhD students (Philipp Tuchel, Bahareh Yousefi), and collaborators like Anna Gusakova and Zakhar Kabluchko. Key contributions include studies on random polytopes, Poisson hyperplane tessellations, and geometric analysis in hyperbolic spaces. His recent publications (2023–2025) explore intersection probabilities, radial spanning trees, and large deviations in high-dimensional settings. Thäle's research has been supported by collaborations with institutions like the University of Duisburg-Essen and the University of Osnabrück.

• Stochastic Geometry
• Geometric Probability
• Limit Theorems
• +۴ مورد دیگر