Telikepalli Kavitha

ACM Trans. Algorithms, January, 2024

Arborescences, Colorful Forests, and Popularity.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Perfect Matchings and Popularity in the Many-To-Many Setting.

[BibT_eX]

[DOI]

Kazuhisa Makino

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Semi-Popular Matchings and Copeland Winners.

[BibT_eX]

[DOI]

Rohit Vaish

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

2022

Understanding Popular Matchings via Stable Matchings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Popular branchings and their dual certificates.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Math. Program., 2022

Quasi-Popular Matchings, Optimality, and Extended Formulations.

[BibT_eX]

[DOI]

Yuri Faenza

Math. Oper. Res., 2022

Fairly Popular Matchings and Optimality.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

The popular assignment problem: when cardinality is more important than popularity.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Stable Matchings with One-Sided Ties and Approximate Popularity.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

A Little Charity Guarantees Almost Envy-Freeness.

[BibT_eX]

[DOI]

Bhaskar Ray Chaudhury

Alkmini Sgouritsa

SIAM J. Comput., 2021

Popularity, Mixed Matchings, and Self-Duality.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Matchings and Copeland's Method.

[BibT_eX]

[DOI]

Rohit Vaish

CoRR, 2021

Popular Matchings in Complete Graphs.

[BibT_eX]

[DOI]

Ágnes Cseh

Algorithmica, 2021

Maximum Matchings and Popularity.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Matchings, Critical Nodes, and Popular Solutions.

[BibT_eX]

[DOI]

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

2020

Envy-free Relaxations for Goods, Chores, and Mixed Items.

[BibT_eX]

[DOI]

Kristóf Bérczi

Erika R. Bérczi-Kovács

Endre Boros

Fekadu Tolessa Gedefa

CoRR, 2020

Min-Cost Popular Matchings.

[BibT_eX]

[DOI]

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

2019

Two Problems in Max-Size Popular Matchings.

[BibT_eX]

[DOI]

Florian Brandl

Algorithmica, 2019

