Telikepalli Kavitha

From MaRDI portal
Person:270029

Available identifiers

zbMath Open kavitha.telikepalliMaRDI QIDQ270029

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61462542024-02-05Paper
Popular Roommates in Simply Exponential Time.2023-02-03Paper
Popular Branchings and Their Dual Certificates2022-10-14Paper
Popular Matchings in Complete Graphs2022-07-21Paper
Popular Matchings: Good, Bad, and Mixed (Invited Talk)2022-07-21Paper
Quasi-Popular Matchings, Optimality, and Extended Formulations2022-05-17Paper
Popular branchings and their dual certificates2022-03-22Paper
Understanding Popular Matchings via Stable Matchings2022-02-09Paper
A Little Charity Guarantees Almost Envy-Freeness2021-09-10Paper
Popularity, Mixed Matchings, and Self-Duality2021-07-15Paper
Popular matchings in complete graphs2021-04-19Paper
Quasi-popular Matchings, Optimality, and Extended Formulations2021-02-02Paper
A Little Charity Guarantees Almost Envy-Freeness2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51363092020-11-25Paper
Popular Matchings and Limits to Tractability2019-10-15Paper
Upper neighbours of Čech closure operators2019-06-24Paper
Two problems in max-size popular matchings2019-05-21Paper
https://portal.mardi4nfdi.de/entity/Q57433832019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57434852019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46143452019-01-31Paper
Popular matchings of desired size2018-11-22Paper
Popular edges and dominant matchings2018-10-26Paper
Distributed construction of purely additive spanners2018-08-16Paper
Popularity, Mixed Matchings, and Self-duality2018-07-16Paper
Distributed construction of purely additive spanners2018-06-01Paper
Lattice of generalized closure operators2018-03-01Paper
New pairwise spanners2018-02-01Paper
Popular Half-Integral Matchings.2017-12-19Paper
Popular Matchings with Two-Sided Preferences and One-Sided Ties2017-10-24Paper
New Algorithms for Maximum Weight Matching and a Decomposition Theorem2017-06-02Paper
Fair Matchings and Related Problems2017-02-21Paper
On Pairwise Spanners2017-01-30Paper
New Pairwise Spanners2017-01-24Paper
Group of closure isomorphisms of Cech closure spaces2017-01-19Paper
Popular edges and dominant matchings2016-08-10Paper
Fair matchings and related problems2016-04-06Paper
Improved approximation algorithms for two variants of the stable marriage problem with ties2015-12-09Paper
Small Stretch Pairwise Spanners and Approximate $D$-Preservers2015-11-18Paper
Maintaining Near-Popular Matchings2015-11-04Paper
Popular Matchings with Two-Sided Preferences and One-Sided Ties2015-10-27Paper
Rank-maximal matchings2015-09-02Paper
Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q55012442015-08-03Paper
Dynamic matrix rank with partial lookahead2015-02-05Paper
https://portal.mardi4nfdi.de/entity/Q29345902014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29216972014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217272014-10-13Paper
Cycle bases in graphs characterization, algorithms, complexity, and applications2014-10-07Paper
Additive spanners and (α, β)-spanners2014-09-09Paper
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance2014-09-09Paper
Popularity at minimum cost2014-06-24Paper
A Size-Popularity Tradeoff in the Stable Marriage Problem2014-06-04Paper
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties2014-06-02Paper
An improved heuristic for computing short integral cycle bases2014-04-01Paper
Small Stretch Pairwise Spanners2013-08-06Paper
Near-Popular Matchings in the Roommates Problem2013-06-27Paper
Popular matchings in the stable marriage problem2013-06-06Paper
Dynamic matrix rank with partial lookahead2012-10-19Paper
Max-coloring paths: tight bounds and extensions2012-10-01Paper
Faster algorithms for all-pairs small stretch distances in weighted graphs2012-04-26Paper
Properties of Gomory-Hu co-cycle bases2012-03-13Paper
Bounded unpopularity matchings2011-11-07Paper
Near-Popular Matchings in the Roommates Problem2011-09-16Paper
Popular Matchings in the Stable Marriage Problem2011-07-06Paper
Popular mixed matchings2011-06-07Paper
Voting Paths2011-04-15Paper
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs2011-04-04Paper
New approximation algorithms for minimum cycle bases of graphs2011-03-30Paper
Isoperimetric Inequalities and the Width Parameters of Graphs2011-03-18Paper
Popular matchings with variable item copies2011-03-14Paper
Popularity at minimum cost2010-12-09Paper
Assigning papers to referees2010-10-07Paper
https://portal.mardi4nfdi.de/entity/Q35794862010-08-06Paper
Optimal popular matchings2010-04-28Paper
Max-Coloring Paths: Tight Bounds and Extensions2009-12-17Paper
Popular Matchings with Variable Job Capacities2009-12-17Paper
Faster Algorithms for Minimum Cycle Basis in Directed Graphs2009-08-20Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
Popular Mixed Matchings2009-07-14Paper
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs2009-03-24Paper
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs2009-03-12Paper
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs2009-01-05Paper
Faster Algorithms for Incremental Topological Ordering2008-08-28Paper
Popular Matchings2008-08-14Paper
Bounded Unpopularity Matchings2008-07-15Paper
On a Special Co-cycle Basis of Graphs2008-07-15Paper
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs2008-04-24Paper
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems2008-04-24Paper
STACS 20042007-10-01Paper
Dynamic Matching Markets and Voting Paths2007-09-07Paper
New Approximation Algorithms for Minimum Cycle Bases of Graphs2007-09-03Paper
Linear time algorithms for Abelian group isomorphism and related problems2007-08-23Paper
Algorithms to compute minimum cycle basis in directed graphs2007-08-23Paper
The carvingwidth of hypercubes2006-10-19Paper
The treewidth and pathwidth of hypercubes2006-03-29Paper
Automata, Languages and Programming2006-01-10Paper
STACS 20052005-12-02Paper
Lower bounds for adaptive locally decodable codes2005-11-15Paper
Automata, Languages and Programming2005-08-24Paper
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon2002-09-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Telikepalli Kavitha