The following pages link to Telikepalli Kavitha (Q270029):
Displayed 48 items.
- Popular Matchings (Q3519386) (← links)
- Faster Algorithms for Incremental Topological Ordering (Q3521937) (← links)
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (Q3549662) (← links)
- (Q3579486) (← links)
- New Approximation Algorithms for Minimum Cycle Bases of Graphs (Q3590960) (← links)
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (Q3613764) (← links)
- Popular Mixed Matchings (Q3638064) (← links)
- Max-Coloring Paths: Tight Bounds and Extensions (Q3652194) (← links)
- Popular Matchings with Variable Job Capacities (Q3652230) (← links)
- Popularity, Mixed Matchings, and Self-duality (Q4575899) (← links)
- (Q4598155) (← links)
- Lattice of generalized closure operators (Q4606129) (← links)
- (Q4614345) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q4957912) (← links)
- Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)
- Understanding Popular Matchings via Stable Matchings (Q5028352) (← links)
- Popular Branchings and Their Dual Certificates (Q5041748) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- (Q5090952) (← links)
- (Q5092362) (← links)
- (Q5136309) (← links)
- Quasi-popular Matchings, Optimality, and Extended Formulations (Q5146785) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q5146956) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191525) (← links)
- Popular Matchings and Limits to Tractability (Q5236364) (← links)
- Near-Popular Matchings in the Roommates Problem (Q5300479) (← links)
- STACS 2004 (Q5309702) (← links)
- Small Stretch Pairwise Spanners (Q5326595) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q5371030) (← links)
- Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs (Q5390579) (← links)
- Voting Paths (Q5392907) (← links)
- An improved heuristic for computing short integral cycle bases (Q5406185) (← links)
- An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties (Q5419004) (← links)
- A Size-Popularity Tradeoff in the Stable Marriage Problem (Q5419029) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems (Q5459111) (← links)
- Automata, Languages and Programming (Q5466519) (← links)
- (Q5501244) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- STACS 2005 (Q5710716) (← links)
- Automata, Languages and Programming (Q5716781) (← links)
- New Algorithms for Maximum Weight Matching and a Decomposition Theorem (Q5739147) (← links)
- (Q5743383) (← links)
- (Q5743485) (← links)
- Dynamic Matching Markets and Voting Paths (Q5757906) (← links)
- (Q5875653) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- (Q6146254) (← links)