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

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +۳ مورد دیگر

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
• +۳ مورد دیگر

Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.

• Probability Theory
• Statistical Physics
• Mathematical Physics
• +۷ مورد دیگر

Prof. Laura Vargas Koch serves as Junior Professor at RWTH Aachen University, leading the Teaching and Research Unit of Algorithmic Game Theory and Discrete Mathematics (GDM). Her interdisciplinary work bridges mathematics, computer science, and economics through rigorous theoretical frameworks. Her research focuses on: Algorithmic Game Theory : Analyzing fair pricing mechanisms and equilibrium structures in traffic flow systems Combinatorial Optimization : Developing approximation algorithms for clustering problems and graph-based optimization Analysis of her 2021-2025 publications reveals evolving expertise in dynamic traffic modeling, routing game equilibria, and auction mechanism design. Her work consistently addresses theoretical foundations while maintaining practical relevance to transportation networks and resource allocation systems. The GDM unit under her direction provides specialized coursework and fosters collaborative research at the intersection of discrete mathematics and economic modeling.

• Algorithmic Game Theory
• Combinatorial Optimization
• Traffic Flow Equilibria
• +۴ مورد دیگر

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
• +۴ مورد دیگر

Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.

• Theoretical Computer Science
• Algorithms and Data Structures
• Computational Geometry
• +۵ مورد دیگر

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
• +۴ مورد دیگر

