| |
| 2004 | ||
|---|---|---|
| 6 | EE | Alak Kumar Datta, Ranjan K. Sen: o(log4 n) time parallel maximal matching algorithm using linear number of processors. Parallel Algorithms Appl. 19(1): 19-32 (2004) |
| 2000 | ||
| 5 | EE | Alak Kumar Datta, Ranjan K. Sen: Improved Parallel Algorithm for Maximal Matching Based on Depth-first-search. Parallel Algorithms Appl. 14(4): 321-327 (2000) |
| 1999 | ||
| 4 | EE | Alak Kumar Datta, Ranjan K. Sen: An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs. Inf. Process. Lett. 71(1): 9-15 (1999) |
| 1995 | ||
| 3 | EE | Alak Kumar Datta, Ranjan K. Sen: 1-Approximation Algorithm for Bottleneck Disjoint Path Matching. Inf. Process. Lett. 55(1): 41-44 (1995) |
| 2 | EE | Alak Kumar Datta, Ranjan K. Sen: A Parallel Algorithm for Maximal Matching Based on Depth First Search. Parallel Algorithms Appl. 5(3): 161-164 (1995) |
| 1992 | ||
| 1 | Alak Kumar Datta, Ranjan K. Sen: An Efficient Parallel Algorithm for Maximal Matching. CONPAR 1992: 813-814 | |
| 1 | Ranjan K. Sen | [1] [2] [3] [4] [5] [6] |