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

• Mixed-Integer Optimization
• Combinatorial Optimization
• Discrete Mathematics
• +۳ مورد دیگر

Timm Oertel is a Professor in the Department of Data Science at Friedrich Alexander University Erlangen-Nuremberg (FAU), holding the Chair of Analytics & Mixed-Integer Optimization. His office is located in Room 03.344 at Cauerstraße 11, Erlangen, and he can be contacted via email at timm.oertel@fau.de or phone at +49 9131 85-67313. His research focuses on mixed-integer optimization, combinatorial optimization, and discrete mathematics, with significant contributions to sparse solutions in lattices and semigroups, integer Carathéodory rank, knapsack polyhedra, and parametric integer optimization. His work bridges theoretical computer science, operations research, and discrete geometry, emphasizing structural properties of integer solutions and algorithmic efficiency. Professor Oertel's publication record (2013-2025) reveals consistent trends in theoretical integer programming, with recent work (2020-2025) concentrating on sparsity patterns, approximation in algebraic structures, and complexity bounds. He frequently collaborates with leading researchers including Iskander Aliev, Robert Weismantel, and Joseph Paat, publishing in top venues like Mathematical Programming and SIAM Journal on Optimization. His research demonstrates deep connections between combinatorial geometry and optimization theory.

• Optimization
• Mixed-Integer Programming
• Lattice Theory
• +۵ مورد دیگر

Professor Timm Oertel is a leading academic at the Department of Data Science (DDS) at Friedrich Alexander University Erlangen-Nuremberg, where he holds the Chair of Analytics & Mixed-Integer Optimization. His research has established him as a significant contributor to the field of mathematical optimization, with a particular focus on integer programming and its applications. Professor Oertel's research interests center on mathematical optimization , specifically mixed-integer programming , lattice theory , semigroups , and combinatorial optimization . His work explores fundamental questions about sparsity in integer solutions, properties of lattice points in polyhedra, and the theoretical foundations of optimization algorithms. His research bridges pure mathematics with practical applications in operations research and computer science. An analysis of Professor Oertel's publication record reveals a strong thematic consistency with evolving depth. His work consistently addresses sparsity phenomena in integer programming, structural properties of lattices and semigroups, and computational complexity aspects of optimization problems. The publications demonstrate increasing sophistication in handling block-structured problems and parametric optimization scenarios, with recent work extending to colorful variants of classical geometric lemmas applied to integer programming. Professor Oertel has established productive collaborations with leading researchers including Iskander Aliev, Robert Weismantel, and Joseph Paat. His research has been consistently published in top-tier venues including Mathematical Programming , SIAM Journal on Optimization , and the prestigious IPCO (Integer Programming and Combinatorial Optimization) conference series. These publications reflect rigorous theoretical contributions with potential applications across operations research, computer science, and discrete mathematics.

Marco Di Summaمشاهده پروفایل

استاد

• Integer Programming
• Polyhedral Combinatorics
• Combinatorial Optimization
• +۲ مورد دیگر

Marco Di Summa is a Full Professor of Operations Research at the Department of Mathematics , University of Padua (Italy) since May 2023. He was previously an Associate Professor (2015-2023) and Assistant Professor (2011-2015) at the same institution. His research focuses on fundamental aspects of integer and mixed-integer linear programming, polyhedral combinatorics, and combinatorial optimization. Research Trends Marco's recent work (2021-2023) examines computational complexity in mixed-integer optimization, split cuts in two-dimensional spaces, and lower bounds for ReLU neural network depth. Earlier studies (2015-2020) address extreme functions, critical node detection, and theoretical properties of convex hulls and S-free sets. His publications span journals like Mathematical Programming , SIAM Journal on Optimization , and Operations Research Letters , with conference contributions at IPCO and SODA. Teaching Marco teaches Mathematics for Food Science undergraduates, Discrete Optimization in Mathematics bachelor's programs, and Optimization at the master's level.

Ramakrishna Upadrastaمشاهده پروفایل

دانشیار

• Domain Specific Programming Languages for Parallelization
• LLVM Optimizations
• Polyhedral Compilation
• +۶ مورد دیگر

Ramakrishna Upadrasta is an Associate Professor in the Department of Computer Science & Engineering and Heritage Science & Technology at Indian Institute of Technology Hyderabad. He earned his PhD from University of Paris-Sud and INRIA, Paris, with a focus on improving scalability in polyhedral compilation tools. His academic journey includes an M.S. from Colorado State University, M.Tech from Indian Institute of Science (IISc), and B.E. in Electrical and Electronics Engineering from Andhra University. His research expertise includes: Domain Specific Programming Languages for Parallelization LLVM Optimizations Polyhedral Compilation Abstract Interpretation Sub-polyhedral Approximations High-Performance Computing (HPC) He leads the IITH-LLVM group and collaborates with industries on compiler technologies. His work addresses scalability vs. precision trade-offs in static analysis tools and extends polyhedral compilation frameworks like Pluto and Polly. Scientific Recognition : HiPEAC paper award for his POPL-2013 publication As an educator, he has taught advanced compiler courses (e.g., CS6250, CS5260) and coordinated interdisciplinary initiatives, including Sanskrit language courses via Samskrita Bharati. His students span PhD, M.Tech, and B.Tech levels, focusing on compiler design and parallelization.