default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Meghana Nasre
@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/corr/abs-2403-15623,
author = {Santhini K. A. and
Kamesh Munagala and
Meghana Nasre and
Govind S. Sankar},
title = {Approximation Algorithms for School Assignment: Group Fairness and
Multi-criteria Optimization},
journal = {CoRR},
volume = {abs/2403.15623},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.15623},
doi = {10.48550/ARXIV.2403.15623},
eprinttype = {arXiv},
eprint = {2403.15623},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-15623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KashyopNNP23,
author = {Manas Jyoti Kashyop and
N. S. Narayanaswamy and
Meghana Nasre and
Sai Mohith Potluri},
title = {Trade-Offs in Dynamic Coloring for Bipartite and General Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {854--878},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01050-7},
doi = {10.1007/S00453-022-01050-7},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KashyopNNP23.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/ijcai/ARN23,
author = {Santhini K. A. and
Raghu Raman Ravi and
Meghana Nasre},
title = {Matchings under One-Sided Preferences with Soft Quotas},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {2774--2782},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/309},
doi = {10.24963/IJCAI.2023/309},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ARN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/LimayeN23,
author = {Girija Limaye and
Meghana Nasre},
editor = {Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Optimal Cost-Based Allocations Under Two-Sided Preferences},
booktitle = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,
Tainan, Taiwan, June 7-10, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13889},
pages = {259--270},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34347-6\_22},
doi = {10.1007/978-3-031-34347-6\_22},
timestamp = {Mon, 26 Jun 2023 15:55:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/LimayeN23.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-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}
}
@inproceedings{DBLP:conf/atal/ASN22,
author = {Santhini K. A. and
Govind S. Sankar and
Meghana Nasre},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based
Quotas},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {696--704},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p696.pdf},
doi = {10.5555/3535850.3535929},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/ASN22.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-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}
}
@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 = {Wed, 21 Aug 2024 22:46: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}
}
@article{DBLP:journals/corr/abs-2101-04425,
author = {Girija Limaye and
Meghana Nasre},
title = {Stable Matchings with Flexible Quotas},
journal = {CoRR},
volume = {abs/2101.04425},
year = {2021},
url = {https://arxiv.org/abs/2101.04425},
eprinttype = {arXiv},
eprint = {2101.04425},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-04425.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/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/sea2/UttureSKN19,
author = {Akshay Utture and
Vedant Somani and
Prem Krishnaa and
Meghana Nasre},
editor = {Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos and
Dimitris Souravlias and
Arsenis Tsokas},
title = {Student Course Allocation with Constraints},
booktitle = {Analysis of Experimental Algorithms - Special Event, SEA{\({^2}\)}
2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11544},
pages = {51--68},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-34029-2\_4},
doi = {10.1007/978-3-030-34029-2\_4},
timestamp = {Tue, 12 May 2020 10:56:04 +0200},
biburl = {https://dblp.org/rec/conf/sea2/UttureSKN19.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-1909-07854,
author = {Manas Jyoti Kashyop and
N. S. Narayanaswamy and
Meghana Nasre and
Sai Mohith Potluri},
title = {Dynamic coloring for Bipartite and General Graphs},
journal = {CoRR},
volume = {abs/1909.07854},
year = {2019},
url = {http://arxiv.org/abs/1909.07854},
eprinttype = {arXiv},
eprint = {1909.07854},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-07854.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}
}
@inproceedings{DBLP:conf/csr/NarayanaswamyNV18,
author = {N. S. Narayanaswamy and
Meghana Nasre and
R. Vijayaragunathan},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Facility Location on Planar Graphs with Unreliable Links},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {269--281},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_23},
doi = {10.1007/978-3-319-90530-3\_23},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/NarayanaswamyNV18.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}
}
@inproceedings{DBLP:conf/csr/NasreR17,
author = {Meghana Nasre and
Amit Rawat},
editor = {Pascal Weil},
title = {Popularity in the Generalized Hospital Residents Setting},
booktitle = {Computer Science - Theory and Applications - 12th International Computer
Science Symposium in Russia, {CSR} 2017, Kazan, Russia, June 8-12,
2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10304},
pages = {245--259},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58747-9\_22},
doi = {10.1007/978-3-319-58747-9\_22},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/NasreR17.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}
}
@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/endm/GorlaN16,
author = {Sreekanth Gorla and
Meghana Nasre},
title = {List Coloring of Planar Graphs with Forbidden Cycles},
journal = {Electron. Notes Discret. Math.},
volume = {55},
pages = {117--121},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.10.030},
doi = {10.1016/J.ENDM.2016.10.030},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GorlaN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NasreR16,
author = {Meghana Nasre and
Amit Rawat},
title = {Popularity in the generalized Hospital Residents Setting},
journal = {CoRR},
volume = {abs/1609.07650},
year = {2016},
url = {http://arxiv.org/abs/1609.07650},
eprinttype = {arXiv},
eprint = {1609.07650},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NasreR16.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}
}
@article{DBLP:journals/siamdm/Nasre14,
author = {Meghana Nasre},
title = {Popular Matchings: Structure and Strategic Issues},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1423--1448},
year = {2014},
url = {https://doi.org/10.1137/130926249},
doi = {10.1137/130926249},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Nasre14.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}
}
@inproceedings{DBLP:conf/isaac/NasrePR14,
author = {Meghana Nasre and
Matteo Pontecorvi and
Vijaya Ramachandran},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Decremental All-Pairs {ALL} Shortest Paths and Betweenness Centrality},
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 = {766--778},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_60},
doi = {10.1007/978-3-319-13075-0\_60},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/NasrePR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/NasrePR14,
author = {Meghana Nasre and
Matteo Pontecorvi and
Vijaya Ramachandran},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Betweenness Centrality - Incremental and Faster},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {577--588},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_49},
doi = {10.1007/978-3-662-44465-8\_49},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/NasrePR14.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/corr/NasrePR14,
author = {Meghana Nasre and
Matteo Pontecorvi and
Vijaya Ramachandran},
title = {Decremental All-Pairs {ALL} Shortest Paths and Betweenness Centrality},
journal = {CoRR},
volume = {abs/1411.4073},
year = {2014},
url = {http://arxiv.org/abs/1411.4073},
eprinttype = {arXiv},
eprint = {1411.4073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NasrePR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Nasre13,
author = {Meghana Nasre},
editor = {Natacha Portier and
Thomas Wilke},
title = {Popular Matchings: Structure and Cheating Strategies},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {412--423},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.412},
doi = {10.4230/LIPICS.STACS.2013.412},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Nasre13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-0902,
author = {Meghana Nasre},
title = {Popular Matchings -- structure and cheating strategies},
journal = {CoRR},
volume = {abs/1301.0902},
year = {2013},
url = {http://arxiv.org/abs/1301.0902},
eprinttype = {arXiv},
eprint = {1301.0902},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-0902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NasrePR13,
author = {Meghana Nasre and
Matteo Pontecorvi and
Vijaya Ramachandran},
title = {Betweenness Centrality - Incremental and Faster},
journal = {CoRR},
volume = {abs/1311.2147},
year = {2013},
url = {http://arxiv.org/abs/1311.2147},
eprinttype = {arXiv},
eprint = {1311.2147},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NasrePR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangKMN11,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha and
Dimitrios Michail and
Meghana Nasre},
title = {Bounded Unpopularity Matchings},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {738--757},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9434-9},
doi = {10.1007/S00453-010-9434-9},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangKMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KavithaN11,
author = {Telikepalli Kavitha and
Meghana Nasre},
title = {Popular matchings with variable item copies},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1263--1274},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.067},
doi = {10.1016/J.TCS.2010.12.067},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KavithaN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KavithaMN11,
author = {Telikepalli Kavitha and
Juli{\'{a}}n Mestre and
Meghana Nasre},
title = {Popular mixed matchings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2679--2690},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.03.028},
doi = {10.1016/J.TCS.2010.03.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KavithaMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnanthNS11,
author = {Prabhanjan Ananth and
Meghana Nasre and
Kanthi K. Sarpatwar},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Rainbow Connectivity: Hardness and Tractability},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {241--251},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.241},
doi = {10.4230/LIPICS.FSTTCS.2011.241},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AnanthNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2074,
author = {Prabhanjan Ananth and
Meghana Nasre},
title = {New Hardness Results in Rainbow Connectivity},
journal = {CoRR},
volume = {abs/1104.2074},
year = {2011},
url = {http://arxiv.org/abs/1104.2074},
eprinttype = {arXiv},
eprint = {1104.2074},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0979,
author = {Prabhanjan Ananth and
Meghana Nasre and
Kanthi K. Sarpatwar},
title = {Hardness and Parameterized Algorithms on Rainbow Connectivity problem},
journal = {CoRR},
volume = {abs/1105.0979},
year = {2011},
url = {http://arxiv.org/abs/1105.0979},
eprinttype = {arXiv},
eprint = {1105.0979},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0979.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}
}
@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/dam/KavithaN09,
author = {Telikepalli Kavitha and
Meghana Nasre},
title = {Optimal popular matchings},
journal = {Discret. Appl. Math.},
volume = {157},
number = {14},
pages = {3181--3186},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2009.06.004},
doi = {10.1016/J.DAM.2009.06.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KavithaN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KavithaMN09,
author = {Telikepalli Kavitha and
Juli{\'{a}}n Mestre and
Meghana Nasre},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Popular Mixed Matchings},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {574--584},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_48},
doi = {10.1007/978-3-642-02927-1\_48},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KavithaMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KavithaN09,
author = {Telikepalli Kavitha and
Meghana Nasre},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Popular Matchings with Variable Job Capacities},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {423--433},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_44},
doi = {10.1007/978-3-642-10631-6\_44},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KavithaN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HuangKMN08,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha and
Dimitrios Michail and
Meghana Nasre},
editor = {Joachim Gudmundsson},
title = {Bounded Unpopularity Matchings},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {127--137},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_13},
doi = {10.1007/978-3-540-69903-3\_13},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HuangKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-24 23:10 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:
