6 citations · 7 across the 4 of their papers we have counts for
4 papers
Algorithms for the Maximum Eulerian Cycle Decomposition Problem
Pedro O. Pinheiro, Alexsandro Oliveira Alexandrino, Andre R. Oliveira +2
Given an Eulerian graph G, in the Maximum Eulerian Cycle Decomposition problem, we are interested in finding a collection of edge-disjoint cycles {E_1, E_2, ..., E_k} in G such tha…
Solving the Minimum Convex Partition of Point Sets with Integer Programming
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related t…
Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number
Breno Piva, Cid C. de Souza
This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinea…
Acyclic orientations with path constraints
Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan +1
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diamet…