On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. - Michel Cosnard; Martín Matamala (MFCS, 1994)

Dynamical and Complexity Results for High Order Neural Networks. - Eric Goles Ch.; Martín Matamala (Int. J. Neural Syst., 1994)

Cyclic Automata Networks on Finite Graphs. - Martín Matamala; Eric Goles Ch. (LATIN, 1995)

Recursive Construction of Periodic Steady State for Neural Networks. - Martín Matamala (Theor. Comput. Sci., 1995)

On Digital Nondeterminism. - Felipe Cucker; Martín Matamala (Math. Syst. Theory, 1996)

Symmetric Discrete Universal Neural Networks. - Eric Goles Ch.; Martín Matamala (Theor. Comput. Sci., 1996)

Dynamic Behavior of Cyclic Automata Networks. - Martín Matamala; Eric Goles Ch. (Discret. Appl. Math., 1997)

Complexity and Dimension. - Felipe Cucker; Pascal Koiran; Martín Matamala (Inf. Process. Lett., 1997)

Reaction-Diffusion Automata: Three States Implies Universality. - Eric Goles Ch.; Martín Matamala (Theory Comput. Syst., 1997)

Alternation on Cellular Automata. - Martín Matamala (Theor. Comput. Sci., 1997)

On the computational structure of the connected components of a hard problem. - Martín Matamala; Klaus Meer (Inf. Process. Lett., 1999)

Cyclic Evolution of Neuronal Automata with Memory When All the Weighting Coefficients are Strictly Positive. - René Ndoundam; Martín Matamala (Complex Syst., 2000)

No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory. - René Ndoundam; Martín Matamala (Complex Syst., 2000)

Dynamical Properties of Min-Max Networks. - Eric Goles Ch.; Martín Matamala; Pablo A. Estévez (Int. J. Neural Syst., 2000)

Some remarks on cycles in graphs and digraphs. - Martin Loebl; Martín Matamala (Discret. Math., 2001)

Bilateral Orientations and Domination. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Electron. Notes Discret. Math., 2001)

k-pseudosnakes in Large Grids. - Martín Matamala; Erich Prisner; Ivan Rapaport (LATIN, 2002)

Constructibility of speed one signal on cellular automata. - Martín Matamala (Discret. Math., 2003)

Minimal de Bruijn Sequence in a Language with Forbidden Substrings. - Eduardo Moreno 001; Martín Matamala (WG, 2004)

AT-free graphs: linear bounds for the oriented diameter. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Discret. Appl. Math., 2004)

Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004. - Thomas M. Liebling; Guillermo Durán; Martín Matamala (Electron. Notes Discret. Math., 2004)

Complexity of approximating the oriented diameter of chordal graphs. - Fedor V. Fomin; Martín Matamala; Ivan Rapaport (J. Graph Theory, 2004)

Domino tilings and related models: space of configurations of domains with holes. - Sébastien Desreux; Martín Matamala; Ivan Rapaport; Eric Rémila (Theor. Comput. Sci., 2004)

Dynamic of cyclic automata over Z2 . - Martín Matamala; Eduardo Moreno 001 (Theor. Comput. Sci., 2004)

Minimal Eulerian trail in a labeled digraph - Martín Matamala; Eduardo Moreno 001 (CoRR, 2005)

A new family of K-divergent graphs. - Martín Matamala; José Zamora (Electron. Notes Discret. Math., 2005)

Minimal Eulerian Circuit in a Labeled Digraph. - Eduardo Moreno 001; Martín Matamala (LATIN, 2006)

Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile. - Guillermo Durán; Thomas M. Liebling; Martín Matamala (Discret. Appl. Math., 2006)

Small Alliances in Graphs. - Rodolfo Carvajal; Martín Matamala; Ivan Rapaport; Nicolas Schabanel (MFCS, 2007)

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. - José R. Correa; Cristina G. Fernandes; Martín Matamala; Yoshiko Wakabayashi (WAOA, 2007)

Vertex partitions and maximum degenerate subgraphs. - Martín Matamala (J. Graph Theory, 2007)

Navigating in a Graph by Aid of Its Spanning Tree. - Feodor F. Dragan; Martín Matamala (ISAAC, 2008)

A new family of expansive graphs. - Martín Matamala; José Zamora (Discret. Appl. Math., 2008)

