Author of the publication

Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity.

, , , and . IWOMP, volume 8122 of Lecture Notes in Computer Science, page 71-83. Springer, (2013)

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

Polynomial Treedepth Bounds in Linear Colorings., , , and . Algorithmica, 83 (1): 361-386 (2021)Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , and . J. Comput. Syst. Sci., (2019)Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity., , , and . IWOMP, volume 8122 of Lecture Notes in Computer Science, page 71-83. Springer, (2013)Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs., , , , , and . WAW, volume 9479 of Lecture Notes in Computer Science, page 29-41. Springer, (2015)Fast algorithms to improve fair information access in networks., , , , , and . CoRR, (2024)Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class., , , , , , , and . ESA, volume 144 of LIPIcs, page 37:1-37:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tree decompositions and social graphs., , and . CoRR, (2014)Mining Maximal Induced Bicliques using Odd Cycle Transversals., , and . CoRR, (2018)Reducing Access Disparities in Networks using Edge Augmentation., , , , and . CoRR, (2022)Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition., , , , and . ACDA, page 111-122. SIAM, (2021)