Author of the publication

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.

, , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 134-145. Springer, (2018)

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

Exact Algorithm for the Maximum Induced Planar Subgraph Problem., , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 287-298. Springer, (2011)Coloring Powers of Graphs of Bounded Clique-Width.. WG, volume 2880 of Lecture Notes in Computer Science, page 370-382. Springer, (2003)On the heapability of finite partial orders., , , , and . Discret. Math. Theor. Comput. Sci., (2020)Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique., and . PODC, page 245-247. ACM, (2016)Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks., , , , , and . DISC, volume 246 of LIPIcs, page 43:1-43:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Polynomial Kernels for Strictly Chordal Edge Modification Problems., , and . IPEC, volume 214 of LIPIcs, page 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing., , and . CoRR, (2023)An O(n2) time algorithm for the minimal permutation completion problem., , and . Discret. Appl. Math., (2019)A Meta-Theorem for Distributed Certification., , , and . SIROCCO, volume 13298 of Lecture Notes in Computer Science, page 116-134. Springer, (2022)On Graphs Coverable by k Shortest Paths., , , and . ISAAC, volume 248 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)