Martín Matamala

73 papers A 2B 10C 2Journal 59

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