Programa
El programa de las Jornadas se encuentra disponible aquÃ. Las actas con todos los trabajos aceptados se encuentran aquÃ.Las actividades del congreso se realizarán en el "Departamento de IngenierÃa Informática y Matemáticas" de la "Escola Tècnica Superior d'Enginyeria, Campus Sescelades". La dirección del mismo es Av. Països Catalans, 26, Campus Sescelades, 43007 Tarragona. Autobuses 54 y 41, Parada: Paisos Catalans. Más información sobre como llegar se puede encontrar en los enlaces anteriores.
Charlas (Talks)
- S. Cabello and M. Jejcic, Shortest Paths in Intersection Graphs of Unit Disks
- J. MartÃ-Farré, Linearly dependent vectorial decomposition of clutters
- S. Bermudo, H. Fernau, and J. M. Sigarreta, The differential and the Roman domination number of a graph
- J. Chappelon, K. Knauer, L.P. Montejano and J. RamÃrez-AlfonsÃn, Connected Covering Numbers
- N. Lopez Lorenzo, H. Pérez-Rosés and J. Pujolàs , Grafos mezclados de Moore de tipo Cayley
- G. De Ita Luna, R. Marcial-Romero and Y. Moyao, An Enumerative Algorithm for #2SAT
- R. Feria-Purón, H. Pérez-Rosés and J. Ryan, Searching for Large Multi-Loop Networks
- A. Estrada-Moreno, I. G. Yero and J. A. RodrÃguez-Velázquez, k-metric resolvability in graphs
- R. Fabila-Monroy, C. Huemer and D. Mitsche, The number of empty four-gons in random point sets
- C. Dalfo, C. Huemer and J. Salas, The degree/diameter problem in maximal planar bipartite graphs
- M. A. Fiol, Caracterizaciones Combinatorias y Algebraicas de Grafos Distancia-Regulares
- W. Carballosa, D. Pestana, J. M. RodrÃguez and J. M. Sigarreta, Distortion of the hyperbolicity constant in minor graphs
- J. M. Aroca, A. Lladó and Slamin, On the ascending subgraph decomposition problem for bipartite graphs
- V. Diego and O. Serra, A problem of Shapozenko on Johnson graphs
- D. Garijo, A. González and A. Márquez, Breaking symmetries of graphs with resolving sets
- C. Hernando, M. Mora and I. M. Pelayo, LD-graphs and global location-domination in bipartite graphs
- J. Rifá Coma and E. Suárez Canedo, About a class of Hadamard Propelinear Codes
- J. Borges Ayats, Cristina Fernández-Córdoba and Roger Ten-Valls, Z_2-double cyclic codes
- A. Carmona, A. M. Encinas and M. Mitjana, Potential Theory on Finite Networks
- G. Perarnau and B. Reed, Existence of spanning F-free subgraphs with large minimum degree
- R. D. Barrolleta and M. Villanueva, Partial permutation decoding for binary linear Hadamard codes
- L. Ramos and J. Rúe, Avoiding subgraphs in Series-Parallel graphs
- M. Blanco and F. Santos, Classification of lattice 3-polytopes with few lattice points
- C. Marijuán López y M. Pisonero Pérez, Sobre condiciones suficientes para el RNIEP y sus márgenes de realizabilidad
- L. Boza, Sobre los números de Ramsey R(K_5-e,K_5) y R(K_6-e,K_4)
- F. Aguiló-Gost, P. GarcÃa-Sánchez and D. Llena, Denumerants of 3-numerical semigroups
- J. Salas and V. Torra, Approximating degree sequences with regular graphic sequences
- G. Hernández and M. Martins, Monitoring maximal outerplanar graphs
- A. Lladó, Decomposing almost complete graphs by random trees
- M. P. Alvarez-Ruiz, I. González-Yero, T. Mediavilla-Gradolph and J. C. Valenzuela, On a variant of Roman domination in graphs
- C. Araúz, A. Carmona and A. M. Encinas, Recovering the conductances on grids
- A. Abiad, M. A. Fiol, W. H. Haemers and G. Perarnau, An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs
- M. Ceballos, J. Núñez y A. F. Tenorio, Estructuras combinatorias asociadas a algunas algebras no asociativas de dimension finita
- S. Bermudo, J. M. RodrÃguez and J. M. Sigarreta, Relations between the differential and parameters in graphs
- G. A. Barragán-RamÃrez, C. GarcÃa Gómez and J. A. RodrÃguez-Velázquez, Closed formulae for the local metric dimension of corona product graphs
- A. M. Robles-Perez and José Carlos Rosales, The numerical semigroup of the integers which are bounded by a submonoid of N^2
- G. De Ita Luna, R. Marcial-Romero and Y. Moyao, An Approximate Algorithm for the Chromatic Number of Graphs
- A. Torokhti, A. Grant and S. Miklavcic, Numerical algorithms for efficient compression of distributed information
- D. Kuziak, J. A. RodrÃguez-Velázquez and I. G. Yero, On the strong metric dimension of product graphs
- Y. Ramirez-Cruz, O. R. Oellermann and J. A. RodrÃguez-Velázquez, Simultaneous Resolvability in Graph Families
- J. Cáceres, C. Hernando, M. Mora, I. Pelayo and M. L. Puertas, On Perfect and Quasiperfect Dominations in Graphs
- J. Cáceres, M. Morales and M. L. Puertas, Two graph families with maximum quasiperfect domination number
- V. Hernández, D. Pestana and J. M. RodrÃguez, Bounds on the Hyperbolicity Constant
- A. Torokhti and P. Howlett, Data estimation under partially missing information
- W. Carballosa, J. M. RodrÃguez, J. M. Sigarreta and Y. Torres-Nuñez, Distinctive power of the alliance polynomial for regular graphs
- C. Araúz, A. Carmona and A. M. Encinas, Dirichlet-to-Robin Matrix on networks
- F. Aguiló-Gost, P. GarcÃa-Sánchez y D. Llena, Un algoritmo para el calculo de primitivos
- W. Carballosa, A. de la Cruz and J. M. RodrÃguez, Characterization of the hyperbolicity in the lexicographic product
- S. Bermudo, J. M. RodrÃguez, O. Rosario and J. M. Sigarreta, Graphs with small hyperbolicity constant
- A. Cantón, A. Granados, A. Portilla and J. M. RodrÃguez, Isoperimetric inequalities in graphs and surfaces
- N. Campanelli, M. E. FrÃas and J. L. MartÃnez, Rings of Graphs
- A. Carmona, A. M. Encinas and M. Mitjana, The Kirchhoff index of unicycle weighted chains
- A. Carmona, A. M. Encinas, S. Gago and M. Mitjana, Laplacian matrix of a weighted graph with new pendant vertices
- L. Colmenarejo Hernando and E. Briand, Combinatorial proof for a stability property of plethysm coefficients
- J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo and M. L. Puertas, The graph distance game and some graph operations
- M. P. Alvarez-Ruiz, I. González-Yero, T. Mediavilla-Gradolph and J. C. Valenzuela, On the Roman Domination Contraction number of trees with small diameter
- C. Balbuena, P. GarcÃa-Vázquez and J. C. Valenzuela, Edge neighbor connectivity in graphs with given girth
- Luis B. Morales, Sobre la enumeración de diseños sobresaturados óptimos con dos niveles
Patrocinadores:
