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

Karthik R. Narasimhanمشاهده پروفایل

استاد

• Language Agents
• Reinforcement Learning
• Natural Language Processing
• +۳ مورد دیگر

Karthik R. Narasimhan is a Professor at Princeton University's School of Engineering and Applied Science in the Department of Computer Science. Previously, he earned his PhD from MIT under Regina Barzilay and served as a visiting research scientist at OpenAI during 2017-18. His research focuses on the intersection of language and decision-making, building autonomous agents that learn from both experience and human knowledge. His research spans multiple high-impact areas including language agents (Text-DQN, CALM, ReAct, Tree of Thoughts), reinforcement learning (h-DQN, Multi-Objective RL), and AI safety (Toxicity in ChatGPT, DataMUX). He has developed critical datasets and benchmarks such as WebShop, InterCode, SWE-bench, and SILG that have become standard evaluation tools in the field. Current work emphasizes agent capabilities, software engineering automation, and multimodal interaction. His publication trends show strong focus on practical agent deployment (SWE-agent, Tree of Thoughts), safety evaluation (Probing AI Safety), and efficiency improvements (DataMUX). Recent work increasingly addresses real-world challenges in software engineering, security, and human-AI collaboration through rigorous benchmarking. Co-author of foundational GPT (2018) paper Key developer of Text-DQN (2015), CALM (2020), ReAct (2022), Tree of Thoughts (2023) Creator of influential benchmarks: WebShop (2022), SWE-bench (2023), InterCode (2023) He actively advises students through Princeton's computer science program, with research supported by multiple grants focused on autonomous agent development and language-based decision systems. His GitHub repositories (nlp-datasets, text-world-player) demonstrate strong community engagement in open-source research tools. Current projects include advancing language agent capabilities through Reflexion (2023) and Tree of Thoughts (2023) frameworks while addressing critical safety and efficiency challenges.

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Lars Rohwedderمشاهده پروفایل

دانشیار

• Algorithms
• Approximation Algorithms
• Online Algorithms
• +۳ مورد دیگر

Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.

Frank Christian Stephanمشاهده پروفایل

استاد

• Mathematical Logic
• Theoretical Computer Science
• Recursion Theory
• +۵ مورد دیگر

Frank Christian Stephan is a Professor at the National University of Singapore (NUS), with joint appointments in the Department of Mathematics (primary) and School of Computing (secondary). His research spans mathematical logic, theoretical computer science, and computational complexity. Research Interests: Recursion theory and Kolmogorov complexity Inductive inference and learning theory Automata theory and automatic structures Parity games and algorithmic randomness Selected Publications include works on quasipolynomial time algorithms for parity games (STOC 2017 Best Paper) and semi-automatic structures. His scientific awards include the STOC 2017 Best Paper Award and the EATCS-IPEC Nerode Prize 2021. He teaches courses such as Computational Complexity (AY 2023/2024 Sem 2, AY 2024/2025 Sem 2), Advanced Automata Theory (multiple editions), and Mathematical Logic (undergraduate). He co-organizes the Logic Seminar at NUS.

Ignasi Sau Vallsمشاهده پروفایل

پژوهشگر

• Graph Theory
• Parameterized Complexity
• Algorithmic Graph Theory
• +۵ مورد دیگر

Ignasi Sau Valls is a Directeur de Recherche (DR2) at CNRS, affiliated with the LIRMM laboratory at Université de Montpellier, France. He is a member of the AlGCo team, focusing on algorithms for graphs and combinatorics. His academic background includes dual degrees in Mathematics and Telecommunications Engineering from UPC (Barcelona), a PhD in joint supervision between UPC and Projet Mascotte (Sophia Antipolis), and a postdoctoral position at the Technion (Israel). He has been with CNRS since 2010 and was promoted to his current role in October 2024. He also served as a Visiting Professor at UFC (Brazil) from 2016–2017. His research interests lie primarily in Graph Theory and Parameterized Complexity , with a focus on structural graph properties, kernelization, and algorithm design. He has made significant contributions to problems involving minor-closed graph classes, treewidth, and graph modification. His work bridges theoretical foundations with algorithmic applications, particularly in discrete optimization and network problems. The recent articles highlight a strong trend in parameterized algorithms, especially for graph modification, kernelization, and structural graph problems. Topics such as hitting minors, dynamic programming on tree decompositions, and edge contractions reflect a deep engagement with structural parameterizations and fixed-parameter tractability. His publications frequently appear in top-tier journals like SIAM Journal on Computing, Journal of Combinatorial Theory, and Algorithmica, as well as major conferences such as ICALP, SODA, and IPEC. Best paper award of Track C of ICALP'10 Best student paper award of WG'09 Ignasi Sau has been a principal investigator of the ANR JCJC project ELIT (ANR-20-CE48-0008-01), funded with 169k€ from 2021 to 2026. He serves as an editor for DMTCS and Information and Computation , and has held significant organizational roles, including PC member of numerous conferences (MFCS, WG, IPEC, COCOON) and as co-chair and main organizer of WG 2019, ICGT 2022, and JCALM 2023. He has delivered invited courses at international schools in France, Argentina, and Brazil. He is actively involved in the research community through editorial duties, conference organization, and collaborative research. His lab affiliation is the AlGCo team at LIRMM, a leading group in algorithmic graph theory and combinatorics.

• Algorithms and Complexity
• Logic
• Database Theory
• +۲ مورد دیگر

Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.

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

استادیار

• Discrete Mathematics
• Theoretical Computer Science
• Machine Learning
• +۳ مورد دیگر

Christoph Hertrich is a tenure-track professor for Applied Discrete Mathematics at University of Technology Nuremberg, where he conducts research at the intersection of discrete mathematics, theoretical computer science, and machine learning. His work particularly focuses on applying polyhedral geometry and combinatorial optimization techniques to neural network theory, with significant contributions to understanding the computational complexity and expressivity of neural networks. Hertrich received his BSc and MSc degrees from TU Kaiserslautern (2013-2018) working with Sven O. Krumke, followed by his PhD at TU Berlin (2018-2022) under the supervision of Martin Skutella. His doctoral thesis, titled "Facets of Neural Network Complexity," laid foundational work for his current research direction. Prior to joining UTN, he held postdoctoral positions at Université libre de Bruxelles (2023-2024) with a Marie Skłodowska-Curie fellowship under Samuel Fiorini, and at LSE London (2022-2023) with László Végh. He also served as a substitute professor for discrete mathematics at Goethe-Universität Frankfurt during the winter semester of 2023/24. Hertrich's research interests center on the mathematical foundations of neural networks, with particular emphasis on polyhedral geometry approaches. His work explores computational complexity questions related to neural network training and architecture, expressivity bounds, and connections to combinatorial optimization problems. He has made significant contributions to understanding the relationship between neural network depth and function representation, the complexity of counting linear regions in ReLU networks, and the application of extended formulations to neural network theory. His approach combines rigorous theoretical analysis with practical implications for neural network design and optimization. His recent publication record reveals a strong trend toward establishing fundamental theoretical limits and connections between deep learning and discrete mathematics. A significant portion of his work examines computational complexity of various neural network problems, often proving hardness results or establishing bounds on expressivity. He has also developed novel connections between polyhedral combinatorics and neural network architecture, demonstrating how techniques from operations research can inform deep learning theory. Marie Skłodowska-Curie fellowship Since February 2025, Hertrich has been supervising PhD student Moritz Stargalla at UTN. His research has been supported by prestigious fellowships including a Marie Skłodowska-Curie fellowship during his postdoctoral period in Brussels. He is organizing a workshop on "Polyhedral Geometry for Neural Networks" in March 2026 in Nuremberg, highlighting his leadership in this emerging interdisciplinary field.

Alan Kuntzمشاهده پروفایل

استادیار

• Robot Motion Planning
• Autonomous Systems
• Robot Design Optimization
• +۴ مورد دیگر

