Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Gaur, Daya Ram"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a class of covering problems with variable capacities in wireless networks
Selim Akl
,
Robert Benkoczi
,
Daya Ram Gaur
,
Hossam Hassanein
,
Shahadat Hossain
,
Mark Thom
Theoretical Computer Science
575
, 2015, pp. 42-55
On polynomial-time approximation algorithms for the variable length scheduling problem
Artur Czumaj
,
Leszek Ga̧sieniec
,
Daya Ram Gaur
,
Ramesh Krishnamurti
,
Wojciech Rytter
,
Michele Zito
Theoretical Computer Science
302
(1-3), 2003, pp. 489-495
A
\frac{5}{3}
-approximation algorithm for scheduling vehicles on a path with release and handling times
Daya Ram Gaur
,
Arvind Gupta
,
Ramesh Krishnamurti
Information Processing Letters
86
(2), 2003, pp. 87-91
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
Daya Ram Gaur
,
Toshihide Ibaraki
,
Ramesh Krishnamurti
Journal of Algorithms
43
(1), 2002, pp. 138-152
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
Daya Ram Gaur
,
Toshihide Ibaraki
,
Ramesh Krishnamurti
Lecture Notes in Computer Science
1879
, 2000, pp. 211-219
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability
Daya Ram Gaur
,
Ramesh Krishnamurti
Lecture Notes in Computer Science
1741
, 1999, pp. 49-55
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
Ramesh Krishnamurti
,
Daya Ram Gaur
Information Processing Letters
72
(5-6), 1999, pp. 183-188