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 Rapaport Z., Iván
2006

17.- Rapaport, Ivan; Suchan, Karol; Todinca, Ioan. Minimal proper interval completions. Graph-theoretic concepts in computer science, 217--228.

2004

16.- Dürr, Christoph; Rapaport, Ivan; Theyssier, Guillaume. Cellular automata and communication complexity. Theoret. Comput. Sci. 322 (2004), no. 2, 355--368.

15.- Desreux, Sébastien; Matamala, Martin; 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.

14.- 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.

13.- 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

12.- C. Durr, E. Goles, Rapaport, Ivan and E. Rémila. Tiling with bars under tomographic constraints. Theoretical Computer Science 290 (2003), 1317-1329.

2002

11.- M. Lachmann, C. Moore and Rapaport, Ivan. Who wins Domineering on rectangular boards?. In More Games of No Chance. MSRI Publications 42 (2002), 307-315, Cambridge University Press.

10.- F. Fomin, M. Matamala and Rapaport, Ivan. The complexity of approximating the oriented diameter of chordal graphs. 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), June 13-15, 2002, Cesky Krumlov, Czech Republic.

9.- M. Matamala, E. Prisner and Rapaport, Ivan. k-Pseudosnakes in large grids. Proceedings of the 5th Latin American Theoretical Informatics Symposium (LATIN 2002), 224-235, April 2-6, 2002, Cancún, Mexico.

8.- C. Moore, Rapaport, Ivan and E. Rémila. Tiling groups for Wang tiles. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 402-411, January 6-8, 2002, San Francisco, California, USA.

2001

7.- F. Fomin, M. Matamala, E. Prisner and Rapaport, Ivan. Bilateral orientation in graphs: domination and AT-free classes. Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 2001), March 17-19, 2001, Fortaleza, Brazil.

1999

6.- J. Mazoyer and Rapaport, Ivan. Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results Discrete Mathematics 199 (1999), 103-122. Editor’s Choice Edition 1999.

5.- E. Goles and Rapaport, Ivan. Tiling allowing rotations only. Theoretical Computer Science 218 (1999), 285-295.

4.- J. Mazoyer and Rapaport, Ivan. Inducing an order on cellular automata by a grouping operation. Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science 1373 (1998), 116-127, February 25-27, 1998, Paris, France. Discrete Applied Mathematics 91 (1999), 177-196.

1998

3.- J. Mazoyer and Rapaport, Ivan. Additive cellular automata over Zp and the bottom of (CA,<) Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science (MFCS 1998), Lecture Notes in Computer Science 1450 (1998), 834-843, August 24-28, 1998, Brno, Czech Republic.

2.- J. Mazoyer and Rapaport, Ivan. Inducing an order on cellular automata by a grouping operation. Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science 1373 (1998), 116-127, February 25-27, 1998, Paris, France. Discrete Applied Mathematics 91 (1999), 177-196.

1997

1.- E. Goles and Rapaport, Ivan. Complexity of tile rotation problems. Theoretical Computer Science 188 (1997), 129-159.

 



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

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