#### Filter Results:

- Full text PDF available (39)

#### Publication Year

2002

2019

- This year (9)
- Last 5 years (46)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We consider the problem of matching a set of <i>applicants</i> to a set of <i>posts</i>, where each applicant has a <i>preference list</i>, ranking a non-empty subset of posts in order of preference,… (More)

- Chien-Chung Huang, Telikepalli Kavitha
- Inf. Comput.
- 2013

We consider the problem of computing a maximum cardinality popular matching in a bipartite graph G=(A@?B,E) where each vertex u@?A@?B ranks its neighbors in a strict order of preference. Such a graph… (More)

The significant advances of hardware manufacturing technology and the development of efficient software algorithms make technically and economically feasible a network composed of numerous, small,… (More)

An (α, β)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of α and an additive term β. It is well known that any graph contains a… (More)

- Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
- ICALP
- 2015

We are given a bipartite graph $G = (A \cup B, E)$ where each vertex has a preference list ranking its neighbors: in particular, every $a \in A$ ranks its neighbors in a strict order of preference,… (More)

- Telikepalli Kavitha, Christian Liebchen, +4 authors Katharina Anna Zweig
- Computer Science Review
- 2009

Cycles in graphs play an important role in many applications, e.g., analysis of electrical networks, analysis of chemical and biological pathways, periodic scheduling, and graph drawing. From a… (More)

Suppose that each member of a set <i>A</i> of applicants ranks a subset of a set <i>P</i> of posts in an order of preference, possibly involving ties. A <i>matching</i> is a set of (applicant, post)… (More)

- Telikepalli Kavitha, Julián Mestre, Meghana Nasre
- Theor. Comput. Sci.
- 2009

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A… (More)

- Telikepalli Kavitha
- SIAM J. Comput.
- 2014

Given a bipartite graph $G = (\mathcal{A}\cup\mathcal{B}, E)$ where each vertex ranks its neighbors in a strict order of preference, the problem of computing a stable matching is classical and well… (More)

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the… (More)