default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPallavi Jain 0001
Person information
- affiliation: Indian Institute of Technology Jodhpur, India
- affiliation (former): Institute of Mathematical Sciences, HBNI, Chennai, India
Other persons with the same name
- Pallavi Jain 0002 — Department of Computer Science and Engineering, SVITS Indore, India
- Pallavi Jain 0003
![[0000-0002-1731-8993]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-1731-8993")
— Technological University Dublin, Ireland - Pallavi Jain 0004 — Mediterranean Agronomic Institute of Montpellier, France (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85(12): 3717-3740 (2023)- 2022
- [j11]Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí:
Scatter search for the minimum leaf spanning tree problem. Comput. Oper. Res. 145: 105858 (2022) - 2021
- [j10]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021) - 2020
- [j9]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34(1): 27 (2020) - [j8]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh:
Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 82(7): 1939-1965 (2020) - [j7]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64(6): 1067-1093 (2020) - [j6]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833: 164-172 (2020) - [j5]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845: 21-37 (2020) - 2017
- [j4]Pallavi Jain, Gur Saran, Kamal Srivastava:
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. Electron. Notes Discret. Math. 63: 353-360 (2017) - 2016
- [j3]Pallavi Jain, Kamal Srivastava, Gur Saran:
Minimizing cyclic cutwidth of graphs using a memetic algorithm. J. Heuristics 22(6): 815-848 (2016) - [j2]Pallavi Jain, Gur Saran, Kamal Srivastava:
On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369: 765-787 (2016) - [j1]Pallavi Jain, Gur Saran, Kamal Srivastava:
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem. J. Autom. Mob. Robotics Intell. Syst. 10(1): 69-73 (2016)
Conference and Workshop Papers
- 2024
- [c34]Pallavi Jain, Rohit Vaish:
Maximizing Nash Social Welfare under Two-Sided Preferences. AAAI 2024: 9798-9806 - [c33]Sushmita Gupta, Pallavi Jain:
Manipulation With(out) Money in Matching Market. ADT 2024: 273-287 - [c32]Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren:
Controlling Delegations in Liquid Democracy. AAMAS 2024: 2624-2632 - [c31]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS 2024: 2659-2667 - [c30]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - [c29]Pallavi Jain, Manveer Singh Rathore:
Sparsity in Covering Solutions. LATIN (2) 2024: 131-146 - [c28]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - 2023
- [c27]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [c26]Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. SOFSEM 2023: 47-62 - 2022
- [c25]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. EUMAS 2022: 221-238 - [c24]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - 2021
- [c23]Pallavi Jain, Nimrod Talmon, Laurent Bulteau:
Partition Aggregation for Participatory Budgeting. AAMAS 2021: 665-673 - [c22]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. AAMAS 2021: 1542-1544 - [c21]Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. CIAC 2021: 300-313 - [c20]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223 - [c19]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. IJCAI 2021: 276-282 - [c18]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c17]Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh:
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM 2021: 293-307 - 2020
- [c16]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM 2020: 51:1-51:19 - [c15]Pallavi Jain, Nimrod Talmon:
Committee Selection with Multimodal Preferences. ECAI 2020: 123-130 - [c14]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - [c13]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
Well-Structured Committees. IJCAI 2020: 189-195 - [c12]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Participatory Budgeting with Project Interactions. IJCAI 2020: 386-392 - 2019
- [c11]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS 2019: 511-519 - [c10]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC 2019: 1-12 - [c9]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC 2019: 161-173 - [c8]Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma:
Exact and Approximate Digraph Bandwidth. FSTTCS 2019: 18:1-18:15 - [c7]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh:
Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS 2019: 35:1-35:15 - 2018
- [c6]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - [c5]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. CSR 2018: 194-206 - [c4]Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. GECCO (Companion) 2018: 326-327 - [c3]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh:
Exploring the Kernelization Borders for Hitting Cycles. IPEC 2018: 14:1-14:14 - [c2]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh:
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15 - 2017
- [c1]Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu:
Mixed Dominating Set: A Parameterized Perspective. WG 2017: 330-343
Informal and Other Publications
- 2024
- [i13]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR abs/2402.02719 (2024) - [i12]Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - [i11]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - [i10]Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon:
Controlling Delegations in Liquid Democracy. CoRR abs/2403.07558 (2024) - [i9]Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (2024) - 2023
- [i8]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR abs/2309.04995 (2023) - [i7]Pallavi Jain, Rohit Vaish:
Maximizing Nash Social Welfare under Two-Sided Preferences. CoRR abs/2312.09167 (2023) - 2022
- [i6]Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. CoRR abs/2208.02766 (2022) - 2021
- [i5]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - 2020
- [i4]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020) - [i3]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR abs/2006.10364 (2020) - [i2]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. CoRR abs/2012.05213 (2020) - 2017
- [i1]Pallavi Jain, Gur Saran, Kamal Srivastava:
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. CoRR abs/1702.05710 (2017)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 21:39 CET 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:
