Author of the publication

Approximation algorithms for the bandwidth minimization problem for caterpillar graphs.

, , and . SPDP, page 301-307. IEEE Computer Society, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

New spectral lower bounds on the bisection width of graphs., , , , and . Theor. Comput. Sci., 320 (2-3): 155-174 (2004)Note on Optimal Gossiping in Some Weak-Connected Graphs., , and . Theor. Comput. Sci., 127 (2): 395-402 (1994)Approximation Algorithms for Multilevel Graph Partitioning., , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Fair cost-sharing methods for scheduling jobs on parallel machines., and . J. Discrete Algorithms, 7 (3): 280-290 (2009)Toward Optimal Diffusion Matrices., , , and . IPDPS, IEEE Computer Society, (2002)A parallel local-search algorithm for the k-partitioning problem., , , and . HICSS (2), page 41-50. IEEE Computer Society, (1995)Load balancing of unit size tokens and expansion properties of graphs., and . SPAA, page 266-273. ACM, (2003)On the Communication Throughput of Buffered Multistage Interconnection Networks., , , and . SPAA, page 152-161. ACM, (1996)Towards developing universal dynamic mapping algorithms., , , and . SPDP, page 456-459. IEEE, (1995)Computing Nash equilibria for scheduling on restricted parallel links., , , and . STOC, page 613-622. ACM, (2004)