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="Saxena, Sanjeev"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient parallel algorithm for building the separating tree
Yijie Han
,
Sanjeev Saxena
,
Xiaojun Shen
Journal Parallel Distributed Computing
70
(6), 2010, pp. 625-629
On finding fundamental cut sets
Sanjeev Saxena
Information Processing Letters
110
(4), 2010, pp. 168-170
Dominance made simple
Sanjeev Saxena
Information Processing Letters
109
(9), 2009, pp. 419-421
Local nature of Brooks' colouring for degree 3 graphs
G. Sajith
,
Sanjeev Saxena
Graphs and Combinatorics
19
(4), 2003, pp. 551-565
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
K.V.R.C.N. Kishore
,
Sanjeev Saxena
Information Processing Letters
75
(4), 2000, pp. 145-151
Parallel vertex colouring of interval graphs
G. Sajith
,
Sanjeev Saxena
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 19-31
Parallel algorithm for finding the most vital edge in weighted graphs
Sudarshan Banerjee
,
Sanjeev Saxena
Journal Parallel Distributed Computing
46
(1), 1997, pp. 101-104
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
G. Sajith
,
Sanjeev Saxena
Discrete Applied Mathematics
64
, 1996, pp. 249-265
Parallel integer sorting and simulation amongst CRCW models
Sanjeev Saxena
Acta Informatica
33
(7), 1996, pp. 607-619
Parallel algorithms for connectivity problems on interval graphs
Sanjeev Saxena
,
N. Malahal Rao
Information Processing Letters
56
, 1995, pp. 37-44
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
G. Sajith
,
Sanjeev Saxena
Information Processing Letters
49
, 1994, pp. 303-308
On parallel prefix computation
Sanjeev Saxena
,
P.C.P. Bhatt
,
V.C. Prasad
Parallel Processing Letters
4
(4), 1994, pp. 429-436
Two-coloring linked lists is
NC^1
-complete for logarithmic space
Sanjeev Saxena
Information Processing Letters
49
, 1994, pp. 73-76
On parallel sorting and addition with concurrent writes
Sanjeev Saxena
,
P.C.P. Bhatt
,
V.C. Prasad
Lecture Notes in Computer Science
338
, 1988, pp. 143-153