Search Results - "Soulignac, Francisco J"

Total 2-domination of proper interval graphs by Soulignac, Francisco J.

“…A set of vertices W of a graph G is a total k-dominating set when every vertex of G has at least k neighbors in W. In a recent article, Chiarelli et al. (2019)…”
Get full text

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows by Lera-Romero, Gonzalo, Miranda Bront, Juan José, Soulignac, Francisco J.

“…•The TDEVRPTW incorporates the time dependency in the travel times and in the battery discharge of the electric vehicles.•We propose a general framework that…”
Get full text

Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows by Lera‐Romero, Gonzalo, Miranda Bront, Juan J., Soulignac, Francisco J.

“…In this paper we implement a branch‐price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the…”
Get full text

Arboricity, h-index, and dynamic algorithms by Lin, Min Chih, Soulignac, Francisco J., Szwarcfiter, Jayme L.

“…We propose a new data structure for manipulating graphs, called h-graph, which is particularly suited for designing dynamic algorithms. The structure itself is…”
Get full text

Normal Helly circular-arc graphs and its subclasses by Lin, Min Chih, Soulignac, Francisco J., Szwarcfiter, Jayme L.

“…A Helly circular-arc model M=(C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, then M is a proper Helly…”
Get full text

A faster algorithm for the cluster editing problem on proper interval graphs by Lin, Min Chih, Soulignac, Francisco J., Szwarcfiter, Jayme L.

“…•O(n+m) time algorithm to solve cluster editing problem for proper interval graphs.•A variation of Mannaa's dynamic programming algorithm with O(n)…”
Get full text

The clique operator on circular-arc graphs by Lin, Min Chih, Soulignac, Francisco J., Szwarcfiter, Jayme L.

“…A circular-arc graph G is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G . Say that the model is…”
Get full text

NP-hardness of the recognition of coordinated graphs by Soulignac, Francisco J., Sueiro, Gabriel

“…A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection…”
Get full text

Disimplicial arcs, transitive vertices, and disimplicial eliminations by Eguia, Martiniano, Soulignac, Francisco

“…In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their…”
Get full text

A certifying and dynamic algorithm for the recognition of proper circular-arc graphs by Soulignac, Francisco J.

“…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…”
Get full text

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration by Eguia, Martiniano, Soulignac, Francisco Juan

“…Graphs and Algorithms A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques…”
Get full text

Complexity of solving a system of difference constraints with variables restricted to a finite set by Cifuentes, Santiago, Soulignac, Francisco J., Terlisky, Pablo

“…Fishburn developed an algorithm to solve a system of m difference constraints whose n unknowns must take values from a set with k real numbers (Fishburn, 2002…”
Get full text

The eternal dominating set problem for interval graphs by Rinemberg, Martín, Soulignac, Francisco J.

“…•The eternal domination and clique-connected cover numbers coincide for interval graphs.•The previous proof of this fact for proper interval graphs is greatly…”
Get full text

Fully Dynamic Recognition of Proper Circular-Arc Graphs by Soulignac, Francisco J.

“…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…”
Get full text

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory by Soulignac, Francisco

“…This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and…”
Get full text

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms by Soulignac, Francisco

“…This is the second and last chapter of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and…”
Get full text

The Star and Biclique Coloring and Choosability Problems by Groshaus, Marina, Soulignac, Francisco J., Terlisky, Pablo

Get full text

Loop unrolling of UCA models: distance labeling by Soulignac, Francisco J, Terlisky, Pablo

“…A proper circular-arc (PCA) model is a pair $M = (C, A)$ where $C$ is a circle and $A$ is a family of inclusion-free arcs on $C$ whose extremes are pairwise…”
Get full text

Complexity of solving a system of difference constraints with variables restricted to a finite set by Cifuentes, Santiago, Soulignac, Francisco J, Terlisky, Pablo

“…Fishburn developed an algorithm to solve a system of $m$ difference constraints whose $n$ unknowns must take values from a set with $k$ real numbers [Solving a…”
Get full text

Total 2-domination of proper interval graphs by Soulignac, Francisco J

“…A set of vertices $W$ of a graph $G$ is a total $k$-dominating set when every vertex of $G$ has at least $k$ neighbors in $W$. In a recent article, Chiarelli…”
Get full text