Olga Sorkine-Hornung is a Professor of Computer Science at ETH Zurich and head of the Institute of Visual Computing. She leads the Interactive Geometry Lab, focusing on theoretical and practical advancements in digital content creation, geometry processing, and shape modeling. Current position: ETH Zurich, Department of Computer Science Previous roles: Courant Institute (NYU), Technical University of Berlin Education: BSc and PhD from Tel Aviv University, postdoc at TU Berlin Her research spans shape representation, digital fabrication, computer animation, and fundamental geometry processing. Key contributions include Laplacian surface editing, as-rigid-as-possible deformation, and generalized winding numbers. She works on applications in VR, AR, and autonomous systems. Awards include Test of Time Awards (2024), ACM Fellow (2020), ERC Consolidator Grant (2020), and EUROGRAPHICS Young Researcher Award (2008). She has supervised numerous students and co-developed software libraries like libigl and Instant Meshes . Co-chair roles for SIGGRAPH, Eurographics, and Pacific Graphics Editorial board member for ACM Transactions on Graphics and other journals Keynote speaker at VMV, CVPR, and SIAM conferences Her work bridges mathematical rigor with practical implementation, advancing computer graphics and geometry processing through intuitive algorithms that maintain surface detail while enabling efficient computation.
Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Dr. Rasmus Ibsen-Jensen is a Lecturer in Computer Science at the University of Liverpool. Previously, he held a Postdoctoral position at IST Austria under Krishnendu Chatterjee and completed his PhD under Peter Bro Miltersen. Research Focus: Algorithmic game theory, strategy complexity in two-player zero-sum games, control flow graph algorithms, edit distance for automata, and theoretical biology applications. Teaching: Module Coordinator for second-year courses in database development (COMP207), C++ programming (COMP282), and industrial placement (COMP299). His work bridges computational game theory and formal verification, with recent publications exploring memory constraints in partial-information games, algebraic path properties in concurrent systems, and evolutionary spatial dynamics. While no scientific awards are explicitly mentioned in the provided text, his contributions to algorithmic complexity and interdisciplinary research (e.g., theoretical biology) highlight his academic impact.
Bo Han is an Associate Professor in the Department of Computer Science at Hong Kong Baptist University's Faculty of Science, where he leads the Trustworthy Machine Learning and Reasoning (TMLR) Group. He also holds a visiting scientist position at the RIKEN Center for Advanced Intelligence Project (RIKEN AIP) in Japan. His research focuses on developing trustworthy and efficient machine learning systems, particularly under imperfect data conditions such as noisy labels, out-of-distribution data, and weak supervision. Bo Han's research interests span Machine Learning , Deep Learning , Foundation Models , Causal Representation Learning , Weakly and Self-supervised Learning , Robustness and Security in Machine Learning , Federated Learning , and AI for Science . His work aims to build intelligent systems that can reliably learn and reason from complex, imperfect real-world data. His recent publications reveal a strong trend toward trustworthy foundation models , robust reasoning with large language models , out-of-distribution detection , privacy-preserving learning , and causal robustness . His research integrates theoretical foundations with practical applications, often published in top-tier venues like NeurIPS, ICML, ICLR, and TPAMI. Notable Awards and Honors: Outstanding Paper Award, NeurIPS Most Influential Paper, NeurIPS IEEE AI's 10 to Watch Award IJCAI Early Career Spotlight INNS Aharon Katzir Young Investigator Award Dean's Award for Outstanding Achievement RGC Early CAREER Scheme Bo Han has been actively involved in the academic community, serving as a Senior Area Chair and Area Chair for NeurIPS, ICML, and ICLR, and as an Associate Editor for IEEE TPAMI, MLJ, and JAIR. He has advised numerous PhD and research students and leads a globally distributed research group. His work is supported by major grants from RGC, NSFC, GDST, RIKEN, and industry partners including Microsoft, Alibaba, Tencent, and Baidu. He also leads research initiatives in Trustworthy Machine Learning , including projects on federated learning, model unlearning, privacy-preserving AI, and robust foundation models, often in collaboration with industry and international institutions.
Stephen Marshall is Professor of Urban Morphology and Urban Design at The Bartlett School of Planning, University College London. He also served as Visiting Professor at the Department of Architecture and Urban Studies, Politecnico di Milano, Italy from 2019 to 2021. With over twenty-five years of experience in the built environment fields, initially in consultancy and subsequently in academia, Professor Marshall has established himself as a leading expert in urban morphology and design. His educational background includes a Doctor of Philosophy from University College London (2001), a Postgraduate Diploma from Edinburgh College of Art (1995), a Master of Science from the University of Leeds (1989), and a Bachelor of Engineering from the University of Glasgow (1988). Professor Marshall's principal research focuses on urban morphology and street layout, examining their relationships with urban formative processes including urban design, coding and planning. His work bridges urban design theory with practical applications, exploring how cities evolve through complex interactions of physical form, social processes, and planning interventions. He has written or edited several influential books including 'Streets and Patterns' (2005), 'Cities, Design and Evolution' (2009), and 'Urban Coding and Planning' (2011). His recent publications reveal a growing interest in applying complexity science to urban morphology, with particular attention to biological analogies for understanding self-organizing cities. He has pioneered research on digital participation methods in urban planning, exploring how online platforms can enhance public engagement in urban space design. His work consistently bridges theoretical urban morphology with practical applications for contemporary urban challenges like pandemic adaptation and sustainable transport. Professor Marshall has served as Chair of the Editorial Board of Urban Design and Planning from its launch to 2012, and is now co-editor of Built Environment journal. His editorial work has significantly shaped scholarly discourse in urban planning and design. He leads several significant research initiatives including the Incubators of Public Spaces project, which explores digital platforms for co-creating urban spaces, and the Self-Organising Built Environment project, which investigates biological analogies in urbanism. These projects reflect his interdisciplinary approach to understanding and shaping urban environments, connecting with Sustainable Development Goal 11 (Sustainable Cities and Communities).
Dr. Frederick Li is an Associate Professor in the Department of Computer Science at Durham University, UK. He holds editorial roles as Associate Editor of Frontiers in Education (Digital Education) and Editorial Board Member of Virtual Reality & Intelligent Hardware. His research focuses on Computer Graphics, Machine Learning, Geometric Modelling, Collaborative Virtual Environments, Visual Aesthetics, and Educational Technologies. He earned his B.A. (Hons) and M.Phil. from The Hong Kong Polytechnic University and his Ph.D. in Computer Graphics from City University of Hong Kong. Prior roles include Assistant Professor at HK PolyU and project manager of a Hong Kong Government ITF-funded project. **Education**: B.A. (Computing Studies) and M.Phil. from HK PolyU; Ph.D. in Computer Graphics (CityU Hong Kong). **Research Interests**: His work spans mesh saliency detection, human-object interaction recognition, cloud modeling, face beautification, and educational technology. Recent achievements include awards for papers (e.g., Best Paper at ITiCSE 2014) and recognition such as EPSRC Peer Review College membership. He leads Durham's Undergraduate Board of Examiners and has been an external examiner at Northumbria University. **Awards**: Best Paper (ACM ITiCSE 2014), Outstanding Paper (ICALT 2013), EPSRC Peer Review College (2024), Outstanding BMVC 2024 Reviewer. **Grants & Labs**: His research is supported by grants from EPSRC and others. He collaborates with the Centre for Vision and Visual Cognition, VIViD, and AIHS group at Durham.
Kushal Dey serves as an Assistant Professor in the Computational and Systems Biology Program at Memorial Sloan Kettering Cancer Center (MSKCC), part of the Graduate School of Medical Sciences in partnership with Weill Cornell Medicine. His research integrates statistical and machine learning approaches with genomic data to understand the regulatory architecture of complex diseases. Dr. Dey's research focuses on developing computational methods that integrate human disease genetics with functional genomics data. His work spans immune-related diseases including Alzheimer's and inflammatory bowel disease, as well as heritable cancers like breast and prostate cancer. His lab develops models to prioritize variants, genes, and cell states for disease using genetic, genomic, and perturbation data, with emphasis on causal directed graphs and benchmarking pipelines informed by disease genetics. His recent publications highlight expertise in GWAS, colocalization, spatial transcriptomics, Perturb-seq, and RNA+ATAC multiome analysis. His work frequently appears in top journals like Nature Genetics, with a focus on single-cell multi-omics approaches to understand disease mechanisms at cellular resolution. Scientific Awards: Josie Robertson Investigator (2023–2028) K99/R00 Pathway to Independence Award (NIH/NHGRI) (2022–2026) NIH/NHGRI Early Stage Investigator R01 (2025-2030) NCI P30 CCSG supplement – 'LLMs in cancer research' (2023-2024) Catalog Working Group Co-chair + Disease Focus Group Lead: IGVF consortium (2023-) Dr. Dey mentors several graduate students through the Weill Cornell Graduate School (WGS), including Thahmina Ali, Pretty Garcia, Karthik Guruvayurappan, Louis Liu, Sarthak Tiwari, Berk Turhan, and Harry Zhang. His lab has received multiple grants including the AWS IMAGINE Grant Children's Health Innovation Award 2024-2025 (as Project Co-lead) and PSRP Developmental Funds Awards (2025: Co-lead). The lab actively collaborates with consortia including ENCODE, ADSP, MorPhiC, and IGVF, maintaining strong ties with Columbia University, Stanford University, and Harvard T.H.Chan School of Public Health. The Kushal Dey Lab is part of the vibrant Tri-Institutional Research campus adjacent to Rockefeller University and Weill Cornell Medical College, offering a collaborative environment focused on computational genomics and disease mechanisms.
Dr. Kaiqun Fu is an Assistant Professor in the McComish Department of Electrical Engineering and Computer Science at South Dakota State University (SDSU). He holds a Ph.D. and M.S. in Computer Science from Virginia Tech (2021 and 2016). His research focuses on spatial data mining, spatiotemporal event analysis, graph neural networks, and urban computing applications such as traffic impact prediction and social media-driven insights. He also explores physics-informed machine learning for power systems and interdisciplinary topics like 'deaths of despair' in rural areas. Education: Ph.D. in Computer Science, Virginia Tech, 2021 M.S. in Computer Science, Virginia Tech, 2016 Research Interests: His work emphasizes machine learning and deep learning applications in spatial-temporal domains, including: Graph neural networks for traffic incident prediction Social media analysis for urban challenges Physics-informed models for power grid stability Citation forecasting in scientific publications Grants & Projects: NSF CRII ($174,734): Spatiotemporal impacts of traffic events via graph neural networks (2024–2026) NSF EAGER ($300,000): Socio-economic impacts of emerging technologies (2024–2026) SDSU RSCA ($10,118): Graph transformer-based location learning (2023–2024) Professional Involvement: He chairs ACM SIGSPATIAL's SRC committee, serves on SDSU's Computer Science curriculum committees, and is an IEEE member. He co-edits Frontiers in Big Data and advises on interdisciplinary projects like climate-impacted grid security (NSF RII Track-2, $750,000). Labs/Teams: Collaborates with interdisciplinary groups focusing on smart cities, data-driven infrastructure resilience, and GeoAI applications.
Dr. Lijun Chang is an Associate Professor in the School of Computer Science at the University of Sydney. He holds an ARC Future Fellowship (2019–2022) and an ARC DECRA Fellowship (2015–2017). Previously, he was at the University of New South Wales. His research focuses on graph analytics, mining, algorithms, and network science. He teaches courses like INFO5011 (Competitive Programming), COMP5313 (Large Scale Networks), and COMP9120 (Database Management Systems), and coaches the USYD Programming Competition Teams. Education: B.Eng. in Computer Science & Technology from Renmin University of China; PhD from the Chinese University of Hong Kong. Research highlights include scalable graph processing systems (e.g., ScaleG), densest subgraph detection, and graph similarity search. He leads projects funded by ARC grants such as 'Advanced Search of Cohesive Subgraphs in Big Graphs' (2018) and 'Directionality-Aware Cohesive Subgraph Search' (2022). His work emphasizes efficient algorithms for large-scale networks and graph databases. Awards : ARC Future Fellow, ARC DECRA Fellow Students : Yu KONG, Rashmika MATHTHAKA GAMAGE, Mouyi XU Labs/Teams : Focuses on graph algorithms and systems research, contributing to open-source tools and large-scale network analysis.
Yihan Sun is an Assistant Professor at the University of California, Riverside (UCR) since January 2020. He earned his Ph.D. in Computer Science from Carnegie Mellon University (CMU) , advised by Guy Blelloch , and holds a Bachelor's degree in Computer Science from Tsinghua University . Research Interests: Yihan Sun focuses on the theory and practice of parallel computing , including Parallel algorithms and data structures Write-efficient algorithms for Non-Volatile Memory (NVM) Computational geometry (range trees, Delaunay triangulations) Graph algorithms (SSSP, SCC, cluster-based BFS) Concurrent and persistent data structures Multi-version concurrency control (MVCC) with garbage collection Applications in databases, transactional systems, and computational biology Recent Research Trends: His work on join-based parallel balanced trees has been foundational, supporting four balancing schemes (AVL, red-black, weight-balanced, treaps) and enabling efficient implementations in graph analytics, spatial queries, and dynamic programming. Recent publications focus on output-sensitive algorithms , scalable graph libraries (PASGAL) , and pedagogical approaches to teaching parallel algorithms. Teaching: He teaches CS260 (Parallel Algorithms) at UCR and has served as a guest lecturer for MIT 6.886 (Algorithm Engineering) and CMU 15-859 (Algorithms in the real world) . He also contributed to algorithm education through a tutorial at the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP 2019) . Labs & Collaborations: Yihan is a core contributor to the PAM (Parallel Augmented Maps) library, which has been integrated into systems like Aspen (graph-streaming) and C-trees . He collaborates with teams at CMU-Parlay , PBBS , and Ligra , with his code available on Github for community feedback.
Duong Nguyen serves as an Assistant Professor in the School of Electrical, Computer and Energy Engineering at Arizona State University. His research integrates operations research, artificial intelligence, economics, and engineering to develop mathematical models for decision-making in large-scale networked systems including cloud/edge computing, smart grids, and crowdsourcing. He directs the NEMO research group focused on building intelligent multi-agent platforms through optimization and market design. His educational credentials include: Ph.D. in Electrical and Computer Engineering from the University of British Columbia (2020) M.Sc. in Telecommunications from INRS, University of Quebec (2014) B.Sc. in Electronic and Telecommunications from Hanoi University of Science and Technology (2011) Dr. Nguyen's research spans Operations Research, Artificial Intelligence, Decision-Making, Market Design, and Optimization with applications in edge computing, power systems, and network economics. His work emphasizes robust algorithms for uncertain environments and secure multi-agent platforms, recently expanding into quantum machine learning and privacy-preserving distributed systems. Current projects address decentralized federated learning, dynamic pricing, and EV charging network design. Analysis of his publication record reveals consistent focus on distributed optimization techniques for edge/cloud systems, with increasing integration of game theory and quantum computing. His work demonstrates strong methodological innovation in handling spatio-temporal uncertainty while addressing practical challenges in energy flexibility and secure genomic computation. His scientific recognition includes: Finalist for Best Student Paper Award at American Control Conference (ACC) 2024 Finalist for Best Paper Award at International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) 2023 Dr. Nguyen actively mentors Ph.D. students including Jiaming Cheng and Long Vu, with student-led research achieving significant recognition. His NEMO group collaborates with institutions including ETH Zurich on projects spanning autonomous driving, edge AI, and quantum optimization. Current research directions emphasize fair resource allocation, privacy-preserving learning, and dynamic pricing frameworks for next-generation networked systems.
Alla Sheffer is a Professor and Associate Head of Faculty Affairs in the Department of Computer Science at the University of British Columbia, Faculty of Science. She is affiliated with multiple research centers including CAIDA (Centre for Artificial Intelligence Decision-making and Action), the Institute of Applied Mathematics, and ICICS (Institute for Computing, Information and Cognitive Systems). B.Sc., Hebrew University, Jerusalem (1991) M.Sc., Hebrew University, Jerusalem (1995) Ph.D., Hebrew University, Jerusalem (1999) Postdoctoral Research Associate, University of Illinois, Urbana-Champaign (1999-2001) Assistant Professor, Technion, Israel (2001-2003) Assistant Professor, University of British Columbia (2003-2008) Associate Professor, University of British Columbia (2008-present) Professor Sheffer's research focuses on geometry processing, addressing algorithmic challenges in digital shape modeling and manipulation. Her work primarily deals with discrete geometry representations, specifically meshes (polygonal model representations), with applications in computer graphics and computer-aided engineering. She utilizes tools from computational and differential geometry, discrete mathematics, and graph theory to generate, manipulate, and edit discrete geometric models. Her research spans virtual and augmented reality, visual computing, and 3D modeling, with significant contributions to sketch-based modeling, mesh processing, and cloth simulation. The 15 most recent publications reveal a consistent research trajectory in geometry processing, with recent work focusing on vector sketch processing, VR drawing tools, and advanced mesh manipulation techniques. Her work demonstrates a strong connection between human perception and computational methods, particularly in the interpretation of freehand sketches and the generation of perceptually-accurate geometric representations. The recurring themes across her publications include flowlines, curve networks, mesh parameterization, and the application of perceptual studies to improve algorithmic outputs. Eurographics Fellow ACM Fellow IEEE Fellow Royal Society of Canada Fellow SIGGRAPH Academy Member UBC Killam Research Prize NSERC Discovery Accelerator Supplement IBM Faculty Award Professor Sheffer has supervised numerous doctoral and master's students, with recent theses focusing on geometric mesh processing, vector sketch interpretation, VR drawing tools, and garment modeling. Her research group maintains strong connections with industry through various partnerships and has received substantial grant funding to support their innovative work in geometry processing and computer graphics. She teaches courses in computer graphics, geometric modeling, and video game programming, contributing significantly to both undergraduate and graduate education in computer science.
Hariharan Subramonyam is an Assistant Professor (Research) at Stanford University's Graduate School of Education and Computer Science (by courtesy) . He serves as the Ram and Vijay Shriram Faculty Fellow at the Institute for Human-Centered AI (HAI) and is a core faculty member of Stanford HCI . His research bridges Human-Computer Interaction (HCI) and the Learning Sciences , focusing on augmenting human learning through AI via cognitively informed design practices, co-design with learners/educators, and transformative AI-enabled learning experiences. His work emphasizes ethical AI, responsible design, and human values in technology. He earned a PhD in Information from the University of Michigan under Eytan Adar. Current projects include Script&Shift (layered interfaces for LLM writing), AltCanvas (accessible image editing for BVI users), and CogGen (AI tutoring systems). His teaching includes EDUC 432: Designing Explorable Explanations and CS 448B: Data Visualization . Key Research Areas Cognitively Informed AI Systems Human-AI Collaborative Writing Accessible Generative AI Tools Ethical AI Frameworks Interactive Learning Environments Awards & Grants Best Paper Award (CHI 2025) Honorable Mention Award (CHI 2025) HAI Hoffman Yee Grant (2024) Cover Story in Interactions Magazine (2024) Collaborative Networks Co-organizing CHI 2025 Tools for Thought Workshop Contributor to UIST 2024 Dynamic Abstractions Workshop Advising PhD students across Stanford, Georgia Tech, and Duke Collaborations with institutions including University of Michigan, National University of Singapore, and Technical University Munich
Diptarka Chakraborty is an Assistant Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). He obtained his PhD from the Indian Institute of Technology Kanpur in 2016 and held postdoctoral positions at Charles University, Prague, and the Weizmann Institute of Science, Israel. His educational background includes: PhD in Computer Science and Engineering, Indian Institute of Technology Kanpur, 2016 Dr. Chakraborty's research lies at the intersection of Theoretical Computer Science and Algorithms , specializing in sublinear algorithms , approximation algorithms , graph algorithms , and data structures for massive datasets. His work addresses computational hardness in edit distance, rank aggregation, and fault-tolerant graph structures, with recent emphasis on algorithmic fairness and streaming applications. Analysis of his 2020-2025 publications reveals dominant trends in fairness-constrained algorithms (e.g., fair rank aggregation) and scalable techniques for massive data (e.g., clustering permutations in streaming models), alongside foundational contributions to equivalence testing, model counting, and reachability under failures. His scientific contributions have been recognized with: Faculty Teaching Excellence Award 2024 Google South & Southeast Asia Research Award 2022 Best Paper Award at FOCS 2018 IBM Research India Outstanding Ph.D. Student Award 2015-16 Dr. Chakraborty actively mentors two PhD students and multiple research fellows while leading three major research projects: massive data handling under edit metrics, fair rank aggregation, and fault-tolerant graph structures. His Google Research Award supports investigations into computational challenges of fairness. He maintains an active research group with international collaborations and regular seminar participation across institutions including IITs, TIFR, and UC campuses.