Research Publications -@ CSE-IITM

Publications by the members of CSE Department :

Page: 6 of 7 » Prev 1 ... 5 6 7 Next page : items per page :

Filters Type : Member : Area : Lab:

Toward Optimal Player Weights in Secure Distributed Protocols.

K. Srinathan, C. Pandu Rangan, V. Kamakoti
Appeared in Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings (INDOCRYPT 2001), Lecture Notes in Computer Science, Vol 2247, pp.232-241, Dec 2001.

The Kr-Packing Problem.

Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
Appeared in Computing, Vol 66, pp.79-89, 2001.

Efficient Asynchronous Secure Multiparty Distributed Computation.

K. Srinathan, C. Pandu Rangan
Appeared in Progress in Cryptology - INDOCRYPT 2000, First International Conference in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings (INDOCRYPT 2000), Lecture Notes in Computer Science, Vol 1977, pp.117-129, Dec 2000.

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.

K. Srinathan, C. Pandu Rangan
Appeared in Progress in Cryptology - INDOCRYPT 2000, First International Conference in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings (INDOCRYPT 2000), Lecture Notes in Computer Science, Vol 1977, pp.130-142, Dec 2000.

On the Complexity of Partial Order Properties.

Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
Appeared in Order, Vol 17, pp.179-193, 2000.

On the Generative Power of Simple H Systems.

Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan
Appeared in Journal of Automata, Languages and Combinatorics, Vol 5, pp.457-, 2000.

Approximation algorithms for the Traveling Salesman Problem with range condition.

D. Arun Kumar, C. Pandu Rangan
Appeared in ITA, Vol 34, pp.173-182, 2000.

Algorithmic aspects of clique-transversal and clique-independent sets.

Venkatesan Guruswami, C. Pandu Rangan
Appeared in Discrete Applied Mathematics, Vol 100, pp.183-202, 2000.

Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue.

A. Arvind, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 69, pp.197-199, 1999.

The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.

Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan
Appeared in Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, Lecture Notes in Computer Science, Vol 1449, pp.35-44, Aug 1998.

Probabilistic Data Structures for Priority Queues (Extended Abstract).

Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan
Appeared in Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, Lecture Notes in Computer Science, Vol 1432, pp.143-154, Jul 1998.

The Vertex-Disjoint Triangles Problem.

Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
Appeared in Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, Lecture Notes in Computer Science, Vol 1517, pp.26-37, Jun 1998.

Partial and Perfect Path Covers of Cographs.

David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan
Appeared in Discrete Applied Mathematics, Vol 89, pp.143-153, 1998.

On The g-centroidal Problem in Special Classes of Perfect Graphs.

C. Pandu Rangan, K. R. Parthasarathy, V. Prakash
Appeared in Ars Comb., Vol 50, 1998.

A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.

Venkatesan Guruswami, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 68, pp.241-248, 1998.

Weighted Irredundance of Interval Graphs.

Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 66, pp.65-70, 1998.

An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions.

Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan
Appeared in Proceedings of the Fourth International on High-Performance Computing, HiPC 1997, Bangalore, India, 18-21 December, 1997, pp.132-136, Dec 1997.

Restrictions of Minimum Spanner Problems.

G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
Appeared in Inf. Comput., Vol 136, pp.143-164, 1997.

The Parity Path Problem on Some Subclasses of Perfect Graphs.

Satyan R. Coorg, C. Pandu Rangan
Appeared in Discrete Applied Mathematics, Vol 68, pp.293-302, 1996.

All-pairs-shortest-length on Strongly Chordal Graphs.

V. Balachandhran, C. Pandu Rangan
Appeared in Discrete Applied Mathematics, Vol 69, pp.169-182, 1996.

Clique Transversal and Clique Independence on Comparability Graphs.

V. Balachandran, P. Nagavamsi, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 58, pp.181-184, 1996.

Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs.

M. S. Madanlal, G. Venkatesan, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 59, pp.97-102, 1996.

Approximate Triclique Coloring for Register Allocation.

G. Venkatesan, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 60, pp.249-253, 1996.

An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph.

Rohan F. M. Aranha, C. Pandu Rangan
Appeared in Inf. Process. Lett., Vol 59, pp.145-150, 1996.

Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.

