Anubhav Dhar
Scholar

Anubhav Dhar

Google Scholar ID: mnHogp4AAAAJ
Student, Indian Institute of Technology Kharagpur
Theoretical Computer ScienceComputational GeometryParameterized Algorithms
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
4
 
H-index
1
 
i10-index
0
 
Publications
5
 
Co-authors
0
 
Contact
CVOpen ↗GitHubOpen ↗LinkedInOpen ↗
Publications
3 items
Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
2026
Cited
0
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
2026
Cited
0
Universal Solvability for Robot Motion Planning on Graphs
2025
Cited
0
Resume (English only)
Academic Achievements
  • - Publications:
  • - 'Local problems in trees across a wide range of distributed models', OPODIS 2024
  • - 'Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets', ISAAC 2023
  • - Preprints:
  • - 'Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares', ArXiv preprint
  • - 'The Complexity of Minimum-Envy House Allocation Over Graphs', ArXiv preprint
  • - 'Universal Solvability for Robot Motion Planning on Graphs', ArXiv preprint
Research Experience
  • - March 2022 - Present: Research under Prof. Sudeshna Kolay on various problems in computational geometry
  • - December 2023: Presented paper 'Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets' at ISAAC 2023
  • - 2023-2024: Worked on polynomial time algorithms for minimum covering of orthogonal polygons with squares and NP Completeness proofs for some other settings
  • - Summer 2024: Research Assistant at Aalto University's Distributed Algorithms group, supervised by Prof. Jukka Suomela, working on classification of localities for LCL problems on rooted regular trees
  • - Summer 2023: Research intern at EPFL Processor Architecture Laboratory, investigating the opensource software OpenFPGA
Education
  • - Degree: Integrated Bachelor and Master
  • - University: Indian Institute of Technology Kharagpur
  • - Major: Computer Science & Engineering
  • - Advisor: Prof. Sudeshna Kolay (since March 2022)
  • - Duration: March 2022 to 2024
Background
  • - Research Interests: Theoretical Computer Science
  • - Professional Field: Computational Geometry, Distributed Algorithms
  • - Introduction: Completed the Integrated Bachelor and Master program in Computer Science & Engineering at Indian Institute of Technology Kharagpur, currently focusing on research in theoretical computer science.
Miscellany
  • - Active participant and problem setter in Competitive Programming
  • - Enjoys tricky math puzzles and brain teasers
  • - Former Tech Lead of Codeclub and Governor of Grimoire of Code at IIT Kharagpur
  • - Part of the problem-setting and organizing team for multiple competitive programming contests
Co-authors
0 total
Co-authors: 0 (list not available)