Home
 Sobre el DIM
 Carrera
 Docencia
 Doctorado
 Investigación
 Académicos 
 Funcionarios 
 Profesores Visitantes 
 Alumnos 
 Biblioteca
 Publicaciones Científicas 
 Publicaciones Docentes 
 Seminario
 Novedades 
 Eventos 
 Congresos DIM
 Link de Interés 
 Contáctenos 
 Intranet
 
 
 
PS PDF Imprimir E-mail

Artículos

por Matamala V., Martín

2008

31.- Correa, José R.; Fernandes, Cristina G.; Matamala, Martín; Wakabayashi, Yoshiko.  A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. Approximation and online algorithms, 184--192, Lecture Notes in Comput. Sci., 4927, Springer, Berlin, 2008.

30.- Matamala, Martín; Zamora, José.  A new family of expansive graphs. Discrete Appl. Math. 156 (2008), no. 7, 1125--1131.

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

2007

28.- Matamala, Martín.  Vertex partitions and maximum degenerate subgraphs. J. Graph Theory 55 (2007), no. 3, 227--232.

2006

27.- Moreno, Eduardo; Matamala, Martín. Minimal Eulerian circuit in a labeled digraph. LATIN 2006: Theoretical informatics, 737--744, Lecture Notes in Comput. Sci., 3887, Springer, Berlin, 2006.

26.- Durán, Guillermo; Liebling, Thomas M.; Matamala, Martín. Traces of the Latin American Conference on Combinatorics, Graphs and Applications. Held in Santiago, August 2004. Discrete Appl. Math. 154 (2006), no. 13, 1771--1772.

2005

25.- Matamala, Martín; Zamora, José. A new family of K-divergent graphs. Proceedings of GRACO2005, 357--363, 2005.

2004

24.- Latin-American Conference on Combinatorics, Graphs and Applications. Papers from the conference held in Santiago, August 16--20, 2004. Edited by T. Liebling, G. Duran and Matamala, Martín. Electronic Notes in Discrete Mathematics, 18. Elsevier Science B.V., Amsterdam, 2004.

23.- Matamala, Martín. Minimal de Bruijn sequence in a language with forbidden substrings. Graph-theoretic concepts in computer science, 168--176, Lecture Notes in Comput. Sci., 3353, Springer, Berlin, 2004.

22.- Matamala, Martín; Moreno, Eduardo Dynamic of cyclic automata over $\Bbb Z\sp 2$. Theoret. Comput. Sci. 322 (2004), no. 2, 369--381.

21.- Desreux, Sébastien; Matamala, Martín; Rapaport, Ivan; Rémila, Eric Domino tilings and related models: space of configurations of domains with holes. Theoret. Comput. Sci. 319 (2004), no. 1-3, 83--101.

20.- Fomin, Fedor V.; Matamala, Martín; Prisner, Erich; Rapaport, Ivan. AT-free graphs: linear bounds for the oriented diameter. Discrete Appl. Math. 141 (2004), no. 1-3, 135--148.

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

2003

18.- Matamala, Martín. Constructibility of speed one signal on cellular automata. Discrete Math. 262 (2003), no. 1-3, 195--209.

2002

17.- Fomin, Fedor V.; Matamala, Martín; Rapaport, Ivan. The complexity of approximating the oriented diameter of chordal graphs. Graph-theoretic concepts in computer science, 211--222.

16.- Matamala, Martín; Prisner, Erich; Rapaport, Ivan. k-pseudosnakes in large grids. LATIN 2002: Theoretical informatics (Cancun), 224--235.

2001

15.- Loebl, Martín; Matamala, Martín. Some remarks on cycles in graphs and digraphs. Graph theory (Prague, 1998). Discrete Math. 233 (2001), no. 1-3, 175--182.

14.- Fomin, Fedor V.; Matamala, Martín; Prisner, Erich; Rapaport, Ivan. Bilateral orientations and domination. Brazilian Symposium on Graphs, Algorithms and Combinatorics, 4 pp. (electronic), Electron. Notes Discrete Math., 7, Elsevier, Amsterdam, 2001.

2000

13.- Ndoundam, René; Matamala, Martín. No polynomial bound for the period of neuronal automata with inhibitory memory. Complex Systems 12 (2000), no. 4, 391--397.

12.- Ndoundam, René; Matamala, Martín. Cyclic evolution of neuronal automata with memory when all the weighting coefficients are strictly positive. Complex Systems 12 (2000), no. 4, 379--390. 

1999

11.- Matamala, Martín; Meer, Klaus. On the computational structure of the connected components of a hard problem. Inform. Process. Lett. 72 (1999), no. 3-4, 83--90.

10.- Goles, Eric; Matamala, Martín. Uniform simulation of Turing machines by cellular automata. Cellular automata and complex systems (Santiago, 1996), 23--36, Nonlinear Phenom. Complex Systems, 3, Kluwer Acad. Publ., Dordrecht, 1999.  

1997

9.- Cucker, Felipe; Koiran, Pascal; Matamala, Martín. Complexity and dimension. Inform. Process. Lett. 62 (1997), no. 4, 209--212.

8.- Goles, E.; Matamala, Martín. Reaction-diffusion automata: three states implies universality. Theory Comput. Syst. 30 (1997), no. 3, 223--229.

7.- Matamala, Martín. On the height used by additive BSS machines. Foundations of computational mathematics (Rio de Janeiro, 1997), 256--266.

6.- Matamala, Martín. Alternation on cellular automata. Theoret. Comput. Sci. 180 (1997), no. 1-2, 229--241.

5.- Matamala, Martín; Goles, Eric. Dynamic behavior of cyclic automata networks. Discrete Appl. Math. 77 (1997), no. 2, 161--184.

1996

4.- Goles, Eric; Matamala, Martín. Symmetric discrete universal neural networks. Universal machines and computations (Paris, 1995). Theoret. Comput. Sci. 168 (1996), no. 2, 405--416.

3.- Cucker, F.; Matamala, Martín. On digital nondeterminism. Math. Systems Theory 29 (1996), no. 6, 635--647.

1995

2.- Matamala, Martín. Recursive construction of periodic steady state for neural networks. Theoret. Comput. Sci. 143 (1995), no. 2, 251--267.

1994

1.- Cosnard, Michel; Matamala, Martín. On NC-real complexity classes for additive circuits and their relations with NC. Mathematical foundations of computer science 1994 (Kosice, 1994), 27--37, Lecture Notes in Comput. Sci., 841, Springer, Berlin, 1994.

 



[Volver a la Lista]
nº de visitas:   650228  

La página se generó en 0.014 Segundos
Optimized for Explorer 5.x, Mozilla1.x or Netscape 7
Copyright 2003,Sidwod Inc.  All rights reserved.