The genetic expressions and both chromosomic breakage and positive circuits. - Julio Aracena; S. B. Lamine; Marie-Ange Mermet; Olivier Cohen; Jacques Demongeot (BIBE, 2000)

Complexity of perceptron recognition for a class of geometric patterns. - Julio Aracena; Eric Goles Ch. (Theor. Comput. Sci., 2003)

Mathematical modeling in genetic networks: relationships between the genetic expression and both chromosomic breakage and positive circuits. - Julio Aracena; S. B. Lamine; Marie-Ange Mermet; Olivier Cohen; Jacques Demongeot (IEEE Trans. Syst. Man Cybern. Part B, 2003)

Fixed points and maximal independent sets in AND-OR networks. - Julio Aracena; Jacques Demongeot; Eric Goles Ch. (Discret. Appl. Math., 2004)

On limit cycles of monotone functions with symmetric connection graph. - Julio Aracena; Jacques Demongeot; Eric Goles Ch. (Theor. Comput. Sci., 2004)

Positive and negative circuits in discrete neural networks. - Julio Aracena; Jacques Demongeot; Eric Goles Ch. (IEEE Trans. Neural Networks, 2004)

On the complexity of feedback set problems in signed digraphs. - Marco Montalva; Julio Aracena; Anahí Gajardo (Electron. Notes Discret. Math., 2008)

On the robustness of update schedules in Boolean networks. - Julio Aracena; Eric Goles Ch.; Andrés Moreira; Luis Salinas (Biosyst., 2009)

Combinatorics on update digraphs in Boolean networks. - Julio Aracena; Eric Fanchon; Marco Montalva; Mathilde Noual (Discret. Appl. Math., 2011)

On the number of update digraphs and its relation with the feedback arc sets and tournaments. - Julio Aracena; Jacques Demongeot; Eric Fanchon; Marco Montalva (Discret. Appl. Math., 2013)

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)

On the Recognition of Strong-Robinsonian Incomplete Matrices. - Julio Aracena; Christopher Thraves Caro (CoRR, 2021)

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

The weighted sitting closer to friends than enemies problem in the line. - Julio Aracena; Christopher Thraves Caro (J. Comb. Optim., 2023)

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)

Hamiltonian dynamics of Boolean networks. - Arturo Zapata-Cortés; Julio Aracena (CoRR, 2025)