37 citations · 89 across the 11 of their papers we have counts for
7 papers · 1 filter
Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
Francisco J. Soulignac
We propose a simple and exact method for the Traveling Salesman Problem with Time Windows and Makespan objective (\TSPTW-M) that solves all instances of the classical benchmark wit…
Loop unrolling of UCA models: distance labeling
Francisco J Soulignac, Pablo Terlisky
A proper circular-arc (PCA) model is a pair where is a circle and is a family of inclusion-free arcs on whose extremes are pairwise different. The model $M…
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
Francisco J. Soulignac
We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The…
Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell +4
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithm…
Fully dynamic recognition of proper circular-arc graphs
Francisco J. Soulignac
We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (tog…
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
Martiniano Eguía, Francisco J. Soulignac
A biclique is a set of vertices that induce a bipartite complete graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every indu…
Arboricity, h-Index, and Dynamic Algorithms
Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210--223…