Pallavi Jain

Orcid: 0000-0001-8900-9797

Affiliations:
  • Indian Institute of Technology Jodhpur, India
  • Institute of Mathematical Sciences, HBNI, Chennai, India (former)


According to our database1, Pallavi Jain authored at least 41 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
When far is better: The Chamberlin-Courant approach to obnoxious committee selection.
CoRR, 2024

Conflict and Fairness in Resource Allocation.
CoRR, 2024

Sparsity in Covering Solutions.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Controlling Delegations in Liquid Democracy.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Manipulation With(out) Money in Matching Market.
Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

Maximizing Nash Social Welfare under Two-Sided Preferences.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
Algorithmica, December, 2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.
CoRR, 2023

More Effort Towards Multiagent Knapsack.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Scatter search for the minimum leaf spanning tree problem.
Comput. Oper. Res., 2022

Gehrlein Stable Committee with Multi-modal Preferences.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Preserving Consistency for Liquid Knapsack Voting.
Proceedings of the Multi-Agent Systems - 19th European Conference, 2022

2021
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
ACM Trans. Comput. Theory, 2021

Parameterized Complexity of d-Hitting Set with Quotas.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Participatory Budgeting with Project Groups.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Circumventing Connectivity for Kernelization.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Partition Aggregation for Participatory Budgeting.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Vertex deletion on split graphs: Beyond 4-hitting set.
Theor. Comput. Sci., 2020

Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci., 2020

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.
Theory Comput. Syst., 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.
Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.
Auton. Agents Multi Agent Syst., 2020

Well-Structured Committees.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Participatory Budgeting with Project Interactions.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Committee Selection with Multimodal Preferences.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Exact and Approximate Digraph Bandwidth.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Exploring the Kernelization Borders for Hitting Cycles.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max <i>l</i>-uncut.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Hitting and Covering Partially.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem.
Electron. Notes Discret. Math., 2017

Mixed Dominating Set: A Parameterized Perspective.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem.
J. Autom. Mob. Robotics Intell. Syst., 2016

On minimizing vertex bisection using a memetic algorithm.
Inf. Sci., 2016

Minimizing cyclic cutwidth of graphs using a memetic algorithm.
J. Heuristics, 2016


  Loading...