Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.
Maria Chudnovsky is a Professor in the Department of Mathematics at Princeton University. Her research focuses on structural graph theory, particularly in areas such as graph decomposition, induced subgraphs, and algorithmic applications of graph structure. She is renowned for her contributions to understanding perfect graphs, even-hole-free graphs, and the Erdős–Hajnal conjecture. Her work often explores the interplay between graph structure and algorithmic efficiency, with applications in combinatorial optimization and theoretical computer science. Notable contributions include foundational results on tree decompositions, chromatic number bounds, and the structure of metrizable graphs. Recent research trends include investigations into induced subgraph obstructions, tree independence numbers, and the properties of sparse graphs. She has published extensively on topics such as clique-stable set separation, rainbow matchings, and the complexity of graph coloring problems in restricted graph classes. Chudnovsky has been involved in significant collaborative projects, including work funded by the DMS-EPSRC grant 'The Power of Graph Structure' (2021). Her research frequently bridges theoretical insights with practical algorithm design, contributing to both fundamental and applied areas of discrete mathematics.
Elias Jarlebring is a Professor in Numerical Linear Algebra at the Department of Mathematics, KTH Royal Institute of Technology, Stockholm. He has held the position of Full Professor since 2021, following his tenure as Associate Professor (2013-2021) and Dahlquist Research Fellow (2011-2013). His research focuses on numerical analysis, numerical linear algebra, matrix computations, and scientific computing. Jarlebring develops linear algebra algorithms to solve problems from various fields including systems and control, acoustics, electromagnetics, data science, quantum mechanics, and quantum chemistry. He is a core developer of NEP-PACK, a scientific computing software package for nonlinear eigenproblems. His recent publications demonstrate significant contributions to computational methods for nonlinear eigenvalue problems, matrix functions, and parameterized linear systems. The research shows a clear trajectory toward increasingly complex applications in quantum computing, data science, and wave propagation problems. Project grant, Swedish research council (2019) Ruth och Nils-Erik Stenbäcks foundation, junior grant (2019) Göran Gustafsson Prize for junior researchers (2014) Project grant for junior researchers, Swedish research council (2014-2018) Professor Jarlebring has supervised numerous PhD students including Vilhelm Peterson Lithell, Gustaf Lorentzon, Siobhán Correnty, Parikshit Upadhyaya, Emil Ringh, Antti Koskela, and Giampaolo Mele. He has received multiple research grants from the Swedish Research Council and serves as editor for BIT Numerical Mathematics, Linear and Multilinear Algebra, NACO Numerical Algebra Control and Optimization, and CALCOLO. He is actively involved in the numerical linear algebra community as a member of ILAS (International Linear Algebra Society), GAMM Activity Group on Numerical Linear Algebra, and the Nordic Numerical Linear Algebra Association. He also contributes to open source projects, particularly in the Julia programming language ecosystem.
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.
Édouard Bonnet is a CNRS researcher at the Laboratoire de l'Informatique du Parallélisme (LIP) in the MC2 team at École Normale Supérieure de Lyon. His research focuses on algorithmic and structural graph theory, representing significant contributions to theoretical computer science. Dr. Bonnet serves as principal investigator of the ANR JCJC grant TWIN-WIDTH (2021-2025), demonstrating recognition of his research excellence. He coordinates the ENS Lyon computer science master 2 internships, playing a key role in graduate education. His involvement in multiple thesis defense committees scheduled for July 2025 confirms his active mentorship role. Within the broader academic community, Bonnet serves on the board of GT CoA (Complexité et Algorithmes) and acts as local correspondent for both GT CoA and GT Graphes, highlighting his standing in the French theoretical computer science community. His habilitation thesis represents a significant scholarly achievement in the French academic system. While specific publications aren't detailed in the provided information, his research focus suggests contributions to graph algorithms, graph classes, parameterized complexity, and structural graph theory, with particular relevance to the twin-width parameter development that has gained prominence in recent years.
Jonathan Fan is an Associate Professor at Stanford University in the Department of Electrical Engineering. His teaching portfolio includes graduate and undergraduate courses in electromagnetics, integrated circuit fabrication, and specialized studies across all quarters. EE 242: Electromagnetic Waves (Autumn) EE 312: Integrated Circuit Fabrication Laboratory (Winter) ENGR 42/EE 42: Electromagnetics and Applications (Spring) 11 independent studies and thesis courses (EE 190, EE 191, EE 300, etc.) His research focuses on nanophotonics and metasurface engineering , with particular emphasis on inverse design methodologies, machine learning -driven photonic optimization, and machine learning in electromagnetic simulation. His recent publications demonstrate a strong trend toward deep learning-enabled photonic design and high-speed optimization of complex optical systems. His work spans metamaterial fabrication , nonlocal effects in metasurfaces, and multi-functional optical devices such as spaceplates for aberration correction. Key technical contributions include physics-augmented neural networks , reparameterization techniques for design constraints, and topology-optimized metasurfaces .
Nina Balcan is the Cadence Design Systems Professor of Computer Science at Carnegie Mellon University's School of Computer Science, with affiliations in both the Machine Learning Department (MLD) and Computer Science Department (CSD). She maintains her office in Gates Hillman Center (GHC) 8205 and is a prominent figure in theoretical machine learning and algorithmic game theory. Her research spans multiple critical areas in computer science, with a strong focus on the theoretical foundations of machine learning, algorithm design and analysis, and computational approaches to game theory and economics. Balcan has made significant contributions to developing principled algorithms for deep learning, learning with limited supervision, representation learning, and life-long learning. Her work uniquely bridges theoretical computer science with practical applications, particularly in the analysis of complex objects and processes, including algorithmic learning and multi-agent systems. Analysis of her recent publications reveals a strong trend toward data-driven algorithm design, with particular emphasis on learning to optimize combinatorial algorithms, revenue-maximizing mechanisms, and robust learning frameworks. Her work consistently demonstrates how theoretical guarantees can inform practical algorithm development across diverse domains from optimization to economics. Major Awards and Honors: ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award (awarded to the outstanding young computer professional of the year) Winner of Outstanding Student Paper Award at UAI 2024 Winner of Exemplary Artificial Intelligence Track Paper Award at ACM EC 2019 Runner Up Best Paper Award at COLT 2012 Professor Balcan has served as Program Committee Co-chair for major conferences including NeurIPS 2020, ICML 2016, and COLT 2014, demonstrating her leadership in the machine learning community. Her teaching portfolio at CMU includes foundational courses such as 10-701 Machine Learning, 10-315 Machine Learning, and 10-715 Advanced Introduction to Machine Learning, where she has mentored numerous students in both theoretical and applied aspects of the field. Her research group focuses on developing theoretically sound yet practically applicable machine learning algorithms, with particular attention to algorithm configuration, data-driven optimization, and learning in strategic environments. Current projects involve learning to improve combinatorial algorithms, designing revenue-maximizing mechanisms, and developing robust learning frameworks that can operate effectively in challenging environments.
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.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Akanksha Agrawal is an Assistant Professor and Veena and Induprakas Keri Faculty Fellow at the Department of Computer Science and Engineering, Indian Institute of Technology Madras. Her research focuses on Parameterized Complexity & Algorithms, Graph Algorithms, Computational Geometry, Exact Algorithms, and Fine Grained Algorithms & Complexity. She has held postdoctoral positions at Ben-Gurion University of the Negev (Israel) and the Hungarian Academy of Sciences, funded by a PBC Fellowship. She earned her Ph.D. from the University of Bergen under Professors Saket Saurabh and Daniel Lokshtanov. Education: Ph.D., University of Bergen, Norway (2017-2021) Postdoctoral Researcher, Ben-Gurion University of the Negev, Israel (2021-2022) Postdoctoral Researcher, Hungarian Academy of Sciences, Hungary (2022-2023) Research Interests: Her work emphasizes parameterized complexity, graph algorithms, and computational geometry. She explores exact algorithms, fine-grained complexity, and algorithmic approaches to NP-hard problems. Her research bridges theoretical insights with practical algorithmic solutions. Recent Activities & Awards: ACM-India Eminent Speaker (2024-2026) Invited Talks: COMSNETS 2025, IISc Bengaluru (2024), Bali Parameterized Graph Algorithms (2024) Program Committee Roles: IPEC 2025 (Co-Chair), WG 2025, CALDAM 2025 Grants & Academic Services: Organizing Dagstuhl Seminar (Jan. 2025) with Maria Chudnovsky, Daniel Paulusma, and Oliver Schaudt Contributions to international conferences and workshops Teaching: Courses include Combinatorial Objects, Parameterized Algorithms, Design & Analysis of Algorithms, Approximation Algorithms, and Advanced Data Structures.
Shaowu Pan is an Assistant Professor of Aerospace Engineering at Rensselaer Polytechnic Institute (RPI), affiliated with the Future of Computing Institute (FOCI) and the Scientific Computation Research Center (SCOREC). He holds a Ph.D. in Aerospace Engineering and Scientific Computing from the University of Michigan and completed a postdoctoral fellowship at the University of Washington’s AI Institute in Dynamic Systems. Education: Ph.D., University of Michigan, 2021 M.S., University of Michigan, 2015 B.E. & B.S., Beihang University, 2013 Research Interests: His work focuses on the intersection of computational fluid dynamics, data-driven modeling, and scientific machine learning. Key areas include operator-theoretic modeling of fluid flows, generative AI for physical systems, and physics-informed neural networks. He develops novel algorithms for reduced-order modeling and stability-preserving surrogate models, with applications in turbulence, plasma physics, and aerodynamics. Key Contributions: Developed PyKoopman , an open-source Python package for Koopman operator approximation. Pioneered mesh-agnostic representation methods like Neural Implicit Flow for spatio-temporal data. Advanced physics-informed neural networks for solving Grad-Shafranov equations and plasma equilibrium problems. Awards & Recognition: John Tichy Junior Faculty Travel Grant (2024) Chinese Outstanding Student Abroad Award (2021) Richard and Eleanor Towner Prize Nominee (2019) Teaching & Mentorship: He teaches courses like MANE 2110: Numerical Methods and Programming for Engineers and mentors multiple Ph.D., master’s, and undergraduate students. His doctoral committee involvement spans interdisciplinary projects in fluid dynamics and AI. Grants & Software: Lead PI for NSF-funded projects on neural representation learning for turbulent flows. Developed software tools like spKDMD and Warp-DG for dynamics analysis and CFD simulations. Labs & Collaborations: Collaborates with institutions like Los Alamos National Laboratory and actively participates in conferences (e.g., AIAA SciTech, SIAM). His research bridges computational science, machine learning, and fluid dynamics to address complex nonlinear systems.
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.
Philipp Eichmeir is a Researcher at the Research Center Wels within the Upper Austria University of Applied Sciences . His work focuses on optimal control , multibody dynamics , and adjoint methods applied to robotics and automotive systems. Expertise in adjoint gradient computation for extremal value optimization Active in automotive/mobility and smart production domains Philipp's research spans computational mathematics , robotics , and mechanical engineering , utilizing advanced numerical methods and simulation modeling for complex dynamic systems. His recent publications focus on multibody dynamics , adjoint optimization , and inequality constraint handling in control systems. Collaborative projects include IOMMS (Innovative Optimization Methods for Multibody Systems) and JR-Centre for Thermal NDE of Composites . Scientific Awards Best Paper Award (2020) Automatisierte Körperschallauswertung (2015)
Thomas Berger is a Professor at the University of Hohenheim , affiliated with the Faculty of Agricultural Sciences and leading the Department of Economics of Land Use . He also contributes to the Computational Science Hub and Hohenheim Tropics initiatives. Focus Areas: Climate change adaptation, land-use modeling, biodiversity-productivity trade-offs, agent-based simulation, and machine learning in agricultural systems. Key Projects: Simulation frameworks for smallholder resilience in Ethiopia, bioeconomic modeling in the Amazon, and hybrid intelligence applications in European agricultural policy. Recent Publications: 2025 study on climate change effects on insecticide reduction in Germany, 2024 work on reconciling biodiversity with productivity via hybrid models, and 2023 methodological contributions to surrogate modeling and seasonal forecast integration. Research Trends: Interdisciplinary integration of climate science, agricultural economics, and computational modeling, with increasing emphasis on AI-assisted decision support systems and sustainability policy validation. Teaching & Outreach: Offers Agricultural Economics seminars and Hohenheim Tropics discussions, requiring advance email registration for office hours.
Jose Israel Rodriguez is an Assistant Professor in the Department of Mathematics at the University of Wisconsin-Madison, with additional affiliations in the Department of Electrical & Computer Engineering and the Institute for Foundations of Data Science. He joined UW Madison in Fall 2020 after completing postdoctoral positions at the University of Chicago (with Lek-Heng Lim) and Notre Dame (with Jonathan Hauenstein). Rodriguez earned his PhD in 2014 from UC Berkeley under the supervision of Bernd Sturmfels. His research focuses on applied algebraic geometry and algebraic methods for statistics, with particular interests in nonlinear algebra and nonlinear eigenvalue problems, algebraic statistics and nearest point problems, and applications of monodromy and Galois groups. Rodriguez has made significant contributions to numerical algebraic geometry, particularly in solving polynomial systems, maximum likelihood estimation, and Euclidean distance degree calculations. His work bridges theoretical mathematics with practical computational methods. Rodriguez's recent publications demonstrate a strong trend toward developing numerical methods for solving complex algebraic problems with applications in statistics, optimization, and engineering. His research shows increasing sophistication in handling decomposable systems, multiparameter eigenvalue problems, and braid group computations, often implementing these methods in software tools like Macaulay2. His work connects abstract algebraic geometry with concrete computational approaches. NSF Postdoctoral Fellow Provost's Postdoctoral Scholar Rodriguez currently advises PhD students Julia Lindberg (expected graduation May 2022, joint with B. Lesieutre) and Zinan Wang. He has organized numerous seminars and conferences including SIAM_SAGA, Algebra in Statistics and Computation Seminar, and Applied Algebra Seminar. His research has been supported by various grants that enable his work in numerical algebraic geometry and its applications. Rodriguez is actively involved in the algebraic geometry and statistics communities, organizing several seminars and minisymposia at major conferences. He has developed several software tools including implementations for decomposable sparse polynomial systems, multiregeneration, algebraic optimization, Galois groups, and maximum likelihood obstruction functions. His work connects theoretical mathematics with practical computational applications across various domains.
