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

Marc Hellmuthمشاهده پروفایل

دانشیار

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

Marc Hellmuth is an Associate Professor of Computational Mathematics at the Department of Mathematics, Stockholm University, Sweden. His academic career includes previous positions as Junior Professor for Biomathematics and Computer Science at University of Greifswald, Germany (2015-2020), Lecturer at School of Computing, University of Leeds, UK (2020), and PostDoc positions at Saarland University and Max-Planck Institutes. Dr. Hellmuth earned his PhD in Computer Science from University of Leipzig, Germany (2007-2010, summa cum laude), supervised by Peter F. Stadler, and completed his Venia Legendi (habilitation) at Saarland University, Germany (2016). His research spans the interface of discrete mathematics, computer science, and life sciences with emphasis on: Discrete Mathematics including Graph Theory, Combinatorics, and Optimization Algorithm Design and Complexity Theory Mathematical and Computational Biology Phylogenomics and Evolutionary Analysis Computational Chemistry and Atom Tracking His publication record demonstrates a consistent focus on developing mathematical frameworks and efficient algorithms for biological problems, particularly in phylogenomics, orthology detection, and evolutionary analysis. His work bridges theoretical computer science with practical applications in biology and chemistry, often resulting in open-source software tools. Dr. Hellmuth has developed numerous software tools including AsymmeTree for phylogenetic simulation, tralda for tree algorithms, and specialized tools for phylogenomics, atom tracking, and graph analysis. His collaborative work extends internationally with research visits to institutions including Yale University, University of Leoben, Vienna University of Economics, University of Southern Denmark, Université de Montréal, and institutions in China.

Erik Carlssonمشاهده پروفایل

استاد

• representation theory
• algebraic geometry
• algebraic combinatorics
• +۵ مورد دیگر

Erik Carlsson is a Professor in the Mathematics department at the University of California, Davis. His research spans multiple areas of pure and applied mathematics, connecting deep theoretical concepts with practical computational applications. He received his Ph.D. from Princeton University under Professor Andrei Okounkov in 2008, and a B.S. in Mathematics with honors and a minor in Computer Science from Stanford University in 2003. Carlsson's research focuses on representation theory, algebraic geometry, algebraic combinatorics, computational topology, and connections with nonconvex optimization. He is particularly interested in connections between Goresky-Kottwitz-Macpherson (GKM) spaces and applications to Macdonald theory and combinatorics. His work also includes computational topology, especially persistent homology, which he develops in collaboration with John Carlsson. One of his recent developments is a method for constructing the alpha complex in high dimension using the powerful duality principle in mathematical optimization. His recent publications show a clear trend toward bridging theoretical mathematics with computational applications. His work spans from proving deep conjectures in algebraic combinatorics (like the shuffle conjecture) to developing practical algorithms for topological data analysis. The interdisciplinary nature of his work connects pure mathematical theory with applications in data science, computer vision, and optimization problems. Carlsson has made significant contributions to multiple fields of mathematics through his collaborations and independent work. His research has implications for both theoretical mathematics and practical computational problems, with recent publications as of 2024 demonstrating his continued active research program.

• Finite Fields
• Cryptography
• Coding Theory
• +۴ مورد دیگر

