• Publications
  • Influence
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
TLDR
In this paper, a strict formulation of a generalization of the classical pickup and delivery problem formulation is presented, which adds the extra flexibility of providing the option for passengers to transfer at specific locations. Expand
  • 173
  • 17
  • PDF
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
TLDR
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. Expand
  • 38
  • 6
Vertex partitions and maximum degenerate subgraphs
Let G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G hasExpand
  • 3
  • 3
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
TLDR
We consider the problem of coloring a grid using $k$ colors with the restriction that each row and each column has a specific number of cells of each color. Expand
  • 27
  • 2
  • PDF
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round
TLDR
In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. Expand
  • 24
  • 2
  • PDF
Alternation on Cellular Automata
  • M. Matamala
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 10 June 1997
TLDR
In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. Expand
  • 8
  • 2
  • PDF
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
TLDR
We improve on Lorys and Zwozniak's result presenting a 5/3-approximation for this problem on cubic graphs. Expand
  • 11
  • 2
  • PDF
Bilateral Orientations and Domination
TLDR
We consider the problem of finding the minimum diameter among all strong orientations of a given connected, bridgeless, undirected graph for different classes of AT-free graphs. Expand
  • 2
  • 2
Allowing each node to communicate only once in a distributed system: shared whiteboard models
TLDR
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Expand
  • 16
  • 1
  • PDF
On digital nondeterminism
  • 16
  • 1
...
1
2
3
4
5
...