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

• Algorithms on Discrete Structures
• Parameterized Algorithms
• Structural Graph Theory
• +۴ مورد دیگر

Michał Pilipczuk is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on theoretical computer science, particularly algorithms on discrete structures, parameterized algorithms, structural graph theory, and logic in computer science. He leads the ERC-funded project "BOBR: Decomposition Method for Discrete Problems" and previously led a grant on optimality in parameterized complexity funded by the Polish National Science Center. His research interests include parameterized algorithms , structural graph theory , graph algorithms , and computational complexity . He has made significant contributions to the understanding of problems such as Independent Set in restricted graph classes, graph editing problems, and structural decompositions. The recent publications highlight a strong focus on structural graph theory and exact algorithms . Key themes include quasi-polynomial time algorithms for Independent Set in claw-free graphs, diameter computation in bounded genus graphs, and kernelization in trivially perfect graphs. His work often bridges combinatorial insights with algorithmic applications, particularly in the context of parameterized complexity. Principal Investigator, ERC Grant BOBR: Decomposition Method for Discrete Problems (2021–2026) Principal Investigator, Polish National Science Center Grant on Optimality in Parameterized Complexity (2014–2017) He has advised or collaborated with several researchers, including Marcin Wrochna and Marcin Pilipczuk. His work is published in top venues such as STOC, SODA, ESA, and ICALP.

Akanksha Agrawalمشاهده پروفایل

استادیار

• Parameterized Complexity & Algorithms
• Graph Algorithms
• Computational Geometry
• +۳ مورد دیگر

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.

Nick Moseyمشاهده پروفایل

دانشیار

• Computational Chemistry
• Theoretical Chemistry
• Materials Science
• +۷ مورد دیگر

Nick Mosey is an Associate Professor in the Department of Chemistry and Associate Dean (Research) in the Faculty of Arts & Science at Queen’s University. He holds a PhD from the University of Western Ontario and completed postdoctoral research at Princeton University. His research focuses on computational and theoretical chemistry, particularly in developing simulation methods to study chemical reactions under mechanical stress and tribological conditions. Key areas include molecular dynamics, exact exchange calculations in periodic systems, and the design of electrocatalysts for fuel cells. His work integrates method development (e.g., contracted planewave basis functions, temporal QM/MM) with applied studies in tribology (e.g., friction modifiers, lubricants) and electrocatalysis (nickel-based materials for alkaline fuel cells). He has led interdisciplinary projects involving collaborations across chemistry, materials science, and engineering. Awards include the NSERC Doctoral Prize (2007), Early Researcher Award (2009-2014), and leadership in securing funding from NSERC and Ontario government programs. Mosey teaches courses in quantum mechanics and computational chemistry, with a focus on bridging theory and practical applications. His group has produced over 70 peer-reviewed publications and trained numerous graduate students and postdoctoral researchers. Current research emphasizes extending simulation time-scales for reactive systems and exploring novel materials for energy applications.

• Algorithms
• Combinatorics
• Parameterized Algorithms
• +۱۲ مورد دیگر

Fedor V. Fomin is a Professor in the Department of Informatics at the University of Bergen, Norway, where he leads the Algorithms Research Group. His work is central to theoretical computer science and combinatorics, with significant contributions to algorithm design and analysis. His primary research interests include: Parameterized Algorithms and Kernelization Exact (Exponential Time) Algorithms Graph Algorithms and Graph Minors Approximation Algorithms and Treewidth Matroid Algorithms and Metric Embedding Algorithmic Fairness and Pursuit-Evasion Problems The selected publications reflect a strong trend in foundational algorithmic techniques, particularly in parameterized complexity, kernelization, and exact algorithms. His work often bridges theoretical depth with practical applicability, especially in graph-theoretic problems and preprocessing methods. His scientific recognition includes: EATCS Nerode Prize 2015 EATCS Nerode Prize 2017 Fedor V. Fomin has made substantial contributions through major textbooks such as Parameterized Algorithms (2015) and Kernelization (2019), which have become essential resources in the field. He has collaborated with leading researchers including Daniel Lokshtanov, Saket Saurabh, and Dieter Kratsch. While specific advising roles are not listed, his publications and books suggest extensive mentorship and collaboration. He is actively involved in organizing academic events like FPT Fest and GRASTA, indicating leadership in the research community. He is affiliated with the Algorithms Research Group at the University of Bergen, contributing to a vibrant research environment focused on discrete algorithms and complexity.

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

استاد

• Geometry Processing
• Computer Graphics
• Discrete Geometry
• +۷ مورد دیگر

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.

• Formal Methods
• Verification
• Model Checking
• +۴ مورد دیگر

Nathalie Bertrand is an Inria Researcher and Head of the DEVINE team at Inria Centre Rennes and IRISA lab. She co-heads the working group on Verification of the GDR IFM of the CNRS with Pierre-Alain Reynier, and co-leads the gender equality commission of IRISA and Inria Rennes with Elisa Fromont. She is also an active member of the Inria committee on gender equality and equal opportunity. PhD from ENS Cachan (October 2006) 1-year post-doc at TU Dresden Hired as Inria researcher (October 2007) Habilitation (HDR) from University Rennes 1 (November 2015) Dr. Bertrand's research focuses on formal methods, verification, model checking, parameterized systems, quantitative models, automata, and games. Her work bridges theoretical computer science with practical applications in distributed systems, probabilistic verification, and game theory. She develops efficient model-based formal methods to verify and enforce functional and non-functional properties of dependable distributed systems that include quantitative aspects such as time, cost, or probabilities. Her recent publications demonstrate a strong trend toward parameterized verification of distributed algorithms, probabilistic systems, and game-theoretic approaches to verification problems. Her research has evolved from foundational work on timed automata and probabilistic systems to increasingly complex problems involving distributed algorithms with arbitrary numbers of participants, blockchain consensus, and randomized fault-tolerant systems. Dr. Bertrand serves on the editorial boards of JLAMP and TCS, and has been a program committee member for numerous prestigious conferences including STACS, TACAS, Concur, QEST, LICS, FoSSaCS, ICALP, MFCS, and many others. She has co-chaired program committees for Formats'20, QEST'17, QAPL'14, and QAPL'15. As an advisor, she has supervised numerous PhD students including Nicolas Waldburger, Bastien Thomas, Suman Sadhukhan, Anirban Majumdar, Engel Lefaucheux, Paulin Fournier, and Amélie Stainer. She currently supervises postdoc Gaëtan Staquet and PhD candidates Pranav Ghorpade, Luca Paparazzo, and Luc Lapointe. She leads the DEVINE project-team (created January 2024), which focuses on developing efficient model-based formal methods to verify and enforce properties of dependable distributed systems with quantitative aspects. Previously, she was part of the SUMO team. Her current projects include ANR MAVeriQ (2021-2025), ANR BISouS (2022-2025), and ANR PaVeDyS (2024-2028).

• Algorithms for Big Data
• Parallel Computing
• External-Memory Algorithms
• +۵ مورد دیگر

Ulrich Meyer is a Professor at the Institute for Computer Science at Goethe University Frankfurt. He serves as a prominent researcher in algorithms for big data, with extensive contributions to parallel and external-memory graph algorithms. His work spans theoretical foundations and practical implementations for processing large-scale data sets. Spokesperson of the DFG priority program (SPP 1736) on Algorithms for Big Data in Germany SEA23 Symposium on Experimental Algorithms, Steering Committee Chair ALENEX23 Algorithm Engineering and Experiments, Program Committee Member Professor Meyer's research interests focus on the theoretical and experimental aspects of processing large data sets on advanced computational models. His work particularly emphasizes parallel and external-memory graph algorithms, with recent focus on efficient large-scale network generation according to various stochastic models. His research has produced significant contributions including the parallel Delta-Stepping algorithm (which received the ESA Test of Time Award in 2019) and the first BFS approach with sublinear I/O. He has also explored more specialized topics like energy-efficient sorting (with records in the JouleSort competition 2009/10 and the Germany Land of Ideas Award) and fragile computing (which earned him a best-paper award at ESA 2019). His recent publications demonstrate a strong focus on graph algorithms, network generation, and parallel computing techniques. The research trends show consistent advancement in scalable algorithms for massive graphs, with particular emphasis on efficient sampling methods, shortcutting techniques, and communication-free distributed approaches. His work bridges theoretical computer science with practical engineering considerations for real-world big data applications. ESA Test of Time Award 2019 for Parallel Delta-Stepping algorithm Records in the JouleSort competition 2009/10 Germany Land of Ideas Award Best-paper award at ESA 2019 for fragile computing research Professor Meyer has made substantial contributions to the academic community through his leadership in the DFG priority program on Algorithms for Big Data, which has fostered significant research collaborations across Germany. His extensive publication record in top venues demonstrates sustained research productivity and impact in the algorithms community. While specific grant details aren't provided in the text, his role as spokesperson for a major DFG priority program indicates substantial research funding and leadership responsibilities. His work appears to be conducted within collaborative research environments focused on algorithm engineering and experimental evaluation. His research appears to be conducted within the Institute for Computer Science at Goethe University Frankfurt, likely involving collaborations with other researchers in the Algorithms for Big Data priority program. The extensive list of co-authored publications suggests active participation in research teams focused on parallel algorithms, graph processing, and network generation.

