Tanvir Kaur

Orcid: 0009-0002-3651-994X

According to our database1, Tanvir Kaur authored at least 11 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Memory optimal distance-2-dispersion with termination.
Int. J. Parallel Emergent Distributed Syst., March, 2026

Black Hole Search: Dynamics, Distribution, and Emergence.
CoRR, March, 2026

Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge.
SN Comput. Sci., January, 2026

When Agents are Powerful: Black Hole Search in Time-Varying Graphs.
Proceedings of the Distributed Computing and Intelligent Technology, 2026

2025
Black Hole Search by Scattered Agents on Time-Varying Dynamic Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2025

Dispersion on Time Varying Graphs.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

Black Hole Search in Dynamic Graphs.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond.
Proceedings of the Distributed Computing and Intelligent Technology, 2025

2024
Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge.
CoRR, 2024

Distance-2-Dispersion with Termination by a Strong Team.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
Distance-2-Dispersion: Dispersion with Further Constraints.
Proceedings of the Networked Systems - 11th International Conference, 2023


  Loading...