Lilian Salinas

According to our database, Lilian Salinas authored at least 12 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Complexity of limit cycles with block-sequential update schedules in conjunctive networks.

Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas

Nat. Comput., September, 2023

Synchronizing Boolean networks asynchronously.

Julio Aracena, Adrien Richard, Lilian Salinas

J. Comput. Syst. Sci., 2023

2022

Existence and Non Existence of Limit Cycles in Boolean Networks.

Lilian Salinas, Luis Gómez, Julio Aracena

Proceedings of the Automata and Complexity, 2022

2021

Compact structure for sparse undirected graphs based on a clique graph partition.

Felipe Glaria, Cecilia Hernández, Susana Ladra, Gonzalo Navarro, Lilian Salinas

Inf. Sci., 2021

Finding the fixed points of a Boolean network from a positive feedback vertex set.

Julio Aracena, Luis Cabrera-Crot, Lilian Salinas

Bioinform., 2021

2020

Fixing monotone Boolean networks asynchronously.

Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas

Inf. Comput., 2020

2017

Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks.

Julio Aracena, Adrien Richard, Lilian Salinas

SIAM J. Discret. Math., 2017

Fixed points in conjunctive networks and maximal independent sets in graph contractions.

Julio Aracena, Adrien Richard, Lilian Salinas

J. Comput. Syst. Sci., 2017

2016

Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks.

Eduardo Palma, Lilian Salinas, Julio Aracena

Bioinform., 2016

2014

Maximum number of fixed points in AND-OR-NOT networks.

Julio Aracena, Adrien Richard, Lilian Salinas

J. Comput. Syst. Sci., 2014

2013

Limit cycles and update digraphs in Boolean networks.

Julio Aracena, Luis Gómez, Lilian Salinas

Discret. Appl. Math., 2013

2010

Sequential operator for filtering cycles in Boolean networks.

Eric Goles, Lilian Salinas

Adv. Appl. Math., 2010