Keshav Ranjan

Orcid: 0000-0002-4207-9330

According to our database¹, Keshav Ranjan authored at least 6 papers between 2019 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Popular critical matchings in the many-to-many setting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., January, 2024

2023

Critical Relaxed Stable Matchings with Two-Sided Ties.

[BibT_eX]

[DOI]

Meghana Nasre

Prajakta Nimbhorkar

Keshav Ranjan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Results on vertex-edge and independent vertex-edge domination.

[BibT_eX]

[DOI]

Subhabrata Paul

Keshav Ranjan

J. Comb. Optim., 2022

Popular Critical Matchings in the Many-to-Many Setting.

[BibT_eX]

[DOI]

Meghana Nasre

Prajakta Nimbhorkar

Keshav Ranjan

CoRR, 2022

2021

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2019

On Vertex-Edge and Independent Vertex-Edge Domination.

[BibT_eX]

[DOI]

Subhabrata Paul

Keshav Ranjan

Proceedings of the Combinatorial Optimization and Applications, 2019

Keshav Ranjan

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...