Man

martin ignacio matamala vasquez

Full Professor

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

santiago, Chile

Líneas de Investigación


Graph Theory, Theoretical Computer Science

Educación

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

Experiencia Académica

  •   Full professor Full Time

    UNIVERSIDAD DE CHILE

    Physical and Mathematical Campus

    Santiago, Chile

    1995 - A la fecha

Experiencia Profesional

  •   Full professor Full Time

    Universidad de Chile

    Chile

    2011 - A la fecha

Formación de Capital Humano


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.


Premios y Distinciones

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


 

Article (30)

Lines in bipartite graphs and in 2‐metric spaces
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture
Weighted antimagic labeling
Convex p-partitions of bipartite graphs
A quantitative approach to perfect one-factorizations of complete bipartite graphs
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Injective Colorings with Arithmetic Constraints
Nowhere-Zero 5-Flows and Even (1,2)-Factors
RECONSTRUCTING 3-COLORED GRIDS FROM HORIZONTAL AND VERTICAL PROJECTIONS IS NP-HARD: A SOLUTION TO THE 2-ATOM PROBLEM IN DISCRETE TOMOGRAPHY
NAVIGATING IN A GRAPH BY AID OF ITS SPANNING TREE METRIC
Realizing disjoint degree sequences of span at most two A tractable discrete tomography problem
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
Degree Sequence of Tight Distance Graphs
Minimum Eulerian circuits and minimum de Bruijn sequences
A new family of expansive graphs
Nowhere-zero 5-flows and (1, 2)-factors
Some remarks about factors of graphs
Vertex partitions and maximum degenerate subgraphs
Minimal Eulerian circuit in a labeled digraph
AT-free graphs: linear bounds for the oriented diameter
Complexity of approximating the oriented diameter of chordal graphs
Domino tilings and related models: space of configurations of domains with holes
Dynamic of cyclic automata over Z(2)
Minimal de Bruijn sequence in a language with forbidden substrings
Constructibility of speed one signal on cellular automata
k-pseudosnakes in large grids
The complexity of approximating the oriented diameter of chordal graphs - (Extended abstract)
Some remarks on cycles in graphs and digraphs
Bilateral orientations and domination

ConferencePaper (4)

Solving the induced subgraph problem in the randomized multiparty simultaneous messages model
Adding a referee to an interconnection network: What can(not) be computed in one round
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
Small alliances in graphs
34
martin matamala

Full Professor

Mathematical engineering

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

santiago, Chile

10
Ivan Rapaport

Associate Professor

Mathematical Engineering

Universidad de Chile

Santiago, Chile

6
Eduardo Moreno

Full Professor

Faculty of Engineering and Sciences

Universidad Adolfo Ibañez

Peñalolen, Chile

4
Flavio Guiñez

Scientist

Mathematical Engeeniering

Universidad de Chile

Santiago, Chile

2
Jose Correa

Full Professor

Industrial Engineering

Universidad de Chile

Santiago, Chile

2
Karol Suchan

Profesor Asociado

Facultad de Ingeniería y Ciencias

Universidad Diego Portales

Santiago, Chile

1
Maya Stein

Full Professor

Department of Mathematical Engineering

Universidad de Chile

Santiago, Chile

1
Cristián Cortés

ASSOCIATE PROFESSOR

CIVIL ENGINEERING

UNIVERSIDAD DE CHILE

Santiago, Chile