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="Pandu Rangan, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The colored sector search tree: A dynamic data structure for efficient high dimensional nearest-foreign-neighbor queries
T. Graf
,
V. Kamakoti
,
N.S. Janaki Latha
,
C. Pandu Rangan
Lecture Notes in Computer Science
1449
, 1998, pp. 35-44
The vertex-disjoint triangles problem
Venkatesan Guruswami
,
C. Pandu Rangan
,
M.S. Chang
,
G.J. Chang
,
C.K. Wong
Lecture Notes in Computer Science
1517
, 1998, pp. 26-37
A natural family of optimization problems with arbitrarily small approximation thresholds
Venkatesan Guruswami
,
C. Pandu Rangan
Information Processing Letters
68
(5), 1998, pp. 241-248
Partial and perfect path covers of cographs
D.G. Kirkpatrick
,
K. Madhukar Reddy
,
C. Pandu Rangan
,
A. Srinivasan
Discrete Applied Mathematics
89
(1-3), 1998, pp. 143-153
Probabilistic data structures for priority queues
R. Sridhar
,
K. Rajasekar
,
C. Pandu Rangan
Lecture Notes in Computer Science
1432
, 1998, pp. 143-154
Restrictions of minimum spanner problems
G. Venkatesan
,
U. Rotics
,
M.S. Madanlal
,
J.A. Makowsky
,
C. Pandu Rangan
Information and Computation
136
(2), 1997, pp. 143-164
Optimal parallel algorithm for finding
st
-ambitus of a planar biconnected graph
K.S. Easwarakumar
,
S.V. Krishnan
,
C. Pandu Rangan
,
S. Seshadri
Algorithmica
15
, 1996, pp. 242-255
Treewidth of circular-arc graphs
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
SIAM Journal on Discrete Mathematics
7
(4), 1994, November, pp. 647-655
Optimal path cover problem on block graphs and bipartite permutation graphs
R. Srikant
,
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
Theoretical Computer Science
115
(2), 1993, pp. 351-357
Connected domination and Steiner set on weighted permutation graphs
K. Arvind
,
C. Pandu Rangan
Information Processing Letters
41
, 1992, pp. 215-220
An optimal algorithm for reconstructing a binary tree
V. Kamakoti
,
C. Pandu Rangan
Information Processing Letters
42
, 1992, pp. 113-115
Generalized vertex covering in interval graphs
Madhav V. Marathe
,
R. Ravi
,
C. Pandu Rangan
Discrete Applied Mathematics
39
, 1992, pp. 87-93
An
O(n\log n)
algorithm for a maxmin location problem
C. Pandu Rangan
,
Ramesh Govindan
Discrete Applied Mathematics
36
, 1992, pp. 203-205
An efficient algorithm for finding a two-pair, and its applications
Srinivasa R. Arikati
,
C. Pandu Rangan
Discrete Applied Mathematics
31
, 1991, pp. 71-74
Two disjoint paths in chordal graphs
S.V. Krishnan
,
C. Pandu Rangan
,
S. Seshadri
,
A. Schwill
Technical Report (2/91), 1991, February
On finding the minimum bandwidth of interval graphs
R. Mahesh
,
C. Pandu Rangan
,
Aravind Srinivasan
Information and Computation
95
(2), 1991, December, pp. 218-224
Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
A. Srinivasan
,
C. Pandu Rangan
Theoretical Computer Science
91
, 1991, pp. 1-21
Linear algorithm for optimal path cover problem on interval graphs
Srinivasa Rao Arikati
,
C. Pandu Rangan
Information Processing Letters
35
, 1990, pp. 149-153
New sequential and parallel algorithms for interval graph recognition
G. Ramalingam
,
C. Pandu Rangan
Information Processing Letters
34
, 1990, pp. 215-219
Parallel algorithms on interval graphs
G.D.S. Ramkumar
,
C. Pandu Rangan
Proceedings of the 1990 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'90 (St.~Charles, IL, August 13-17, 1990)
, 1990, pp. 72-74
Optimal parallel algorithms on circular-arc graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Lecture Notes in Computer Science
405
, 1989, pp. 44-55
Optimal parallel algorithms on circular-arc graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Information Processing Letters
33
, 1989/90, pp. 147-156
Linear algorithm for domatic number problem on interval graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Information Processing Letters
33
, 1989/90, pp. 29-33
A new linear algorithm for the two path problem on chordal graphs
S.V. Krishnan
,
C. Pandu Rangan
,
S. Seshadri
Lecture Notes in Computer Science
338
, 1988, pp. 49-66
Total domination in interval graphs revisited
G. Ramalingam
,
C. Pandu Rangan
Information Processing Letters
27
(1), 1988, February, pp. 17-21
Seiten 1
2
>