Sequential operator for filtering cycles in Boolean networks. - Eric Goles 001; Lilian Salinas (Adv. Appl. Math., 2010)

Limit cycles and update digraphs in Boolean networks. - Julio Aracena; Luis Gómez; Lilian Salinas (Discret. Appl. Math., 2013)

Maximum number of fixed points in AND-OR-NOT networks. - Julio Aracena; Adrien Richard; Lilian Salinas (J. Comput. Syst. Sci., 2014)

Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks. - Eduardo Palma; Lilian Salinas; Julio Aracena (Bioinform., 2016)

Fixed points in conjunctive networks and maximal independent sets in graph contractions. - Julio Aracena; Adrien Richard; Lilian Salinas (J. Comput. Syst. Sci., 2017)

Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks. - Julio Aracena; Adrien Richard; Lilian Salinas (SIAM J. Discret. Math., 2017)

Fixing monotone Boolean networks asynchronously. - Julio Aracena; Maximilien Gadouleau; Adrien Richard; Lilian Salinas (Inf. Comput., 2020)

Finding the fixed points of a Boolean network from a positive feedback vertex set. - Julio Aracena; Luis Cabrera-Crot; Lilian Salinas (Bioinform., 2021)

Compact structure for sparse undirected graphs based on a clique graph partition. - Felipe Glaria; Cecilia Hernández; Susana Ladra; Gonzalo Navarro 001; Lilian Salinas (Inf. Sci., 2021)

Existence and Non Existence of Limit Cycles in Boolean Networks. - Lilian Salinas; Luis Gómez; Julio Aracena (Automata and Complexity, 2022)

Synchronizing Boolean networks asynchronously. - Julio Aracena; Adrien Richard; Lilian Salinas (J. Comput. Syst. Sci., 2023)

Complexity of limit cycles with block-sequential update schedules in conjunctive networks. - Julio Aracena; Florian Bridoux; Luis Gómez; Lilian Salinas (Nat. Comput., 2023)

Dynamically equivalent disjunctive networks. - Julio Aracena; Luis Cabrera-Crot; Adrien Richard; Lilian Salinas (Theor. Comput. Sci., 2025)