جست‌وجوی استاد و پژوهشگر

• Combinatorics
• Probabilistic Methods
• Random Graphs
• +۴ مورد دیگر

Rajko Nenadov is a Lecturer in Theoretical Computer Science at the University of Auckland, New Zealand. Previously, he earned his PhD from ETH Zurich in 2016 under Angelika Steger. He held postdoctoral positions at Monash University (Australia) and ETH Zurich, focusing on combinatorics and graph theory. Between 2018–2022, he worked as a software engineer at Google Zurich, contributing to search ranking algorithms. Returning to academia in 2023, his research emphasizes probabilistic methods, random structures, and applications in theoretical computer science. His education includes a PhD in Computer Science from ETH Zurich (2016). Notable career milestones include postdoctoral research on expanders, pseudorandomness, and Ramsey theory, followed by industry experience in algorithmic development. Rajko’s research interests revolve around combinatorics, with a focus on probabilistic methods, random graphs, extremal graph theory, and Ramsey theory. His work bridges foundational combinatorics with practical applications in computer science, particularly in algorithm design and computational complexity. His recent publications explore topics like hypergraph universality, container theorems, and extremal subgraph counting. These contributions highlight advancements in probabilistic combinatorics and structural graph theory. No scientific awards or grants are explicitly listed in the provided information. His career transition from academia to industry and back underscores his interdisciplinary expertise in theory and applied computing.

André Schulzمشاهده پروفایل

استاد

• Graph Theory
• Computational Geometry
• Algorithm Design
• +۳ مورد دیگر

Prof. André Schulz is a Professor at the Faculty MI, Department of Theoretical Computer Science, Distance University. His research focuses on graph theory, computational geometry, and algorithm design, with a strong emphasis on geometric graphs, graph drawing algorithms, and topological representations. He has published extensively in top-tier journals and conferences such as Discrete & Computational Geometry , Journal of Graph Algorithms and Applications , and Graph Drawing and Network Visualization . His work spans topics like adjacency graphs of polyhedral surfaces, Lombardi drawings of knots, and experimental analysis of graph visualization techniques. He collaborates internationally, co-authoring over 30 peer-reviewed articles since 2015. His research addresses challenges in geometric algorithms, graph embeddings, and combinatorial optimization, with applications in social network analysis and geometric topology. Key contributions include minimizing geometric primitives in planar graph drawings and developing efficient algorithms for 1-planar and cubic graphs. His recent work (2023–2024) explores orthogonal circle arrangements and schematic hypergraph layouts. Despite no explicit mention of awards or grants, his prolific publication record underscores his academic influence.

Adam Shefferمشاهده پروفایل

دانشیار

• Computational Geometry
• Discrete Mathematics
• Incidence Geometry
• +۳ مورد دیگر

Adam Sheffer is an Associate Professor of Mathematics at Baruch College and the Graduate Center of the City University of New York (CUNY). He is a member of Baruch's Discrete Math Group and serves as the Director of the NYC Discrete Math REU and the Baruch College Computer Science Program. His research focuses on computational geometry, discrete mathematics, and additive combinatorics, with notable contributions to incidence geometry and polynomial methods. He is the author of Polynomial Methods and Incidence Theory (Cambridge University Press) and an editor of the Journal of Computational Geometry . Sheffer's academic activities include organizing the Polymath Jr Program and the NYC Geometry Seminar. He has mentored numerous student research projects, several of which have led to published papers. Key research interests include geometric incidences, distinct distances problems, and combinatorial configurations. His work frequently bridges algebraic and geometric techniques to solve problems in discrete mathematics.

Sanjukta Bhowmickمشاهده پروفایل

دانشیار

• Computer Science
• Network Analysis
• Algorithms
• +۵ مورد دیگر

Sanjukta Bhowmick is an Associate Professor in the Department of Computer Science and Engineering at the University of North Texas, part of the College of Engineering. Her research focuses on network analysis, graph algorithms, parallel computing, and scalable data systems. She is actively involved in collaborative projects such as LEGAS (Learning Evolving Graphs At Scale) and MLN-DIVE (Multilayer Network Data Infrastructure for Visualization and Exploration), emphasizing interdisciplinary applications like precision agriculture and cybersecurity. Her work bridges theoretical foundations with practical implementations, addressing challenges in dynamic networks, community detection, and high-performance computing. Notable contributions include efficient algorithms for motif counting, centrality disruption analysis, and checkpointing systems optimized for GPU acceleration. She has co-authored numerous papers presented at conferences like SIAM Data Mining and HPC Symposium, showcasing her commitment to advancing computational methods for complex systems. Grants & Collaborations: Collaborative Research projects funded by NSF (SHF: Small, CSSI: CANDY), ANACIN-X framework for nondeterminism analysis, and multilayer network infrastructure initiatives. Key Themes: Network robustness, scalable parallel algorithms, graph-based machine learning, and interdisciplinary data-driven solutions. Her research emphasizes real-world applications, such as optimizing variable rate spraying in agriculture and enhancing fault tolerance in distributed systems. She actively contributes to workshops and symposiums, promoting co-design approaches for deep learning accelerators and high-performance computing systems.

