| Lines in bipartite graphs and in 2-metric spaces | 0 | 0.34 | 2020 |
| Weighted antimagic labeling. | 0 | 0.34 | 2018 |
| A new class of graphs that satisfies the Chen-Chvátal Conjecture. | 0 | 0.34 | 2018 |
| Graphs admitting antimagic labeling for arbitrary sets of positive integers | 0 | 0.34 | 2017 |
| Convex p-partitions of bipartite graphs. | 2 | 0.47 | 2016 |
| Weighted antimagic labeling: an algorithmic approach | 1 | 0.39 | 2015 |
| Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. | 5 | 0.44 | 2015 |
| Allowing each node to communicate only once in a distributed system: shared whiteboard models | 6 | 0.53 | 2012 |
| The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method | 43 | 1.99 | 2010 |
| Editorial: Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007 | 0 | 0.34 | 2010 |
| Minimum Eulerian circuits and minimum de Bruijn sequences | 5 | 0.45 | 2009 |
| Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard | 16 | 1.29 | 2009 |
| Some remarks about factors of graphs | 5 | 0.64 | 2008 |
| Nowhere-Zero 5-Flows and Even (1,2)-Factors | 0 | 0.34 | 2008 |
| A new family of expansive graphs | 5 | 0.42 | 2008 |
| Vertex partitions and maximum degenerate subgraphs | 1 | 0.35 | 2007 |
| A 5/3-approximation for finding spanning trees with many leaves in cubic graphs | 8 | 0.56 | 2007 |
| Small Alliances in Graphs | 6 | 0.71 | 2007 |
| Minimal eulerian circuit in a labeled digraph | 2 | 0.44 | 2006 |
| Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile | 0 | 0.34 | 2006 |
| A new family of K-divergent graphs | 0 | 0.34 | 2005 |
| Minimal Eulerian trail in a labeled digraph | 0 | 0.34 | 2005 |
| Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004 | 0 | 0.34 | 2004 |
| AT-free graphs: linear bounds for the oriented diameter | 9 | 0.68 | 2004 |
| Minimal de bruijn sequence in a language with forbidden substrings | 2 | 0.43 | 2004 |
| Complexity of approximating the oriented diameter of chordal graphs | 11 | 0.67 | 2004 |
| Constructibility of speed one signal on cellular automata | 0 | 0.34 | 2003 |
| k-pseudosnakes in Large Grids | 1 | 0.48 | 2002 |
| Dynamical properties of min-max networks. | 0 | 0.34 | 2000 |
| No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory. | 0 | 0.34 | 2000 |
| Cyclic Evolution of Neuronal Automata with Memory When All the Weighting Coefficients are Strictly Positive. | 0 | 0.34 | 2000 |
| Reaction-Diffusion Automata: Three States Implies Universality. | 0 | 0.34 | 1997 |
| Alternation on cellular automata | 6 | 0.90 | 1997 |
| Dynamic behavior of cyclic automata networks | 1 | 0.37 | 1997 |
| Complexity and dimension | 5 | 0.86 | 1997 |
| On Digital Nondeterminism. | 11 | 1.37 | 1996 |
| Symmetric discrete universal neural networks | 1 | 0.36 | 1996 |
| Cyclic Automata Networks on Finite Graphs | 0 | 0.34 | 1995 |
| Recursive construction of periodic steady state for neural networks | 3 | 0.54 | 1995 |
| Dynamical and Complexity Results for High Order Neural Networks. | 3 | 0.56 | 1994 |
| On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC | 0 | 0.34 | 1994 |
