Pallavi Jain

80 papers A* 10A 6B 9C 4Misc 2Journal 39Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bribery's Influence on Ranked Aggregation.
CoRR
Pallavi Jain, Anshul Thakur
2026 J jnl
Minimum Envy Graphical House Allocation Beyond Identical Valuations.
CoRR
Tanmay Inamdar, Pallavi Jain, Pranjal Pandey
2026 J jnl
Parameterized Approximation Schemes for Biclique-Free Max
ACM Trans. Algorithms
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2026 J jnl
Participatory budgeting with project groups.
J. Comput. Syst. Sci.
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2026 J jnl
Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes.
CoRR
Umang Bhaskar, Juhi Chaudhary, Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2026 J jnl
When agents choose bundles autonomously: guarantees beyond discrepancy.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 B conf
A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma.
IPEC
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 J jnl
A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 J jnl
Budget-feasible egalitarian allocation of conflicting jobs.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2025 A* conf
Efficient Algorithms for Electing Successive Committees.
IJCAI
Pallavi Jain, Andrzej Kaczmarczyk
2025 J jnl
Efficient Algorithms for Electing Successive Committees.
CoRR
Pallavi Jain, Andrzej Kaczmarczyk
2025 J jnl
Exact and Approximate Digraph Bandwidth.
Theory Comput. Syst.
Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2025 — conf
Fairness and Efficiency in Two-Sided Matching Markets.
FSTTCS
Pallavi Jain, Palash Jha, Shubham Solanki
2025 J jnl
Fairness and Efficiency in Two-Sided Matching Markets.
CoRR
Pallavi Jain, Palash Jha, Shubham Solanki
2025 A* conf
How to Resolve Envy by Adding Goods.
IJCAI
Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals
2025 J jnl
How to Resolve Envy by Adding Goods.
CoRR
Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals
2025 J jnl
Max-SAT with cardinality constraint parameterized by the number of clauses.
Theor. Comput. Sci.
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2025 A* conf
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules.
IJCAI
Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025 J jnl
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules.
CoRR
Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025 — conf
Parameterized Complexity of Disconnected Matchings.
CIAC (2)
Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh
2024 A conf
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
AAMAS
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 J jnl
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
CoRR
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 J jnl
Conflict and Fairness in Resource Allocation.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2024 A conf
Controlling Delegations in Liquid Democracy.
AAMAS
Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren
2024 J jnl
Controlling Delegations in Liquid Democracy.
CoRR
Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon
2024 — conf
Manipulation With(out) Money in Matching Market.
ADT
Sushmita Gupta, Pallavi Jain
2024 — conf
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.
LATIN (2)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024 A* conf
Maximizing Nash Social Welfare under Two-Sided Preferences.
AAAI
Pallavi Jain, Rohit Vaish
2024 A* conf
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.
ICALP
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024 J jnl
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.
CoRR
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024 — conf
Sparsity in Covering Solutions.
LATIN (2)
Pallavi Jain, Manveer Singh Rathore
2024 — conf
When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.
FSTTCS
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024 J jnl
When far is better: The Chamberlin-Courant approach to obnoxious committee selection.
CoRR
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2023 J jnl
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
Algorithmica
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2023 J jnl
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.
CoRR
Sushmita Gupta, Pallavi Jain, Saket Saurabh
2023 J jnl
Maximizing Nash Social Welfare under Two-Sided Preferences.
CoRR
Pallavi Jain, Rohit Vaish
2023 B conf
More Effort Towards Multiagent Knapsack.
SOFSEM
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2023 A* conf
Parameterized Approximation Scheme for Biclique-free Max
SODA
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2022 B conf
Gehrlein Stable Committee with Multi-modal Preferences.
SAGT
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
2022 J jnl
More Effort Towards Multiagent Knapsack.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2022 C conf
Preserving Consistency for Liquid Knapsack Voting.
EUMAS
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
2022 J jnl
Scatter search for the minimum leaf spanning tree problem.
Comput. Oper. Res.
Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí
2021 C conf
Circumventing Connectivity for Kernelization.
CIAC
Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma
2021 A* conf
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
IJCAI
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2021 B conf
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
SAGT
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021 J jnl
Gerrymandering on graphs: Computational complexity and parameterized algorithms.
CoRR
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021 J jnl
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
ACM Trans. Comput. Theory
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2021 B conf
Parameterized Complexity of d-Hitting Set with Quotas.
SOFSEM
Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh
2021 A* conf
Participatory Budgeting with Project Groups.
IJCAI
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2021 A conf
Partition Aggregation for Participatory Budgeting.
AAMAS
Pallavi Jain, Nimrod Talmon, Laurent Bulteau
2021 A conf
Preserving Consistency for Liquid Knapsack Voting.
AAMAS
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
2020 A conf
Committee Selection with Multimodal Preferences.
ECAI
Pallavi Jain, Nimrod Talmon
2020 J jnl
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.
Theory Comput. Syst.
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
2020 J jnl
Gehrlein stability in committee selection: parameterized hardness and algorithms.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 — conf
On the (Parameterized) Complexity of Almost Stable Marriage.
FSTTCS
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 J jnl
On the (Parameterized) Complexity of Almost Stable Marriage.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 — conf
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
APPROX-RANDOM
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020 J jnl
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
CoRR
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Parameterized Complexity of Conflict-Free Matchings and Paths.
Algorithmica
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2020 J jnl
Participatory Budgeting with Project Groups.
CoRR
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2020 A* conf
Participatory Budgeting with Project Interactions.
IJCAI
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
2020 J jnl
Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci.
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2020 J jnl
Vertex deletion on split graphs: Beyond 4-hitting set.
Theor. Comput. Sci.
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
2020 A* conf
Well-Structured Committees.
IJCAI
Sushmita Gupta, Pallavi Jain, Saket Saurabh
2019 — conf
Exact and Approximate Digraph Bandwidth.
FSTTCS
Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2019 A conf
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms.
AAMAS
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019 B conf
Parameterized Complexity of Conflict-Free Matchings and Paths.
MFCS
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2019 C conf
Quadratic Vertex Kernel for Split Vertex Deletion.
CIAC
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2019 C conf
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set.
CIAC
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
2018 — conf
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max
GECCO (Companion)
Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2018 B conf
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.
MFCS
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
2018 Misc conf
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.
CSR
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
2018 B conf
Exploring the Kernelization Borders for Hitting Cycles.
IPEC
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
2018 Misc conf
Hitting and Covering Partially.
COCOON
Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh
2017 B conf
Mixed Dominating Set: A Parameterized Perspective.
WG
Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu
2017 J jnl
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem.
CoRR
Pallavi Jain, Gur Saran, Kamal Srivastava
2017 J jnl
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem.
Electron. Notes Discret. Math.
Pallavi Jain, Gur Saran, Kamal Srivastava
2016 J jnl
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem.
J. Autom. Mob. Robotics Intell. Syst.
Pallavi Jain, Gur Saran, Kamal Srivastava
2016 J jnl
Minimizing cyclic cutwidth of graphs using a memetic algorithm.
J. Heuristics
Pallavi Jain, Kamal Srivastava, Gur Saran
2016 J jnl
On minimizing vertex bisection using a memetic algorithm.
Inf. Sci.
Pallavi Jain, Gur Saran, Kamal Srivastava