Pallavi Jain
Title
Cited by
Cited by
Year
Participatory Budgeting with Project Interactions.
P Jain, K Sornat, N Talmon
IJCAI, 386-392, 2020
122020
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
International Workshop on Graph-Theoretic Concepts in Computer Science, 330-343, 2017
82017
On minimizing vertex bisection using a memetic algorithm
P Jain, G Saran, K Srivastava
Information Sciences 369, 765-787, 2016
82016
Branch and bound algorithm for vertex bisection minimization problem
P Jain, G Saran, K Srivastava
Advanced Computing and Communication Technologies, 17-23, 2016
72016
Conflict free version of covering problems on graphs: Classical and parameterized
P Jain, L Kanesh, P Misra
Theory of Computing Systems 64 (6), 1067-1093, 2020
62020
A new integer linear programming and quadratically constrained quadratic programming formulation for vertex bisection minimization problem
P Jain, G Saran, K Srivastava
Journal of Automation, Mobile Robotics and Intelligent Systems, 69-73, 2016
62016
Minimizing cyclic cutwidth of graphs using a memetic algorithm
P Jain, K Srivastava, G Saran
Journal of Heuristics 22 (6), 815-848, 2016
52016
Exploring the kernelization borders for hitting cycles
A Agrawal, P Jain, L Kanesh, P Misra, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
42018
Vertex deletion on split graphs: Beyond 4-hitting set
P Choudhary, P Jain, R Krithika, V Sahlot
Theoretical Computer Science 845, 21-37, 2020
22020
Participatory Budgeting with Project Groups
P Jain, K Sornat, N Talmon, M Zehavi
arXiv preprint arXiv:2012.05213, 2020
22020
On the parameterized approximability of contraction to classes of chordal graphs
S Gunda, P Jain, D Lokshtanov, S Saurabh, P Tale
arXiv preprint arXiv:2006.10364, 2020
22020
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica, 1-27, 2020
22020
Conflict free feedback vertex set: a parameterized dichotomy
A Agrawal, P Jain, L Kanesh, D Lokshtanov, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
22018
On the (Parameterized) Complexity of Almost Stable Marriage
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
arXiv preprint arXiv:2005.08150, 2020
12020
Gehrlein stability in committee selection: parameterized hardness and algorithms
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
Autonomous Agents and Multi-Agent Systems 34 (1), 1-21, 2020
12020
Committee Selection with Multimodal Preferences
P Jain, N Talmon
ECAI 2020, 123-130, 2020
12020
Partition Aggregation for Budgeting
L Bulteau, P Jain, N Talmon
12th Multidisciplinary Workshop on Advances in Preference Handling, at ECAIí20, 2020
12020
Well-Structured Committees.
S Gupta, P Jain, S Saurabh
IJCAI, 189-195, 2020
12020
Hitting and Covering Partially
A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh
International Computing and Combinatorics Conference, 751-763, 2018
12018
Quadratic vertex kernel for split vertex deletion
A Agrawal, S Gupta, P Jain, R Krithika
Theoretical Computer Science 833, 164-172, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20