Popular Matchings and Limits to Tractability.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Popular Matchings: Good, Bad, and Mixed (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Popular Roommates in Simply Exponential Time.

[BibT_eX]

[DOI]

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

2018

Popular edges and dominant matchings.

[BibT_eX]

[DOI]

Ágnes Cseh

Math. Program., 2018

Distributed construction of purely additive spanners.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Popularity, stability, and the dominant matching polytope.

[BibT_eX]

[DOI]

CoRR, 2018

The Popular Roommates problem.

[BibT_eX]

[DOI]

CoRR, 2018

Max-size popular matchings and extensions.

[BibT_eX]

[DOI]

CoRR, 2018

Popular Matchings of Desired Size.

[BibT_eX]

[DOI]

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

2017

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

[BibT_eX]

[DOI]

Ágnes Cseh

SIAM J. Discret. Math., 2017

New Pairwise Spanners.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

New Algorithms for Maximum Weight Matching and a Decomposition Theorem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Popular Matchings with Multiple Partners.

[BibT_eX]

[DOI]

Florian Brandl

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

2016

Ranked Matching.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fair Matchings and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2016

Popular Half-Integral Matchings.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Small Stretch Pairwise Spanners and Approximate D-Preservers.

[BibT_eX]

[DOI]

Nithin M. Varma

SIAM J. Discret. Math., 2015

Improved approximation algorithms for two variants of the stable marriage problem with ties.

[BibT_eX]

[DOI]

Math. Program., 2015

Maintaining Near-Popular Matchings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

A Size-Popularity Tradeoff in the Stable Marriage Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Dynamic Matrix Rank with Partial Lookahead.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Popularity at minimum cost.

[BibT_eX]

[DOI]

Prajakta Nimbhorkar

J. Comb. Optim., 2014

An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Near-Popular Matchings in the Roommates Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Popular matchings in the stable marriage problem.

[BibT_eX]

[DOI]

Inf. Comput., 2013

On Pairwise Spanners.

[BibT_eX]

[DOI]

Marek Cygan

Fabrizio Grandoni

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Small Stretch Pairwise Spanners.

[BibT_eX]

[DOI]

Nithin M. Varma

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Properties of Gomory-Hu co-cycle bases.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Max-coloring paths: tight bounds and extensions.

[BibT_eX]

[DOI]

Julián Mestre

J. Comb. Optim., 2012

Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Popularity vs maximum cardinality in the stable marriage setting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficient algorithms for maximum weight matchings in general graphs with small edge weights.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Popular matchings with variable item copies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Popular mixed matchings.

[BibT_eX]

[DOI]

Julián Mestre

Theor. Comput. Sci., 2011

New Approximation Algorithms for Minimum Cycle Bases of Graphs.

[BibT_eX]

[DOI]

Dimitrios Michail

Algorithmica, 2011

Bounded Unpopularity Matchings.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Additive spanners and (alpha, beta)-spanners.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Voting Paths.

[BibT_eX]

[DOI]

David J. Abraham

SIAM J. Discret. Math., 2010

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.

[BibT_eX]

[DOI]

Surender Baswana

SIAM J. Comput., 2010

Assigning Papers to Referees.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Optimal popular matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Cycle bases in graphs characterization, algorithms, complexity, and applications.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

Popular Matchings with Variable Job Capacities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Ranked Matching.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Faster Algorithms for Minimum Cycle Basis in Directed Graphs.

[BibT_eX]

[DOI]

Ramesh Hariharan

SIAM J. Comput., 2008

An improved heuristic for computing short integral cycle bases.

[BibT_eX]

[DOI]

Katakam Vamsi Krishna

ACM J. Exp. Algorithmics, 2008

An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2008

On a Special Co-cycle Basis of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Faster Algorithms for Incremental Topological Ordering.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Popular Matchings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Algorithms to Compute Minimum Cycle Basis in Directed Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Linear time algorithms for Abelian group isomorphism and related problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Faster Algorithms for Online Topological Ordering

[BibT_eX]

[DOI]

Rogers Mathew

CoRR, 2007

An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient algorithms for computing all low s-t edge connectivities and related problems.

[BibT_eX]

[DOI]

Ramesh Hariharan

Debmalya Panigrahi

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Rank-maximal matchings.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

The carvingwidth of hypercubes.

[BibT_eX]

[DOI]

L. Sunil Chandran

Discret. Math., 2006

The treewidth and pathwidth of hypercubes.

[BibT_eX]

[DOI]

L. Sunil Chandran

Discret. Math., 2006

Dynamic Matching Markets and Voting Paths.

[BibT_eX]

[DOI]

David J. Abraham

Proceedings of the Algorithm Theory, 2006

Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.

[BibT_eX]

[DOI]

Chintan D. Shah

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.

[BibT_eX]

[DOI]

Ramesh Hariharan

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.

[BibT_eX]

[DOI]

Surender Baswana

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Lower bounds for adaptive locally decodable codes.

[BibT_eX]

[DOI]

Amit Deshpande

Rahul Jain

Satyanarayana V. Lokam

Jaikumar Radhakrishnan

Random Struct. Algorithms, 2005

A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

New constructions of (alpha, beta)-spanners and purely additive spanners.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

A Faster Algorithm for Minimum Cycle Basis of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Efficient Algorithms for Abelian Group Isomorphism and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Isoperimetric Inequalities and the Width Parameters of Graphs.

[BibT_eX]

[DOI]

L. Sunil Chandran

C. R. Subramanian

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

On shortest paths in line arrangements.

[BibT_eX]

[DOI]

Kasturi R. Varadarajan

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

Subir Kumar Ghosh

Sylvain Lazard

Algorithmica, 2002

Better Lower Bounds for Locally Decodable Codes.

[BibT_eX]

[DOI]

Amit Deshpande

Rahul Jain