Telikepalli Kavitha
According to our database^{1},
Telikepalli Kavitha
authored at least 82 papers
between 2002 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at dl.acm.org
On csauthors.net:
Bibliography
2020
Quasipopular Matchings, Optimality, and Extended Formulations.
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
A Little Charity Guarantees Almost EnvyFreeness.
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
2019
Popular Branchings and Their Dual Certificates.
CoRR, 2019
Two Problems in MaxSize Popular Matchings.
Algorithmica, 2019
Popular Matchings and Limits to Tractability.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Popular Matchings: Good, Bad, and Mixed (Invited Talk).
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Popular Roommates in Simply Exponential Time.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
2018
Popular edges and dominant matchings.
Math. Program., 2018
Distributed construction of purely additive spanners.
Distributed Computing, 2018
Popularity, stability, and the dominant matching polytope.
CoRR, 2018
The Popular Roommates problem.
CoRR, 2018
Maxsize popular matchings and extensions.
CoRR, 2018
Popular Matchings of Desired Size.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2018
Popular Matchings in Complete Graphs.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
2017
Popular Matchings with TwoSided Preferences and OneSided Ties.
SIAM J. Discrete Math., 2017
New Pairwise Spanners.
Theory Comput. Syst., 2017
New Algorithms for Maximum Weight Matching and a Decomposition Theorem.
Math. Oper. Res., 2017
Popularity, Mixed Matchings, and Selfduality.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Popular Matchings with Multiple Partners.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017
2016
Ranked Matching.
Encyclopedia of Algorithms, 2016
Fair Matchings and Related Problems.
Algorithmica, 2016
Popular HalfIntegral Matchings.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Small Stretch Pairwise Spanners and Approximate DPreservers.
SIAM J. Discrete Math., 2015
Improved approximation algorithms for two variants of the stable marriage problem with ties.
Math. Program., 2015
Maintaining NearPopular Matchings.
Proceedings of the Automata, Languages, and Programming  42nd International Colloquium, 2015
2014
A SizePopularity Tradeoff in the Stable Marriage Problem.
SIAM J. Comput., 2014
Dynamic Matrix Rank with Partial Lookahead.
Theory Comput. Syst., 2014
Popularity at minimum cost.
J. Comb. Optim., 2014
An Improved Approximation Algorithm for the Stable Marriage Problem with OneSided Ties.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
NearPopular Matchings in the Roommates Problem.
SIAM J. Discrete Math., 2013
Popular matchings in the stable marriage problem.
Inf. Comput., 2013
On Pairwise Spanners.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Small Stretch Pairwise Spanners.
Proceedings of the Automata, Languages, and Programming  40th International Colloquium, 2013
2012
Properties of GomoryHu cocycle bases.
Theor. Comput. Sci., 2012
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
ACM Trans. Algorithms, 2012
Maxcoloring paths: tight bounds and extensions.
J. Comb. Optim., 2012
Faster Algorithms for AllPairs Small Stretch Distances in Weighted Graphs.
Algorithmica, 2012
Popularity vs maximum cardinality in the stable marriage setting.
Proceedings of the TwentyThird Annual ACMSIAM Symposium on Discrete Algorithms, 2012
Efficient algorithms for maximum weight matchings in general graphs with small edge weights.
Proceedings of the TwentyThird Annual ACMSIAM Symposium on Discrete Algorithms, 2012
2011
Popular matchings with variable item copies.
Theor. Comput. Sci., 2011
Popular mixed matchings.
Theor. Comput. Sci., 2011
New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Algorithmica, 2011
Bounded Unpopularity Matchings.
Algorithmica, 2011
2010
Additive spanners and (alpha, beta)spanners.
ACM Trans. Algorithms, 2010
Voting Paths.
SIAM J. Discrete Math., 2010
Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs.
SIAM J. Comput., 2010
Assigning Papers to Referees.
Algorithmica, 2010
2009
Optimal popular matchings.
Discrete Applied Mathematics, 2009
Cycle bases in graphs characterization, algorithms, complexity, and applications.
Computer Science Review, 2009
Popular Matchings with Variable Job Capacities.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Ranked Matching.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Faster Algorithms for Minimum Cycle Basis in Directed Graphs.
SIAM J. Comput., 2008
An improved heuristic for computing short integral cycle bases.
ACM Journal of Experimental Algorithmics, 2008
An [(O)\tilde](m^{2}n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
Algorithmica, 2008
On a Special Cocycle Basis of Graphs.
Proceedings of the Algorithm Theory, 2008
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Faster Algorithms for Incremental Topological Ordering.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Strongly stable matchings in time O(nm) and extension to the hospitalsresidents problem.
ACM Trans. Algorithms, 2007
Popular Matchings.
SIAM J. Comput., 2007
Algorithms to Compute Minimum Cycle Basis in Directed Graphs.
Theory Comput. Syst., 2007
Linear time algorithms for Abelian group isomorphism and related problems.
J. Comput. Syst. Sci., 2007
Faster Algorithms for Online Topological Ordering
CoRR, 2007
An Õ(mn) GomoryHu tree construction algorithm for unweighted graphs.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Efficient algorithms for computing all low st edge connectivities and related problems.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
2006
Rankmaximal matchings.
ACM Trans. Algorithms, 2006
The carvingwidth of hypercubes.
Discrete Mathematics, 2006
The treewidth and pathwidth of hypercubes.
Discrete Mathematics, 2006
Dynamic Matching Markets and Voting Paths.
Proceedings of the Algorithm Theory, 2006
Efficient Algorithms for Weighted RankMaximal Matchings and Related Problems.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Faster Algorithms for Approximate Distance Oracles and AllPairs Small Stretch Paths.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Lower bounds for adaptive locally decodable codes.
Random Struct. Algorithms, 2005
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.
Proceedings of the STACS 2005, 2005
New constructions of (alpha, beta)spanners and purely additive spanners.
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
An Õ(m^{2}n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
2004
Strongly Stable Matchings in Time O(nm) and Extension to the HospitalsResidents Problem.
Proceedings of the STACS 2004, 2004
A Faster Algorithm for Minimum Cycle Basis of Graphs.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Efficient Algorithms for Abelian Group Isomorphism and Related Problems.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
Isoperimetric Inequalities and the Width Parameters of Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
On shortest paths in line arrangements.
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.
Algorithmica, 2002
Better Lower Bounds for Locally Decodable Codes.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002