Leif Kobbeltمشاهده پروفایل

استاد

• Computer Graphics
• Geometry Processing
• Interactive Visualization
• +۳ مورد دیگر

Leif Kobbelt serves as a University Professor at RWTH Aachen University, leading the Computer Graphics Group within the Department of Computer Science (Informatik 8). His research focuses on advancing geometry processing, interactive visualization, and computer graphics through innovative algorithmic solutions and interdisciplinary collaborations. Professor Kobbelt's research program centers on geometry acquisition and processing, with significant contributions to mesh generation, surface reconstruction, and neural rendering techniques. His work bridges theoretical geometry with practical applications in computer vision, photo-realistic image synthesis, and multimedia data transmission, often involving collaborations with industry partners and international research teams funded by DFG and EU sources. Recent publications (2023-2025) reveal a strategic integration of deep learning with traditional geometry processing, particularly in Gaussian splatting for real-time rendering, NeRF-based 4D content generation, and robust mesh Boolean operations. His group maintains leadership in quad mesh optimization and surface mapping while expanding into immersive visualization techniques for complex data analysis. The group has earned recognition through prestigious awards: Günter Enderle Best Paper Award at Eurographics 2023 Best Paper Award (1st place) at Symposium on Geometry Processing 2022 Honorable Mention for Best Paper at ACM Symposium on Virtual Reality Software and Technology Funding from Deutsche Forschungsgemeinschaft and European Union programs supports the group's research infrastructure and international collaborations. The team actively supervises graduate theses while developing open-source software tools that translate theoretical advances into practical industry applications, particularly in digital fabrication and immersive visualization systems. The Computer Graphics Group operates as a central hub for visual computing research at RWTH Aachen, maintaining strong ties with both academic institutions and technology companies. Their recent work on virtual reality educational tools and high-fidelity 3D reconstruction systems demonstrates commitment to knowledge transfer and real-world impact beyond traditional publication venues.

• Algorithms
• Data Structures
• Data Science
• +۱ مورد دیگر

Dr. Johan van Rooij is an Assistant Professor in the Algorithms and Complexity group at Utrecht University , Faculty of Science. His work focuses on algorithm design, computational complexity, and data science applications. Specializes in exact algorithms for NP-hard graph problems Active in parameterized complexity and treewidth-based techniques Contributes to applied data science through transportation optimization and railway inspection projects Research trends show consistent contributions to: Exponential time algorithms for graph problems Treewidth and branch decomposition optimization Data science applications in public mobility Scientific Recognition: 2018: Hendrik Lorentz Prize (Dutch Data Science Prizes) 2022: Finalist for Prize for OR for the Common Good

• 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.

Manuel Penschuckمشاهده پروفایل

پژوهشگر ارشد

• Algorithm Engineering
• Random Graphs
• Parallel and Distributed Computing
• +۳ مورد دیگر

Manuel Penschuck is a Research Fellow at the Institute of Computer Science , Goethe University Frankfurt, Germany. His research focuses on algorithm engineering, graph theory, and scalable network generation, with emphasis on parallel computing, I/O-efficient algorithms, and random graph models. He actively contributes to conferences like ESA, SEA, and IPDPS, and has co-authored publications in top venues including LIPIcs , IEEE Transactions , and SIAM . His work includes engineering algorithms for non-linear preferential attachment , parallel shuffling , and hyperbolic graph generation . He has co-organized program committees for ESA, EuroPar, and SEA, and his collaborations span institutions such as MPI-INF, TU Darmstadt, and Australian National University. Recent publications highlight advances in uniform graph sampling, geometric network models, and distributed systems. His research integrates theoretical rigor with practical implementation, addressing challenges in big data and high-performance computing. He is a key contributor to the Networkit toolkit for large-scale network analysis.

Ioan Todincaمشاهده پروفایل

استاد

• Graph Algorithms
• Theoretical Computer Science
• Exact Algorithms
• +۶ مورد دیگر

