 | 2009 |
| 37 |  | Christoph Dürr,
Flavio Guiñez,
Martín Matamala:
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.
ESA 2009: 776-787 |
| 36 |  | Christoph Dürr,
Flavio Guiñez,
Martín Matamala:
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard
CoRR abs/0904.3169: (2009) |
| 2008 |
| 35 |  | Feodor F. Dragan,
Martín Matamala:
Navigating in a Graph by Aid of Its Spanning Tree.
ISAAC 2008: 788-799 |
| 34 |  | Martín Matamala,
José Zamora:
A new family of expansive graphs.
Discrete Applied Mathematics 156(7): 1125-1131 (2008) |
| 33 |  | Thomas M. Liebling,
Jayme Luiz Szwarcfiter,
Guillermo Durán,
Martín Matamala:
Preface.
Electronic Notes in Discrete Mathematics 30: 1-2 (2008) |
| 32 |  | Martín Matamala,
José Zamora:
Nowhere-zero 5-flows and (1, 2)-factors.
Electronic Notes in Discrete Mathematics 30: 279-284 (2008) |
| 31 |  | José R. Correa,
Martín Matamala:
Some remarks about factors of graphs.
Journal of Graph Theory 57(4): 265-274 (2008) |
| 2007 |
| 30 |  | Rodolfo Carvajal,
Martín Matamala,
Ivan Rapaport,
Nicolas Schabanel:
Small Alliances in Graphs.
MFCS 2007: 218-227 |
| 29 |  | José R. Correa,
Cristina G. Fernandes,
Martín Matamala,
Yoshiko Wakabayashi:
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
WAOA 2007: 184-192 |
| 28 |  | Martín Matamala:
Vertex partitions and maximum degenerate subgraphs.
Journal of Graph Theory 55(3): 227-232 (2007) |
| 2006 |
| 27 |  | Eduardo Moreno,
Martín Matamala:
Minimal Eulerian Circuit in a Labeled Digraph.
LATIN 2006: 737-744 |
| 26 |  | Guillermo Durán,
Thomas M. Liebling,
Martín Matamala:
Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.
Discrete Applied Mathematics 154(13): 1771-1772 (2006) |
| 2005 |
| 25 |  | Martín Matamala,
Eduardo Moreno:
Minimal Eulerian trail in a labeled digraph
CoRR abs/cs/0505036: (2005) |
| 24 |  | Martín Matamala,
José Zamora:
A new family of K-divergent graphs.
Electronic Notes in Discrete Mathematics 19: 357-363 (2005) |
| 2004 |
| 23 |  | Eduardo Moreno,
Martín Matamala:
Minimal de Bruijn Sequence in a Language with Forbidden Substrings.
WG 2004: 168-176 |
| 22 |  | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter.
Discrete Applied Mathematics 141(1-3): 135-148 (2004) |
| 21 |  | Thomas M. Liebling,
Guillermo Durán,
Martín Matamala:
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004.
Electronic Notes in Discrete Mathematics 18: 1-4 (2004) |
| 20 |  | Fedor V. Fomin,
Martín Matamala,
Ivan Rapaport:
Complexity of approximating the oriented diameter of chordal graphs.
Journal of Graph Theory 45(4): 255-269 (2004) |
| 19 |  | Sébastien Desreux,
Martín Matamala,
Ivan Rapaport,
Eric Rémila:
Domino tilings and related models: space of configurations of domains with holes.
Theor. Comput. Sci. 319(1-3): 83-101 (2004) |
| 18 |  | Martín Matamala,
Eduardo Moreno:
Dynamic of cyclic automata over Z2 .
Theor. Comput. Sci. 322(2): 369-381 (2004) |
| 2003 |
| 17 |  | Martín Matamala:
Constructibility of speed one signal on cellular automata.
Discrete Mathematics 262(1-3): 195-209 (2003) |
| 2002 |
| 16 |  | Martín Matamala,
Erich Prisner,
Ivan Rapaport:
k-pseudosnakes in Large Grids.
LATIN 2002: 224-235 |
| 15 |  | Fedor V. Fomin,
Martín Matamala,
Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs.
WG 2002: 211-222 |
| 2001 |
| 14 |  | Martin Loebl,
Martín Matamala:
Some remarks on cycles in graphs and digraphs.
Discrete Mathematics 233(1-3): 175-182 (2001) |
| 13 |  | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
Bilateral Orientations and Domination.
Electronic Notes in Discrete Mathematics 7: 26-29 (2001) |
| 2000 |
| 12 |  | Eric Goles Ch.,
Martín Matamala,
Pablo A. Estévez:
Dynamical Properties of Min-Max Networks.
Int. J. Neural Syst. 10(6): 467-473 (2000) |
| 1999 |
| 11 |  | Martín Matamala,
Klaus Meer:
On the computational structure of the connected components of a hard problem.
Inf. Process. Lett. 72(3-4): 83-90 (1999) |
| 1997 |
| 10 |  | Martín Matamala,
Eric Goles Ch.:
Dynamic Behavior of Cyclic Automata Networks.
Discrete Applied Mathematics 77(2): 161-184 (1997) |
| 9 |  | Felipe Cucker,
Pascal Koiran,
Martín Matamala:
Complexity and Dimension.
Inf. Process. Lett. 62(4): 209-212 (1997) |
| 8 |  | Martín Matamala:
Alternation on Cellular Automata.
Theor. Comput. Sci. 180(1-2): 229-241 (1997) |
| 7 |  | Eric Goles Ch.,
Martín Matamala:
Reaction-Diffusion Automata: Three States Implies Universality.
Theory Comput. Syst. 30(3): 223-229 (1997) |
| 1996 |
| 6 |  | Felipe Cucker,
Martín Matamala:
On Digital Nondeterminism.
Mathematical Systems Theory 29(6): 635-647 (1996) |
| 5 |  | Eric Goles Ch.,
Martín Matamala:
Symmetric Discrete Universal Neural Networks.
Theor. Comput. Sci. 168(2): 405-416 (1996) |
| 1995 |
| 4 |  | Martín Matamala,
Eric Goles Ch.:
Cyclic Automata Networks on Finite Graphs.
LATIN 1995: 398-410 |
| 3 |  | Martín Matamala:
Recursive Construction of Periodic Steady State for Neural Networks.
Theor. Comput. Sci. 143(2): 251-267 (1995) |
| 1994 |
| 2 |  | Michel Cosnard,
Martín Matamala:
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC.
MFCS 1994: 27-37 |
| 1 |  | Eric Goles Ch.,
Martín Matamala:
Dynamical and Complexity Results for High Order Neural Networks.
Int. J. Neural Syst. 5(3): 241-252 (1994) |