Martín Matamala


Member of the
Discrete Maths and Theoretical Computer Science group (DMTCS)

Associated Professor
Department of Mathematical Engineering (DIM)

Associated Researcher
Center for Mathematical Modeling (CMM)

Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile
Address: Blanco Encalada 2120, Santiago, Chile
Postcode: 8370459
Phone: 56 2 978 45 55
Fax: 56 2 688 38 21
email: m followed by the seven first letters of my last name at dim uchile cl


Courses:


Former Ph.D. students


My research area is Discrete Mathematics mainly Algorithms and Graph Theory. In the last years I have been working in Graph Factor Theory and its relation to other combinatorial problems.
My research activity has been support mainly for Conicyt under projects Fondecyt, Fondap, Anillo, Basal.

Publications:

2010
Claudio Contardo, Cristiá Cortés Martín Matamala: The Pickup and Delivery Problem with Transfers: Formulation and a Branch-and-cut solution method. European Journal of Operational Research 200 (2010) 711 -- 724.
2009
Martín Matamala, José Zamora: Degree sequences of tight distance graphs LAGOS 2009
Christoph Dürr, Flavio Guiñez, Martín Matamala, Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard. Lecture Notes in Computer Science 5757, 776--787, Proceeding of ESA 2009. This paper was the recipient of the ESA 2009 Best Paper Award.
Martín Matamala, Eduardo Moreno , Minimum Eulerian circuits and minimum de Bruijn sequence, Discrete Mathematics 309 (2009) 5298-5304.
2008
Feodor Dragan, Martín Matamala, Navigating in a graph by aid of its spanning tree. Lecture Notes in Computer Science 5369, 788-799, 2008. Proceeding of ISAAC 2008
Martín Matamala, José Zamora: A new family of expansive graphs. Discrete Applied Mathematics 156(7): 1125-1131 (2008). (Extended Abstract in Proceedings of GRACO2005, 357--363 Electron. Notes Discrete Math., 19, Elsevier, Amsterdam)
José R. Correa, Martín Matamala,: Some Remarks About Factors of Graphs. Journal of Graph Theory, 57, No 4: 265-274 (2008)
2007
Martín Matamala, José Zamora: Nowhere-zero 5-flows and (1, 2)-factors. LAGOS 2007:
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel: Small Alliances in Graphs. MFCS 2007: 218-227
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
Martín Matamala,: Vertex partitions and maximum degenerate subgraphs. Journal of Graph Theory, 55, No 3: 227-232 (2007)
2006
Eduardo Moreno, Martín Matamala: Minimal Eulerian Circuit in a Labeled Digraph. LATIN 2006: 737-744
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)
2004
Eduardo Moreno, Martín Matamala: Minimal de Bruijn Sequence in a Language with Forbidden Substrings. WG 2004: 168-176
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). Extended Abstract: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Under title: Bilateral orientations and domination. Electron. Notes Discrete Math., 7, Elsevier, Amsterdam, 2001.
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). (Extended Abstract: Graph-theoretic concepts in computer science, 211--222, Lecture Notes in Comput. Sci., 2573, Springer, Berlin, 2002)
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)
Martín Matamala, Eduardo Moreno: Dynamic of cyclic automata over Z2 . Theor. Comput. Sci. 322(2): 369-381 (2004)
2003
Martín Matamala: Constructibility of speed one signal on cellular automata. Discrete Mathematics 262(1-3): 195-209 (2003)
2002
Martín Matamala, Erich Prisner, Ivan Rapaport: k-pseudosnakes in Large Grids. LATIN 2002: 224-235
Francisco Martínez Martín Matamala: A structural approach to solve transport networks' user equilibrium. 9th World Conference in Transportation Research. South Corea, 2002.
2001
Martin Loebl, Martín Matamala: Some remarks on cycles in graphs and digraphs. Discrete Mathematics 233(1-3): 175-182 (2001)
2000
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)
Ndoundam, René, Martín Matamala: No polynomial bound for the period of neuronal automata with inhibitory memory. Complex Systems 12 (4): 391-397, (2000).
Ndoundam, René, Martín Matamala: Cyclic evolution of neuronal automata with memory when all the weighting coefficients are strictly positive. Complex Systems 12 (4): 379-390, (2004).
1999
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
Martín Matamala, Eric Goles Ch.: Dynamic Behavior of Cyclic Automata Networks. Discrete Applied Mathematics 77(2): 161-184 (1997). Extended Abstract in LATIN 1995. Under title Cyclic Automata Networks on Finite Graphs. 398-410
Felipe Cucker, Pascal Koiran, Martín Matamala: Complexity and Dimension. Inf. Process. Lett. 62(4): 209-212 (1997)
Martín Matamala: Alternation on Cellular Automata. Theor. Comput. Sci. 180(1-2): 229-241 (1997)
Eric Goles Ch., Martín Matamala: Reaction-Diffusion Automata: Three States Implies Universality. Theory Comput. Syst. 30(3): 223-229 (1997)
Martín Matamala: On the height used by additives BSS machines. Foundations of computational mathematics (selected papers of a conference held in Rio de Janeiro, 1997), pp. 256-266. Brasil.
1996
Felipe Cucker, Martín Matamala: On Digital Nondeterminism. Mathematical Systems Theory 29(6): 635-647 (1996)
Eric Goles Ch., Martín Matamala: Symmetric Discrete Universal Neural Networks. Theor. Comput. Sci. 168(2): 405-416 (1996)
Pekka Orponen Martín Matamala: Universal Computation by finite two-dimensional coupled map lattices. Proceedings Physical and Computation, pp. 243-247. USA, 1996.
1995
Martín Matamala: Recursive Construction of Periodic Steady State for Neural Networks. Theor. Comput. Sci. 143(2): 251-267 (1995)
1994
Michel Cosnard, Martín Matamala: On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS 1994: 27-37
Eric Goles Ch., Martín Matamala: Dynamical and Complexity Results for High Order Neural Networks. Int. J. Neural Syst. 5(3): 241-252 (1994)

