toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Montealegre, R., Perez-Salazar, S., Rapaport, I., & Todinca, I. (2020). Graph reconstruction in the congested clique. J. Comput. Syst. Sci., 113, 1–17.
toggle visibility
Becker, F., Montealecre, P., Rapaport, I., & Todinca, I. (2020). The Impact Of Locality In The Broadcast Congested Clique Model. SIAM Discret. Math., 34(1), 682–700.
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
Becker, F., Kosowski, A., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., et al. (2015). Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distrib. Comput., 28(3), 189–200.
toggle visibility
Goles, E., Montealegre-Barba, P., & Todinca, I. (2013). The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci., 504, 73–82.
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
Select All    Deselect All
 | 
Citations
 | 
   print