Ioan Todinca is a Professor of Computer Science at the University of Orléans, France, affiliated with the LIFO (Laboratoire d'Informatique Fondamentale d'Orléans) research laboratory. His academic career spans over two decades, with significant contributions to theoretical computer science, particularly in graph algorithms and distributed computing. Faculty of Science, University of Orléans LIFO Research Laboratory Member of Institut thématique pluridisciplinaire Modélisation, Systèmes, Langages (since 2014) Former director of MIPTIS doctoral school (2012-2014) Former head of Computer Science degree program (2007-2011) Former leader of LIFO Graphs, Algorithms and Computational Models team (2008-2012) Todinca's research focuses primarily on graph algorithms, with expertise in exact algorithms (moderately exponential), parameterized algorithms, and algorithms for specific graph classes. He has made significant contributions to techniques involving tree decompositions, treewidth, minimal separators, and potential maximal cliques. More recently, his work has expanded into distributed algorithms, especially in communication-constrained models like the broadcast congested clique. His research bridges theoretical foundations with practical algorithmic approaches for NP-hard problems. The analysis of his recent publications reveals a strong trend toward distributed computing problems, particularly in congested network models. His work spans from fundamental graph theory problems (cycle detection, graph modification) to applications in quantum computing and model checking. The consistent focus on communication complexity, verification, and efficient algorithms across different computational models demonstrates his ability to adapt theoretical computer science principles to emerging computational paradigms. Todinca has supervised numerous PhD students and has been actively involved in the theoretical computer science community through conference organization and editorial work. His publications appear consistently in top-tier venues including SIAM Journal on Computing, Algorithmica, and proceedings of major conferences like STACS, WG, and DISC. Teaching responsibilities include algorithms, graph theory, and discrete structures for undergraduate and graduate students, with previous experience teaching databases, programming, and software engineering. His educational materials are hosted on the university's Celene platform.

• Graph Theory
• Combinatorial Optimization
• Operations Research
• +۴ مورد دیگر

Cristina Bazgan is a University Professor at Université Paris-Dauphine, affiliated with LAMSADE (Laboratoire d'Analyse et Modélisation de Systèmes pour l'Aide à la Décision) within PSL University. Her office is located at P 409 with contact number 01 44 05 40 90. She maintains an active research profile with numerous publications spanning graph theory, combinatorial optimization, and multi-objective optimization. Professor Bazgan's research primarily focuses on graph theory and combinatorial optimization , with significant contributions to domination theory, network analysis, approximation algorithms, and multi-objective optimization. Her work bridges theoretical computer science and operations research, addressing fundamental problems in computational complexity while developing practical algorithmic solutions. She has made notable contributions to understanding graph partitions, community detection in networks, and the complexity of various optimization problems. Analysis of her recent publications reveals a strong trend in multi-objective optimization and parameterized complexity . Her work often explores the interface between theoretical computer science and operations research, with applications to network analysis and decision support systems. A significant portion of her research addresses the complexity and approximability of graph-theoretic problems, particularly those related to domination, community structure, and anonymization in networks. Professor Bazgan has co-authored the book Combinatorial Algorithms (2022) with H. Fernau and contributed chapters to authoritative works on combinatorial optimization. While specific scientific awards aren't mentioned in the available information, her extensive publication record in top-tier journals demonstrates significant recognition in her field. She maintains an active collaboration network, frequently working with researchers such as Vanderpooten D., Tuza Z., Chlebíková J., and Herzel A. Her research has practical applications in network security, social network analysis, and decision support systems. The LAMSADE laboratory, where she is based, focuses on decision support systems and operations research, providing an interdisciplinary environment for her theoretical and applied work.

Karin Nachbagauerمشاهده پروفایل

استاد

• Multibody System Dynamics
• Numerical Mathematics
• Inverse Dynamics
• +۳ مورد دیگر

Karin Nachbagauer is a Professor of Applied Mathematics at the University of Applied Sciences Upper Austria, affiliated with the Faculty for Engineering's Mechanical Engineering Department. She holds a Hans Fischer Fellowship at the TUM Institute for Advanced Study (since 2020). Her research focuses on multibody system dynamics, numerical mathematics, optimal control, and inverse dynamics, with applications in mechanical engineering and robotics. She earned her PhD in Engineering Sciences (2012) and Diploma in Industrial Mathematics (2009) from Johannes Kepler University Linz. Notable awards include the 2020 Best Paper Award for optimal control research and 2019 Excellence in Teaching Award. Her work emphasizes adjoint gradient methods for optimization problems, parameter identification in multibody systems, and time-optimal control applications. Current projects include the VRoboCoop initiative for human-robot collaboration and IOMMS for innovative optimization in multibody systems. Publications span journals like Journal of Computational and Nonlinear Dynamics and Multibody System Dynamics , with over 80 peer-reviewed articles. She actively participates in international conferences and serves on editorial boards.

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.