Prof. Johannes Carmesin is a Professor at the Faculty for Mathematics and Computer Science, Technische Universität Bergakademie Freiberg. His research focuses on advanced topics in Graph Theory, Combinatorics, and Topology, with notable contributions to 3-dimensional Kuratowski-type theorems and the extension of Structural Graph Theory to simplicial complexes. He leads the Discrete Structures group, which explores areas including Graph Minors, Matroid Theory, and Infinite Graphs. Education and Career: He holds a PhD (2015) and Habilitation (2018) in Mathematics, with earlier work on harmonic functions in networks (Master's 2012). His academic journey includes research on infinite matroids and tree-decompositions. Research Interests: Carmesin’s work bridges discrete mathematics and topology, emphasizing structural properties of graphs and their embeddings. Key areas include 3D graph embeddings, connectivity in infinite graphs, and matroid characterizations. He has pioneered methods for analyzing 2-dimensional simplicial complexes and their topological representations. Recent Trends in Publications: His recent work extends Graph Minor Theory to temporal networks and 3D spaces, with a focus on canonical decompositions, tangle theory, and applications in large-scale network analysis. His 2023 European Prize in Combinatorics recognizes breakthroughs in 3D Kuratowski analogues. Awards: European Prize in Combinatorics (2023) Advising and Team: Supervised PhD students Emily Nevinson and Tsvetomir Mihaylov, and mentored master’s students like Will J. Turner. His research team includes Dr. Jan Kurkofka and Dr. Matthew Kroeker. Notable collaborations address infinite graph connectivity and Stallings-type theorems for finite groups. Labs/Groups: Directs the Discrete Structures research group, which hosts regular seminars and collaborates internationally. Past members include Georgios Kontogeorgiou and Lyuben Lichev as interns.

• Graph Theory
• Combinatorics
• Topology
• +۳ مورد دیگر

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
• +۷ مورد دیگر

Markus Heydenreich is a Professor at the Institute of Mathematics, Faculty of Mathematics, Natural Sciences and Technology, University of Augsburg. His research focuses on probability theory, particularly discrete random objects in statistical mechanics, mean-field behavior, lace expansion, and spatial random graph models. 2025: Workshop Bayrischzell 2024: Workshop Frauenchiemsee His recent publications highlight critical phenomena in random connection models, percolation, and spatial networks. He contributes to editorial boards and DFG-funded projects, including Random Geometric Systems and Mathematics of Many-Body Quantum Systems . Teaching includes courses on stochastic processes and seminars on probability and forensics. Key research themes: phase transitions, high-dimensional random walks, and mathematical physics applications. Collaborators include Remco van der Hofstad, Christian Hirsch, and Kilian Matzke. The team at Augsburg comprises doctoral researchers and postdocs.

• Probability Theory
• Statistical Mechanics
• Random Graphs
• +۷ مورد دیگر

Alice Niemeyer is a Professor at the Algebra Teaching and Research Area of RWTH Aachen University , specializing in computational algebra, finite group theory, and interdisciplinary applications in civil engineering. She has co-authored over 30 publications in journals like PNAS Nexus , Linear Algebra and Its Applications , and International Journal of Solids and Structures , with recent work bridging abstract algebra and topological interlocking concrete systems. Research Interests : Finite groups, matrix decomposition algorithms, combinatorial design, and applications to sustainable construction. Key Collaborators : Cheryl Praeger, Tomasz Popiel, Wilhelm Plesken, Daniel Robertz, Reymond Akpanya. Notable Grants : Funding from the Simons Foundation for computational algebra research. Awards : No explicit awards mentioned in the provided text.

• Computational Algebra
• Finite Group Theory
• Combinatorics
• +۷ مورد دیگر

Artur Czumaj is a Professor of Computer Science and Director of the Center for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick, United Kingdom. He is a member of the Global Faculty at the University of Cologne and serves as President of the European Association for Theoretical Computer Science (EATCS). PhD and Habilitation from University of Paderborn Recipient of the IBM Award and Fellow of EATCS His research focuses on theoretical computer science, particularly in the design of randomized algorithms, analysis of large data, and applications to parallel/distributed computing, property testing, sublinear algorithms, optimization algorithms, and algorithmic game theory. His work has been funded by major institutions including EPSRC, NSF, Royal Society, European Union, Simons Foundation, and IBM. The 15 most recent publications reflect expertise in graph algorithms, distributed systems, approximation techniques, and algorithmic complexity. His research spans foundational algorithm design to practical applications in large-scale data processing. Fellow of the European Association for Theoretical Computer Science (EATCS) IBM Award recipient Czumaj has held leadership roles in prominent conferences, including Program Committee Chair for STOC, ICALP, SODA, and HALG. His academic career is supported by grants from multiple international research councils and organizations.

• Theoretical Computer Science
• Randomized Algorithms
• Parallel and Distributed Computing
• +۴ مورد دیگر

Prof. Dr. Anna Dall'Acqua holds a position as University Professor (Univ.-Prof.) at the Institute for Applied Analysis, Universität Ulm. Her research focuses on partial differential equations, calculus of variations, geometric analysis, and mathematical physics, with specific interests in higher-order elliptic problems, elastic curves, Willmore surfaces, and Hartree-Fock theory. She leads a research group and has supervised doctoral students including Gabriel Knöbl and Manuel Schlierf. Her work is supported by grants from the German Research Foundation (DFG) and Taiwan’s MoST. Recent research includes studies on elastic networks, Willmore flow of tori, and obstacle problems in elasticity. She teaches advanced courses such as Functional Analysis, Calculus of Variations, and Analysis series at the university. Prof. Dall'Acqua’s publications span over two decades, with contributions to journals like Calc. Var. PDEs , Journal of Differential Equations , and Analysis & PDE . Her habilitation thesis (2011) and earlier work on boundary value problems and pseudorelativistic Hartree-Fock systems highlight her interdisciplinary expertise.

• Partial Differential Equations
• Calculus of Variations
• Geometric Analysis
• +۵ مورد دیگر

Torsten Ueckerdt is an Interim Professor in the Algorithmics I group at the Institute of Theoretical Informatics, Karlsruher Institut für Technologie (KIT). He has held academic positions since 2012, including postdoctoral roles and habilitation in Discrete Mathematics. His research focuses on combinatorial objects like graphs, posets, and hypergraphs in geometric settings, exploring structural properties, colorings, and geometric representations. Holds a PhD from TU Berlin (2011) and habilitation from KIT (2017). Professional service includes editorial roles (Annals of Combinatorics) and program committees for conferences like Graph Drawing, SoCG, and EuroCG. Supervised numerous students across Bachelor's, Master's, and diploma theses. Research interests span structural graph theory, geometric graph theory, Ramsey theory, discrete geometry, and combinatorial games. Active in graph drawing and algorithm design, with contributions to queue layouts, graph representations, and optimization problems like cartograms and wind farm cabling.

• Graph Theory
• Geometric Graph Theory
• Discrete Mathematics
• +۸ مورد دیگر

Sebastian Eckert is a researcher at the Faculty of Mathematics , Bielefeld University , with prior postdoctoral experience at the Max Planck Institute for Mathematics in Bonn . His academic career includes PhD research under Prof. Dr. William Crawley-Boevey and MSc supervision by Prof. Dr. Henning Krause at Bielefeld University. Education : BSc (Bielefeld), MSc (Bielefeld), PhD (Bielefeld, 2022). Research Interests focus on the representation theory of finite-dimensional algebr with emphasis on amenable representation type , tame/wild dichotomy , and quiver theory . He explores connections between algebraic structures and graph theory to classify module families, particularly addressing Elek's conjecture linking tame algebras to amenable type. Article Trends reveal a progression from verifying amenable type for tame hereditary path algebras (2023) to generalizing these results to clannish algebras (2022) and Kronecker quivers (2022), while disproving amenability for wild algebras using dimension expanders (2020-2022). His work bridges abstract algebra with concrete applications in mathematical analysis. Grants & Projects include coordination of the International Research Training Group 2235 (IRTG 2235/2: "The Regular in the Irregular") funded by the German Research Foundation (DFG), and participation in third-party funded projects since 2016.

• Representation Theory of Finite Dimensional Algebras
• Amenable Representation Type
• Tame and Wild Algebras
• +۳ مورد دیگر