K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri
Appeared in Algorithmica, Vol 15, pp.242-255, 1996.

Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
Appeared in Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings, Lecture Notes in Computer Science, Vol 959, pp.71-80, Aug 1995.

Modeling and simulation of dynamic job scheduling in multiprocessor systems.

Sathi Mahesh, C. Siva Ram Murthy, Timothy A. Gonsalves, C. Pandu Rangan
Appeared in Int. J. Comput. Math., Vol 58, pp.221-247, 1995.

An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph

Rohan F. M. Aranha, C. Pandu Rangan
Appeared in J. UCS, Vol 1, pp.633-650, 1995.

Optimal Parallel Algorithms for Path Problems on Planar Graphs.

G. Srikrishna, C. Pandu Rangan
Appeared in Theor. Comput. Sci., Vol 145, pp.27-43, 1995.

An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
Appeared in Nord. J. Comput., Vol 2, pp.28-40, 1995.

Feedback vertex set on cocomparability graphs.

Satyan R. Coorg, C. Pandu Rangan
Appeared in Networks, Vol 26, pp.101-111, 1995.

Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.

Saptarshi Mahesh Prabhakarrao, C. Siva Ram Murthy, C. Pandu Rangan
Appeared in IEICE Transactions, Vol 78, pp.3-12, 1995.

Parallel Algorithms on Interval Graphs.

V. B. Balayogan, C. Pandu Rangan
Appeared in ITA, Vol 29, pp.451-470, 1995.

Edge-disjoint paths in permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan
Appeared in Discussiones Mathematicae Graph Theory, Vol 15, pp.59-72, 1995.

A linear algorithms for the two paths problem on permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan
Appeared in Discussiones Mathematicae Graph Theory, Vol 15, pp.147-166, 1995.

Efficient algorithms for minimal disjoint path problems on chordal graphs.

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg
Appeared in Discussiones Mathematicae Graph Theory, Vol 15, pp.119-145, 1995.

Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.

Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan
Appeared in Parallel Processing Letters, Vol 5, pp.343-355, 1995.

Weighted Independent Perfect Domination on Cocomparability Graphs.

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
Appeared in Discrete Applied Mathematics, Vol 63, pp.215-222, 1995.

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang
Appeared in Inf. Process. Lett., Vol 56, pp.165-171, 1995.

Systematic Design of an Algorithm for Biconnected Components.

K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar
Appeared in Sci. Comput. Program., Vol 25, pp.63-77, 1995.

Efficient Parallel Algorithms for Permutation Graphs.

K. Arvind, V. Kamakoti, C. Pandu Rangan
Appeared in J. Parallel Distrib. Comput., Vol 26, pp.116-124, 1995.

Edge-Disjoint Paths in Permutation Graphs.

C. P. Gopalakrishnan, C. Pandu Rangan
Appeared in Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, Lecture Notes in Computer Science, Vol 834, pp.208-216, Aug 1994.

Weighted Irredundance of Interval Graphs.

C. Pandu Rangan, Maw-Shang Chang
Appeared in Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, Lecture Notes in Computer Science, Vol 834, pp.567-574, Aug 1994.

Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension.

P. Jagan Mohan, V. Kamakoti, C. Pandu Rangan
Appeared in , pp.547-552, Jan 1994.

Efficient Parallel Shuffle Recognition.

Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
Appeared in Parallel Processing Letters, Vol 4, pp.455-463, 1994.

Treewidth of Circular-Arc Graphs.

Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
Appeared in SIAM J. Discrete Math., Vol 7, pp.647-655, 1994.

A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.

K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston
Appeared in Inf. Process. Lett., Vol 51, pp.121-124, 1994.

Weighted Independent Perfect Domination on Cocomparability Graphs.

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
Appeared in Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, Lecture Notes in Computer Science, Vol 762, pp.506-514, Dec 1993.

Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.

Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan
Appeared in Algorithms and Data Structures, Third Workshop, WADS '93, Montral, Canada, August 11-13, 1993, Proceedings, Lecture Notes in Computer Science, Vol 709, pp.131-141, Aug 1993.

Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.

R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
Appeared in Theor. Comput. Sci., Vol 115, pp.351-357, 1993.

Page: 6 of 7 » Prev 1 ... 5 6 7 Next page : items per page :

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras

Website Credits