Anubhav Dhar

According to our database, Anubhav Dhar authored at least 7 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices.

Palash Dey, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay, Aritra Mitra

CoRR, February, 2026

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs.

Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay

CoRR, February, 2026

2025

Universal Solvability for Robot Motion Planning on Graphs.

Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay, Pranav Nyati, Tanishq Prasad

CoRR, June, 2025

The Complexity of Minimum-Envy House Allocation Over Graphs.

Palash Dey, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay

CoRR, May, 2025

2024

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares.

Anubhav Dhar, Subham Ghosh, Sudeshna Kolay

CoRR, 2024

Local Problems in Trees Across a Wide Range of Distributed Models.

Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

2023

Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets.

Anubhav Dhar, Soumita Hait, Sudeshna Kolay

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023