Qiang (Steven) Wang is a Professor in the School of Mathematics and Statistics at Carleton University. His academic career spans several decades with a strong focus on finite fields and their applications in cryptography and coding theory. He maintains an active teaching schedule including courses like Abstract Algebra, Rings and Fields, and Fields and Coding Theory. Professor Wang's research interests center on Finite Fields and Applications in Cryptography and Coding Theory, Combinatorics, Algebra and Number Theory. His work particularly focuses on polynomials and functions over finite fields, sequences over finite fields, and applications in Coding Theory and Cryptography. He has made significant contributions to the study of irreducible polynomials, permutation polynomials, primitive polynomials, planar functions, Boolean functions, LFSR and NLFSR sequences, de Bruijn sequences, stream ciphers, pseudorandom generators, and linear complexity. His research bridges theoretical mathematics with practical cryptographic implementations. His extensive publication record shows a consistent and growing research program, with numerous publications in top-tier journals including Designs, Codes and Cryptography, Finite Fields and Their Applications, and Cryptography and Communications. His most recent work (2022-2024) has increasingly focused on compositional inverses of permutation polynomials, stable polynomials, additive codes with few weights, and generalized cyclotomic mappings, while maintaining strong connections to cryptographic applications. Editorial board member of Applicable Algebra in Engineering, Communication and Computing, Springer Editorial board member of Finite Fields and their Applications, Elsevier Professor Wang actively contributes to the academic community through his editorial work and seminar organization. He coordinates the Carleton Finite Fields eSeminar and participates in the Ottawa-Carleton Combinatorics and Optimization Seminar, fostering research collaboration in discrete mathematics and related fields. His teaching portfolio is diverse, covering both undergraduate and graduate courses that reflect his broad expertise across algebraic structures, coding theory, and discrete mathematics.

Aravind N.R.مشاهده پروفایل

دانشیار

• Algorithms
• Graph Theory
• Combinatorics
• +۵ مورد دیگر

Dr. N.R. Aravind is an Associate Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Hyderabad. Holding a Ph.D. in Theoretical Computer Science from The Institute of Mathematical Sciences, Chennai, he is affiliated with the College of Engineering. His research spans algorithms, graph theory, combinatorics, and determinantal complexity, with a focus on parameterized algorithms and approximation techniques for NP-hard problems. Education: Ph.D., The Institute of Mathematical Sciences, Chennai (Advisor: Prof. C.R. Subramanian) Postdoctoral research under Prof. Sundar Vishwanathan at IIT Bombay Aravind's research explores structural questions in graph theory, social network modeling, and complexity bounds. His work on parameterized algorithms addresses tractable instances via input parameters, while his studies in graph coloring and forbidden subgraphs contribute to theoretical understanding. Recent publications focus on matching cut problems, happy coloring, and determinantal complexity. His 15 most recent publications (2010-2024) span computational complexity, graph algorithms, coloring problems, and determinantal complexity. These works emphasize parameterized approaches, structural graph theory, and algorithmic bounds for intractable problems. Scientific Awards: Aravind has mentored numerous PhD and MTech students, including Roopam Saxena, Anjeneya Swami Kare, and R.B. Sandeep, now holding academic positions at prestigious institutions. He has taught courses like Algorithms, Probability in Computing, and Cryptology, often collaborating with co-instructors such as Dr. Rakesh Venkat. His office is located in Room CS-408, Indian Institute of Technology Hyderabad.

• Algorithms
• Randomized Data Structures
• Divide-and-Conquer Algorithms
• +۵ مورد دیگر

Salvador Roura Ferret is a faculty member at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the Department of Computer Sciences. He is an active researcher in the ALBCOM group, focusing on algorithmics, bioinformatics, complexity, and formal methods. His research interests span algorithms , randomized data structures , divide-and-conquer methods , and computational complexity . His work often bridges theoretical computer science with practical applications in voting systems, game theory, and educational technologies. The recent publications (2013–2025) reflect a strong trend in theoretical computer science, particularly in algorithm design, data structures (e.g., K-d trees, binary search trees), and game-theoretic models. There is a notable emphasis on mathematical rigor, complexity analysis, and formal modeling of computational problems. Best student paper award Distinció Jaume Vicenç Vives a la qualitat docent universitària (modalitat individual) 18è Premi UPC a la Qualitat en la Docència Universitària Roura has contributed to teaching innovation through projects like Eines per a la Transformació de la Docència en Programació and the development of Jutge.org , an online programming judge platform. He has participated in numerous competitive R+D+i projects, often in collaboration with researchers such as Conrado Martinez, Xavier Molinero, and Maria Serna. His work has been supported by national and regional funding programs. While no direct mention of grants or student advising is made, his extensive publication and project history suggest significant research leadership.

