| |
Author  |
Title |
Year |
Publication |
Volume |
Pages |
Links |
|
|
D'Angelo, G.; Di Stefano, G.; Navarra, A.; Nisse, N.; Suchan, K. |
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks |
2015 |
Algorithmica |
72 |
1055-1096 |
|
|
|
Feuilloley, L.; Fraigniaud, P.; Montealegre, P.; Rapaport, I.; Remila, E.; Todinca, I. |
Compact Distributed Certification of Planar Graphs |
2021 |
Algorithmica |
83 |
2215-2244 |
|
|
|
Fraigniaud, P.; Montealegre, P.; Rapaport, I.; Todinca, I. |
Alert Results A Meta-Theorem for Distributed Certification 5 of 28 A Meta-Theorem for Distributed Certification |
2023 |
Algorithmica |
Early Access |
|
|
|
|
Kosowski, A.; Li, B.; Nisse, N.; Suchan, K. |
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth |
2015 |
Algorithmica |
72 |
758-777 |
|
|
|
Liedloff, M.; Montealegre, P.; Todinca, I. |
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques |
2019 |
Algorithmica |
81 |
986-1005 |
|
|
|
Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J. |
On Dissemination Thresholds in Regular and Irregular Graph Classes |
2011 |
Algorithmica |
59 |
16-34 |
|
