Interconnecting Rectangular Areas by Corridors and Tours (with A. Gonzalez), Proceedings of the SIEEEM, Monterrey, Oct. 2008.

Efficient Distributed Algorithms and Protocols for Handling Transient Single Node Failures, (with A. Bhosle), *Proceedings of the 20th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '08*, (to appear).

Efficient Algorithms for Single Link Failure Recovery and Its Application to ATM Networks, (with A. M. Bhosle), Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '03, (2003), Marina Del Rey, CA, 87 -- 92.

Algorithms for a Class of Min--Cut and Max--Cut Problems, (with T. Murayama), Proceedings of the Third Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science #650, Springer--Verlag, December 1992, pp. 97 -- 105.

The On--Line D--Dimensional Dictionary Problem, Proceedings of the 3rd Symposium on Discrete Algorithms, January 1992, pp. 376 -- 385.

Complexity Aspects of Map Compression, (with H. Bodlaender and T. Kloks), Proceedings of the Data Compression Conference, April 1991, pp. 287 -- 296.

On the Computational Complexity of Clustering and Related Problems, Systems Modeling and Optimization, Proceedings of the 10th IFIP Conference on Systems Modeling and Optimization, Lecture Notes in Control and Information Sciences #38, Springer--Verlag, August 1981, pp. 174 -- 182.

Evaluating Arithmetic Expressions with Algebraic Identities is Hard, (with J. JaJa), Proceedings of the 1979 Conference on Information Science and Systems, March 1979, pp. 167 -- 173.

Sorting Numbers in Linear Expected Time and Constant Extra Space, (with D. B. Johnson), Proceedings of the 16th Annual Allerton Conference on Communication, Control and Computing, October 1978, pp. 64 -- 72.

P--Complete Problems and Approximate Solutions, (with S. Sahni), Proceedings of the 15th Annual IEEE Symposium on Switching and Automata Theory, October 1974, pp. 28 -- 32.