Vinit Kumar

Max Planck Society, Jaypee Institute of Information Technology

Papers

Total Citations

H-Index

About

Vinit Kumar’s research bridges foundational computer science theory and modern machine learning applications. His most influential work, “Optimal constrained graph exploration” (2001, 39 citations), addresses the fundamental problem of navigating unknown graphs under resource constraints—specifically, tethered robots or those with limited fuel capacity. This paper provides optimal algorithms for exploration from a given start node, contributing to robotics, network discovery, and algorithmic theory. Kumar’s analysis of these tighter constraints offers practical insights for autonomous systems operating in unknown environments. More recently, he has explored machine learning, co-authoring “Performance Metrics of Different Machine Learning Algorithms” (2021, 3 citations), which evaluates algorithms for email spam detection—a critical task in cybersecurity and data filtering. This work demonstrates his ability to apply computational methods to real-world problems. Kumar’s research trajectory, from graph exploration to machine learning, showcases a versatile approach to algorithmic problem-solving. His contributions to constrained exploration remain a reference point for researchers in robotics and graph algorithms, while his ML work highlights ongoing relevance in applied data science.