Martín Matamala

According to our database1, Martín Matamala authored at least 58 papers between 1994 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Lines in bipartite graphs and in 2-metric spaces.
J. Graph Theory, 2020

Graphs admitting antimagic labeling for arbitrary sets of positive numbers.
Discret. Appl. Math., 2020

Graphs with no induced house nor induced hole have the de Bruijn-Erdős property.
CoRR, 2020

A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture.
J. Graph Theory, 2018

Weighted antimagic labeling.
Discret. Appl. Math., 2018

Graphs admitting antimagic labeling for arbitrary sets of positive integers.
Electron. Notes Discret. Math., 2017

Convex p-partitions of bipartite graphs.
Theor. Comput. Sci., 2016

Injective Colorings with Arithmetic Constraints.
Graphs Comb., 2015

Weighted antimagic labeling: an algorithmic approach.
Electron. Notes Discret. Math., 2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Comput., 2015

A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs.
Electron. J. Comb., 2015

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model.
Proceedings of the Structural Information and Communication Complexity, 2015

Nowhere-Zero 5-Flows and Even (1, 2)-Factors.
Graphs Comb., 2013

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., 2012

Navigating in a Graph by Aid of Its Spanning Tree Metric.
SIAM J. Discret. Math., 2011

Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem.
Discret. Appl. Math., 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method.
Eur. J. Oper. Res., 2010

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
Discret. Appl. Math., 2010

Degree Sequence of Tight Distance Graphs.
Electron. Notes Discret. Math., 2009

Minimum Eulerian circuits and minimum de Bruijn sequences.
Discret. Math., 2009

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.
Proceedings of the Algorithms, 2009

Some remarks about factors of graphs.
J. Graph Theory, 2008

Nowhere-zero 5-flows and (1, 2)-factors.
Electron. Notes Discret. Math., 2008

Electron. Notes Discret. Math., 2008

A new family of expansive graphs.
Discret. Appl. Math., 2008

Navigating in a Graph by Aid of Its Spanning Tree.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Vertex partitions and maximum degenerate subgraphs.
J. Graph Theory, 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Small Alliances in Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.
Discret. Appl. Math., 2006

Minimal Eulerian Circuit in a Labeled Digraph.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

A new family of K-divergent graphs.
Electron. Notes Discret. Math., 2005

Minimal Eulerian trail in a labeled digraph
CoRR, 2005

Dynamic of cyclic automata over Z<sup>2</sup> .
Theor. Comput. Sci., 2004

Domino tilings and related models: space of configurations of domains with holes.
Theor. Comput. Sci., 2004

Complexity of approximating the oriented diameter of chordal graphs.
J. Graph Theory, 2004

Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004.
Electron. Notes Discret. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.
Discret. Appl. Math., 2004

Minimal de Bruijn Sequence in a Language with Forbidden Substrings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Constructibility of speed one signal on cellular automata.
Discret. Math., 2003

k-pseudosnakes in Large Grids.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Bilateral Orientations and Domination.
Electron. Notes Discret. Math., 2001

Some remarks on cycles in graphs and digraphs.
Discret. Math., 2001

Dynamical Properties of Min-Max Networks.
Int. J. Neural Syst., 2000

No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory.
Complex Syst., 2000

Cyclic Evolution of Neuronal Automata with Memory When All the Weighting Coefficients are Strictly Positive.
Complex Syst., 2000

On the computational structure of the connected components of a hard problem.
Inf. Process. Lett., 1999

Alternation on Cellular Automata.
Theor. Comput. Sci., 1997

Reaction-Diffusion Automata: Three States Implies Universality.
Theory Comput. Syst., 1997

Complexity and Dimension.
Inf. Process. Lett., 1997

Dynamic Behavior of Cyclic Automata Networks.
Discret. Appl. Math., 1997

Symmetric Discrete Universal Neural Networks.
Theor. Comput. Sci., 1996

On Digital Nondeterminism.
Math. Syst. Theory, 1996

Recursive Construction of Periodic Steady State for Neural Networks.
Theor. Comput. Sci., 1995

Cyclic Automata Networks on Finite Graphs.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Dynamical and Complexity Results for High Order Neural Networks.
Int. J. Neural Syst., 1994

On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994