Author of the publication

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

, , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)

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

Sharp threshold for hamiltonicity of random geometric graphs, , and . CoRR, (2006)Dynamic random graphs with vertex removal., , and . CoRR, (2022)EATCS Fellows 2019 - Call for Nominations.. Bull. EATCS, (2018)Complexity issues on bounded restrictive H-coloring., , and . Discret. Math., 307 (16): 2082-2093 (2007)Structural Complexity I, , and . EATCS Monographs on Theoretical Computer Science Springer, (1990)On the connectivity of dynamic random geometric graphs., , and . SODA, page 601-610. SIAM, (2008)Adversarial Models for Priority-Based Networks., , , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 142-151. Springer, (2003)On List k-Coloring Convex Bipartite Graphs., , , and . CoRR, (2020)A new upper bound for 3-SAT., , , and . FSTTCS, volume 2 of LIPIcs, page 163-174. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Absorption Time of the Moran Process., , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 630-642. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)