Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Prajakta Nimbhorkar
@article{DBLP:journals/tcs/NasreNRS24,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Keshav Ranjan and
Ankita Sarkar},
title = {Popular critical matchings in the many-to-many setting},
journal = {Theor. Comput. Sci.},
volume = {982},
pages = {114281},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114281},
doi = {10.1016/J.TCS.2023.114281},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NasreNRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bisht0NV24,
author = {Pranav Bisht and
Nikhil Gupta and
Prajakta Nimbhorkar and
Ilya Volkovich},
title = {Launching Identity Testing into (Bounded) Space},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--041},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/041},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bisht0NV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrishnaaLNN23,
author = {Prem Krishnaa and
Girija Limaye and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Envy-freeness and relaxed stability: hardness and approximation algorithms},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {41},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00963-x},
doi = {10.1007/S10878-022-00963-X},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KrishnaaLNN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/LouisNNS23,
author = {Anand Louis and
Meghana Nasre and
Prajakta Nimbhorkar and
Govind S. Sankar},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {Online Algorithms for Matchings with Proportional Fairness Constraints
and Diversity Constraints},
booktitle = {{ECAI} 2023 - 26th European Conference on Artificial Intelligence,
September 30 - October 4, 2023, Krak{\'{o}}w, Poland - Including
12th Conference on Prestigious Applications of Intelligent Systems
{(PAIS} 2023)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {372},
pages = {1601--1608},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230442},
doi = {10.3233/FAIA230442},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/LouisNNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pakdd/GaneshGHN23,
author = {Aadityan Ganesh and
Pratik Ghosal and
Vishwa Prakash HV and
Prajakta Nimbhorkar},
editor = {Hisashi Kashima and
Tsuyoshi Id{\'{e}} and
Wen{-}Chih Peng},
title = {Fair Healthcare Rationing to Maximize Dynamic Utilities},
booktitle = {Advances in Knowledge Discovery and Data Mining - 27th Pacific-Asia
Conference on Knowledge Discovery and Data Mining, {PAKDD} 2023, Osaka,
Japan, May 25-28, 2023, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13936},
pages = {231--242},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-33377-4\_18},
doi = {10.1007/978-3-031-33377-4\_18},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pakdd/GaneshGHN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NasreNR23,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Keshav Ranjan},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Critical Relaxed Stable Matchings with Two-Sided Ties},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {447--461},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_32},
doi = {10.1007/978-3-031-43380-1\_32},
timestamp = {Wed, 27 Sep 2023 09:00:02 +0200},
biburl = {https://dblp.org/rec/conf/wg/NasreNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10632,
author = {Pratik Ghosal and
Vishwa Prakash HV and
Prajakta Nimbhorkar and
Nithin Varma},
title = {{EFX} Exists for Four Agents with Three Types of Valuations},
journal = {CoRR},
volume = {abs/2301.10632},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10632},
doi = {10.48550/ARXIV.2301.10632},
eprinttype = {arXiv},
eprint = {2301.10632},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10632.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-11053,
author = {Aadityan Ganesh and
Prajakta Nimbhorkar and
Pratik Ghosal and
Vishwa Prakash HV},
title = {Fair Healthcare Rationing to Maximize Dynamic Utilities},
journal = {CoRR},
volume = {abs/2303.11053},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.11053},
doi = {10.48550/ARXIV.2303.11053},
eprinttype = {arXiv},
eprint = {2303.11053},
timestamp = {Wed, 22 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-11053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-12325,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Keshav Ranjan},
title = {Critical Relaxed Stable Matchings with Two-Sided Ties},
journal = {CoRR},
volume = {abs/2303.12325},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.12325},
doi = {10.48550/ARXIV.2303.12325},
eprinttype = {arXiv},
eprint = {2303.12325},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-12325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-15479,
author = {Vishwa Prakash HV and
Prajakta Nimbhorkar},
title = {Weighted Proportional Allocations of Indivisible Goods and Chores:
Insights via Matchings},
journal = {CoRR},
volume = {abs/2312.15479},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.15479},
doi = {10.48550/ARXIV.2312.15479},
eprinttype = {arXiv},
eprint = {2312.15479},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-15479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DattaLNTW22,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism Is in Log-Space},
journal = {{ACM} Trans. Comput. Theory},
volume = {14},
number = {2},
pages = {8:1--8:33},
year = {2022},
url = {https://doi.org/10.1145/3543686},
doi = {10.1145/3543686},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/DattaLNTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChatterjeeN22,
author = {Kushagra Chatterjee and
Prajakta Nimbhorkar},
editor = {Sang Won Bae and
Heejin Park},
title = {Popular Edges with Critical Nodes},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {54:1--54:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.54},
doi = {10.4230/LIPICS.ISAAC.2022.54},
timestamp = {Wed, 14 Dec 2022 11:53:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChatterjeeN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12394,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Keshav Ranjan},
title = {Popular Critical Matchings in the Many-to-Many Setting},
journal = {CoRR},
volume = {abs/2206.12394},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12394},
doi = {10.48550/ARXIV.2206.12394},
eprinttype = {arXiv},
eprint = {2206.12394},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12394.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09951,
author = {Atasi Panda and
Anand Louis and
Prajakta Nimbhorkar},
title = {Bipartite Matchings with Group Fairness and Individual Fairness Constraints},
journal = {CoRR},
volume = {abs/2208.09951},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09951},
doi = {10.48550/ARXIV.2208.09951},
eprinttype = {arXiv},
eprint = {2208.09951},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11378,
author = {Govind S. Sankar and
Anand Louis and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Matchings Under Diversity Constraints},
journal = {CoRR},
volume = {abs/2208.11378},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11378},
doi = {10.48550/ARXIV.2208.11378},
eprinttype = {arXiv},
eprint = {2208.11378},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-10805,
author = {Kushagra Chatterjee and
Prajakta Nimbhorkar},
title = {Popular Edges with Critical Nodes},
journal = {CoRR},
volume = {abs/2209.10805},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.10805},
doi = {10.48550/ARXIV.2209.10805},
eprinttype = {arXiv},
eprint = {2209.10805},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-10805.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/NasreNRS21,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Keshav Ranjan and
Ankita Sarkar},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Popular Matchings in the Hospital-Residents Problem with Two-Sided
Lower Quotas},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {30:1--30:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.30},
doi = {10.4230/LIPICS.FSTTCS.2021.30},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/NasreNRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/SankarLNN21,
author = {Govind S. Sankar and
Anand Louis and
Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Zhi{-}Hua Zhou},
title = {Matchings with Group Fairness Constraints: Online and Offline Algorithms},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {377--383},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/53},
doi = {10.24963/IJCAI.2021/53},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/SankarLNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GaneshHNP21,
author = {Aadityan Ganesh and
Vishwa Prakash HV and
Prajakta Nimbhorkar and
Geevarghese Philip},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Disjoint Stable Matchings in Linear Time},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {94--105},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_7},
doi = {10.1007/978-3-030-86838-3\_7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/GaneshHNP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-09522,
author = {Govind S. Sankar and
Anand Louis and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Matchings with Group Fairness Constraints: Online and Offline Algorithms},
journal = {CoRR},
volume = {abs/2105.09522},
year = {2021},
url = {https://arxiv.org/abs/2105.09522},
eprinttype = {arXiv},
eprint = {2105.09522},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-09522.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KrishnaaLNN20,
author = {Prem Krishnaa and
Girija Limaye and
Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Tobias Harks and
Max Klimm},
title = {Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms},
booktitle = {Algorithmic Game Theory - 13th International Symposium, {SAGT} 2020,
Augsburg, Germany, September 16-18, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12283},
pages = {193--208},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57980-7\_13},
doi = {10.1007/978-3-030-57980-7\_13},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sagt/KrishnaaLNN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-13248,
author = {Prajakta Nimbhorkar and
Geevarghese Philip and
Vishwa Prakash HV},
title = {Disjoint Stable Matchings in Linear Time},
journal = {CoRR},
volume = {abs/2011.13248},
year = {2020},
url = {https://arxiv.org/abs/2011.13248},
eprinttype = {arXiv},
eprint = {2011.13248},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-13248.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NimbhorkarV19,
author = {Prajakta Nimbhorkar and
V Arvind Rameshwar},
title = {Dynamic rank-maximal and popular matchings},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {523--545},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0348-9},
doi = {10.1007/S10878-018-0348-9},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NimbhorkarV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GhosalNN19,
author = {Pratik Ghosal and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Rank-maximal matchings - structure and algorithms},
journal = {Theor. Comput. Sci.},
volume = {767},
pages = {73--82},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.09.033},
doi = {10.1016/J.TCS.2018.09.033},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GhosalNN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GopalNNR19,
author = {Kavitha Gopal and
Meghana Nasre and
Prajakta Nimbhorkar and
T. Pradeep Reddy},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided
Ties},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {193--205},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_16},
doi = {10.1007/978-3-030-26176-4\_16},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/GopalNNR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NasreNP19,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Nada Pulath},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Classified Rank-Maximal Matchings and Popular Matchings - Algorithms
and Hardness},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {244--257},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_19},
doi = {10.1007/978-3-030-30786-8\_19},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/NasreNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-07159,
author = {Prem Krishnaa and
Girija Limaye and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Maximum-Size Envy-free Matchings},
journal = {CoRR},
volume = {abs/1910.07159},
year = {2019},
url = {http://arxiv.org/abs/1910.07159},
eprinttype = {arXiv},
eprint = {1910.07159},
timestamp = {Tue, 22 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-07159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ArvindMNV18,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar and
Yadu Vasudev},
title = {Expanding Generating Sets for Solvable Permutation Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {1721--1740},
year = {2018},
url = {https://doi.org/10.1137/17M1148979},
doi = {10.1137/17M1148979},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/ArvindMNV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/MNNR18,
author = {Krishnapriya A. M and
Meghana Nasre and
Prajakta Nimbhorkar and
Amit Rawat},
editor = {Gianlorenzo D'Angelo},
title = {How Good Are Popular Matchings?},
booktitle = {17th International Symposium on Experimental Algorithms, {SEA} 2018,
June 27-29, 2018, L'Aquila, Italy},
series = {LIPIcs},
volume = {103},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SEA.2018.9},
doi = {10.4230/LIPICS.SEA.2018.9},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/MNNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-01311,
author = {Krishnapriya A. M and
Meghana Nasre and
Prajakta Nimbhorkar and
Amit Rawat},
title = {How good are Popular Matchings?},
journal = {CoRR},
volume = {abs/1805.01311},
year = {2018},
url = {http://arxiv.org/abs/1805.01311},
eprinttype = {arXiv},
eprint = {1805.01311},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-01311.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02851,
author = {Meghana Nasre and
Prajakta Nimbhorkar and
Nada Pulath},
title = {Dichotomy Results for Classified Rank-Maximal Matchings and Popular
Matchings},
journal = {CoRR},
volume = {abs/1805.02851},
year = {2018},
url = {http://arxiv.org/abs/1805.02851},
eprinttype = {arXiv},
eprint = {1805.02851},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02851.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanNT18,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Anuj Tawari},
title = {Computing the maximum using (min, +) formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-020}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/020},
eprinttype = {ECCC},
eprint = {TR18-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanNT18a,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Anuj Tawari},
title = {Shortest path length with bounded-alternation (min, +) formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-146}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/146},
eprinttype = {ECCC},
eprint = {TR18-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanNT18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/NimbhorkarV17,
author = {Prajakta Nimbhorkar and
V Arvind Rameshwar},
editor = {Yixin Cao and
Jianer Chen},
title = {Dynamic Rank-Maximal Matchings},
booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON}
2017, Hong Kong, China, August 3-5, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10392},
pages = {433--444},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62389-4\_36},
doi = {10.1007/978-3-319-62389-4\_36},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/NimbhorkarV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/NasreN17,
author = {Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Popular Matchings with Lower Quotas},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.44},
doi = {10.4230/LIPICS.FSTTCS.2017.44},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/NasreN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MahajanNT17,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Anuj Tawari},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Computing the Maximum using (min, +) Formulas},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {74:1--74:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.74},
doi = {10.4230/LIPICS.MFCS.2017.74},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/MahajanNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NimbhorkarV17,
author = {Prajakta Nimbhorkar and
V Arvind Rameshwar},
title = {Dynamic Rank Maximal Matchings},
journal = {CoRR},
volume = {abs/1704.00899},
year = {2017},
url = {http://arxiv.org/abs/1704.00899},
eprinttype = {arXiv},
eprint = {1704.00899},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/NimbhorkarV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NasreN17,
author = {Meghana Nasre and
Prajakta Nimbhorkar},
title = {Popular Matching with Lower Quotas},
journal = {CoRR},
volume = {abs/1704.07546},
year = {2017},
url = {http://arxiv.org/abs/1704.07546},
eprinttype = {arXiv},
eprint = {1704.07546},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NasreN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KavithaNN14,
author = {Telikepalli Kavitha and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Popularity at minimum cost},
journal = {J. Comb. Optim.},
volume = {27},
number = {3},
pages = {574--596},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9537-0},
doi = {10.1007/S10878-012-9537-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KavithaNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GhoshalNN14,
author = {Pratik Ghosal and
Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Rank-Maximal Matchings - Structure and Algorithms},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {593--605},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_47},
doi = {10.1007/978-3-319-13075-0\_47},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GhoshalNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GhoshalNN14,
author = {Pratik Ghosal and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Rank Maximal Matchings - Structure and Algorithms},
journal = {CoRR},
volume = {abs/1409.4977},
year = {2014},
url = {http://arxiv.org/abs/1409.4977},
eprinttype = {arXiv},
eprint = {1409.4977},
timestamp = {Fri, 14 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GhoshalNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DasDN13,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
title = {Log-Space Algorithms for Paths and Matchings in k-Trees},
journal = {Theory Comput. Syst.},
volume = {53},
number = {4},
pages = {669--689},
year = {2013},
url = {https://doi.org/10.1007/s00224-013-9469-9},
doi = {10.1007/S00224-013-9469-9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DasDN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MahajanNV12,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Kasturi R. Varadarajan},
title = {The planar k-means problem is NP-hard},
journal = {Theor. Comput. Sci.},
volume = {442},
pages = {13--21},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2010.05.034},
doi = {10.1016/J.TCS.2010.05.034},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MahajanNV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ArvindMN12,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Erd{\H{o}}s-R{\'{e}}nyi Sequences and Deterministic Construction
of Expanding Cayley Graphs},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {37--48},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_4},
doi = {10.1007/978-3-642-29344-3\_4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/ArvindMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ArvindMNV12,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar and
Yadu Vasudev},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Near-Optimal Expanding Generator Sets for Solvable Permutation Groups},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {112--123},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_13},
doi = {10.1007/978-3-642-32589-2\_13},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ArvindMNV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-3181,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar and
Yadu Vasudev},
title = {Near-Optimal Expanding Generating Sets for Solvable Permutation Groups},
journal = {CoRR},
volume = {abs/1201.3181},
year = {2012},
url = {http://arxiv.org/abs/1201.3181},
eprinttype = {arXiv},
eprint = {1201.3181},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-3181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KouckyNP11,
author = {Michal Kouck{\'{y}} and
Prajakta Nimbhorkar and
Pavel Pudl{\'{a}}k},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Pseudorandom generators for group products: extended abstract},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {263--272},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993672},
doi = {10.1145/1993636.1993672},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KouckyNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindMN11,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar},
title = {Erdos-Renyi Sequences and Deterministic construction of Expanding
Cayley Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-081}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/081},
eprinttype = {ECCC},
eprint = {TR11-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindMNV11,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Prajakta Nimbhorkar and
Yadu Vasudev},
title = {Expanding Generator Sets for Solvable Permutation Groups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-140}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/140},
eprinttype = {ECCC},
eprint = {TR11-140},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindMNV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/LimayeMN10,
author = {Nutan Limaye and
Meena Mahajan and
Prajakta Nimbhorkar},
title = {Longest Paths in Planar DAGs in Unambiguous Log-Space},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2010},
year = {2010},
url = {http://cjtcs.cs.uchicago.edu/articles/CATS2009/5/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/LimayeMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KavithaNN10,
author = {Telikepalli Kavitha and
Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Popularity at Minimum Cost},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {145--156},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_15},
doi = {10.1007/978-3-642-17517-6\_15},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KavithaNN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DasDN10,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Log-space Algorithms for Paths and Matchings in k-trees},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {215--226},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2456},
doi = {10.4230/LIPICS.STACS.2010.2456},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DasDN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-2591,
author = {Telikepalli Kavitha and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Popularity at Minimum Cost},
journal = {CoRR},
volume = {abs/1009.2591},
year = {2010},
url = {http://arxiv.org/abs/1009.2591},
eprinttype = {arXiv},
eprint = {1009.2591},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-2591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaNTW10,
author = {Samir Datta and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Graph Isomorphism for K\({}_{\mbox{3,3}}\)-free and K\({}_{\mbox{5}}\)-free
graphs is in Log-space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-050}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/050},
eprinttype = {ECCC},
eprint = {TR10-050},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaNTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KouckyNP10,
author = {Michal Kouck{\'{y}} and
Prajakta Nimbhorkar and
Pavel Pudl{\'{a}}k},
title = {Pseudorandom Generators for Group Products},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-113}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/113},
eprinttype = {ECCC},
eprint = {TR10-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KouckyNP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/LimayeMN09,
author = {Nutan Limaye and
Meena Mahajan and
Prajakta Nimbhorkar},
editor = {Rod Downey and
Prabhu Manyem},
title = {Longest Paths in Planar DAGs in Unambiguous Logspace},
booktitle = {Theory of Computing 2009, Fifteenth Computing: The Australasian Theory
Symposium, {CATS} 2009, Wellington, New Zealand, January 2009},
series = {{CRPIT}},
volume = {94},
pages = {99--105},
publisher = {Australian Computer Society},
year = {2009},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV94Limaye.html},
timestamp = {Mon, 08 Feb 2021 13:26:47 +0100},
biburl = {https://dblp.org/rec/conf/cats/LimayeMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {203--214},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.16},
doi = {10.1109/CCC.2009.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaNTW09,
author = {Samir Datta and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Graph Isomorphism for K{\_}\{3, 3\}-free and K{\_}5-free graphs is
in Log-space},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
pages = {145--156},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314},
doi = {10.4230/LIPICS.FSTTCS.2009.2314},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MahajanNV09,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Kasturi R. Varadarajan},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The Planar k-Means Problem is NP-Hard},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {274--285},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_24},
doi = {10.1007/978-3-642-00202-1\_24},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/MahajanNV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2416/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-4602,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
title = {Log-space Algorithms for Paths and Matchings in k-trees},
journal = {CoRR},
volume = {abs/0912.4602},
year = {2009},
url = {http://arxiv.org/abs/0912.4602},
eprinttype = {arXiv},
eprint = {0912.4602},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-4602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WagnerDLNT09,
author = {Fabian Wagner and
Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf},
title = {Planar Graph Isomorphism is in Log-space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-052}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/052},
eprinttype = {ECCC},
eprint = {TR09-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WagnerDLNT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaLN08,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {3-connected Planar Graph Isomorphism is in Log-space},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {155--162},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1749},
doi = {10.4230/LIPICS.FSTTCS.2008.1749},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaLN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1699,
author = {Nutan Limaye and
Meena Mahajan and
Prajakta Nimbhorkar},
title = {Longest paths in Planar DAGs in Unambiguous Logspace},
journal = {CoRR},
volume = {abs/0802.1699},
year = {2008},
url = {http://arxiv.org/abs/0802.1699},
eprinttype = {arXiv},
eprint = {0802.1699},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-1041,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar},
title = {3-connected Planar Graph Isomorphism is in Log-space},
journal = {CoRR},
volume = {abs/0806.1041},
year = {2008},
url = {http://arxiv.org/abs/0806.1041},
eprinttype = {arXiv},
eprint = {0806.1041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-1041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2319,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {A Log-space Algorithm for Canonization of Planar Graphs},
journal = {CoRR},
volume = {abs/0809.2319},
year = {2008},
url = {http://arxiv.org/abs/0809.2319},
eprinttype = {arXiv},
eprint = {0809.2319},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2319.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-03 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