Preface. - Thomas M. Liebling; Jayme Luiz Szwarcfiter; Guillermo Durán; Martín Matamala (Electron. Notes Discret. Math., 2008)

Nowhere-zero 5-flows and (1, 2)-factors. - Martín Matamala; José Zamora (Electron. Notes Discret. Math., 2008)

Some remarks about factors of graphs. - José R. Correa; Martín Matamala (J. Graph Theory, 2008)

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. - Christoph Dürr; Flavio Guiñez; Martín Matamala (ESA, 2009)

Minimum Eulerian circuits and minimum de Bruijn sequences. - Martín Matamala; Eduardo Moreno 001 (Discret. Math., 2009)

Degree Sequence of Tight Distance Graphs. - Martín Matamala; José Zamora (Electron. Notes Discret. Math., 2009)

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. - Guillermo Durán; Thomas M. Liebling; Martín Matamala; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. - Cristián E. Cortés; Martín Matamala; Claudio Contardo (Eur. J. Oper. Res., 2010)

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. - Florent Becker; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (IPDPS, 2011)

Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. - Flavio Guiñez; Martín Matamala; Stéphan Thomassé (Discret. Appl. Math., 2011)

Navigating in a Graph by Aid of Its Spanning Tree Metric. - Feodor F. Dragan; Martín Matamala (SIAM J. Discret. Math., 2011)

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography. - Christoph Dürr; Flavio Guiñez; Martín Matamala (SIAM J. Discret. Math., 2012)

Nowhere-Zero 5-Flows and Even (1, 2)-Factors. - Martín Matamala; José Zamora (Graphs Comb., 2013)

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. - Jarkko Kari; Martín Matamala; Ivan Rapaport; Ville Salo (SIROCCO, 2015)

A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs. - Natacha Astromujoff; Martín Matamala (Electron. J. Comb., 2015)

Allowing each node to communicate only once in a distributed system: shared whiteboard models. - Florent Becker; Adrian Kosowski; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (Distributed Comput., 2015)

Weighted antimagic labeling: an algorithmic approach. - Martín Matamala; José Zamora (Electron. Notes Discret. Math., 2015)

Injective Colorings with Arithmetic Constraints. - Natacha Astromujoff; Mathieu Chapelle; Martín Matamala; Ioan Todinca; José Zamora (Graphs Comb., 2015)

Convex p-partitions of bipartite graphs. - Luciano N. Grippo; Martín Matamala; Martín Darío Safe; Maya J. Stein (Theor. Comput. Sci., 2016)

Graphs admitting antimagic labeling for arbitrary sets of positive integers. - Martín Matamala; José Zamora (Electron. Notes Discret. Math., 2017)

Weighted antimagic labeling. - Martín Matamala; José Zamora (Discret. Appl. Math., 2018)

A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. - Pierre Aboulker; Martín Matamala; Paul Rochet; José Zamora (J. Graph Theory, 2018)

Graphs admitting antimagic labeling for arbitrary sets of positive numbers. - Martín Matamala; José Zamora (Discret. Appl. Math., 2020)

Lines in bipartite graphs and in 2-metric spaces. - Martín Matamala; José Zamora (J. Graph Theory, 2020)

Chen and Chvátal's conjecture in tournaments. - Gabriela Araujo-Pardo; Martín Matamala (Eur. J. Comb., 2021)

Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. - Pierre Aboulker; Laurent Beaudou; Martín Matamala; José Zamora (J. Graph Theory, 2022)

A de Bruijn and Erdös property in quasi-metric spaces with four points. - Gabriela Araujo-Pardo; Martín Matamala; J. Zamora (LAGOS, 2023)

Counting lines in semi-complete digraphs *. - Gabriela Araujo-Pardo; Martín Matamala; José Zamora (LAGOS, 2023)

Boundedness for proper conflict-free and odd colorings. - Andrea Jiménez; Kolja Knauer; Carla Negri Lintzmayer; Martín Matamala; Juan Pablo Peña; Daniel A. Quiroz; Maycon Sambinelli; Yoshiko Wakabayashi; Weiqiang Yu; José Zamora (CoRR, 2023)

The Minimum Clique Routing Problem on Cycles. - Mariana Escalante; Martín Matamala; Iván Rapaport; Paola B. Tolomei; Luis Miguel Torres (CoRR, 2023)