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 
Meeting deadlines: How much speed suffices?
Authors: Anand, S.; Garg, Naveen; Megow, Nicole
Place of Publication: Heidelberg
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2011
Title of Proceedings: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I
Start Page: 232
End Page: 243
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 618680.0
Assigning Papers to Referees
Authors: Garg, Naveen; Kavitha, T.; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: Algorithmica
Volume: 58
Issue / Number: 1
Start Page: 119
End Page: 136
Document Type: Article
ID: 536729.0
Assigning Papers to Referees
Authors: Garg, Naveen; Kavitha, T.; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
Date of Publication (YYYY-MM-DD): 2009
Title of Journal: Algorithmica
Volume: x
Start Page: x
End Page: x
Document Type: Article
ID: 518258.0
Unbiased Rounding of Rational Matrices
Editors: Arun-Kumar, S.; Garg, Naveen
Authors: Doerr, Benjamin; Klein, Christian
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2006
Title of Proceedings: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference
Start Page: 200
End Page: 211
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 314504.0
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
Authors: Eisenbrand, Friedrich; Funke, Stefan; Garg, Naveen; Könemann, Jochen
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 2003
Title of Proceedings: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)
Start Page: 517
End Page: 522
Document Type: Conference-Paper
ID: 202028.0
A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
Authors: Eisenbrand, Friedrich; Funke, Stefan; Garg, Naveen; Könemann, Jochen
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 2003
Title of Proceedings: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)
Start Page: 517
End Page: 522
Document Type: Conference-Paper
ID: 202008.0
Approximation algorithm for the group Steiner tree problem
Authors: Garg, Naveen; Konjevod, Goran; Ravi, R.
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Journal of Algorithms
Volume: 37
Issue / Number: 1
Start Page: 66
End Page: 84
Document Type: Article
ID: 518156.0
Minimizing stall time in single and parallel disk systems
Authors: Albers, Susanne; Garg, Naveen; Leonardi, Stefano
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: Journal of the ACM
Volume: 47
Issue / Number: 6
Start Page: 969
End Page: 986
Document Type: Article
ID: 518166.0
On the single-source unsplittable flow problem
Authors: Dinitz, Yefim; Garg, Naveen; Goemans, Michel X.
Date of Publication (YYYY-MM-DD): 1999
Title of Journal: Combinatorica
Volume: 19
Issue / Number: 1
Start Page: 17
End Page: 41
Document Type: Article
ID: 518070.0
Minimizing stall time in single and parallel disk systems
Authors: Albers, Susanne; Garg, Naveen; Leonardi, Stefano
Place of Publication: New York, USA
Publisher: ACM Press
Date of Publication (YYYY-MM-DD): 1998
Title of Proceedings: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98)
Start Page: 454
End Page: 462
Document Type: Conference-Paper
ID: 517980.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.