Telikepalli Kavitha

148 papers A* 20A 10B 9Misc 1Journal 80Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Condorcet Dimension and Pareto Optimality for Matchings and Beyond. CoRR Telikepalli Kavitha, Jannik Matuschke, Ulrike Schmidt-Kraepelin
2026	J	`jnl`	Max-Utility Matchings with Popularity via Critical Vertices. Algorithmica Telikepalli Kavitha
2025	J	`jnl`	Best-of-Both-Worlds Guarantees with Fairer Endings. CoRR Telikepalli Kavitha, Surya Panchapakesan, Rohit Vaish, Vignesh Viswanathan, Jatin Yadav
2025	—	`conf`	Fault-Tolerant Approximate Distance Oracles with a Source Set. FSTTCS Dipan Dey, Telikepalli Kavitha
2025	J	`jnl`	Fault-Tolerant Approximate Distance Oracles with a Source Set. CoRR Dipan Dey, Telikepalli Kavitha
2025	J	`jnl`	Matchings, Relaxed Popularity, and Optimality. SIAM J. Discret. Math. Telikepalli Kavitha
2025	J	`jnl`	Popular Arborescences and Their Matroid Generalization. ACM Trans. Algorithms Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2025	J	`jnl`	Popular Roommates in Simply Exponential Time. Algorithmica Telikepalli Kavitha
2024	A*	`conf`	Arborescences, Colorful Forests, and Popularity. SODA Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Maximum Matchings and Popularity. SIAM J. Discret. Math. Telikepalli Kavitha
2024	J	`jnl`	Perfect Matchings and Popularity in the Many-to-Many Setting. CoRR Telikepalli Kavitha, Kazuhisa Makino
2024	J	`jnl`	Popular Matchings with One-Sided Bias. ACM Trans. Algorithms Telikepalli Kavitha
2024	B	`conf`	Popular Solutions for Optimal Matchings. WG Telikepalli Kavitha
2024	J	`jnl`	Stable Matchings, One-Sided Ties, and Approximate Popularity. Algorithmica Telikepalli Kavitha
2023	—	`ed.`	2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023 SOSA Telikepalli Kavitha, Kurt Mehlhorn
2023	J	`jnl`	Arborescences, Colorful Forests, and Popularity. CoRR Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2023	—	`conf`	Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS Telikepalli Kavitha, Kazuhisa Makino
2023	A	`conf`	Semi-Popular Matchings and Copeland Winners. AAMAS Telikepalli Kavitha, Rohit Vaish
2022	A	`conf`	Fairly Popular Matchings and Optimality. STACS Telikepalli Kavitha
2022	J	`jnl`	Popular Matchings with One-Sided Bias. CoRR Telikepalli Kavitha
2022	J	`jnl`	Popular branchings and their dual certificates. Math. Program. Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2022	J	`jnl`	Quasi-Popular Matchings, Optimality, and Extended Formulations. Math. Oper. Res. Yuri Faenza, Telikepalli Kavitha
2022	—	`conf`	Stable Matchings with One-Sided Ties and Approximate Popularity. FSTTCS Telikepalli Kavitha
2022	A*	`conf`	The popular assignment problem: when cardinality is more important than popularity. SODA Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2022	J	`jnl`	Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
2021	J	`jnl`	A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2021	J	`jnl`	Matchings and Copeland's Method. CoRR Telikepalli Kavitha, Rohit Vaish
2021	—	`conf`	Matchings, Critical Nodes, and Popular Solutions. FSTTCS Telikepalli Kavitha
2021	A*	`conf`	Maximum Matchings and Popularity. ICALP Telikepalli Kavitha
2021	J	`jnl`	Popular Matchings in Complete Graphs. Algorithmica Ágnes Cseh, Telikepalli Kavitha
2021	J	`jnl`	Popularity, Mixed Matchings, and Self-Duality. Math. Oper. Res. Chien-Chung Huang, Telikepalli Kavitha
2021	J	`jnl`	The popular assignment problem: when cardinality is more important than popularity. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	A*	`conf`	A Little Charity Guarantees Almost Envy-Freeness. SODA Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Maximum Matchings and Popularity. CoRR Telikepalli Kavitha
2020	—	`conf`	Min-Cost Popular Matchings. FSTTCS Telikepalli Kavitha
2020	B	`conf`	Popular Branchings and Their Dual Certificates. IPCO Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	A*	`conf`	Popular Matchings with One-Sided Bias. ICALP Telikepalli Kavitha
2020	A*	`conf`	Quasi-popular Matchings, Optimality, and Extended Formulations. SODA Yuri Faenza, Telikepalli Kavitha
2019	J	`jnl`	A Little Charity Guarantees Almost Envy-Freeness. CoRR Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
2019	J	`jnl`	Popular Branchings and Their Dual Certificates. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2019	A*	`conf`	Popular Matchings and Limits to Tractability. SODA Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
2019	B	`conf`	Popular Matchings: Good, Bad, and Mixed (Invited Talk). MFCS Telikepalli Kavitha
2019	—	`conf`	Popular Roommates in Simply Exponential Time. FSTTCS Telikepalli Kavitha
2019	J	`jnl`	Quasi-popular Matchings, Optimality, and Extended Formulations. CoRR Yuri Faenza, Telikepalli Kavitha
2019	J	`jnl`	Two Problems in Max-Size Popular Matchings. Algorithmica Florian Brandl, Telikepalli Kavitha
2018	J	`jnl`	Distributed construction of purely additive spanners. Distributed Comput. Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
2018	J	`jnl`	Max-size popular matchings and extensions. CoRR Telikepalli Kavitha
2018	J	`jnl`	Popular Matchings and Limits to Tractability. CoRR Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
2018	—	`conf`	Popular Matchings in Complete Graphs. FSTTCS Ágnes Cseh, Telikepalli Kavitha
2018	J	`jnl`	Popular Matchings in Complete Graphs. CoRR Ágnes Cseh, Telikepalli Kavitha
2018	B	`conf`	Popular Matchings of Desired Size. WG Telikepalli Kavitha
2018	J	`jnl`	Popular edges and dominant matchings. Math. Program. Ágnes Cseh, Telikepalli Kavitha
2018	J	`jnl`	Popularity, stability, and the dominant matching polytope. CoRR Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
2018	J	`jnl`	The Popular Roommates problem. CoRR Telikepalli Kavitha
2017	J	`jnl`	New Algorithms for Maximum Weight Matching and a Decomposition Theorem. Math. Oper. Res. Chien-Chung Huang, Telikepalli Kavitha
2017	J	`jnl`	New Pairwise Spanners. Theory Comput. Syst. Telikepalli Kavitha
2017	—	`conf`	Popular Matchings with Multiple Partners. FSTTCS Florian Brandl, Telikepalli Kavitha
2017	J	`jnl`	Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
2017	A*	`conf`	Popularity, Mixed Matchings, and Self-duality. SODA Chien-Chung Huang, Telikepalli Kavitha
2016	A	`conf`	Distributed Construction of Purely Additive Spanners. DISC Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
2016	J	`jnl`	Distributed Construction of Purely Additive Spanners. CoRR Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
2016	J	`jnl`	Fair Matchings and Related Problems. Algorithmica Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2016	B	`conf`	Popular Edges and Dominant Matchings. IPCO Ágnes Cseh, Telikepalli Kavitha
2016	A*	`conf`	Popular Half-Integral Matchings. ICALP Telikepalli Kavitha
2016	J	`jnl`	Popular Matchings with Multiple Partners. CoRR Florian Brandl, Telikepalli Kavitha
2016	J	`jnl`	Popular matchings with two-sided preferences and one-sided ties. CoRR Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
2016	—	`ch.`	Ranked Matching. Encyclopedia of Algorithms Telikepalli Kavitha
2015	J	`jnl`	Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. Chien-Chung Huang, Telikepalli Kavitha
2015	—	`conf`	Maintaining Near-Popular Matchings. ICALP (2) Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner
2015	A	`conf`	New Pairwise Spanners. STACS Telikepalli Kavitha
2015	J	`jnl`	Popular Edges and Dominant Matchings. CoRR Ágnes Cseh, Telikepalli Kavitha
2015	—	`conf`	Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
2015	J	`jnl`	Small Stretch Pairwise Spanners and Approximate D-Preservers. SIAM J. Discret. Math. Telikepalli Kavitha, Nithin M. Varma
2014	J	`jnl`	A Size-Popularity Tradeoff in the Stable Marriage Problem. SIAM J. Comput. Telikepalli Kavitha
2014	B	`conf`	An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. IPCO Chien-Chung Huang, Telikepalli Kavitha
2014	J	`jnl`	Dynamic Matrix Rank with Partial Lookahead. Theory Comput. Syst. Telikepalli Kavitha
2014	J	`jnl`	Popularity at minimum cost. J. Comb. Optim. Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2013	—	`conf`	Fair Matchings and Related Problems. FSTTCS Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2013	J	`jnl`	Near-Popular Matchings in the Roommates Problem. SIAM J. Discret. Math. Chien-Chung Huang, Telikepalli Kavitha
2013	J	`jnl`	On Pairwise Spanners CoRR Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
2013	A	`conf`	On Pairwise Spanners. STACS Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
2013	J	`jnl`	Popular matchings in the stable marriage problem. Inf. Comput. Chien-Chung Huang, Telikepalli Kavitha
2013	—	`conf`	Small Stretch Pairwise Spanners. ICALP (1) Telikepalli Kavitha, Nithin M. Varma
2012	A*	`conf`	Efficient algorithms for maximum weight matchings in general graphs with small edge weights. SODA Chien-Chung Huang, Telikepalli Kavitha
2012	J	`jnl`	Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. Algorithmica Telikepalli Kavitha
2012	—	`ed.`	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, Hyderabad, India, December 15-17, 2012 FSTTCS Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan
2012	J	`jnl`	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2012	J	`jnl`	Max-coloring paths: tight bounds and extensions. J. Comb. Optim. Telikepalli Kavitha, Julián Mestre
2012	A*	`conf`	Popularity vs maximum cardinality in the stable marriage setting. SODA Telikepalli Kavitha
2012	J	`jnl`	Properties of Gomory-Hu co-cycle bases. Theor. Comput. Sci. Telikepalli Kavitha
2011	J	`jnl`	Bounded Unpopularity Matchings. Algorithmica Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
2011	J	`jnl`	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance CoRR Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2011	A	`conf`	Near-Popular Matchings in the Roommates Problem. ESA Chien-Chung Huang, Telikepalli Kavitha
2011	J	`jnl`	New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2011	—	`conf`	Popular Matchings in the Stable Marriage Problem. ICALP (1) Chien-Chung Huang, Telikepalli Kavitha
2011	J	`jnl`	Popular matchings with variable item copies. Theor. Comput. Sci. Telikepalli Kavitha, Meghana Nasre
2011	J	`jnl`	Popular mixed matchings. Theor. Comput. Sci. Telikepalli Kavitha, Julián Mestre, Meghana Nasre
2010	J	`jnl`	Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2010	J	`jnl`	Assigning Papers to Referees. Algorithmica Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
2010	J	`jnl`	Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. Surender Baswana, Telikepalli Kavitha
2010	J	`jnl`	Popularity at Minimum Cost CoRR Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2010	—	`conf`	Popularity at Minimum Cost. ISAAC (1) Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2010	J	`jnl`	Voting Paths. SIAM J. Discret. Math. David J. Abraham, Telikepalli Kavitha
2009	J	`jnl`	Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig
2009	B	`conf`	Max-Coloring Paths: Tight Bounds and Extensions. ISAAC Telikepalli Kavitha, Julián Mestre
2009	J	`jnl`	Optimal popular matchings. Discret. Appl. Math. Telikepalli Kavitha, Meghana Nasre
2009	B	`conf`	Popular Matchings with Variable Job Capacities. ISAAC Telikepalli Kavitha, Meghana Nasre
2009	—	`conf`	Popular Mixed Matchings. ICALP (1) Telikepalli Kavitha, Julián Mestre, Meghana Nasre
2008	J	`jnl`	An [( Algorithmica Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2008	J	`jnl`	An improved heuristic for computing short integral cycle bases. ACM J. Exp. Algorithmics Telikepalli Kavitha, Katakam Vamsi Krishna
2008	—	`conf`	Bounded Unpopularity Matchings. SWAT Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
2008	—	`conf`	Dynamic matrix rank with partial lookahead. FSTTCS Telikepalli Kavitha
2008	A*	`conf`	Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
2008	—	`conf`	Faster Algorithms for Incremental Topological Ordering. ICALP (1) Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
2008	J	`jnl`	Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
2008	—	`conf`	On a Special Co-cycle Basis of Graphs. SWAT Telikepalli Kavitha
2008	—	`ch.`	Ranked Matching. Encyclopedia of Algorithms Telikepalli Kavitha
2007	J	`jnl`	Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. Telikepalli Kavitha, Kurt Mehlhorn
2007	A*	`conf`	An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat
2007	A*	`conf`	Efficient algorithms for computing all low SODA Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
2007	—	`conf`	Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. FSTTCS Telikepalli Kavitha
2007	J	`jnl`	Faster Algorithms for Online Topological Ordering CoRR Telikepalli Kavitha, Rogers Mathew
2007	J	`jnl`	Linear time algorithms for Abelian group isomorphism and related problems. J. Comput. Syst. Sci. Telikepalli Kavitha
2007	A	`conf`	New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2007	J	`jnl`	Popular Matchings. SIAM J. Comput. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
2007	J	`jnl`	Strongly stable matchings in time ACM Trans. Algorithms Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2006	—	`conf`	A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
2006	—	`conf`	Dynamic Matching Markets and Voting Paths. SWAT David J. Abraham, Telikepalli Kavitha
2006	B	`conf`	Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. ISAAC Telikepalli Kavitha, Chintan D. Shah
2006	A*	`conf`	Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS Surender Baswana, Telikepalli Kavitha
2006	J	`jnl`	Rank-maximal matchings. ACM Trans. Algorithms Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2006	J	`jnl`	The carvingwidth of hypercubes. Discret. Math. L. Sunil Chandran, Telikepalli Kavitha
2006	J	`jnl`	The treewidth and pathwidth of hypercubes. Discret. Math. L. Sunil Chandran, Telikepalli Kavitha
2005	A	`conf`	A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS Telikepalli Kavitha, Kurt Mehlhorn
2005	A*	`conf`	An Õ( ICALP Telikepalli Kavitha
2005	J	`jnl`	Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
2005	A*	`conf`	New constructions of (alpha, beta)-spanners and purely additive spanners. SODA Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
2005	A*	`conf`	Popular matchings. SODA David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
2004	A*	`conf`	A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2004	A*	`conf`	Rank-maximal matchings. SODA Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2004	A	`conf`	Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
2003	—	`conf`	Efficient Algorithms for Abelian Group Isomorphism and Related Problems. FSTTCS Telikepalli Kavitha
2003	Misc	`conf`	Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian
2003	—	`conf`	On shortest paths in line arrangements. CCCG Telikepalli Kavitha, Kasturi R. Varadarajan
2002	J	`jnl`	An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. Algorithmica Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard
2002	A	`conf`	Better Lower Bounds for Locally Decodable Codes. CCC Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam