Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pallavi Jain 0001
@inproceedings{DBLP:conf/aaai/0001V24,
author = {Pallavi Jain and
Rohit Vaish},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Maximizing Nash Social Welfare under Two-Sided Preferences},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {9798--9806},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28839},
doi = {10.1609/AAAI.V38I9.28839},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/0001V24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/JainR24,
author = {Pallavi Jain and
Manveer Singh Rathore},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Sparsity in Covering Solutions},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {131--146},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_9},
doi = {10.1007/978-3-031-55601-2\_9},
timestamp = {Wed, 13 Mar 2024 19:10:54 +0100},
biburl = {https://dblp.org/rec/conf/latin/JainR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/JainKPSSSU24,
author = {Pallavi Jain and
Lawqueen Kanesh and
Fahad Panolan and
Souvik Saha and
Abhishek Sahu and
Saket Saurabh and
Anannya Upasana},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Max-SAT with Cardinality Constraint Parameterized by the Number of
Clauses},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {223--237},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_15},
doi = {10.1007/978-3-031-55601-2\_15},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/JainKPSSSU24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-02719,
author = {Sushmita Gupta and
Pallavi Jain and
A. Mohanapriya and
Vikash Tripathi},
title = {Budget-feasible Egalitarian Allocation of Conflicting Jobs},
journal = {CoRR},
volume = {abs/2402.02719},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.02719},
doi = {10.48550/ARXIV.2402.02719},
eprinttype = {arXiv},
eprint = {2402.02719},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-02719.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-04265,
author = {Susobhan Bandopadhyay and
Aritra Banik and
Sushmita Gupta and
Pallavi Jain and
Abhishek Sahu and
Saket Saurabh and
Prafullkumar Tale},
title = {Conflict and Fairness in Resource Allocation},
journal = {CoRR},
volume = {abs/2403.04265},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.04265},
doi = {10.48550/ARXIV.2403.04265},
eprinttype = {arXiv},
eprint = {2403.04265},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-04265.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-07328,
author = {Tanmay Inamdar and
Pallavi Jain and
Daniel Lokshtanov and
Abhishek Sahu and
Saket Saurabh and
Anannya Upasana},
title = {Satisfiability to Coverage in Presence of Fairness, Matroid, and Global
Constraints},
journal = {CoRR},
volume = {abs/2403.07328},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.07328},
doi = {10.48550/ARXIV.2403.07328},
eprinttype = {arXiv},
eprint = {2403.07328},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-07328.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-07558,
author = {Shiri Alouf{-}Heffetz and
Tanmay Inamdar and
Pallavi Jain and
Yash More and
Nimrod Talmon},
title = {Controlling Delegations in Liquid Democracy},
journal = {CoRR},
volume = {abs/2403.07558},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.07558},
doi = {10.48550/ARXIV.2403.07558},
eprinttype = {arXiv},
eprint = {2403.07558},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-07558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaJST23,
author = {Sushmita Gupta and
Pallavi Jain and
Saket Saurabh and
Nimrod Talmon},
title = {Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability
for Multiwinner Rules},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3717--3740},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01155-7},
doi = {10.1007/S00453-023-01155-7},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaJST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0001KPSS0U23,
author = {Pallavi Jain and
Lawqueen Kanesh and
Fahad Panolan and
Souvik Saha and
Abhishek Sahu and
Saket Saurabh and
Anannya Upasana},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Parameterized Approximation Scheme for Biclique-free Max \emph{k}-Weight
{SAT} and Max Coverage},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {3713--3733},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch143},
doi = {10.1137/1.9781611977554.CH143},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/0001KPSS0U23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GuptaJS23,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjay Seetharaman},
editor = {Leszek Gasieniec},
title = {More Effort Towards Multiagent Knapsack},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {47--62},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_4},
doi = {10.1007/978-3-031-23101-8\_4},
timestamp = {Fri, 23 Dec 2022 17:47:39 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/GuptaJS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-04995,
author = {Sushmita Gupta and
Pallavi Jain and
Saket Saurabh},
title = {How to assign volunteers to tasks compatibly ? {A} graph theoretic
and parameterized approach},
journal = {CoRR},
volume = {abs/2309.04995},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.04995},
doi = {10.48550/ARXIV.2309.04995},
eprinttype = {arXiv},
eprint = {2309.04995},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-04995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-09167,
author = {Pallavi Jain and
Rohit Vaish},
title = {Maximizing Nash Social Welfare under Two-Sided Preferences},
journal = {CoRR},
volume = {abs/2312.09167},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.09167},
doi = {10.48550/ARXIV.2312.09167},
eprinttype = {arXiv},
eprint = {2312.09167},
timestamp = {Tue, 09 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-09167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/KardamSJM22,
author = {Yogita Singh Kardam and
Kamal Srivastava and
Pallavi Jain and
Rafael Mart{\'{\i}}},
title = {Scatter search for the minimum leaf spanning tree problem},
journal = {Comput. Oper. Res.},
volume = {145},
pages = {105858},
year = {2022},
url = {https://doi.org/10.1016/j.cor.2022.105858},
doi = {10.1016/J.COR.2022.105858},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/KardamSJM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eumas/JainST22,
author = {Pallavi Jain and
Krzysztof Sornat and
Nimrod Talmon},
editor = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Preserving Consistency for Liquid Knapsack Voting},
booktitle = {Multi-Agent Systems - 19th European Conference, {EUMAS} 2022, D{\"{u}}sseldorf,
Germany, September 14-16, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13442},
pages = {221--238},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20614-6\_13},
doi = {10.1007/978-3-031-20614-6\_13},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/eumas/JainST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/GuptaJLRS22,
author = {Sushmita Gupta and
Pallavi Jain and
Daniel Lokshtanov and
Sanjukta Roy and
Saket Saurabh},
editor = {Panagiotis Kanellopoulos and
Maria Kyropoulou and
Alexandros A. Voudouris},
title = {Gehrlein Stable Committee with Multi-modal Preferences},
booktitle = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022,
Colchester, UK, September 12-15, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13584},
pages = {508--525},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15714-1\_29},
doi = {10.1007/978-3-031-15714-1\_29},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sagt/GuptaJLRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-02766,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjay Seetharaman},
title = {More Effort Towards Multiagent Knapsack},
journal = {CoRR},
volume = {abs/2208.02766},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.02766},
doi = {10.48550/ARXIV.2208.02766},
eprinttype = {arXiv},
eprint = {2208.02766},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-02766.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GundaJLST21,
author = {Spoorthy Gunda and
Pallavi Jain and
Daniel Lokshtanov and
Saket Saurabh and
Prafullkumar Tale},
title = {On the Parameterized Approximability of Contraction to Classes of
Chordal Graphs},
journal = {{ACM} Trans. Comput. Theory},
volume = {13},
number = {4},
pages = {27:1--27:40},
year = {2021},
url = {https://doi.org/10.1145/3470869},
doi = {10.1145/3470869},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GundaJLST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/0001TB21,
author = {Pallavi Jain and
Nimrod Talmon and
Laurent Bulteau},
editor = {Frank Dignum and
Alessio Lomuscio and
Ulle Endriss and
Ann Now{\'{e}}},
title = {Partition Aggregation for Participatory Budgeting},
booktitle = {{AAMAS} '21: 20th International Conference on Autonomous Agents and
Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021},
pages = {665--673},
publisher = {{ACM}},
year = {2021},
url = {https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p665.pdf},
doi = {10.5555/3463952.3464033},
timestamp = {Wed, 20 Jul 2022 17:03:47 +0200},
biburl = {https://dblp.org/rec/conf/atal/0001TB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/0001ST21,
author = {Pallavi Jain and
Krzysztof Sornat and
Nimrod Talmon},
editor = {Frank Dignum and
Alessio Lomuscio and
Ulle Endriss and
Ann Now{\'{e}}},
title = {Preserving Consistency for Liquid Knapsack Voting},
booktitle = {{AAMAS} '21: 20th International Conference on Autonomous Agents and
Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021},
pages = {1542--1544},
publisher = {{ACM}},
year = {2021},
url = {https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p1542.pdf},
doi = {10.5555/3463952.3464153},
timestamp = {Wed, 20 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/0001ST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/0001KR0S21,
author = {Pallavi Jain and
Lawqueen Kanesh and
Shivesh Kumar Roy and
Saket Saurabh and
Roohani Sharma},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Circumventing Connectivity for Kernelization},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {300--313},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_21},
doi = {10.1007/978-3-030-75242-2\_21},
timestamp = {Thu, 06 May 2021 09:40:55 +0200},
biburl = {https://dblp.org/rec/conf/ciac/0001KR0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/Gupta00T21,
author = {Sushmita Gupta and
Pallavi Jain and
Saket Saurabh and
Nimrod Talmon},
editor = {Zhi{-}Hua Zhou},
title = {Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability
for Multiwinner Rules},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {217--223},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/31},
doi = {10.24963/IJCAI.2021/31},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/Gupta00T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0001STZ21,
author = {Pallavi Jain and
Krzysztof Sornat and
Nimrod Talmon and
Meirav Zehavi},
editor = {Zhi{-}Hua Zhou},
title = {Participatory Budgeting with Project Groups},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {276--282},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/39},
doi = {10.24963/IJCAI.2021/39},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0001STZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/GuptaJPRS21,
author = {Sushmita Gupta and
Pallavi Jain and
Fahad Panolan and
Sanjukta Roy and
Saket Saurabh},
editor = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen},
title = {Gerrymandering on Graphs: Computational Complexity and Parameterized
Algorithms},
booktitle = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
Aarhus, Denmark, September 21-24, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12885},
pages = {140--155},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85947-3\_10},
doi = {10.1007/978-3-030-85947-3\_10},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sagt/GuptaJPRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GuptaJPS21,
author = {Sushmita Gupta and
Pallavi Jain and
Aditya Petety and
Sagar Singh},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Parameterized Complexity of d-Hitting Set with Quotas},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {293--307},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_21},
doi = {10.1007/978-3-030-67731-2\_21},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GuptaJPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-09889,
author = {Sushmita Gupta and
Pallavi Jain and
Fahad Panolan and
Sanjukta Roy and
Saket Saurabh},
title = {Gerrymandering on graphs: Computational complexity and parameterized
algorithms},
journal = {CoRR},
volume = {abs/2102.09889},
year = {2021},
url = {https://arxiv.org/abs/2102.09889},
eprinttype = {arXiv},
eprint = {2102.09889},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-09889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/GuptaJRSZ20,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
title = {Gehrlein stability in committee selection: parameterized hardness
and algorithms},
journal = {Auton. Agents Multi Agent Syst.},
volume = {34},
number = {1},
pages = {27},
year = {2020},
url = {https://doi.org/10.1007/s10458-020-09452-z},
doi = {10.1007/S10458-020-09452-Z},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/GuptaJRSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalJKS20,
author = {Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Saket Saurabh},
title = {Parameterized Complexity of Conflict-Free Matchings and Paths},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1939--1965},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00681-y},
doi = {10.1007/S00453-020-00681-Y},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalJKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JainKM20,
author = {Pallavi Jain and
Lawqueen Kanesh and
Pranabendu Misra},
title = {Conflict Free Version of Covering Problems on Graphs: Classical and
Parameterized},
journal = {Theory Comput. Syst.},
volume = {64},
number = {6},
pages = {1067--1093},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09964-6},
doi = {10.1007/S00224-019-09964-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JainKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalGJK20,
author = {Akanksha Agrawal and
Sushmita Gupta and
Pallavi Jain and
R. Krithika},
title = {Quadratic vertex kernel for split vertex deletion},
journal = {Theor. Comput. Sci.},
volume = {833},
pages = {164--172},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.06.001},
doi = {10.1016/J.TCS.2020.06.001},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalGJK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoudharyJKS20,
author = {Pratibha Choudhary and
Pallavi Jain and
R. Krithika and
Vibha Sahlot},
title = {Vertex deletion on split graphs: Beyond 4-hitting set},
journal = {Theor. Comput. Sci.},
volume = {845},
pages = {21--37},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.08.028},
doi = {10.1016/J.TCS.2020.08.028},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoudharyJKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Gunda0L0T20,
author = {Spoorthy Gunda and
Pallavi Jain and
Daniel Lokshtanov and
Saket Saurabh and
Prafullkumar Tale},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {On the Parameterized Approximability of Contraction to Classes of
Chordal Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {51:1--51:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.51},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.51},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Gunda0L0T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/0001T20,
author = {Pallavi Jain and
Nimrod Talmon},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {Committee Selection with Multimodal Preferences},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {123--130},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200084},
doi = {10.3233/FAIA200084},
timestamp = {Fri, 09 Apr 2021 18:50:05 +0200},
biburl = {https://dblp.org/rec/conf/ecai/0001T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Gupta0R0Z20,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
editor = {Nitin Saxena and
Sunil Simon},
title = {On the (Parameterized) Complexity of Almost Stable Marriage},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {24:1--24:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.24},
doi = {10.4230/LIPICS.FSTTCS.2020.24},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Gupta0R0Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/Gupta0020,
author = {Sushmita Gupta and
Pallavi Jain and
Saket Saurabh},
editor = {Christian Bessiere},
title = {Well-Structured Committees},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {189--195},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/27},
doi = {10.24963/IJCAI.2020/27},
timestamp = {Mon, 20 Jul 2020 12:38:52 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/Gupta0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0001ST20,
author = {Pallavi Jain and
Krzysztof Sornat and
Nimrod Talmon},
editor = {Christian Bessiere},
title = {Participatory Budgeting with Project Interactions},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {386--392},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/54},
doi = {10.24963/IJCAI.2020/54},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0001ST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-08150,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
title = {On the (Parameterized) Complexity of Almost Stable Marriage},
journal = {CoRR},
volume = {abs/2005.08150},
year = {2020},
url = {https://arxiv.org/abs/2005.08150},
eprinttype = {arXiv},
eprint = {2005.08150},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-08150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-10364,
author = {Spoorthy Gunda and
Pallavi Jain and
Daniel Lokshtanov and
Saket Saurabh and
Prafullkumar Tale},
title = {On the Parameterized Approximability of Contraction to Classes of
Chordal Graphs},
journal = {CoRR},
volume = {abs/2006.10364},
year = {2020},
url = {https://arxiv.org/abs/2006.10364},
eprinttype = {arXiv},
eprint = {2006.10364},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-10364.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-05213,
author = {Pallavi Jain and
Krzysztof Sornat and
Nimrod Talmon and
Meirav Zehavi},
title = {Participatory Budgeting with Project Groups},
journal = {CoRR},
volume = {abs/2012.05213},
year = {2020},
url = {https://arxiv.org/abs/2012.05213},
eprinttype = {arXiv},
eprint = {2012.05213},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-05213.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/Gupta0R0Z19,
author = {Sushmita Gupta and
Pallavi Jain and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi},
editor = {Edith Elkind and
Manuela Veloso and
Noa Agmon and
Matthew E. Taylor},
title = {Gehrlein Stability in Committee Selection: Parameterized Hardness
and Algorithms},
booktitle = {Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
2019},
pages = {511--519},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2019},
url = {http://dl.acm.org/citation.cfm?id=3331734},
timestamp = {Wed, 29 May 2019 16:36:58 +0200},
biburl = {https://dblp.org/rec/conf/atal/Gupta0R0Z19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AgrawalG0019,
author = {Akanksha Agrawal and
Sushmita Gupta and
Pallavi Jain and
R. Krithika},
editor = {Pinar Heggernes},
title = {Quadratic Vertex Kernel for Split Vertex Deletion},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {1--12},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_1},
doi = {10.1007/978-3-030-17402-6\_1},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AgrawalG0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Choudhary0KS19,
author = {Pratibha Choudhary and
Pallavi Jain and
R. Krithika and
Vibha Sahlot},
editor = {Pinar Heggernes},
title = {Vertex Deletion on Split Graphs: Beyond 4-Hitting Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {161--173},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_14},
doi = {10.1007/978-3-030-17402-6\_14},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Choudhary0KS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/0001KL0S19,
author = {Pallavi Jain and
Lawqueen Kanesh and
William Lochet and
Saket Saurabh and
Roohani Sharma},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Exact and Approximate Digraph Bandwidth},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.18},
doi = {10.4230/LIPICS.FSTTCS.2019.18},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/0001KL0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AgrawalJKS19,
author = {Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Saket Saurabh},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Parameterized Complexity of Conflict-Free Matchings and Paths},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.35},
doi = {10.4230/LIPICS.MFCS.2019.35},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/AgrawalJKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AgrawalCJKS018,
author = {Akanksha Agrawal and
Pratibha Choudhary and
Pallavi Jain and
Lawqueen Kanesh and
Vibha Sahlot and
Saket Saurabh},
editor = {Lusheng Wang and
Daming Zhu},
title = {Hitting and Covering Partially},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {751--763},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_62},
doi = {10.1007/978-3-319-94776-1\_62},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/AgrawalCJKS018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JainKM18,
author = {Pallavi Jain and
Lawqueen Kanesh and
Pranabendu Misra},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Conflict Free Version of Covering Problems on Graphs: Classical and
Parameterized},
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 = {194--206},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_17},
doi = {10.1007/978-3-319-90530-3\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/JainKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/JainKM018,
author = {Pallavi Jain and
Lawqueen Kanesh and
Jayakrishnan Madathil and
Saket Saurabh},
editor = {Hern{\'{a}}n E. Aguirre and
Keiki Takadama},
title = {A parameterized runtime analysis of randomized local search and evolutionary
algorithm for max \emph{l}-uncut},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference
Companion, {GECCO} 2018, Kyoto, Japan, July 15-19, 2018},
pages = {326--327},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3205651.3205749},
doi = {10.1145/3205651.3205749},
timestamp = {Wed, 20 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/JainKM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AgrawalJKM018,
author = {Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Pranabendu Misra and
Saket Saurabh},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Exploring the Kernelization Borders for Hitting Cycles},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.14},
doi = {10.4230/LIPICS.IPEC.2018.14},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/AgrawalJKM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AgrawalJKL018,
author = {Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Daniel Lokshtanov and
Saket Saurabh},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Conflict Free Feedback Vertex Set: {A} Parameterized Dichotomy},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {53:1--53:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.53},
doi = {10.4230/LIPICS.MFCS.2018.53},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/AgrawalJKL018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/JainSS17,
author = {Pallavi Jain and
Gur Saran and
Kamal Srivastava},
title = {Polynomial Time Efficient Construction Heuristics for Vertex Separation
Minimization Problem},
journal = {Electron. Notes Discret. Math.},
volume = {63},
pages = {353--360},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.11.032},
doi = {10.1016/J.ENDM.2017.11.032},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/JainSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JainJPS17,
author = {Pallavi Jain and
Jayakrishnan Madathil and
Fahad Panolan and
Abhishek Sahu},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Mixed Dominating Set: {A} Parameterized Perspective},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {330--343},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_25},
doi = {10.1007/978-3-319-68705-6\_25},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/JainJPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JainSS17,
author = {Pallavi Jain and
Gur Saran and
Kamal Srivastava},
title = {Polynomial Time Efficient Construction Heuristics for Vertex Separation
Minimization Problem},
journal = {CoRR},
volume = {abs/1702.05710},
year = {2017},
url = {http://arxiv.org/abs/1702.05710},
eprinttype = {arXiv},
eprint = {1702.05710},
timestamp = {Wed, 20 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/JainSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/JainSS16,
author = {Pallavi Jain and
Kamal Srivastava and
Gur Saran},
title = {Minimizing cyclic cutwidth of graphs using a memetic algorithm},
journal = {J. Heuristics},
volume = {22},
number = {6},
pages = {815--848},
year = {2016},
url = {https://doi.org/10.1007/s10732-016-9319-4},
doi = {10.1007/S10732-016-9319-4},
timestamp = {Wed, 20 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/JainSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/JainSS16,
author = {Pallavi Jain and
Gur Saran and
Kamal Srivastava},
title = {On minimizing vertex bisection using a memetic algorithm},
journal = {Inf. Sci.},
volume = {369},
pages = {765--787},
year = {2016},
url = {https://doi.org/10.1016/j.ins.2016.07.055},
doi = {10.1016/J.INS.2016.07.055},
timestamp = {Wed, 20 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/isci/JainSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamris/0001SS16,
author = {Pallavi Jain and
Gur Saran and
Kamal Srivastava},
title = {A new Integer Linear Programming and Quadratically Constrained Quadratic
Programming Formulation for Vertex Bisection Minimization Problem},
journal = {J. Autom. Mob. Robotics Intell. Syst.},
volume = {10},
number = {1},
pages = {69--73},
year = {2016},
url = {https://doi.org/10.14313/jamris\_1-2016/9},
doi = {10.14313/JAMRIS\_1-2016/9},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamris/0001SS16.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-07 22: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:
