| 
Citations
 | 
   web
D'Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., & Suchan, K. (2015). Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica, 72(4), 1055–1096.
toggle visibility
Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., Remila, E., & Todinca, I. (2021). Compact Distributed Certification of Planar Graphs. Algorithmica, 83(7), 2215–2244.
toggle visibility
Kosowski, A., Li, B., Nisse, N., & Suchan, K. (2015). k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica, 72(3), 758–777.
toggle visibility
Liedloff, M., Montealegre, P., & Todinca, I. (2019). Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica, 81(3), 986–1005.
toggle visibility
Rapaport, I., Suchan, K., Todinca, I., & Verstraete, J. (2011). On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica, 59(1), 16–34.
toggle visibility