Martín Matamala

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A de Bruijn and Erdös property in quasi-metric spaces with four points.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

J. Zamora

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Graphs with no induced house nor induced hole have the de Bruijn-Erdös property.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

2021

Chen and Chvátal's conjecture in tournaments.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

Eur. J. Comb., 2021

2020

Lines in bipartite graphs and in 2-metric spaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Graphs admitting antimagic labeling for arbitrary sets of positive numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Weighted antimagic labeling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Graphs admitting antimagic labeling for arbitrary sets of positive integers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Convex p-partitions of bipartite graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Injective Colorings with Arithmetic Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Weighted antimagic labeling: an algorithmic approach.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

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

[BibT_eX]

[DOI]

Distributed Comput., 2015

A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Natacha Astromujoff

Electron. J. Comb., 2015

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

2013

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

[BibT_eX]

[DOI]

Graphs Comb., 2013

2012

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography.

[BibT_eX]

[DOI]

Christoph Dürr

Flavio Guiñez

SIAM J. Discret. Math., 2012

2011

Navigating in a Graph by Aid of Its Spanning Tree Metric.

[BibT_eX]

[DOI]

Feodor F. Dragan

SIAM J. Discret. Math., 2011

Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem.

[BibT_eX]

[DOI]

Flavio Guiñez

Stéphan Thomassé

Discret. Appl. Math., 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method.

[BibT_eX]

[DOI]

Cristián E. Cortés

Claudio Contardo

Eur. J. Oper. Res., 2010

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

[BibT_eX]

[DOI]

Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2010

2009

Degree Sequence of Tight Distance Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Minimum Eulerian circuits and minimum de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2009

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.

[BibT_eX]

[DOI]

Christoph Dürr

Flavio Guiñez

Proceedings of the Algorithms, 2009

2008

Some remarks about factors of graphs.

[BibT_eX]

[DOI]

José R. Correa

J. Graph Theory, 2008

Nowhere-zero 5-flows and (1, 2)-factors.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Preface.

[BibT_eX]

[DOI]

Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2008

A new family of expansive graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Navigating in a Graph by Aid of Its Spanning Tree.

[BibT_eX]

[DOI]

Feodor F. Dragan

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Vertex partitions and maximum degenerate subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.

[BibT_eX]

[DOI]

José R. Correa

Cristina G. Fernandes

Yoshiko Wakabayashi

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Small Alliances in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Minimal Eulerian Circuit in a Labeled Digraph.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

A new family of K-divergent graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Minimal Eulerian trail in a labeled digraph

[BibT_eX]

[DOI]

CoRR, 2005

2004

Dynamic of cyclic automata over Z<sup>2</sup> .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Domino tilings and related models: space of configurations of domains with holes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Complexity of approximating the oriented diameter of chordal graphs.

[BibT_eX]

[DOI]

Fedor V. Fomin

Ivan Rapaport

J. Graph Theory, 2004

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Minimal de Bruijn Sequence in a Language with Forbidden Substrings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Constructibility of speed one signal on cellular automata.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

k-pseudosnakes in Large Grids.

[BibT_eX]

[DOI]

Erich Prisner

Ivan Rapaport

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Bilateral Orientations and Domination.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Some remarks on cycles in graphs and digraphs.

[BibT_eX]

[DOI]

Martin Loebl

Discret. Math., 2001

2000

Dynamical Properties of Min-Max Networks.

[BibT_eX]

[DOI]

Pablo A. Estévez

Int. J. Neural Syst., 2000

No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory.

[BibT_eX]

[DOI]

René Ndoundam

Complex Syst., 2000

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

[BibT_eX]

[DOI]

René Ndoundam

Complex Syst., 2000

1999

On the computational structure of the connected components of a hard problem.

[BibT_eX]

[DOI]

Klaus Meer

Inf. Process. Lett., 1999

1997

Alternation on Cellular Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Reaction-Diffusion Automata: Three States Implies Universality.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

Complexity and Dimension.

[BibT_eX]

[DOI]

Felipe Cucker

Pascal Koiran

Inf. Process. Lett., 1997

Dynamic Behavior of Cyclic Automata Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Symmetric Discrete Universal Neural Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On Digital Nondeterminism.

[BibT_eX]

[DOI]

Felipe Cucker

Math. Syst. Theory, 1996

1995

Recursive Construction of Periodic Steady State for Neural Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Cyclic Automata Networks on Finite Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Dynamical and Complexity Results for High Order Neural Networks.

[BibT_eX]

[DOI]

Int. J. Neural Syst., 1994

On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC.

[BibT_eX]

[DOI]

Michel Cosnard