Christoph Berkholzمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithm Design
• Computational Complexity
• +۳ مورد دیگر

Prof. Christoph Berkholz is a University Professor and head of the Algorithms Group at the Institute for Theoretical Computer Science within the Department of Computer Science and Automation at Humboldt-Universität zu Berlin since August 2022. He holds a PhD from RWTH Aachen University (2014) and completed postdoctoral research in Stockholm, Berlin, and Berkeley. Prior to his current role, he served as a Junior Professor of Logic and Complexity at Humboldt-Universität, leading the DFG-funded Emmy Noether Junior Research Group on Representation Complexity of Enumeration and Counting Algorithms. His research focuses on theoretical computer science, particularly algorithmic methods and their fundamental limits. Core questions driving his work include conditions for efficient algorithms, structural differences between 'light' and 'heavy' input instances, and the capabilities/limitations of algorithmic strategies. Research applications span query optimization in databases, SAT solving, and constraint solving. He has published ~30 papers and actively participates in program committees for AI, theoretical computer science, and database systems conferences. Prof. Berkholz's group investigates methods ranging from classical decision problems (e.g., propositional logic satisfiability) to dynamic algorithms supporting efficient updates. Key application areas include probabilistic databases and SAT/constraint-solving data structures. No specific awards are listed, though his Emmy Noether Research Group indicates significant grant recognition.

John Rickertمشاهده پروفایل

استاد

• Number Theory
• Diophantine Equations
• Partition Functions
• +۳ مورد دیگر

John Rickert is a Professor of Mathematics at Rose-Hulman Institute of Technology, specializing in number theory and Diophantine equations. He holds a PhD from the University of Michigan and BS degrees from the University of Wisconsin. His research focuses on topics such as partition functions, Pell-type equations, and simultaneous rational approximations. Beyond academia, he is renowned for applying mathematics to baseball, including advising on the design of Safeco Field’s retractable roof. Rickert is deeply involved in mathematics education, coordinating competitions like the Rose-Hulman High School Math Contest and serving as chief judge for MATHCOUNTS. He has received prestigious awards, including the Samuel Greitzer Distinguished Coach Award for his mentorship in ARML competitions. Education PhD in Mathematics, University of Michigan, 1990 BS in Astronomy-Physics and Mathematics, University of Wisconsin, 1984 Research Interests His work spans number theory, Diophantine approximations, and applications of mathematics in sports analytics. Recent projects include studies on composite number generation via digit appending and graph theory analysis of hypercube substructures. Awards George Polya Award, Mathematical Association of America Samuel L. Greitzer Distinguished Coach Award, American Regions Math League (2016) Teaching & Outreach Rickert teaches courses such as MA371 (Linear Algebra) and MA381 (Probability & Statistics), and mentors students at MIT’s Research Science Institute. He actively promotes math competitions, organizing events like the Alfred R. Schmidt Freshman Mathematics Competition and Indiana’s ARML team.

• Automorphic Forms
• Modular Forms
• Combinatorics
• +۷ مورد دیگر

Karl Mahlburg was an Associate Professor in the Department of Mathematics at Louisiana State University from 2011 to 2021. He holds a Ph.D. in Mathematics from the University of Wisconsin-Madison, an M.S. in Mathematics, and a B.S. in Mathematics from Harvey Mudd College. His research focuses on automorphic forms, partition theory, combinatorial number theory, and nonstandard analysis. Research interests include: Theory of automorphic forms including modular forms and harmonic Maass forms Applications to partition theory and basic hypergeometric series Algebraic and finite combinatorics including graph theory Combinatorial probability and nonstandard analysis Dr. Mahlburg has received several prestigious awards including the Humboldt Foundation Fellowship, LSU Faculty Excellence Award, and PNAS Paper of the Year Award for his groundbreaking work on partition congruences. His research has been supported by NSF grants and Louisiana Board of Regents funding. He has advised numerous graduate and undergraduate students in mathematics research, with doctoral students pursuing careers in academia and industry. Dr. Mahlburg organized LSU's Problem-Solving Seminar for undergraduate mathematics competitions and served on multiple departmental committees.

• Combinatorics
• Discrete Mathematics
• Algebra
• +۳ مورد دیگر