Maria Ivanمشاهده پروفایل

مدرس

• Extremal Combinatorics
• Ramsey Theory
• Poset Saturation

Dr. Maria Ivan is a Lecturer in the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge and holds a Fellowship at Magdalene College. Her primary academic appointment involves research and teaching in advanced mathematical disciplines. Her research focuses on several interconnected areas of combinatorics: Extremal Combinatorics : Investigating maximum/minimum possible sizes of mathematical structures Ramsey Theory : Studying conditions under which order must appear in mathematical systems Poset Saturation : Examining partially ordered sets that are maximally dense without containing certain substructures Analysis of her 15 most recent publications (2020-2025) reveals consistent focus on combinatorial structures including poset saturation problems, Turán densities for hypercubes and daisies, Ramsey-theoretic characterizations, and extremal set theory. Her work frequently involves establishing new bounds, solving open conjectures, and developing novel proof techniques within discrete mathematics. No scientific awards, grants, or student advising relationships are documented in the available information.

José Alejandro Samperمشاهده پروفایل

استادیار

• Algebraic Combinatorics
• Geometric Combinatorics
• Topological Combinatorics
• +۵ مورد دیگر

Dr. José Alejandro Samper is an Assistant Professor of Mathematics at Pontificia Universidad Católica de Chile (PUC Chile), specializing in algebraic, geometric, and topological combinatorics. His research focuses on simplicial complexes, matroids, polytopes, and convex bodies, with a particular interest in the implications of linear orderings on matroids. Current affiliation: Mathematics Department, PUC Chile Previous positions: Postdoctoral fellow at Max Planck Institute for Mathematics in the Sciences (MPI), postdoc at ICERM and University of Miami PhD: University of Washington under Isabella Novik His research spans combinatorial structures with deep connections to algebraic geometry and topology, including studies on shellability, higher chordality, and matroidal relaxations. Recent publications highlight interactions between matroid theory, polytopes, and convex geometry, with a focus on topological constraints and Hopf algebraic structures. Dr. Samper co-organizes key mathematical events such as the Cibercoloquio Latinoamericano de Matemáticas and the Club de Matemáticas UC. He is accessible via email at jsamper@uc.cl.

Nicolas Reschمشاهده پروفایل

استادیار

• Coding Theory
• Cryptography
• Theoretical Computer Science
• +۱ مورد دیگر

Nicolas Resch is an Assistant Professor at the Theoretical Computer Science Group within the Informatics Institute at the University of Amsterdam (UvA). His research focuses on coding theory, cryptography, and their intersections, with prior postdoctoral work at Centrum Wiskunde & Informatica (CWI) under Ronald Cramer. He earned his PhD from Carnegie Mellon University (CMU) advised by Venkatesan Guruswami and Bernhard Haeupler. Education: PhD (CMU), advised by Venkatesan Guruswami and Bernhard Haeupler. Resch's research addresses theoretical challenges in code-based cryptography, list decoding, and secure communication. His work includes advancements in randomness-efficient codes, smoothing bounds for lattices, and protocols for oblivious transfer and interactive coding. Articles reflect trends in post-quantum cryptography, error-correcting codes, and computational complexity. He has received the 2022 Veni award from NWO for his proposal "Secure and Efficient Code-Based Cryptography" and is invited to key workshops such as Oberwolfach (2025) and TIFR ICTS (2025). His supervision includes PhD students Lydia Tasiou and Martijn Brehm, alongside MSc and BSc advisees. Scientific Awards: 2022 Veni laureate (NWO) Resch teaches courses in information theory and modern cryptography at the UvA, with recent invitations to Simons Institute programs and Oberwolfach workshops. His work bridges theoretical foundations with practical cryptographic applications.

Christopher Hojnyمشاهده پروفایل

استادیار

