Dynamic Matching Markets and Voting Paths (2006)
Abraham, David J, Telikepalli, Kavitha
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list that ranks some subset of...
Dynamic Matching Markets and Voting Paths (2006)
Abraham, David J, Telikepalli, Kavitha
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list that ranks some subset of...
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (2006)
Hariharan, Ramesh, Telikepalli, Kavitha, Mehlhorn, Kurt, Bugliesi, Michele, Preneel, Bart, Sassone, Vladimir, ...
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is...
A Faster Algorithm for Minimum Cycle Basis of Graphs (2004)
Mehlhorn,Kurt, Michail,Dimitrios, Telikepalli,Kavitha, Paluch,Katarzyna
In this paper we consider the problem of computing a minimum cycle basis in a graph $G$ with $m$ edges and $n$ vertices. The edges of $G$ have non-negative weights on them. The previous best result...
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem (2004)
Mehlhorn, Kurt, Michail, Dimitrios, Telikepalli, Kavitha, Diekert, Volker, Habib, Michel
A Faster Algorithm for Minimum Cycle Basis of Graphs (2004)
Mehlhorn, Kurt, Michail, Dimitrios, Telikepalli, Kavitha, Paluch, Katarzyna, Díaz, Josep, Karhumäki, Juhani, ...
In this paper we consider the problem of computing a minimum cycle basis in a graph $G$ with $m$ edges and $n$ vertices. The edges of $G$ have non-negative weights on them. The previous best result...
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem (2004)
Mehlhorn, Kurt, Michail, Dimitrios, Telikepalli, Kavitha, Diekert, Volker, Habib, Michel
A Faster Algorithm for Minimum Cycle Basis of Graphs (2004)
Mehlhorn, Kurt, Michail, Dimitrios, Telikepalli, Kavitha, Paluch, Katarzyna, Díaz, Josep, Karhumäki, Juhani, ...
In this paper we consider the problem of computing a minimum cycle basis in a graph $G$ with $m$ edges and $n$ vertices. The edges of $G$ have non-negative weights on them. The previous best result...
Isoperimetric Inequalities and the Width parameters of graphs (2003)
Chandran, L. Sunil, Telikepalli, Kavitha, Subramanian, C. R., Warnow, Tandy, Zhu, Binhai
Isoperimetric Inequalities and Width Parameters of Graphs (2003)
Telikepalli, Kavitha, Chandran, Sunil, Subramanian, C. R., Warnow, Tandy, Zhu, Binhai