Julio Aracena

According to our database, Julio Aracena authored at least 23 papers between 2000 and 2025.

Collaborative distances:

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

2025

Dynamically equivalent disjunctive networks.

Julio Aracena, Luis Cabrera-Crot, Adrien Richard, Lilian Salinas

Theor. Comput. Sci., 2025

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

The weighted sitting closer to friends than enemies problem in the line.

Julio Aracena, Christopher Thraves Caro

J. Comb. Optim., 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

On the Recognition of Strong-Robinsonian Incomplete Matrices.

Julio Aracena, Christopher Thraves Caro

CoRR, 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

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

2011

Combinatorics on update digraphs in Boolean networks.

Julio Aracena, Eric Fanchon, Marco Montalva, Mathilde Noual

Discret. Appl. Math., 2011

2009

On the robustness of update schedules in Boolean networks.

Julio Aracena, Eric Goles Ch., Andrés Moreira, Luis Salinas

Biosyst., 2009

2008

On the complexity of feedback set problems in signed digraphs.

Marco Montalva, Julio Aracena, Anahí Gajardo

Electron. Notes Discret. Math., 2008

2004

Positive and negative circuits in discrete neural networks.

Julio Aracena, Jacques Demongeot, Eric Goles Ch.

IEEE Trans. Neural Networks, 2004

On limit cycles of monotone functions with symmetric connection graph.

Julio Aracena, Jacques Demongeot, Eric Goles Ch.

Theor. Comput. Sci., 2004

Fixed points and maximal independent sets in AND-OR networks.

Julio Aracena, Jacques Demongeot, Eric Goles Ch.

Discret. Appl. Math., 2004

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

Complexity of perceptron recognition for a class of geometric patterns.

Julio Aracena, Eric Goles Ch.

Theor. Comput. Sci., 2003

2000

The genetic expressions and both chromosomic breakage and positive circuits.

Julio Aracena, S. B. Lamine, Marie-Ange Mermet, Olivier Cohen, Jacques Demongeot

Proceedings of the 1st IEEE International Symposium on Bioinformatics and Biomedical Engineering, 2000