Martín  Matamala
Martín Matamala
Verified email at - Homepage
Cited by
Cited by
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
CE Cortés, M Matamala, C Contardo
European Journal of Operational Research 200 (3), 711-724, 2010
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: a solution to the 2-atom problem in discrete tomography
C Dürr, F Guinez, M Matamala
SIAM Journal on Discrete Mathematics 26 (1), 330-352, 2012
On digital nondeterminism
F Cucker, M Matamala
Mathematical Systems Theory 29 (6), 635-647, 1996
Adding a referee to an interconnection network: What can (not) be computed in one round
F Becker, M Matamala, N Nisse, I Rapaport, K Suchan, I Todinca
2011 IEEE International Parallel & Distributed Processing Symposium, 508-514, 2011
AT-free graphs: linear bounds for the oriented diameter
FV Fomin, M Matamala, E Prisner, I Rapaport
Discrete applied mathematics 141 (1-3), 135-148, 2004
Complexity of approximating the oriented diameter of chordal graphs
FV Fomin, M Matamala, I Rapaport
Journal of Graph Theory 45 (4), 255-269, 2004
Allowing each node to communicate only once in a distributed system: shared whiteboard models
F Becker, A Kosowski, N Nisse, I Rapaport, K Suchan
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
Some remarks about factors of graphs
JR Correa, M Matamala
Journal of Graph Theory 57 (4), 265-274, 2008
Small alliances in graphs
R Carvajal, M Matamala, I Rapaport, N Schabanel
Mathematical Foundations of Computer Science 2007: 32nd International …, 2007
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model
J Kari, M Matamala, I Rapaport, V Salo
Structural Information and Communication Complexity: 22nd International …, 2015
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
F Guiñez, M Matamala, S Thomassé
Discrete Applied Mathematics 159 (1), 23-30, 2011
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
JR Correa, CG Fernandes, M Matamala, Y Wakabayashi
Approximation and Online Algorithms: 5th International Workshop, WAOA 2007 …, 2008
A new class of graphs that satisfies the Chen‐Chvátal conjecture
P Aboulker, M Matamala, P Rochet, J Zamora
Journal of Graph Theory 87 (1), 77-88, 2018
Universal computation by finite two-dimensional coupled map lattices
P Orponen, M Matamala
PhysComp96: Proceedings of the 4th Workshop on Physics and Computation, 1996
Recursive construction of periodic steady state for neural networks
M Matamala
Theoretical computer science 143 (2), 251-267, 1995
Convex p-partitions of bipartite graphs
LN Grippo, M Matamala, MD Safe, MJ Stein
Theoretical Computer Science 609, 511-514, 2016
No polynomial bound for the period of neuronal automata with inhibitory memory
R Ndoundam, M Matamala
Complex Systems 12 (4), 391-398, 2000
Cyclic evolution of neuronal automata with memory when all the weighting coefficients are strictly positive
R Ndoundam, M Matamala
Complex systems 12 (4), 379-390, 2000
Complexity and dimension
F Cucker, P Koiran, M Matamala
Information Processing Letters 62 (4), 209-212, 1997
Alternation on cellular automata
M Matamala
Theoretical Computer Science 180 (1-2), 229-241, 1997
The system can't perform the operation now. Try again later.
Articles 1–20