Prajakta Nimbhorkar

CoRR, 2023

EFX Exists for Four Agents with Three Types of Valuations.

[BibT_eX]

[DOI]

CoRR, 2023

Critical Relaxed Stable Matchings with Two-Sided Ties.

[BibT_eX]

[DOI]

Keshav Ranjan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Fair Healthcare Rationing to Maximize Dynamic Utilities.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2023

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Matchings Under Diversity Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Bipartite Matchings with Group Fairness and Individual Fairness Constraints.

[BibT_eX]

[DOI]

Atasi Panda

Anand Louis

CoRR, 2022

Popular Critical Matchings in the Many-to-Many Setting.

[BibT_eX]

[DOI]

Keshav Ranjan

CoRR, 2022

Popular Edges with Critical Nodes.

[BibT_eX]

[DOI]

Kushagra Chatterjee

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Disjoint Stable Matchings in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Disjoint Stable Matchings in Linear Time.

[BibT_eX]

[DOI]

Geevarghese Philip

Vishwa Prakash HV

CoRR, 2020

2019

Rank-maximal matchings - structure and algorithms.

[BibT_eX]

[DOI]

Pratik Ghosal

Theor. Comput. Sci., 2019

Dynamic rank-maximal and popular matchings.

[BibT_eX]

[DOI]

V Arvind Rameshwar

J. Comb. Optim., 2019

Maximum-Size Envy-free Matchings.

[BibT_eX]

[DOI]

CoRR, 2019

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.

[BibT_eX]

[DOI]

Nada Pulath

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties.

[BibT_eX]

[DOI]

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

2018

Expanding Generating Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Shortest path length with bounded-alternation (min, +) formulas.

[BibT_eX]

[DOI]

Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

Computing the maximum using (min, +) formulas.

[BibT_eX]

[DOI]

Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings.

[BibT_eX]

[DOI]

Nada Pulath

CoRR, 2018

How Good Are Popular Matchings?.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017

Popular Matching with Lower Quotas.

[BibT_eX]

[DOI]

CoRR, 2017

Popular Matchings with Lower Quotas.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Dynamic Rank-Maximal Matchings.

[BibT_eX]

[DOI]

V Arvind Rameshwar

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2014

Popularity at minimum cost.

[BibT_eX]

[DOI]

Telikepalli Kavitha

J. Comb. Optim., 2014

2013

Log-Space Algorithms for Paths and Matchings in k-Trees.

[BibT_eX]

[DOI]

Bireswar Das

Samir Datta

Theory Comput. Syst., 2013

2012

The planar k-means problem is NP-hard.

[BibT_eX]

[DOI]

Kasturi R. Varadarajan

Theor. Comput. Sci., 2012

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

[BibT_eX]

[DOI]

CoRR, 2012

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Expanding Generator Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.

[BibT_eX]

[DOI]

Vikraman Arvind

Partha Mukhopadhyay

Electron. Colloquium Comput. Complex., 2011

Pseudorandom generators for group products: extended abstract.

[BibT_eX]

[DOI]

Michal Koucký

Pavel Pudlák

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Pseudorandom Generators for Group Products.

[BibT_eX]

[DOI]

Michal Koucký

Pavel Pudlák

Electron. Colloquium Comput. Complex., 2010

Graph Isomorphism for K<sub>3,3</sub>-free and K<sub>5</sub>-free graphs is in Log-space.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Longest Paths in Planar DAGs in Unambiguous Log-Space.

[BibT_eX]

[DOI]

Nutan Limaye

Chic. J. Theor. Comput. Sci., 2010

2009

Planar Graph Isomorphism is in Log-space.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.

[BibT_eX]

[DOI]

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

Longest Paths in Planar DAGs in Unambiguous Logspace.

[BibT_eX]

[DOI]

Nutan Limaye

Proceedings of the Theory of Computing 2009, 2009

2008

A Log-space Algorithm for Canonization of Planar Graphs

[BibT_eX]

[DOI]

CoRR, 2008

3-connected Planar Graph Isomorphism is in Log-space.

[BibT_eX]

[DOI]

Samir Datta

Nutan Limaye