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
[4]
Hilfe
Suche: Author="Bhattacharya, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms for uniform partitions of points
P.K. Agarwal
,
B.K. Bhattacharya
,
S. Sen
Algorithmica
32
(4), 2002, pp. 521-539
Efficient algorithms for centers and medians in interval and circular-arc graphs
S. Bespamyatnikh
,
B. Bhattacharya
,
J. Mark Keil
,
D. Kirkpatrick
,
M. Segal
Lecture Notes in Computer Science
1879
, 2000, pp. 100-111
Generalized maximum independent sets for trees in subquadratic time
B.K. Bhattacharya
,
M.E. Houle
Lecture Notes in Computer Science
1741
, 1999, pp. 435-445
Computing shortest transversals
B. Bhattacharya
,
G. Toussaint
Lecture Notes in Computer Science
510
, 1991, pp. 649-660
Solving the two-dimensional findpath problem using a line-triangle representation of the robot
B.K. Bhattacharya
,
J. Zorbas
Journal of Algorithms
9
, 1988, pp. 449-469