PDI - Resultado de Búsqueda

martin ignacio matamala vasquez

Full Professor

DEPARTAMENTO DE INGENIERIA MATEMATICA, FACULTAD DE CIENCIAS FÍSICAS Y MATEMATICAS, UNIVERSIDAD DE CHILE

santiago, Chile

Graph Theory, Theoretical Computer Science

ciencias de la ingenieria, UNIVERSIDAD DE CHILE. Chile, 1994
Engineering Sciences, UNIVERSIDAD DE CHILE. Chile, 1994

Full professor Full Time

UNIVERSIDAD DE CHILE

Physical and Mathematical Campus

Santiago, Chile

1995 - A la fecha

Full professor Full Time

Universidad de Chile

Chile

2011 - A la fecha

Ph.D Students

Natacha Astromujoff 2010-2014 (U. Chile).
Thesis: Edge coloring of subgraphs with constraints.

Flavio Guiñez 2005-2009 (U. Chile), currently scientist U. Chile (CMM)
Thesis: Disjoint realization of degree sequences and some applications to Discrete Tomography.

José Zamora 2005-2008
(U. Chile), currently associate professor U. Andrés Bello.
Thesis: Graph Labelings: flow and edge induced colorings.

Eduardo Moreno 2001-2005
(Joint U. Chile - U. Marne-la-Vallé, co-advised with D. Perrin), currently full professor U. Adolfo Ibañez
Thesis: Sequences and de Bruijn's graphs in restricted languages.

Master Students

Julio Maldonado 2019 – 2020 Master in Applied Math, U. Chile
Pigmented graph colorings.

Felipe Contreras 2016 Master in Applied Math, U. Chile.
Convex partitions in a family of graphs built by replacements.

Gonzalo Muñoz Mathematical Engineering title, U. Chile.
Integer Lineal optimization models and its application to Mining.

Gonzalo Sanchez 2009, Mathematical Engineering title, U. Chile.
Scheduling of works for a Chilean Winery company.

José Zamora 2004, Mathematical Engineering title, U. Chile.
Thesis: Clique interations and its applications.

Eduardo Moreno 2001, Mathematical Engineering title, U. Chile.
Thesis: Cyclic Automata networks in a grid.

Best paper European Symposium on Algorithms

European Association for Theoretical Computer Science

Dinamarca, 2009

Award for the best paper at ESA. 258 submission, 68 accepted papers.


