Multicasting in the Hypercube, Chord and Binomial Graphs ( with Christopher C. Cipriano), submitted for possible journal publication.

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links ( with A. Bhosle), submitted for possible journal publication.

Improved Algorithms for Constructing Hypercube SP-Multicasting Trees (with C. Cipriano), *Proceedings of the 21th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '09* (6 pages).

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links, (with A. Bhosle), Proceedings of the 21th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '09.

Improved Communication Schedules with Buffers {\it Parallel Processing Letters,} Vol 19, No. 1, 129 -- 139, 2009.

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).

Scheduling Independent Tasks to Minimize Computation and Communication Makespan in Distributed Systems, *Proceedings of the 20th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '08*.

Continuous Delivery Message Dissemination Problems Under the Multicasting Communication Mode, *IEEE Transactions Transactions on Parallel and Distributed Systems,* Vol. 19, No. 8, pp. 1034 -- 1043, 2008.

Message Dissemination Using Modern Communication Primitives, *Handbook of Parallel Computing: Models, Algorithms, and Applications,* Eds. J. Reif and S. Rajasekaran, Chapman & Hall / CRC, Jan. 2008.

Message Dissemination Under the Multicasting Communication Mode, Keynote Address, *8th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT'07*, pp. 3 -- 4, 2007.

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode, *Proceedings of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '06,* Dallas, Tx, 2006.

Pairwise Disjoint Shortest Paths in the n-Cube and Related Problems, (with D. Serena), * Theoretical Computer Science,* Vol 369, No. 1, pp. 427 -- 435, 2006.

Improving the Computation and Communication Time with Buffers, *Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '05*, Phoenix, Az, pp. 336 - 341.

Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode, (with R. Brandt), *Journal of Interconnection Networks*, Vol. 6, No. 5, pp. 383 - 406, 2005.

Algorithms for Single Link Failure Recovery and Related Problems, (with A. M. Bhosle), *Journal of Graph Algorithms and Applications*, Vol. 8, No 3, pp 275 -- 294, 2004.

Replacement Paths for Pairs of Shortest Path Edges in Directed Graphs, (with A. M. Bhosle), Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '04, (2004), MIT Cambridge MA, 94--99.

*n*-Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices, (with D. Serena), *Journal of Parallel Computing*, Vol. 30, 8, pp. 973 -998, 2004.

Complexity of the Pairwise Shortest Path Routing in the Grid, (with D. Serena), *Theoretical Computer Science*, Vol. 326, 1-3, pp. 155 -185, 2004.

Efficient Resource Utilization in Parallel and Distributed Systems, *Journal of Supercomputing*, Vol. 28, (1), pp 5 - 6, (Guest Editorial).

Open Shop Scheduling," in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Ed. Y. J.-T. Leung, Chapter 6, Part II, Chapman & Hall / CRC, 2004.

An Efficient Algorithm for Gossiping in the Multicasting Communication Environment," *IEEE Transactions on Parallel and Distributed Systems*, Vol 14, No. 7, pp. 701 -708, 2003.

Multicasting using WDM in Multifiber Optical Star Networks, (with R. Brandt), Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '03, (2003), Marina Del Rey, CA, 56 -- 61.

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.

Complexity of *k*-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems, (with F. D. Serena) Proceedings of the 14th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '02, (2002), MIT Cambridge, MA, 61 -- 66.

*n*-Cube Search Algorithm for Finding *(n-1)*-Pairwise Node Disjoint Shortest Paths, (with F. D. Serena) Proceedings of the International Conference on Communications in Computing CIC'02, (2002), Las Vegas, NV, 19 -- 25.

On Solving Multimessage Multicasting Problems, *International Journal of Foundations of Computer Science, Special Issue on Scheduling - Theory and Applications*, Vol. 12, No. 6, pp. 791 -- 808, 2001.

Simple Algorithms for MultiMessage Multicasting with Forwarding, *Algorithmica*, Vol. 29, 2001, pp. 511 -- 533.

Minimum-Energy Broadcast in Simple Graphs with Limited Node Power, (with O. Egecioglu) Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '01, (2001), Anaheim, CA, 278 -- 282.

Node Disjoint Shortest Paths for Pairs of Vertices in an *n*-Cube Network, (with F. D. Serena) Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '01, (2001), Anaheim, CA, 278 -- 282.

Gossiping in the Multicasting Communication Environment, Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS 2001, (6 pages).

Distributed Algorithms for Multimessage Multicasting, *Journal of Interconnection Networks*, Vol. 1, No. 4, Dec 2000, pp 303 -- 315.

Gossiping with Multicasting Communication Primitives, Proceedings of the 12th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '00, (2000), Las Vegas, NV, Vol. II, 768 -- 773.

Multimessage Multicasting with Bounded Number of Destinations, Proceedings of the 11th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '99, (1999), Cambridge, MA, 495 -- 500.

Distributed Multimessage Multicasting, Proceedings of the Thirteen International Conference On Systems Engineering, pp. CS-43 -- CS-48, Las Vegas, Nevada, August 1999.

Complexity and Approximations for Multimessage Multicasting, *Journal of Parallel and Distributed Computing*, 55, 1998, 215 -- 235.

Improved Approximation Algorithms for Embedding Hypergraphs in a Cycle, *Information Processing Letters*, Vol. 67, 1998, 267 -- 271.

Algorithms for MultiMessage Multicasting With Forwarding, Proceedings of the Tenth ISCA International Conference on Parallel and Distributed Computing Systems PDCS '97, pp. 372 -- 377, New Orleans, LA, 1997.

MultiMessage Multicasting: Complexity and Approximations, Proceedings of the 30th Hawaii International Conference on System Sciences (HICSS), (1997), vol.1, pp. 211 -- 220, Nominated for the Best Paper Award in the Software Technology Track.

Improved MultiMessage Multicasting Approximation Algorithms, Proceedings of the Ninth International Conference on Parallel and Distributed Computing Systems PDCS '96, pp. 456 -- 461, Dijon, France, September 1996.

MultiMessage Multicasting, Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems (Irregular'96), Lecture Notes in Computer Science (1117), Springer, (1996), pp. 217 -- 228.

Proofs for Improved Approximation Algorithms for MultiMessage Multicasting, UCSB Department of Computer Science, Technical Report TRCS--96--17, July 1996.