Ayomikun Adeniran is an Assistant Professor of Mathematics at Colby College, specializing in combinatorics and discrete mathematics. He holds a Ph.D. from Texas A&M University (2020). His research focuses on algebraic combinatorics, parking functions, Gončarov polynomials, and partition lattices. He currently teaches courses in multi-variable calculus, linear algebra, mathematical reasoning, and graph theory. His work bridges combinatorial structures with algebraic methods, exploring topics such as parking sequences, lattice theory, and enumerative combinatorics. Recent publications (2019–2022) emphasize interdisciplinary approaches to discrete mathematics problems. No scientific awards or grants are explicitly mentioned in the provided information. He advises no listed students but teaches across multiple undergraduate mathematics courses.

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

Carol T. Zamfirescu is a Professor in the Department of Applied Mathematics, Computer Science and Statistics at Universiteit Gent (University of Ghent). She holds a Dipl.-Math from TU Dortmund and a Ph.D. from UGent. Her research focuses on graph theory, combinatorics, and discrete mathematics, with particular emphasis on Hamiltonian cycles, planar graphs, and algorithmic graph theory. Educations: Dipl.-Math (TU Dortmund) Ph.D. (Universiteit Gent) Research interests span structural graph theory, including topics like hypohamiltonian graphs, cycle spectra, and graph embeddings. She is a member of the FWO (Research Foundation Flanders) W&T1 Fellowship panel on Mathematical Sciences since 2023, evaluating doctoral/postdoctoral fellowships. Her work often involves collaborations with computational methods, exploring properties of graphs such as fault-tolerance, spanning trees, and cycle covers. Recent contributions include studies on platypus graphs, edge-Kempe equivalence, and the Gromov-Hausdorff metric applied to graph spaces. Her research also addresses foundational questions in graph theory, such as the existence of non-hamiltonian polyhedra and the structure of cubic graphs with unique longest cycles. She has contributed to improving bounds for hypohamiltonian graphs and their computational generation.

Angelika Stegerمشاهده پروفایل

استاد

• Probabilistic Methods
• Randomized Algorithms
• Graph Theory
• +۳ مورد دیگر

Prof. Angelika Steger is a Full Professor in the Department of Computer Science at ETH Zurich, leading research in theoretical computer science since 2003. She holds a Master's in Applied Mathematics from Stony Brook University (1985) and a PhD from the University of Bonn (1990). Her career includes roles at Kiel, Duisburg, and TU München before joining ETH. She is a Leopoldina member (2007), ICM speaker (2014), and Collegium Helveticum Fellow (2009+). Research focuses on probabilistic methods, randomized algorithms, graph theory, and combinatorial optimization. She has contributed to understanding discrete structures, neural networks, and algorithmic resilience. Awards include recognition in both computer science and mathematics circles. Her work bridges theoretical foundations with applications in AI, neuroscience, and distributed systems.

Cansin Yaman Evrenosogluمشاهده پروفایل

پژوهشگر

• Electric Power Engineering
• Renewable Energy Integration
• Energy Storage Systems
• +۵ مورد دیگر

Cansin Yaman Evrenosoglu is a Principal Expert at the Research Center for Energy Networks (FEN) at ETH Zürich, Switzerland. His academic journey includes a B.S. and M.S. in Electrical Power Engineering from Istanbul Technical University (1998–2001) and a Ph.D. in Electrical and Computer Engineering from Texas A&M University (2006). Prior to FEN, he held roles such as Assistant Professor at Virginia Tech (2011–2013) and University of Nevada Reno (2008–2011), and Principal Scientist at ABB Corporate Research (2013–2019). His research focuses on electric power grids, including design, operation, and protection of transmission/distribution systems. Key areas include secure integration of renewable energy sources, high-penetration scenarios with energy storage systems, electric vehicles, solar PVs, and heat pumps. He is a Senior Member of IEEE and served as Editor for the IEEE Transactions on Smart Grid (2014–2019). Evrenosoglu has supervised numerous students, including PhD graduates Meghana M. Reddy and Alexandra Weinberger, and has contributed to projects like the Arrangements and Drawings initiative. His work spans academic and industrial collaborations, emphasizing infrastructure planning and smart grid technologies.

Hermina Alajbegovićمشاهده پروفایل

دانشیار

• Mathematics
• Graph Theory
• Cryptography
• +۳ مورد دیگر

Hermina Alajbegović is an Associate Professor at the Department of Mathematics and Informatics, Faculty of Mechanical Engineering, University of Zenica. She holds a Ph.D. in Mathematics from the University of Sarajevo, focusing on crystallographic groups and subgroup growth. Her career includes roles as an assistant (2003–2008) and postgraduate studies in Algebra (2003–2008). She has authored over 20 publications, spanning graph theory, cryptography, and mathematical software applications like Mathematica and GAP. Education: B.Sc. in Mathematics & Computer Science (2003), M.Sc. in Algebra (2008), Ph.D. in Mathematics (2016). Research interests include algebraic structures, graph theory applications, and mathematical software tools. Notable works involve quasi-regular graph constructions, divisor problem asymptotics, and zeta function analyses in crystallographic groups. She has developed educational tools like web applications for modular arithmetic and interactive e-learning modules using PowerPoint for quiz design. Her publications reflect a blend of theoretical mathematics and practical applications, with recent focus on graph theory and subgroup growth analysis. She actively contributes to academic software integration and problem-solving methodologies in mathematics education.

