Spremljaj
Pallavi Jain
Naslov
Navedeno
Navedeno
Leto
Participatory Budgeting with Project Interactions.
P Jain, K Sornat, N Talmon
IJCAI, 386-392, 2020
272020
On minimizing vertex bisection using a memetic algorithm
P Jain, G Saran, K Srivastava
Information Sciences 369, 765-787, 2016
132016
Branch and bound algorithm for vertex bisection minimization problem
P Jain, G Saran, K Srivastava
Advanced Computing and Communication Technologies: Proceedings of the 9th …, 2016
132016
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
122017
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
112016
Participatory budgeting with project groups
P Jain, K Sornat, N Talmon, M Zehavi
arXiv preprint arXiv:2012.05213, 2020
92020
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
92020
Minimizing cyclic cutwidth of graphs using a memetic algorithm
P Jain, K Srivastava, G Saran
Journal of Heuristics 22, 815-848, 2016
92016
Self-supervised learning for invariant representations from multi-spectral and sar images
P Jain, B Schoen-Phelan, R Ross
IEEE Journal of Selected Topics in Applied Earth Observations and Remote …, 2022
82022
Multi-modal self-supervised representation learning for earth observation
P Jain, B Schoen-Phelan, R Ross
2021 IEEE International Geoscience and Remote Sensing Symposium IGARSS, 3241 …, 2021
82021
On the (parameterized) complexity of almost stable marriage
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
arXiv preprint arXiv:2005.08150, 2020
82020
Gerrymandering on graphs: computational complexity and parameterized algorithms
S Gupta, P Jain, F Panolan, S Roy, S Saurabh
Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus …, 2021
72021
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica 82 (7), 1939-1965, 2020
62020
Preserving consistency for liquid knapsack voting
P Jain, K Sornat, N Talmon
Multi-Agent Systems: 19th European Conference, EUMAS 2022, Düsseldorf …, 2022
42022
Partition aggregation for participatory budgeting
P Jain, N Talmon, L Bulteau
Proceedings of the 20th International Conference on Autonomous Agents and …, 2021
42021
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), 27, 2020
42020
Committee selection with multimodal preferences
P Jain, N Talmon
ECAI 2020, 123-130, 2020
42020
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
On the parameterized approximability of contraction to classes of chordal graphs
S Gunda, P Jain, D Lokshtanov, S Saurabh, P Tale
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
32021
Well-structured committees
S Gupta, P Jain, S Saurabh
Proceedings of the Twenty-Ninth International Conference on International …, 2021
32021
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20