Alan Kuntz is an Assistant Professor at the University of Utah's Kahlert School of Computing (KSoC) and a core member of the Robotics Center. He leads the interdisciplinary Kuntz Research Lab, focusing on robotics and computational methods with medical applications, particularly in healthcare and surgery. His work spans robot motion planning, autonomous systems, and robot design optimization. Education: Ph.D. in Computer Science from the University of North Carolina at Chapel Hill, with research in the Computational Robotics Research Group. Previously a postdoctoral scholar at Vanderbilt University's Medical Engineering and Discovery Lab. Research interests include surgical robotics, continuum robots, needle steering, and medical device design. Recent projects include autonomous needle navigation, continuum lung staplers, and metamaterial-based robots. His team has published extensively on topics like kinematic modeling, uncertainty quantification, and medical intervention systems. Notable awards include the 2022 IEEE Access Best Video Award for his group's work, and mentoring over 15 students through the University of Utah's Undergraduate Research Opportunities Program. The Kuntz Lab actively collaborates on clinical applications, presenting at top conferences like IROS, Hamlyn Symposium, and ISMR. Labs/Teams: Directs the Kuntz Research Lab, known for its innovative medical robotics projects. The lab's work has been featured in Forbes and other media outlets for breakthroughs like in vivo needle steering demonstrations.

Christian Ikenmeyerمشاهده پروفایل

استاد

• Computational Complexity
• Algebraic Combinatorics
• Geometric Complexity Theory
• +۲ مورد دیگر

Christian Ikenmeyer is Professor in Computer Science and Mathematics at the University of Warwick. His research focuses on algebraic complexity theory, geometric complexity theory (GCT), and representation theory, with emphasis on tensor rank, Kronecker coefficients, and polynomial identity testing. Research Focus: Dr. Ikenmeyer develops mathematical frameworks to solve fundamental problems in computational complexity, including P vs NP. His work connects representation theory with algebraic geometry to establish complexity lower bounds and classify computational hardness. Leadership: He organizes workshops on algebraic complexity and GCT, including the 2023 Algebraic Complexity Theory Workshop at ICALP. His research is funded by EPSRC and DFG grants, supporting investigations into homogeneous complexity and branching programs. Teaching: Courses include 'Groups and Representations' and programming contest coaching. He has previously taught at MIT, Texas A&M, and Saarland University, developing lecture notes on GCT.

• Algorithms and Complexity
• Parameterized Algorithms
• Approximation Algorithms
• +۷ مورد دیگر

Matthias Mnich is a Professor and Head of the Institute for Algorithms and Complexity at Hamburg University of Technology (TUHH), within the School of Electrical Engineering, Computer Science and Mathematics. He also serves as Deputy Dean International, reflecting his leadership in academic administration and international collaboration. He is a principal investigator at the Helmholtz Graduate School for the Structure of Matter, further emphasizing his interdisciplinary impact. His research lies at the intersection of theoretical computer science and practical algorithm design, focusing on parameterized algorithms , approximation algorithms , combinatorial optimization , scheduling , and algorithmic game theory . His work often bridges theoretical guarantees with real-world applications in energy systems, quantum computing, and logistics. The recent publications (2023–2025) highlight his sustained excellence in top-tier venues such as FOCS, ICALP, ESA, STACS, and journals like Mathematical Programming and ACM Transactions on Algorithms . These works explore foundational problems in vector bin packing , integer programming , graph algorithms , and kernelization , while also applying algorithmic techniques to microgrid energy optimization and quantum algorithm engineering . He is deeply embedded in the theoretical computer science community, having served on program committees of major conferences including: STACS 2023 ESA 2024 FOCS 2023 ICALP 2024 IJCAI 2019–2025 AAAI 2018 SWAT 2018 He has successfully supervised several PhD students to completion, including Matthias Kaul , Roland Vincze , and Alexander Göke , many of whom have taken postdoctoral positions at institutions like the University of Bonn and University of Augsburg. His current research projects include PATTERN (2025–2031) , Hamburg Quantum Computing (2024–2029) , and Kernelization for Big Data , indicating long-term funding and strategic research directions. He leads the Institute for Algorithms and Complexity (E-11) , fostering a research environment focused on high-impact algorithmic research.

Yann Pontyمشاهده پروفایل

پژوهشگر

• RNA Folding
• RNA Design
• RNA Evolution
• +۹ مورد دیگر

Yann Ponty is a tenured CNRS Researcher at the Computer Science Department (LIX) of École Polytechnique (Institut Polytechnique de Paris, France). He leads the AMIBio team and serves as Deputy Director of LIX. His work focuses on developing bioinformatics methods at the intersection of computer science, mathematics, and molecular biology, particularly for RNA structure prediction, design, and evolution. He holds leadership roles in the ISCB Board of Directors (2025-2027) and the HDR referent for the IDIA department (CS&Interactions) at IP Paris. Research Interests: RNA folding/design/evolution, RNA-RNA/RNA-protein interactions, random generation, enumerative combinatorics, discrete algorithms, parameterized complexity, RNA visualization Key Contributions: Developed algorithms for RNA inverse folding, pseudoknot modeling, and dynamic programming optimization Collaborations: Partnerships with institutions like Simon Fraser University, Boston College, and Université Paris-Saclay His recent publications (15 most recent) span RNA structure prediction, pseudoknot partition functions, linear-time inverse folding algorithms, and parameterized sampling techniques. The work emphasizes dynamic programming, combinatorial approaches, and integration of experimental data for improving RNA modeling. Scientific awards include election to the ISCB Board of Directors (2025-2027) and leadership roles in academic networks like GdR BIM. He actively contributes to software development (VARNA, RNANR, SPARCS, IncaRNAtion, RNARedPrint) and serves as Associate Editor for Bioinformatics (OUP). Teaching engagements include graduate-level courses in combinatorial optimization, RNA bioinformatics, and algorithms at Université Paris-Saclay and École Polytechnique.

Fedor Fominمشاهده پروفایل

استاد

• Theoretical Computer Science
• Graph Algorithms
• Parameterized Complexity
• +۳ مورد دیگر

Fedor Fomin is a Professor in the Department of Informatics at the University of Bergen. His research focuses on Theoretical Computer Science, including Graph Algorithms, Parameterized Complexity, Combinatorics, and Combinatorial Games. He is affiliated with the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, and the Academia Europaea, and holds fellowships from ACM and EATCS. His work has been recognized with the EATCS Nerode Prize in 2015 and 2017. Dr. Fomin has authored influential books such as Kernelization: Theory of Parameterized Preprocessing and Parameterized Algorithms , which are foundational in the field of algorithm design. His recent publications explore cutting-edge topics in parameterized complexity, graph theory, and distributed computing, with contributions to approximation algorithms, kernelization, and combinatorial optimization. His awards and honors reflect his significant impact on theoretical computer science. Fomin has been awarded an ERC Advanced Grant and has mentored numerous researchers, contributing to the advancement of algorithmic techniques and their applications.

Chris Whiddenمشاهده پروفایل

استادیار

• Algorithms and Bioinformatics
• Computational Biology
• Phylogenetics
• +۱۰ مورد دیگر

Chris Whidden is an Assistant Professor in the Faculty of Computer Science at Dalhousie University, where he leads research in algorithms and bioinformatics. His work bridges theoretical computer science with practical applications in computational biology and ocean data analytics. Whidden's research interests include approximation and fixed-parameter algorithms, computational biology, evolutionary trees and networks, graph theory, hybridization and lateral gene transfer, NP-hardness, and ocean data analytics. He develops efficient algorithms and software to solve NP-hard problems, particularly in the context of phylogenetics and large-scale biological data. His work applies both theoretical algorithm design and practical software engineering to create novel solutions for understanding biodiversity, bacterial and viral evolution, and oceanographic systems. His recent publications reflect a strong trend toward interdisciplinary research, combining deep learning and machine learning with oceanographic data analysis, fish detection and classification, echosounder data processing, and environmental monitoring. Many of his algorithmic contributions focus on phylogenetic tree comparison, including SPR distances, maximum agreement forests, and supertree construction. He has developed several widely used software tools such as rspr, SPR Supertrees, uspr, and phylogenetic topographer. NSERC Killam Trusts Tula Foundation NSF Simons Foundation (via Life Sciences Research Foundation) DeepSense (industry-academic collaboration) He is actively involved in mentoring and has funding available for PhD and MCS students in computer science, particularly in algorithms, bioinformatics, and data analytics. He teaches courses such as Algorithm Engineering (CSCI 4118/6105), Software Development (CSCI 2134), and Design and Analysis of Algorithms (CSCI 3110). Whidden has collaborated extensively with industry through DeepSense, working on projects that apply data analytics and machine learning to the ocean sector, including predictive modeling for ocean buoys, automated fish detection, and tidal energy monitoring.

Pinar Heggernesمشاهده پروفایل

استاد

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

Pinar Heggernes is a Professor at the Department of Informatics at the University of Bergen , specializing in algorithms and graph theory . Her research focuses on solving NP-hard graph problems through polynomial-time and fixed parameter tractable algorithms , particularly on chordal , split , and outerplanar graphs . She served as the elected deputy rector of the University of Bergen (2021–2025) with responsibility for education and digital knowledge, and previously as head of the Department of Informatics until 2021. Her career spans leadership in externally funded projects, editorial roles in international journals, and active participation in national research policy, including co-founding the Norwegian Artificial Intelligence Research Consortium (NORA). Education: PhD in Informatics from the University of Bergen. Research Interests: Algorithms for graph classes, computational complexity, parameterized algorithms, and combinatorial optimization. Collaborations: Extensive partnerships with academia, businesses, and public administration, including advisory roles in the Bergen Chamber of Commerce and the Norwegian Cognitive Center . Grants: Project leader for four Research Council of Norway FRIPRO grants (CLASSIS, SCOPE, MIST, and earlier projects) and participant in EU, Trond Mohn Foundation, and National Security Authority grants. Students: Supervised Paloma T. Lima (PhD, 2019) and co-supervised numerous advisees through collaborative projects. Labs/Teams: Coordinated interdisciplinary ICT research and education initiatives at UiB, with international collaborations in the USA, France, and Turkey.

• Algorithmic Game Theory
• Market Equilibrium Computation
• Fair Division
• +۵ مورد دیگر

Ruta Mehta is an Associate Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign . Since 2016 she has led a vibrant research program in algorithmic game theory, market design, and fair division, while actively shaping the community through service roles such as Program Co-Chair of WINE 2020 and Area Chair of EC 2021. Education Ph.D. in Computer Science & Engineering, Indian Institute of Technology Bombay, 2012. (Advisors: Prof. Milind Sohoni & Prof. Bharat Adsul; ACM India Doctoral Dissertation Award 2012) M.Tech. in Computer Science & Engineering, Indian Institute of Technology Bombay, 2005 B.E. in Computer Engineering, Maharaja Sayajirao University (MSU) Baroda, 2003 Research Interests Mehta’s work lies at the intersection of theoretical computer science , mathematical economics , and social choice theory . She investigates the computability and complexity of equilibria—both market and Nash—under a variety of utility models, and designs provably efficient algorithms that are practical for real-world resource-allocation tasks. Current themes include: Algorithmic Game Theory: equilibrium computation, smoothed analysis, learning in games Fair Division: envy-freeness up to any good (EFX), mixed manna, competitive equilibrium with chores Interdisciplinary Applications: genetic evolution, machine-learning markets, climate-aware allocation Publication Trends Her 15 most recent works (2017–2025) span Operations Research , Mathematics of Operations Research , STOC, SODA, EC, ITCS, AAMAS, and NeurIPS. The articles cluster around three thrusts: (i) rigorous hardness and approximation results for market equilibrium in Leontief and PLC exchange economies, (ii) algorithmic advances toward guaranteed EFX allocations and competitive equilibrium with mixed manna, and (iii) novel game-theoretic analyses of genetic diversity and strategic resource allocation under budget constraints. Scientific Awards & Honors NSF CAREER Award (2018) Outstanding Post-Doctoral Researcher Award, Georgia Tech (2014) Rising Stars in EECS (2013) ACM India Doctoral Dissertation Award (2012) Google India Anita Borg Memorial Scholarship (2012) IBM PhD Award (2010) IBM PhD Fellowship (2009–2010) Grants, Advising, and Community Leadership Mehta currently mentors a growing group of graduate students and post-docs. She is PI on an NSF CAREER grant and has served on federal panels reviewing NSF CISE proposals. Beyond research, she founded the EC (AGT) Mentoring Workshop , co-located with the ACM Economics & Computation conference, to broaden participation of women and under-represented minorities in algorithmic game theory. Labs & Teams Her research group operates within the Theory & Algorithms cluster at UIUC, leveraging ties with the Decision & Control group and the Social & Algorithmic Thinking initiative. She is an active member of ACM SIGecom and regularly organizes reading groups on algorithmic game theory and fair division.