PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Sen, Arunabha"

Author of the publication

copydeleteadd this publication to your clipboard
The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application.

, , , , and . Inf. Sci., (2019)

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.

Tatiana Senkova University of Stuttgart

Ph. D. Gennaro Senatore University of Stuttgart

Ute Sengle University of Stuttgart

Dr. -Ing. Christian Senger University of Stuttgart

M. Senf

 

Other publications of authors with the same name

A Comparative Study of Shuffle-Exchange, Manhattan Street and Supercube Network for Lightwave Applications., and . Computer Networks and ISDN Systems, 26 (6-8): 1007-1022 (1994)A new model for scheduling packet radio networks., and . Wireless Networks, 3 (1): 71-82 (1997)On an Optimally Fault-Tolerant Multiprocessor Network Architecture., , and . IEEE Trans. Computers, 36 (5): 619-623 (1987)Topology Design of Service Overlay Network with a Generalized Cost Model., and . GLOBECOM, page 75-80. IEEE, (2007)A Social Identity Approach to Identify Familiar Strangers in a Social Network., , , , and . ICWSM, The AAAI Press, (2009)On a Graph Partition Problem with Application to VLSI Layout., , and . Inf. Process. Lett., 43 (2): 87-94 (1992)Impairment Aware Dynamic Routing of Many-to-Many Flows in Elastic Optical Networks., and . ENIC, page 33-39. IEEE Computer Society, (2015)On Some Topological Properties of Hypercube, Incomplete Hypercube and Supercube., , and . IPPS, page 636-642. IEEE Computer Society, (1993)Fair queuing with round robin: a new packet scheduling algorithm for routers., , , and . ISCC, page 1001-1006. IEEE Computer Society, (2002)The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application., , , , and . Inf. Sci., (2019)