Neeldhara Misra

Theor. Comput. Sci., 2024

The Cost and Complexity of Minimizing Envy in House Allocation.

[BibT_eX]

[DOI]

Jayakrishnan Madathil

CoRR, 2024

A Little Aggression Goes a Long Way.

[BibT_eX]

[DOI]

Jyothi Krishnan

Saraswati Girish Nanoti

CoRR, 2024

Opinion Diffusion on Society Graphs Based on Approval Ballots.

[BibT_eX]

[DOI]

Jayakrishnan Madathil

Yash More

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Envy-Free and Efficient Allocations for Graphical Valuations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

2023

On the exact amount of missing information that makes finding possible winners hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., August, 2023

The Price of Equity with Binary Valuations and Few Agent Types.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Spartan Bipartite Graphs Are Essentially Elementary.

[BibT_eX]

[DOI]

Saraswati Girish Nanoti

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Finding Perfect Matching Cuts Faster.

[BibT_eX]

[DOI]

Yash More

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On the Complexity of the Eigenvalue Deletion Problem.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Complexity of Minimizing Envy in House Allocation.

[BibT_eX]

[DOI]

Jayakrishnan Madathil

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).

[BibT_eX]

[DOI]

Dagstuhl Reports, November, 2022

Exact Multi-Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs.

[BibT_eX]

[DOI]

Saraswati Nanoti

CoRR, 2022

Eternal Vertex Cover on Bipartite Graphs.

[BibT_eX]

[DOI]

Jasine Babu

Saraswati Nanoti

Proceedings of the Computer Science - Theory and Applications, 2022

Diverse Non Crossing Matchings.

[BibT_eX]

Saraswati Nanoti

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

On Fair Division with Binary Valuations Respecting Social Networks.

[BibT_eX]

[DOI]

Debanuj Nayak

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Imbalance parameterized by twin cover revisited.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

Theor. Comput. Sci., 2021

A parameterized perspective on protecting elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Equitable Division of a Path.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Parameterized complexity of happy coloring problems.

[BibT_eX]

[DOI]

Akanksha Agrawal

N. R. Aravind

Theor. Comput. Sci., 2020

Subexponential algorithm for <i>d</i>-cluster edge deletion: Exception or rule?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Color spanning objects: Algorithms and hardness results.

[BibT_eX]

[DOI]

Sandip Banerjee

Subhas C. Nandy

Discret. Appl. Math., 2020

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.

[BibT_eX]

[DOI]

Frances A. Rosamond

Meirav Zehavi

Algorithms, 2020

A Parameterized Perspective on Attacking and Defending Elections.

[BibT_eX]

[DOI]

Kishen N. Gowda

Vraj Patel

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.

[BibT_eX]

[DOI]

Chinmay Sonar

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Fair Division is Hard even for Amicable Agents.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Red-Blue Point Separation for Points on a Circle.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.

[BibT_eX]

[DOI]

Chamanvir Kaur

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On structural parameterizations of firefighting.

[BibT_eX]

[DOI]

Bireswar Das

Murali Krishna Enduri

Theor. Comput. Sci., 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Robustness Radius for Chamberlin-Courant on Restricted Domains.

[BibT_eX]

[DOI]

Chinmay Sonar

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

On the Complexity of Optimal Matching Reconfiguration.

[BibT_eX]

[DOI]

Manoj Gupta

Hitesh Kumar

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.

[BibT_eX]

[DOI]

Piyush Rathi

Proceedings of the Computer Science - Theory and Applications, 2019

On the Parameterized Complexity of Edge-Linked Paths.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

Deleting to Structured Trees.

[BibT_eX]

[DOI]

Pratyush Dayal

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

On the Parameterized Complexity of Party Nominations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

2018

Complexity of manipulation with partial information in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the Parameterized Complexity of Colorful Components and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

On the Complexity of Two Dots for Narrow Boards and Few Colors.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On Structural Parameterizations of Firefighting.

[BibT_eX]

[DOI]

Bireswar Das

Murali Krishna Enduri

I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Frugal bribery in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Backdoors into heterogeneous classes of SAT and CSP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

The Parameterized Complexity of Happy Colorings.

[BibT_eX]

[DOI]

I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Saving Critical Nodes with Firefighters is FPT.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On Structural Parameterizations of Graph Motif and Chromatic Number.

[BibT_eX]

[DOI]

Bireswar Das

Murali Krishna Enduri

I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

On the Complexity of Chamberlin-Courant on Almost Structured Profiles.

[BibT_eX]

[DOI]

Chinmay Sonar

P. R. Vaidyanathan

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Kernelization, Planar F-Deletion.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Alternate Parameterizations.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Kernelization complexity of possible winner and coalitional manipulation problems in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Hitting Forbidden Minors: Approximation and Kernelization.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

The Runaway Rectangle Escape Problem.

[BibT_eX]

[DOI]

CoRR, 2016

Preference Elicitation for Single Crossing Domain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Elicitation for Preferences Single Peaked on Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Two Dots is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

On the Computational Hardness of Manipulating Pairwise Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Randomised Procedures for Initialising and Switching Actions in Policy Iteration.

[BibT_eX]

[DOI]

Shivaram Kalyanakrishnan

Aditya Gopalan

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On Choosing Committees Based on Approval Votes in the Presence of Outliers.

[BibT_eX]

[DOI]

CoRR, 2015

Manipulation is Harder with Incomplete Votes.

[BibT_eX]

[DOI]

CoRR, 2015

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

[BibT_eX]

[DOI]

Algorithmica, 2015

Solving <i>d-</i>SAT via Backdoors to Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Graph Modification Problems: A Modern Perspective.

[BibT_eX]

[DOI]

Fedor V. Fomin

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Unique Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

On the Parameterized Complexity of Minimax Approval Voting.

[BibT_eX]

[DOI]

Arshed Nabeel

Harman Singh

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Detecting Possible Manipulators in Elections.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Complexity of Kernelization in the Possible Winner Problem.

[BibT_eX]

[DOI]

CoRR, 2014

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.

[BibT_eX]

[DOI]

Algorithmica, 2014

UNO Gets Easier for a Single Player.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Vertex Cover Gets Faster and Harder on Low Degree Graphs.

[BibT_eX]

[DOI]

Akanksha Agrawal

Sathish Govindarajan

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

On the d-Runaway Rectangle Escape Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Solving min ones 2-sat as fast as vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Imbalance is fixed parameter tractable.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Inf. Process. Lett., 2013

An Erdős--Ko--Rado theorem for matchings in the complete graph

[BibT_eX]

[DOI]

CoRR, 2013

On the Parameterized Complexity of the Maximum Edge Coloring Problem.

[BibT_eX]

[DOI]

CoRR, 2013

The Parameterized Complexity of Unique Coverage and Its Variants.

[BibT_eX]

[DOI]

Algorithmica, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Hitting and Piercing Rectangles Induced by a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On Parameterized Independent Feedback Vertex Set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

FPT algorithms for Connected Feedback Vertex Set.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Planar F-Deletion: Approximation and Optimal FPT Algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Kernelization - Preprocessing with a Guarantee.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Lower bounds on kernelization.

[BibT_eX]

[DOI]

Venkatesh Raman