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="Das, Gautam"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithm for the widest empty 1-corner corridor
Gautam K. Das
,
Debapriyay Mukhopadhyay
,
Subhas C. Nandy
Information Processing Letters
109
(18), 2009, pp. 1060-1065
Weighted broadcast in linear radio networks
Gautam K. Das
,
Subhas C. Nandy
Information Processing Letters
106
(4), 2008, pp. 136-143
Variations of base-station placement problem on the boundary of a convex region
Gautam K. Das
,
Sasanka Roy
,
Sandip Das
,
Subhas C. Nandy
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 405-427
Improved algorithm for minimum cost range assignment problem for linear radio networks
Gautam K. Das
,
Sasthi C. Ghosh
,
Subhas C. Nandy
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 619-635
Computing best coverage path in the presence of obstacles in a sensor field
Senjuti Basu Roy
,
Gautam Das
,
Sajal Das
Lecture Notes in Computer Science
4619
, 2007, pp. 577-588
Efficient algorithm for placing a given number of base stations to cover a convex region
Gautam K. Das
,
Sandip Das
,
Subhas C. Nandy
,
Bhabani P. Sinha
Journal Parallel Distributed Computing
66
(11), 2006, pp. 1353-1358
Range assignment for energy efficient broadcasting in linear radio networks
Gautam K. Das
,
Sandip Das
,
Subhas C. Nandy
Theoretical Computer Science
352
(1-3), 2006, pp. 332-341
Lower bounds for computing geometric spanners and approximate shortest paths
Danny Z. Chen
,
Gautam Das
,
Michiel Smid
Discrete Applied Mathematics
110
(2-3), 2001, pp. 151-167
A lower bound for approximating the geometric minimum weight matching
Gautam Das
,
Michiel Smid
Information Processing Letters
74
(5-6), 2000, pp. 253-255
Episode matching
Gautam Das
,
Rudolf Fleischer
,
Leszek Ga̧sieniec
,
Dimitris Gunopulos
,
Juha Kärkkäinen
misc, 1997
Episode matching
Gautam Das
,
Rudolf Fleischer
,
Leszek Ga̧sieniec
,
Dimitris Gunopulos
,
Juha Kärkkäinen
Lecture Notes in Computer Science
1264
, 1997, pp. 12-27
Constructing degree-3 spanners with other sparseness properties
Gautam Das
,
Paul J. Heffernan
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 121-135
On the complexity of approximating Euclidean Traveling Salesman tours and minimum spanning trees
Gautam Das
,
Sanjieev Kapoor
,
Michiel Smid
Lecture Notes in Computer Science
1180
, 1996, pp. 64-75
Euclidean spanners: Short, thin, and lanky
Sunil Arya
,
Gautam Das
,
David M. Mount
,
Jeffrey S. Salowe
,
Michiel Smid
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 489-498
On the complexity of approximating and illummating three-dimensional convex polyhedra
Gautam Das
,
Michael T. Goodrich
Lecture Notes in Computer Science
955
, 1995, pp. 74-85
A new way to weigh malnourished Euclidean graphs
Gautam Das
,
Giri Narasimhan Jeffrey Salowe
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 215-222
Finding all weakly-visible chords of a polygon in linear time
Gautam Das
,
Paul J. Heffernan
,
Giri Narasimhan
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 119-130
Constructing degree-3 spanners with other sparsenenss properties
Gautam Das
,
Paul J. Heffernan
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 11-20
Minimum vertex hulls for polyhedral domains
Gautam Das
,
Deborah Joseph
Theoretical Computer Science
103
, 1992, pp. 107-135
Geometric searching and link distance
Gautam Das
,
Giri Narasimhan
Lecture Notes in Computer Science
519
, 1991, pp. 261-272
Generating sparse spanners for weighted graphs
Ingo Althöfer
,
Gautam Das
,
David Dobkin
,
Deborah Joseph
Lecture Notes in Computer Science
447
, 1990, pp. 26-37