Yifan Jingمشاهده پروفایل

استادیار

• Additive and Combinatorial Number Theory
• Combinatorics and Graph Theory
• Harmonic Analysis
• +۸ مورد دیگر

Yifan Jing is an Assistant Professor in the Department of Mathematics at The Ohio State University (OSU). He previously held postdoctoral positions at the University of Oxford’s Mathematical Institute and Wolfson College, mentored by Ben Green. His academic journey includes a PhD from the University of Illinois Urbana-Champaign (2021), supervised by József Balogh and Xiaochun Li, an M.Sc. from Simon Fraser University (2018) under Bojan Mohar, and a B.Sc. from the University of Science and Technology of China (2016), advised by Jack Koolen. His research focuses on Arithmetic Combinatorics, Analytic and Combinatorial Group Theory, Lie groups, Abstract Harmonic Analysis, Representation Theory, Additive Number Theory, Model Theory applications, Discrete Probability, and Theoretical Computer Science. Notable contributions include work on measure growth in Lie groups, inverse theorems for geometric inequalities, and structural graph theory. He received the 2023 Kirkman Medal for his research contributions. He currently organizes OSU’s Combinatorics Seminar and teaches Math 4507: Geometry. His advising includes PhD students Yewen Sun, Chavdar Lalov, and Yuchen Meng, alongside mentoring multiple undergraduate researchers at Oxford. Collaborators include leading mathematicians such as Chieu-Minh Tran, Ruixiang Zhang, and Bojan Mohar. His work bridges analysis, algebra, and logic to address problems across combinatorics, number theory, and geometry.

Demetres Christofidesمشاهده پروفایل

دانشیار

• Combinatorics
• Random Graphs
• Extremal Graph Theory
• +۱۰ مورد دیگر

Dr. Demetres Christofides is an Associate Professor in Mathematics and Course Leader of BSc (Hons) Mathematics & Statistics at the University of Central Lancashire Cyprus (UCLan Cyprus). He holds a PhD in Mathematics from the University of Cambridge (2008), alongside advanced qualifications from Cambridge including a BA (2003), MA (2007), and Certificate of Advanced Study in Mathematics (2004). Affiliations: School of Sciences, Department of Mathematics. Administrative Roles: Former Senate Member (2015–2020), Deputy Head of School (2017–2018), and Academic Standards Lead (2017–2020). Research Interests: Focuses on combinatorics, including random graphs, extremal graph theory, positional games, and algorithmic graph theory. His work spans Hamilton cycles, Cayley graphs, information theory, and structural graph properties. He has contributed to over 10 peer-reviewed publications in journals like Journal of Combinatorial Theory and SIAM Journal on Discrete Mathematics . Funding & Grants: Secured research grants from the Cyprus Research Promotion Foundation and the EPSRC, including projects on extremal combinatorics and graph algorithms. Awards: Smith Prize (University of Cambridge). Outreach: Trains Cypriot Mathematical Olympiad teams, creates problems for international competitions (e.g., IMO Shortlist 2020), and co-authored a training book for high-school mathematics competitions. Teaching: Leads and teaches modules across all undergraduate years, including Real Analysis, Algebra, and Complex Analysis. Previously taught at Charles University, Warwick, and Birmingham.

• Artificial Intelligence
• Optimization
• Scheduling
• +۴ مورد دیگر

Marie-Louise Lackner is a Research Fellow (PostDoc Researcher) in the Department of Databases and Artificial Intelligence at Technische Universität Wien. She holds Diplom-Ingenieur and Dr. techn. degrees and actively contributes to the CD Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling (2017–2025). Her research focuses on Artificial Intelligence and Optimization , with emphasis on industrial scheduling, constraint programming, and algorithm design. Key domains include: Industrial oven scheduling and production leveling Metaheuristics (simulated annealing, large neighborhood search) Multi-objective optimization in manufacturing systems Combinatorial mathematics and discrete structures Her publications demonstrate a strong trajectory in applied optimization , with recent work concentrating on energy-efficient scheduling algorithms for electronic manufacturing, while earlier research explored permutation patterns and social choice theory. Methodologies consistently integrate theoretical computer science with industrial problem-solving. She supervises graduate researchers, including P. Malik's work on memetic algorithms for production leveling. Grant involvement includes the CD Laboratory project focused on AI-driven planning systems. Lackner is affiliated with the CD Laboratory for Artificial Intelligence and Optimization, conducting applied research in industrial scheduling systems within TU Wien's Databases and AI group.