Chapters/Edited Books

2007
Proceedings of the 5thLatin-american Algorithms, Graphs and Optimization Symposium: Puerto Varas, Chile, November 21-24, 2007. Electronic Notes in Discrete Mathematics 30, 2008. Editores: G. Durán, T. Liebling, M. Matamala and J. Szwarcfiter.
2006
Discrete Applied Mathematics 154, 2006. Traces of the Latin America Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile. Guess Editors: G. Durán, T. Liebling and M. Matamala.
2004
Proceedings of the Latin-american Conference on Combinatorics, Graphs and Applications: Santiago, Chile, August 16-20, 2004. Electronic Notes in Discrete Mathematics, 18, 1, 2005. Editors: G. Durán, T. Liebling and M. Matamala.
1999
Eric Goles Ch., Martín Matamala: Uniform Simulation of Turing by Cellular Automata. In Cellular Automata and Complex Systems, Nonlinear Phenom. Complex Systems 3, Editors:E. Goles, S. Martínez, 1999.

Finished but not yet submitted/accepted/published

????
Martín Matamala, José Zamora: Edge colorings induced by vertex labelings. Submitted. 2008.
Flavio Guiñez, Martín Matamala, Stéphan Thomassé, Realizing degree sequences disjointly in bipartite graphs: a solvable case of a discrete tomography problem. Submitted 2008.
Martín Matamala, José Zamora: A characterization of nowhere-zero 5-flows in terms of (1, 2)-factors for cubic graphs. 2008.
Martín Matamala, José Zamora: Weak Decomposition of completes graphs in tree- functions. 2008.
Martín Matamala, Upper bounds for domination numbers with connectivity constraints. 2004.

Working papers

????
Martín Matamala, Orientation and coloring in planar graphs.
Martín Matamala, Orientation of Claw-free graphs.

Conferences Program Committe Member

Current
V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2009), Gramados, Brasil.
Past
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2007), Puerto Varas, Chile
Latin American Theoretical Informatics Symposium (LATIN 2006), Valdivia, Chile
Latin-American Graphs, Combinatoric and Applications (LACGA 2004), Santiago, Chile