Please note that eDoc will be permanently shut down in the first quarter of 2021!      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 
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
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Editors: Bugliesi, Michele; Preneel, Bart; Sassone, Vladimir; Wegener, Ingo
Authors: Hariharan, Ramesh; Telikepalli, Kavitha; Mehlhorn, Kurt
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2006
Title of Proceedings: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I
Start Page: 250
End Page: 261
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 314560.0
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Authors: Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: SIAM Journal on Computing
Volume: 30
Start Page: 1385
End Page: 1404
Document Type: Article
ID: 202072.0
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Authors: Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: SIAM Journal on Computing
Volume: 30
Issue / Number: 5
Start Page: 1385
End Page: 1404
Document Type: Article
ID: 518226.0
Hardness of Set Cover with Intersection 1
Authors: Kumar, V. S. Anil; Arya, Sunil; Hariharan, Ramesh
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2000
Title of Proceedings: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00)
Start Page: 624
End Page: 635
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 518142.0
Covering Rectilinear Polygons with Axis-Parallel Rectangles
Authors: Kumar, V. S. Anil; Hariharan, Ramesh
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 1999
Title of Proceedings: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99)
Start Page: 445
End Page: 454
Document Type: Conference-Paper
ID: 518050.0
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
Authors: Kumar, V. S. Anil; Hariharan, Ramesh
Place of Publication: Los Alamitos, USA
Publisher: IEEE
Date of Publication (YYYY-MM-DD): 1999
Title of Proceedings: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99)
Start Page: 241
End Page: 251
Document Type: Conference-Paper
ID: 518051.0
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
Authors: Crochemore, Maxime; Gasieniec, Leszek; Hariharan, Ramesh; Muthukrishnan, S.; Rytter, Wojciech
Date of Publication (YYYY-MM-DD): 1998
Title of Journal: SIAM Journal on Computing
Volume: 27
Issue / Number: 3
Start Page: 668
End Page: 681
Document Type: Article
ID: 518013.0
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Authors: Cole, Richard; Hariharan, Ramesh
Place of Publication: New York
Publisher: acm
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)
Start Page: 323
End Page: 332
Document Type: Conference-Paper
ID: 517778.0
Approximate hypergraph coloring
Authors: Kelsen, Pierre; Mahajan, Sanjeev; Hariharan, Ramesh
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory
Start Page: 41
End Page: 52
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517839.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.