default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartín Matamala
Person information
- affiliation: University of Chile, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Gabriela Araujo-Pardo, Martín Matamala, J. Zamora:
A de Bruijn and Erdös property in quasi-metric spaces with four points. LAGOS 2023: 308-315- [c13]Gabriela Araujo-Pardo, Martín Matamala, José Zamora:
Counting lines in semi-complete digraphs *. LAGOS 2023: 352-359 - [i7]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 abs/2308.00170 (2023) - [i6]Mariana Escalante, Martín Matamala, Iván Rapaport, Paola B. Tolomei, Luis Miguel Torres:
The Minimum Clique Routing Problem on Cycles. CoRR abs/2311.10055 (2023) - 2022
- [j47]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): 638-652 (2022) - 2021
- [j46]Gabriela Araujo-Pardo, Martín Matamala:
Chen and Chvátal's conjecture in tournaments. Eur. J. Comb. 97: 103374 (2021) - 2020
- [j45]Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive numbers. Discret. Appl. Math. 281: 246-251 (2020) - [j44]Martín Matamala, José Zamora:
Lines in bipartite graphs and in 2-metric spaces. J. Graph Theory 95(4): 565-585 (2020) - [i5]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 abs/2005.09447 (2020)
2010 – 2019
- 2018
- [j43]Martín Matamala, José Zamora:
Weighted antimagic labeling. Discret. Appl. Math. 245: 194-201 (2018) - [j42]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): 77-88 (2018) - 2017
- [j41]Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive integers. Electron. Notes Discret. Math. 62: 159-164 (2017) - 2016
- [j40]Luciano N. Grippo, Martín Matamala, Martín Darío Safe, Maya J. Stein:
Convex p-partitions of bipartite graphs. Theor. Comput. Sci. 609: 511-514 (2016) - [i4]Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A new class of graphs that satisfies the Chen-Chvátal Conjecture. CoRR abs/1606.06011 (2016) - 2015
- [j39]Natacha Astromujoff, Martín Matamala:
A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j38]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): 189-200 (2015) - [j37]Martín Matamala, José Zamora:
Weighted antimagic labeling: an algorithmic approach. Electron. Notes Discret. Math. 50: 127-132 (2015) - [j36]Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora:
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31(6): 2003-2017 (2015) - [c12]Jarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo:
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO 2015: 370-384 - 2013
- [j35]Martín Matamala, José Zamora:
Nowhere-Zero 5-Flows and Even (1, 2)-Factors. Graphs Comb. 29(3): 609-616 (2013) - 2012
- [j34]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): 330-352 (2012) - 2011
- [j33]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): 23-30 (2011) - [j32]Feodor F. Dragan, Martín Matamala:
Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discret. Math. 25(1): 306-332 (2011) - [c11]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: 508-514 - 2010
- [j31]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): 1213-1215 (2010) - [j30]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): 711-724 (2010) - [i3]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 abs/1009.4447 (2010)
2000 – 2009
- 2009
- [j29]Martín Matamala, Eduardo Moreno:
Minimum Eulerian circuits and minimum de Bruijn sequences. Discret. Math. 309(17): 5298-5304 (2009) - [j28]Martín Matamala, José Zamora:
Degree Sequence of Tight Distance Graphs. Electron. Notes Discret. Math. 35: 329-334 (2009) - [c10]Christoph Dürr, Flavio Guiñez, Martín Matamala:
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. ESA 2009: 776-787 - [i2]Christoph Dürr, Flavio Guiñez, Martín Matamala:
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard. CoRR abs/0904.3169 (2009) - 2008
- [j27]Martín Matamala, José Zamora:
A new family of expansive graphs. Discret. Appl. Math. 156(7): 1125-1131 (2008) - [j26]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala:
Preface. Electron. Notes Discret. Math. 30: 1-2 (2008) - [j25]Martín Matamala, José Zamora:
Nowhere-zero 5-flows and (1, 2)-factors. Electron. Notes Discret. Math. 30: 279-284 (2008) - [j24]José R. Correa, Martín Matamala:
Some remarks about factors of graphs. J. Graph Theory 57(4): 265-274 (2008) - [c9]Feodor F. Dragan, Martín Matamala:
Navigating in a Graph by Aid of Its Spanning Tree. ISAAC 2008: 788-799 - 2007
- [j23]Martín Matamala:
Vertex partitions and maximum degenerate subgraphs. J. Graph Theory 55(3): 227-232 (2007) - [c8]Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel:
Small Alliances in Graphs. MFCS 2007: 218-227 - [c7]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: 184-192 - 2006
- [j22]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): 1771-1772 (2006) - [c6]Eduardo Moreno, Martín Matamala:
Minimal Eulerian Circuit in a Labeled Digraph. LATIN 2006: 737-744 - 2005
- [j21]Martín Matamala, José Zamora:
A new family of K-divergent graphs. Electron. Notes Discret. Math. 19: 357-363 (2005) - [i1]Martín Matamala, Eduardo Moreno:
Minimal Eulerian trail in a labeled digraph. CoRR abs/cs/0505036 (2005) - 2004
- [j20]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): 135-148 (2004) - [j19]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: 1-4 (2004) - [j18]Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4): 255-269 (2004) - [j17]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): 83-101 (2004) - [j16]Martín Matamala, Eduardo Moreno:
Dynamic of cyclic automata over Z2 . Theor. Comput. Sci. 322(2): 369-381 (2004) - [c5]Eduardo Moreno, Martín Matamala:
Minimal de Bruijn Sequence in a Language with Forbidden Substrings. WG 2004: 168-176 - 2003
- [j15]Martín Matamala:
Constructibility of speed one signal on cellular automata. Discret. Math. 262(1-3): 195-209 (2003) - 2002
- [c4]Martín Matamala, Erich Prisner, Ivan Rapaport:
k-pseudosnakes in Large Grids. LATIN 2002: 224-235 - [c3]Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222 - 2001
- [j14]Martin Loebl, Martín Matamala:
Some remarks on cycles in graphs and digraphs. Discret. Math. 233(1-3): 175-182 (2001) - [j13]Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7: 26-29 (2001) - 2000
- [j12]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) - [j11]René Ndoundam, Martín Matamala:
No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory. Complex Syst. 12(4) (2000) - [j10]Eric Goles Ch., Martín Matamala, Pablo A. Estévez:
Dynamical Properties of Min-Max Networks. Int. J. Neural Syst. 10(6): 467-473 (2000)
1990 – 1999
- 1999
- [j9]Martín Matamala, Klaus Meer:
On the computational structure of the connected components of a hard problem. Inf. Process. Lett. 72(3-4): 83-90 (1999) - 1997
- [j8]Martín Matamala, Eric Goles Ch.:
Dynamic Behavior of Cyclic Automata Networks. Discret. Appl. Math. 77(2): 161-184 (1997) - [j7]Felipe Cucker, Pascal Koiran, Martín Matamala:
Complexity and Dimension. Inf. Process. Lett. 62(4): 209-212 (1997) - [j6]Eric Goles Ch., Martín Matamala:
Reaction-Diffusion Automata: Three States Implies Universality. Theory Comput. Syst. 30(3): 223-229 (1997) - [j5]Martín Matamala:
Alternation on Cellular Automata. Theor. Comput. Sci. 180(1-2): 229-241 (1997) - 1996
- [j4]Felipe Cucker, Martín Matamala:
On Digital Nondeterminism. Math. Syst. Theory 29(6): 635-647 (1996) - [j3]Eric Goles Ch., Martín Matamala:
Symmetric Discrete Universal Neural Networks. Theor. Comput. Sci. 168(2): 405-416 (1996) - 1995
- [j2]Martín Matamala:
Recursive Construction of Periodic Steady State for Neural Networks. Theor. Comput. Sci. 143(2): 251-267 (1995) - [c2]Martín Matamala, Eric Goles Ch.:
Cyclic Automata Networks on Finite Graphs. LATIN 1995: 398-410 - 1994
- [j1]Eric Goles Ch., Martín Matamala:
Dynamical and Complexity Results for High Order Neural Networks. Int. J. Neural Syst. 5(3): 241-252 (1994) - [c1]Michel Cosnard, Martín Matamala:
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS 1994: 27-37
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
