| 2005 |
|---|
| 18 | EE | V. Yugandhar,
Sanjeev Saxena:
Parallel algorithms for separable permutations.
Discrete Applied Mathematics 146(3): 343-364 (2005) |
| 2003 |
|---|
| 17 | EE | G. Sajith,
Sanjeev Saxena:
Local Nature of Brooks' Colouring for Degree 3 Graphs.
Graphs and Combinatorics 19(4): 551-565 (2003) |
| 16 | EE | G. Sajith,
Sanjeev Saxena:
Fast parallel edge colouring of graphs.
J. Parallel Distrib. Comput. 63(9): 775-785 (2003) |
| 2000 |
|---|
| 15 | EE | G. Sajith,
Sanjeev Saxena:
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.
Algorithmica 27(2): 187-197 (2000) |
| 14 | EE | K. V. R. C. N. Kishore,
Sanjeev Saxena:
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs.
Inf. Process. Lett. 75(4): 145-151 (2000) |
| 1999 |
|---|
| 13 | | G. Sajith,
Sanjeev Saxena:
Parallel Vertex Colouring of Interval Graphs.
Int. J. Found. Comput. Sci. 10(1): 19-32 (1999) |
| 1997 |
|---|
| 12 | | Sudarshan Banerjee,
Sanjeev Saxena:
Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs.
J. Parallel Distrib. Comput. 46(1): 101-104 (1997) |
| 1996 |
|---|
| 11 | | Sanjeev Saxena:
Parallel Integer Sorting and Simulation Amongst CRCW Models.
Acta Inf. 33(7): 607-619 (1996) |
| 10 | EE | G. Sajith,
Sanjeev Saxena:
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.
Discrete Applied Mathematics 64(3): 249-265 (1996) |
| 1995 |
|---|
| 9 | EE | S. Das,
Sanjeev Saxena:
Parallel algorithms for single row routing in narrow streets.
VLSI Design 1995: 13-18 |
| 8 | EE | G. Sajith,
Sanjeev Saxena:
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Inf. Process. Lett. 54(5): 305 (1995) |
| 7 | EE | Sanjeev Saxena,
N. Malahal Rao:
Parallel Algorithms for Connectivity Problems on Interval Graphs.
Inf. Process. Lett. 56(1): 37-44 (1995) |
| 1994 |
|---|
| 6 | | Sanjeev Saxena:
Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space.
Inf. Process. Lett. 49(2): 73-76 (1994) |
| 5 | | G. Sajith,
Sanjeev Saxena:
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Inf. Process. Lett. 49(6): 303-308 (1994) |
| 4 | | Sanjeev Saxena,
Pramod Chandra P. Bhatt,
V. C. Prasad:
On Parallel Prefix Computation.
Parallel Processing Letters 4: 429-436 (1994) |
| 1991 |
|---|
| 3 | | P. C. P. Bhatt,
Krzysztof Diks,
Torben Hagerup,
V. C. Prasad,
Tomasz Radzik,
Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting
Inf. Comput. 94(1): 29-47 (1991) |
| 1990 |
|---|
| 2 | | Sanjeev Saxena,
P. C. P. Bhatt,
V. C. Prasad:
Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions.
IEEE Trans. Computers 39(3): 400-404 (1990) |
| 1988 |
|---|
| 1 | | Sanjeev Saxena,
P. C. P. Bhatt,
V. C. Prasad:
On Parallel Sorting and Addition with Concurrent Writes.
FSTTCS 1988: 143-153 |
