| 2023 | LAGOS | A de Bruijn and Erds property in quasi-metric spaces with four points. | Gabriela Araujo-Pardo, Martn Matamala, Jos Zamora |
| 2023 | LAGOS | Counting lines in semi-complete digraphs *. | Gabriela Araujo-Pardo, Martn Matamala, Jos Zamora |
| 2015 | SIROCCO | Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. | Jarkko Kari, Martn Matamala, Ivan Rapaport, Ville Salo |
| 2009 | ESA | Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. | Christoph Drr, Flavio Guiez, Martn Matamala |
| 2008 | ISAAC | Navigating in a Graph by Aid of Its Spanning Tree. | Feodor F. Dragan, Martn Matamala |
| 2007 | MFCS | Small Alliances in Graphs. | Rodolfo Carvajal, Martn Matamala, Ivan Rapaport, Nicolas Schabanel |
| 2007 | WAOA | A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. | Jos R. Correa, Cristina G. Fernandes, Martn Matamala, Yoshiko Wakabayashi |
| 2006 | LATIN | Minimal Eulerian Circuit in a Labeled Digraph. | Eduardo Moreno, Martn Matamala |
| 2004 | WG | Minimal de Bruijn Sequence in a Language with Forbidden Substrings. | Eduardo Moreno, Martn Matamala |
| 2002 | LATIN | k-pseudosnakes in Large Grids. | Martn Matamala, Erich Prisner, Ivan Rapaport |
| 2002 | WG | The Complexity of Approximating the Oriented Diameter of Chordal Graphs. | Fedor V. Fomin, Martn Matamala, Ivan Rapaport |
| 1995 | LATIN | Cyclic Automata Networks on Finite Graphs. | Martn Matamala, Eric Goles Ch. |
| 1994 | MFCS | On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. | Michel Cosnard, Martn Matamala |