The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martín Matamala: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martín Matamala, Eric Goles Ch.
    Cyclic Automata Networks on Finite Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:398-410 [Conf]
  2. Martín Matamala, Erich Prisner, Ivan Rapaport
    k-pseudosnakes in Large Grids. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:224-235 [Conf]
  3. Eduardo Moreno, Martín Matamala
    Minimal Eulerian Circuit in a Labeled Digraph. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:737-744 [Conf]
  4. Michel Cosnard, Martín Matamala
    On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:27-37 [Conf]
  5. Fedor V. Fomin, Martín Matamala, Ivan Rapaport
    The Complexity of Approximating the Oriented Diameter of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:211-222 [Conf]
  6. Eduardo Moreno, Martín Matamala
    Minimal de Bruijn Sequence in a Language with Forbidden Substrings. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:168-176 [Conf]
  7. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
    AT-free graphs: linear bounds for the oriented diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:135-148 [Journal]
  8. Martín Matamala, Eric Goles Ch.
    Dynamic Behavior of Cyclic Automata Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:2, pp:161-184 [Journal]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1771-1772 [Journal]
  10. Martin Loebl, Martín Matamala
    Some remarks on cycles in graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:175-182 [Journal]
  11. Martín Matamala
    Constructibility of speed one signal on cellular automata. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:195-209 [Journal]
  12. Eric Goles Ch., Martín Matamala
    Dynamical and Complexity Results for High Order Neural Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 1994, v:5, n:3, pp:241-252 [Journal]
  13. Eric Goles Ch., Martín Matamala, Pablo A. Estévez
    Dynamical Properties of Min-Max Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 2000, v:10, n:6, pp:467-473 [Journal]
  14. Felipe Cucker, Pascal Koiran, Martín Matamala
    Complexity and Dimension. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:4, pp:209-212 [Journal]
  15. Martín Matamala, Klaus Meer
    On the computational structure of the connected components of a hard problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:83-90 [Journal]
  16. Eric Goles Ch., Martín Matamala
    Reaction-Diffusion Automata: Three States Implies Universality. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:3, pp:223-229 [Journal]
  17. Felipe Cucker, Martín Matamala
    On Digital Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:6, pp:635-647 [Journal]
  18. Eric Goles Ch., Martín Matamala
    Symmetric Discrete Universal Neural Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:2, pp:405-416 [Journal]
  19. Sébastien Desreux, Martín Matamala, Ivan Rapaport, Eric Rémila
    Domino tilings and related models: space of configurations of domains with holes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:83-101 [Journal]
  20. Martín Matamala
    Recursive Construction of Periodic Steady State for Neural Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:2, pp:251-267 [Journal]
  21. Martín Matamala
    Alternation on Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:229-241 [Journal]
  22. Martín Matamala, Eduardo Moreno
    Dynamic of cyclic automata over Z2 . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:322, n:2, pp:369-381 [Journal]
  23. Fedor V. Fomin, Martín Matamala, Ivan Rapaport
    Complexity of approximating the oriented diameter of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:4, pp:255-269 [Journal]
  24. Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
    Small Alliances in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:218-227 [Conf]

  25. Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. [Citation Graph (, )][DBLP]


  26. Navigating in a Graph by Aid of Its Spanning Tree. [Citation Graph (, )][DBLP]


  27. A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. [Citation Graph (, )][DBLP]


  28. Minimal Eulerian trail in a labeled digraph [Citation Graph (, )][DBLP]


  29. Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard [Citation Graph (, )][DBLP]


  30. A new family of expansive graphs. [Citation Graph (, )][DBLP]


  31. Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. [Citation Graph (, )][DBLP]


  32. Minimum Eulerian circuits and minimum de Bruijn sequences. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002