Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Additive Spanners and (α, β)-Spanners
Authors: Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: ACM Transactions on Algorithms
Volume: 7
Issue / Number: 1
Start Page: 5:1
End Page: 5:26
Sequence Number of Article: 5
Document Type: Article
ID: 618744.0
Bounded Unpopularity Matchings
Authors: Huang, Chien-Chung; Kavitha, Telikepalli; Michael, Dimitrios; Nasr, Meghana
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Algorithmica
Volume: 61
Issue / Number: 3
Start Page: 738
End Page: 757
Document Type: Article
ID: 618752.0
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Authors: Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Algorithmica
Volume: 59
Issue / Number: 4
Start Page: 471
End Page: 488
Document Type: Article
ID: 618754.0
Popular mixed matchings
Authors: Kavitha, Telikepalli; Mestre, Julian; Nasre, Meghana
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Theoretical Computer Science
Volume: 412
Issue / Number: 24
Start Page: 2679
End Page: 2690
Document Type: Article
ID: 618753.0
Max-coloring paths: Tight bounds and extensions
Authors: Kavitha, Telikepalli; Mestre, Julian
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: Journal of Combinatorial Optimization
Volume: Online First
Start Page: 1
End Page: 14
Document Type: Article
ID: 536728.0
Max-coloring paths: Tight bounds and extensions
Authors: Kavitha, Telikepalli; Mestre, Julian
Place of Publication: Heidelberg, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2009
Title of Proceedings: Proc. of the 20th International Symposium Algorithms and Computation
Start Page: 87
End Page: 96
Document Type: Conference-Paper
ID: 518285.0
An O˜ (m2n) Algorithm for Minimum Cycle Basis
of Graphs
Authors: Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
Date of Publication (YYYY-MM-DD): 2008
Title of Journal: Algorithmica
Volume: 52
Issue / Number: 3
Start Page: 333
End Page: 349
Document Type: Article
ID: 428121.0
Faster algorithms for minimum cycle basis in directed graphs
Authors: Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
Date of Publication (YYYY-MM-DD): 2008
Title of Journal: SIAM Journal on Computing
Volume: 38
Issue / Number: 4
Start Page: 1430
End Page: 1447
Document Type: Article
ID: 428101.0
Algorithms to compute minimum cycle basis in directed graphs
Authors: Kavitha, Telikepalli; Mehlhorn, Kurt
Date of Publication (YYYY-MM-DD): 2007
Title of Journal: Theory of Computing Systems
Volume: 40
Issue / Number: 4
Start Page: 485
End Page: 505
Document Type: Article
ID: 356646.0
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Authors: Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2007
Title of Proceedings: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science
Start Page: 512
End Page: 523
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 356750.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.