( en | de | ru )

 

Disambiguation of "Laforest, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
Distributed Approximation Allocation Resources Algorithm for Connecting Groups.

, , and . Euro-Par, volume 4128 of Lecture Notes in Computer Science, page 519-529. Springer, (2006)

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.

Christian Christian

Christian Winter

Gold-katalysierte Cycloisomerisierung funktionalisierter Allene und Anwendung in der Naturstoffsynthese. TU Dortmund, (2009)

Christian Helbig

Synthese und Charakterisierung von metallorganischen Bronzen. Uni Augsburg, (2009)

Christian Schüller

Automatisierte Feedbackgenerierung in der benutzerzentrierten Softwareentwicklung am Beispiel mobiler Anwendungen. TU München, (2009)

Christian Quast

Tool and database development for the phylogenetic classification and functional characterisation of organisms. Uni Bremen, (2009)
 

Other publications of authors with the same name

Hardness results and approximation algorithms of k-tuple domination in graphs., and . Inf. Process. Lett., 89 (2): 75-83 (2004)A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem., and . ACM SIGOPS Oper. Syst. Rev., 34 (3): 60-68 (2000)Distributed Approximation Allocation Resources Algorithm for Connecting Groups., , and . Euro-Par, volume 4128 of Lecture Notes in Computer Science, page 519-529. Springer, (2006)Gossip in Trees under Line-Communication Mode.. Euro-Par, Vol. I, volume 1123 of Lecture Notes in Computer Science, page 333-340. Springer, (1996)Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases.. Euro-Par, volume 2790 of Lecture Notes in Computer Science, page 903-910. Springer, (2003)Graph Problems with Obligations., and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 183-197. Springer, (2018)Maximization of the Size and the Weight of Schedules of Degradable Intervals., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 219-228. Springer, (2004)Edge-disjoint spanners of complete bipartite graphs., , , and . Discret. Math., 234 (1-3): 65-76 (2001)Broadcast and Gossip in Line-communication Mode.. Discret. Appl. Math., 80 (2-3): 161-176 (1997)Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks., and . IPDPS, IEEE Computer Society, (2002)