Martín Matamala

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 19

Top Topics

Maximum Matching

Bipartite Graph

Mutual Reinforcement

Top Venues

J. Graph Theory

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Mariana Escalante, Martín Matamala, Iván Rapaport, Paola B. Tolomei, Luis Miguel Torres
The Minimum Clique Routing Problem on Cycles. CoRR (2023)
Gabriela Araujo-Pardo, Martín Matamala, José Zamora
Counting lines in semi-complete digraphs *. LAGOS (2023)
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora
Boundedness for proper conflict-free and odd colorings. CoRR (2023)
Gabriela Araujo-Pardo, Martín Matamala, J. Zamora
A de Bruijn and Erdös property in quasi-metric spaces with four points. LAGOS (2023)
Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. J. Graph Theory 100 (4) (2022)
Gabriela Araujo-Pardo, Martín Matamala
Chen and Chvátal's conjecture in tournaments. Eur. J. Comb. 97 (2021)
Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property. CoRR (2020)
Martín Matamala, José Zamora
Graphs admitting antimagic labeling for arbitrary sets of positive numbers. Discret. Appl. Math. 281 (2020)
Martín Matamala, José Zamora
Lines in bipartite graphs and in 2-metric spaces. J. Graph Theory 95 (4) (2020)
Martín Matamala, José Zamora
Weighted antimagic labeling. Discret. Appl. Math. 245 (2018)
Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. J. Graph Theory 87 (1) (2018)
Martín Matamala, José Zamora
Graphs admitting antimagic labeling for arbitrary sets of positive integers. Electron. Notes Discret. Math. 62 (2017)
Luciano N. Grippo, Martín Matamala, Martín Darío Safe, Maya J. Stein
Convex p-partitions of bipartite graphs. Theor. Comput. Sci. 609 (2016)
Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora
A new class of graphs that satisfies the Chen-Chvátal Conjecture. CoRR (2016)
Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31 (6) (2015)
Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28 (3) (2015)
Natacha Astromujoff, Martín Matamala
A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs. Electron. J. Comb. 22 (1) (2015)
Jarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO (2015)
Martín Matamala, José Zamora
Weighted antimagic labeling: an algorithmic approach. Electron. Notes Discret. Math. 50 (2015)
Martín Matamala, José Zamora
Nowhere-Zero 5-Flows and Even (1, 2)-Factors. Graphs Comb. 29 (3) (2013)
Christoph Dürr, Flavio Guiñez, Martín Matamala
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography. SIAM J. Discret. Math. 26 (1) (2012)
Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discret. Math. 25 (1) (2011)
Flavio Guiñez, Martín Matamala, Stéphan Thomassé
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Discret. Appl. Math. 159 (1) (2011)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS (2011)
Cristián E. Cortés, Martín Matamala, Claudio Contardo
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200 (3) (2010)
Guillermo Durán, Thomas M. Liebling, Martín Matamala, Jayme Luiz Szwarcfiter
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. Discret. Appl. Math. 158 (12) (2010)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round CoRR (2010)
Martín Matamala, Eduardo Moreno
Minimum Eulerian circuits and minimum de Bruijn sequences. Discret. Math. 309 (17) (2009)
Martín Matamala, José Zamora
Degree Sequence of Tight Distance Graphs. Electron. Notes Discret. Math. 35 (2009)
Christoph Dürr, Flavio Guiñez, Martín Matamala
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard CoRR (2009)
Christoph Dürr, Flavio Guiñez, Martín Matamala
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. ESA (2009)
Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala
Preface. Electron. Notes Discret. Math. 30 (2008)
José R. Correa, Martín Matamala
Some remarks about factors of graphs. J. Graph Theory 57 (4) (2008)
Martín Matamala, José Zamora
A new family of expansive graphs. Discret. Appl. Math. 156 (7) (2008)
Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree. ISAAC (2008)
Martín Matamala, José Zamora
Nowhere-zero 5-flows and (1, 2)-factors. Electron. Notes Discret. Math. 30 (2008)
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
Small Alliances in Graphs. MFCS (2007)
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)
Martín Matamala
Vertex partitions and maximum degenerate subgraphs. J. Graph Theory 55 (3) (2007)
Eduardo Moreno, Martín Matamala
Minimal Eulerian Circuit in a Labeled Digraph. LATIN (2006)
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. Discret. Appl. Math. 154 (13) (2006)
Martín Matamala, Eduardo Moreno
Minimal Eulerian trail in a labeled digraph CoRR (2005)
Martín Matamala, José Zamora
A new family of K-divergent graphs. Electron. Notes Discret. Math. 19 (2005)
Thomas M. Liebling, Guillermo Durán, Martín Matamala
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004. Electron. Notes Discret. Math. 18 (2004)
Eduardo Moreno, Martín Matamala
Minimal de Bruijn Sequence in a Language with Forbidden Substrings. WG (2004)
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45 (4) (2004)
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141 (1-3) (2004)
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) (2004)
Martín Matamala, Eduardo Moreno
. Theor. Comput. Sci. 322 (2) (2004)
Martín Matamala
Constructibility of speed one signal on cellular automata. Discret. Math. 262 (1-3) (2003)
Martín Matamala, Erich Prisner, Ivan Rapaport
k-pseudosnakes in Large Grids. LATIN (2002)
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG (2002)
Martin Loebl, Martín Matamala
Some remarks on cycles in graphs and digraphs. Discret. Math. 233 (1-3) (2001)
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7 (2001)
René Ndoundam, Martín Matamala
No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory. Complex Syst. 12 (4) (2000)
René Ndoundam, Martín Matamala
Cyclic Evolution of Neuronal Automata with Memory When All the Weighting Coefficients are Strictly Positive. Complex Syst. 12 (4) (2000)
Eric Goles Ch., Martín Matamala, Pablo A. Estévez
Dynamical Properties of Min-Max Networks. Int. J. Neural Syst. 10 (6) (2000)
Martín Matamala, Klaus Meer
On the computational structure of the connected components of a hard problem. Inf. Process. Lett. 72 (3-4) (1999)
Eric Goles Ch., Martín Matamala
Reaction-Diffusion Automata: Three States Implies Universality. Theory Comput. Syst. 30 (3) (1997)
Martín Matamala
Alternation on Cellular Automata. Theor. Comput. Sci. 180 (1-2) (1997)
Martín Matamala, Eric Goles Ch.
Dynamic Behavior of Cyclic Automata Networks. Discret. Appl. Math. 77 (2) (1997)
Felipe Cucker, Pascal Koiran, Martín Matamala
Complexity and Dimension. Inf. Process. Lett. 62 (4) (1997)
Felipe Cucker, Martín Matamala
On Digital Nondeterminism. Math. Syst. Theory 29 (6) (1996)
Eric Goles Ch., Martín Matamala
Symmetric Discrete Universal Neural Networks. Theor. Comput. Sci. 168 (2) (1996)
Martín Matamala
Recursive Construction of Periodic Steady State for Neural Networks. Theor. Comput. Sci. 143 (2) (1995)
Martín Matamala, Eric Goles Ch.
Cyclic Automata Networks on Finite Graphs. LATIN (1995)
Michel Cosnard, Martín Matamala
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS (1994)
Eric Goles Ch., Martín Matamala
Dynamical and Complexity Results for High Order Neural Networks. Int. J. Neural Syst. 5 (3) (1994)