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="Nandy, Subhas C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Line coverage measures in wireless sensor networks
Dinesh Dash
,
Arobinda Gupta
,
Arijit Bishnu
,
Subhas C. Nandy
Journal Parallel Distributed Computing
74
(7), 2014, pp. 2596-2614
Efficient multiple-precision integer division algorithm
Debapriyay Mukhopadhyay
,
Subhas C. Nandy
Information Processing Letters
114
(3), 2014, pp. 152-157
Minimum enclosing circle with few extra variables
Minati De
,
Subhas C. Nandy
,
Sasanka Roy
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 510-521
Measuring the quality of surveillance in a wireless sensor network
Debashis Mondal
,
Abhay Kumar
,
Arijit Bishnu
,
Krishnendu Mukhopadhyaya
,
Subhas C. Nandy
International Journal of Foundations of Computer Science
22
(4), 2011, pp. 983-998
Recognition of largest empty orthoconvex polygon in a point set
Subhas C. Nandy
,
Krishnendu Mukhopadhyaya
,
Bhargab B. Bhattacharya
Information Processing Letters
110
(17), 2010, pp. 746-752
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
A new fast heuristic for labeling points
Sasanka Roy
,
Subhasis Bhattacharjee
,
Sandip Das
,
Subhas C. Nandy
Information Processing Letters
109
(10), 2009, pp. 478-484
A generalization of magic squares with applications to digital halftoning
Boris Aronov
,
Tetsuo Asano
,
Yosuke Kikuchi
,
Subhas C. Nandy
,
Shinji Sasahara
,
Takeaki Uno
Theory of Computing Systems
42
(2), 2008, pp. 143-156
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
Chromatic distribution of
k
-nearest neighbors of a line segment in a planar colored point set
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Information Processing Letters
102
(4), 2007, pp. 163-168
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
Constrained minimum enclosing circle with center on a query line segment
Sasanka Roy
,
Arindam Karmakar
,
Sandip Das
,
Subhas C. Nandy
Lecture Notes in Computer Science
4162
, 2006, pp. 765-776
Smallest
k
-point enclosing rectangle and square of arbitrary orientation
Sandip Das
,
Partha P. Goswami
,
Subhas C. Nandy
Information Processing Letters
94
(6), 2005, pp. 259-266
Shortest monotone descent path problem in polyhedral terrain
Sasanka Roy
,
Sandip Das
,
Subhas C. Nandy
Lecture Notes in Computer Science
3404
, 2005, pp. 281-292
A generalization of magic squares with applications to digital halftoning
Boris Aronov
,
Tetsuo Asano
,
Yosuke Kikuchi
,
Subhas C. Nandy
,
Shinji Sasahara
,
Takeaki Uno
Lecture Notes in Computer Science
3341
, 2004, pp. 89-100
Optimal algorithm for a special point-labeling problem
Sasanka Roy
,
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Information Processing Letters
89
(2), 2004, pp. 91-98
An improved algorithm for point set pattern matching under rigid motion
Arijit Bishnu
,
Sandip Das
,
Subhas C. Nandy
,
Bhargab B. Bhattacharya
Lecture Notes in Computer Science
2653
, 2003, pp. 36-45
Largest empty rectangle among a point set
Jeet Chaudhuri
,
Subhas C. Nandy
,
Sandip Das
Journal of Algorithms
46
(1), 2003, pp. 54-78
An efficient
k
nearest neighbors searching algorithm for a query line
Subhas C. Nandy
,
Sandip Das
,
Partha P. Goswami
Theoretical Computer Science
299
(1-3), 2003, pp. 273-288
Simplex range searching and
k
nearest neighbors of a line segment in 2D
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Lecture Notes in Computer Science
2368
, 2002, pp. 69-79
Optimal algorithm for a special point-labeling problem
Sasanka Roy
,
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Lecture Notes in Computer Science
2368
, 2002, pp. 110-120
Dynamically maintaining the widest
k
-dense corridor
Subhas C. Nandy
,
Tomohiro Harayama
,
Tetsuo Asano
Theoretical Computer Science
255
(1-2), 2001, pp. 627-639
Seiten 1
2
>