toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Golovach, P. A., Heggernes, P., Lima, P. T., & Montealegre, P. (2020). Finding connected secluded subgraphs. J. Comput. Syst. Sci., 113, 101–124.
toggle visibility
Goles, E., Montealegre, P., & Rios-Wilson, M. (2020). On The Effects Of Firing Memory In The Dynamics Of Conjunctive Networks. Discret. Contin. Dyn. Syst., 40(10), 5765–5793.
toggle visibility
Bottcher, L., Montealegre, P., Goles, E., & Gersbach, H. (2020). Competing activists-Political polarization. Physica A, 545, 13 pp.
toggle visibility
Goles, E., & Montealegre, P. (2020). The complexity of the asynchronous prediction of the majority automata. Inform. Comput., to appear.
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
Lobos, F., Goles, E., Ruivo, E. L. P., de Oliveira, P. P. B., & Montealegre, P. (2018). Mining a Class of Decision Problems for One-dimensional Cellular Automata. J. Cell. Autom., 13(5-6), 393–405.
toggle visibility
Goles, E., Montealegre, P., Perrot, K., & Theyssier, G. (2018). On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci., 91, 1–32.
toggle visibility
Goles, E., Montealegre, P., & Vera, J. (2016). Naming Game Automata Networks. J. Cell. Autom., 11(5-6), 497–521.
toggle visibility
Goles, E., Montealegre, P., Salo, V., & Torma, I. (2016). PSPACE-completeness of majority automata networks. Theor. Comput. Sci., 609, 118–128.
toggle visibility
Goles, E., & Montealegre, P. (2015). The complexity of the majority rule on planar graphs. Adv. Appl. Math., 64, 111–123.
toggle visibility
Goles, E., & Montealegre, P. (2014). Computational complexity of threshold automata networks under different updating schemes. Theor. Comput. Sci., 559, 3–19.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print