artículo académico

• Dynamically equivalent disjunctive networks.  THEORETICAL COMPUTER SCIENCE.  1024. 2025
• Complexity of limit cycles with block-sequential update schedules in conjunctive networks.  NATURAL COMPUTING.  22:411-429. 2023
• Synchronizing Boolean networks asynchronously.  JOURNAL OF COMPUTER AND SYSTEM SCIENCES.  136:249-279. 2023
• Compact structure for sparse undirected graphs based on a clique graph partition.  INFORMATION SCIENCES.  544:485-499. 2021
• Finding the fixed points of a Boolean network from a positive feedback vertex set.  BIOINFORMATICS.  37(8):1148-1155. 2021
• Fixing monotone Boolean networks asynchronously.  INFORMATION AND COMPUTATION.  254. 2020
• Fixed points in conjunctive networks and maximal independent sets in graph contractions.  JOURNAL OF COMPUTER AND SYSTEM SCIENCES.  88:145-163. 2017
• Number of fixed points and disjoint cycles in monotone boolean networks.  SIAM JOURNAL ON DISCRETE MATHEMATICS.  31(3):1702-1725. 2017
• Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks.  BIOINFORMATICS.  32(5):722-729. 2016
• Maximum number of fixed points in AND-OR-NOT networks.  JOURNAL OF COMPUTER AND SYSTEM SCIENCES.  80(7):1175-1190. 2014
• Limit cycles and update digraphs in Boolean networks.  DISCRETE APPLIED MATHEMATICS.  161:1-12. 2013
• Sequential operator for filtering cycles in Boolean networks.  ADVANCES IN APPLIED MATHEMATICS.  45(3):346-358. 2010
• On the Robustness of Update Schedules in Boolean Networks.  BIOSYSTEMS.  97:1-8. 2009