Lines in bipartite graphs and in 2‐metric spaces Matamala, Martín; Zamora, José Article Journal of Graph Theory (2020)
Graphs admitting antimagic labeling for arbitrary sets of positive numbers Matamala M.; Zamora J. Article SCOPUS Discrete Applied Mathematics (2019)
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture Aboulker, P.; Matamala, M.; Rochet, P.; Zamora, J. Article SCOPUS Journal of Graph Theory (2017)
Weighted antimagic labeling Matamala, Martín; Zamora, José Article SCOPUS Discrete Applied Mathematics (2017)
Convex p-partitions of bipartite graphs Grippo, LN; Matamala M.; Safe MD; Stein, MJ Article ISI SCOPUS THEORETICAL COMPUTER SCIENCE (2016)
A quantitative approach to perfect one-factorizations of complete bipartite graphs Astromujoff, N; Matamala M. Article ISI The Electronic Journal of Combinatorics (2015)
Allowing each node to communicate only once in a distributed system: shared whiteboard models Becker, F; Kosowski A.; Matamala M.; Nisse, N; Rapaport, I; Suchan, K; Todinca, I Article ISI SCOPUS Distributed Computing (2015)
Injective Colorings with Arithmetic Constraints Astromujoff, N; Chapelle, M; Matamala M.; Todinca, I; Zamora J. Article ISI SCOPUS Graphs and Combinatorics (2015)
Nowhere-Zero 5-Flows and Even (1,2)-Factors Matamala M.; Zamora J. Article ISI SCOPUS Graphs and Combinatorics (2013)
RECONSTRUCTING 3-COLORED GRIDS FROM HORIZONTAL AND VERTICAL PROJECTIONS IS NP-HARD: A SOLUTION TO THE 2-ATOM PROBLEM IN DISCRETE TOMOGRAPHY Durr, C.; Guínez, F.; Matamala M. Article ISI SCOPUS SIAM Journal on Discrete Mathematics (2012)
NAVIGATING IN A GRAPH BY AID OF ITS SPANNING TREE METRIC Dragan, FF; Matamala M. Article ISI SCOPUS SIAM Journal on Discrete Mathematics (2011)
Realizing disjoint degree sequences of span at most two A tractable discrete tomography problem Guínez, F.; Matamala M.; Thomassé S. Article ISI SCOPUS DISCRETE APPLIED MATHEMATICS (2011)
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method Cortés CE.; Matamala M.; Contardo C Article ISI SCOPUS European Journal of Operational Research (2010)
Degree Sequence of Tight Distance Graphs Matamala M.; Zamora J. Article SCOPUS Electronic Notes in Discrete Mathematics (2009)
Minimum Eulerian circuits and minimum de Bruijn sequences Matamala M.; Moreno E. Article ISI SCOPUS DISCRETE MATHEMATICS (2009)
A new family of expansive graphs Matamala M.; Zamora J. Article ISI SCOPUS DISCRETE APPLIED MATHEMATICS (2008)
Nowhere-zero 5-flows and (1, 2)-factors Matamala M.; Zamora J. Article SCOPUS Electronic Notes in Discrete Mathematics (2008)
Some remarks about factors of graphs Correa JR; Matamalal, M Article ISI SCOPUS JOURNAL OF GRAPH THEORY (2008)
Vertex partitions and maximum degenerate subgraphs Matamala M. Article ISI SCOPUS JOURNAL OF GRAPH THEORY (2007)
Minimal Eulerian circuit in a labeled digraph Moreno E.; Matamala M. Article ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2006)
AT-free graphs: linear bounds for the oriented diameter Fomin FV; Matamala M.; Prisner, E; Rapaport, I Article ISI DISCRETE APPLIED MATHEMATICS (2004)
Complexity of approximating the oriented diameter of chordal graphs Fomin FV; Matamala M.; Rapaport, I Article ISI SCOPUS JOURNAL OF GRAPH THEORY (2004)
Domino tilings and related models: space of configurations of domains with holes Desreux, S; Matamala M.; Rapaport, I; Rémila E. Article ISI THEORETICAL COMPUTER SCIENCE (2004)
Dynamic of cyclic automata over Z(2) Matamala M.; Moreno E. Article ISI SCOPUS THEORETICAL COMPUTER SCIENCE (2004)
Minimal de Bruijn sequence in a language with forbidden substrings Moreno E.; Matamala M. Article ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2004)
Constructibility of speed one signal on cellular automata Matamala M. Article ISI SCOPUS DISCRETE MATHEMATICS (2003)
k-pseudosnakes in large grids Matamala M.; Prisner, E; Rapaport, I Article ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2002)
The complexity of approximating the oriented diameter of chordal graphs - (Extended abstract) Fomin FV; Matamala M.; Rapaport, I Article ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2002)
Some remarks on cycles in graphs and digraphs Loebl M.; Matamala M. Article ISI SCOPUS DISCRETE MATHEMATICS (2001)
Bilateral orientations and domination Fomin F.V.; Matamala M.; Rapaport, I; Prisner, E Article SCOPUS Electronic Notes in Discrete Mathematics (2000)


Solving the induced subgraph problem in the randomized multiparty simultaneous messages model Kari, J; Matamala M.; Rapaport, I; Salo, V ConferencePaper SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015)
Adding a referee to an interconnection network: What can(not) be computed in one round Becker, F; Matamala M.; Nisse, N; Rapaport, I; Suchan, K; Todinca, I ConferencePaper SCOPUS Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011 (2011)
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs Correa JR; Fernandes CG; Matamala M.; Wakabayashi, Y ConferencePaper ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2008)
Small alliances in graphs Carvajal R.; Matamala M.; Rapaport, I; Schabanel, N ConferencePaper ISI EDUCATING FOR A NEW FUTURE: MAKING SENSE OF TECHNOLOGY-ENHANCED LEARNING ADOPTION, EC-TEL 2022 (2007)