• Mixed-Integer Programming
• Symmetry Handling in Optimization
• Combinatorial Optimization
• +۳ مورد دیگر

Christopher Hojny is an Assistant Professor at the Department of Mathematics and Computer Science at Eindhoven University of Technology , specializing in combinatorial optimization. He contributes to the EAISI Foundational group and co-develops the academic solver SCIP . His research focuses on symmetry handling in mixed-integer programming , theoretical properties of integer programs, and algorithm development for combinatorial optimization. Recent work explores applications in graph neural network verification , clustering problems, and network coding through mixed-integer programming frameworks. Key publication trends show expertise in Symmetry detection and mitigation techniques Relaxation complexity theory Applications to machine learning robustness Decision diagram-based scheduling Scientific contributions include Proof systems for symmetry certification Topological bounds tightening in GNNs Stable set problem symmetry handling SCIP solver extensions He supervises PhD students Cédric Roy (NWO project on Local Symmetries) and Sten Wessel (co-supervised with Frits Spieksma), while Jasper van Doornmalen (2019-2023) investigated symmetry propagation algorithms.

Terry Johnsonمشاهده پروفایل

استاد آموزشی

• Chemical Engineering
• Tissue Engineering
• Synthetic Biology
• +۲ مورد دیگر

Terry D. Johnson is Senior Instructional Professor and Program Director for the Master of Engineering at the University of Chicago's Pritzker School of Molecular Engineering. He holds an MS in Chemical Engineering from MIT and is an emeritus Teaching Professor from UC Berkeley, where he co-founded the Masters of Translational Medicine program. Research integrates engineering and biomedicine, with patented innovations in tissue engineering and synthetic biology. Recent work develops sustainable textile dyeing technologies eliminating toxic reductants. Earlier projects include microfluidic hepatocyte cultures and EGF-functionalized biomaterials. Awards: Golden Apple Award for Outstanding Teaching (UC Berkeley 2010) Distinguished Teaching Award (UC Berkeley 2013) Co-authored the popular science book How to Defeat Your Own Clone . Teaches molecular engineering courses and directs master's programs bridging technical innovation and medical translation.

• Probabilistic Combinatorics
• Extremal Combinatorics
• Random Structures
• +۱ مورد دیگر

Michael Krivelevich is a Full Professor at the School of Mathematical Sciences, Tel Aviv University, holding this position since 2005. He previously served as Associate Professor (2002-2005) and Senior Lecturer (1999-2002) at the same institution. From 2015 to 2020, he acted as Dean of the Faculty of Exact Sciences at Tel Aviv University. Research Interests: Probabilistic and extremal combinatorics Random structures Applications of combinatorics to computer science Scientific Contributions: Authored two books: Positional Games (2014) and Random Graphs, Geometry and Asymptotic Structure (2016) Published over 200 research papers in combinatorics and related fields Editor-in-Chief of the Journal of Combinatorial Theory Series B (JCTB) Recognitions: Clay Lecturer (2019) Fellow of the American Mathematical Society (2017) Invited Speaker at ICM (2014) Pazy Memorial Award (2007) Academic Leadership: Dean of Faculty of Exact Sciences (2015-2020) Supervised 9 PhD and 16 MSc students at Tel Aviv University

• Supply Chain Coordination
• Spreadsheet Modeling
• Decision Making & Optimization
• +۳ مورد دیگر

Professor Michelle Cheong Lee Fong is a full-time faculty member at the School of Information Systems, Singapore Management University. She holds leadership roles as Associate Dean for Post-Graduate Professional Education and Director of the Doctor of Engineering program, and is actively involved in designing educational frameworks for technology-driven learning. Current affiliations: Singapore Management University (School of Information Systems) Research focus: Supply chain coordination, spreadsheet modeling, and educational technology Key courses taught: Computer as an Analysis Tool, Financial Modeling, Process Modeling Her research interests in supply chain coordination span strategic hub location optimization, tactical supplier coordination, and operational transportation planning. She also specializes in spreadsheet modeling for business decision-making, having developed textbook resources and case studies for logistics networks and financial planning. Recent work explores AI's role in digital education, including ChatGPT's impact on assessment design and ethical considerations in AI-driven pedagogy. The articles she has written or co-authored demonstrate expertise in operations research, educational technology, and AI applications. Topics include optimization theory, heuristic algorithms for scheduling, and digital assessment frameworks that integrate learning analytics. Her work bridges spreadsheet modeling's pedagogical value with modern challenges like ChatGPT's influence on student learning. Her teaching portfolio includes courses such as IS102 (Computer as an Analysis Tool), IS304 (Process Modeling), and FNCE645 (Financial Modeling). These courses emphasize practical skills in translating business requirements into technology solutions through spreadsheet-based analytical frameworks.

• Artificial Intelligence
• Smart and Service Industry
• Mobility and Transport
• +۵ مورد دیگر

Marco Schutten is an Associate Professor at the Digital Society Institute of the University of Twente, affiliated with the Industrial Engineering & Business Information Systems department. His work bridges Artificial Intelligence , Transportation , and Operations Research , focusing on optimizing complex systems. Expert in Urban Logistics and Freight Transport Specializes in Mathematical Programming and Optimization Research interests include Vehicle Routing , Machine Scheduling , and Agent-Based Simulation . Key trends in his 15 most recent articles (2015–2025) involve: Dynamic scheduling under time constraints Urban logistics and smart city applications Heuristics for combinatorial optimization Integration of MILP and Simulation models No scientific awards, formal supervisory roles, or part-time appointments are explicitly mentioned.

Nicholas Wormaldمشاهده پروفایل

استاد

• Combinatorics
• Random Graphs
• Graph Theory
• +۴ مورد دیگر

Nicholas Wormald is a Professor in the Department of Mathematical Sciences at Monash University, Australia. He joined the university in 2013 as an Australian Laureate Fellow, following a decade as a Canada Research Chair in Combinatorics and Optimization at the University of Waterloo, Canada. His primary research focuses on combinatorics, probabilistic methods, and random structures, with notable contributions to random graph theory, enumeration, and applications in optimization. Wormald holds a PhD from the University of Newcastle. His work spans topics including Hamilton cycles in random regular graphs, k-core emergence, probabilistic combinatorics, and algorithms for graph generation. He has contributed to foundational results such as the sudden emergence of giant components in random graphs and the contiguity of random graph models. He serves on editorial boards of journals like the Electronic Journal of Combinatorics and Random Structures and Algorithms . His research interests also include underground mine optimization and the study of Steiner trees. Notable projects include enumeration and random generation of contingency tables, properties of large discrete structures, and the analysis of random structures' applications. Wormald has authored or co-authored over 250 publications, with recent work focusing on asymptotic enumeration, hypergraphs, and the probabilistic analysis of combinatorial structures.

• Information Theory
• Coding Theory
• Discrete Mathematics
• +۳ مورد دیگر

Charul Rajput is a Research Fellow at Aalto University's Department of Mathematics and Systems Analysis, School of Science. Their research focuses on Information Theory, Coding Theory, Discrete Mathematics, and Algebra, with a particular emphasis on caching systems and network optimization. Recent work includes advancements in hierarchical coded caching, hotplug models, and error probability analysis in communication channels. Publications span topics like function-correcting codes, private information retrieval, and locally recoverable codes. Rajput's research also intersects with systems analysis, addressing challenges in distributed storage and network efficiency. Research interests include the theoretical foundations of coding and information theory, with applications to modern communication systems. Key contributions address the design of efficient caching schemes and error-correcting codes for high-performance networks. No scientific awards or grants are explicitly mentioned in the provided texts. Rajput is affiliated with the Algebra and Discrete Mathematics research group at Aalto University, contributing to interdisciplinary projects that bridge pure mathematics and practical network systems.