Proper Helly Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (WG, 2007)

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (SWAT, 2008)

On cliques of Helly Circular-arc Graphs. - Min Chih Lin; Ross M. McConnell; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2008)

NP-hardness of the recognition of coordinated graphs. - Francisco J. Soulignac; Gabriel Sueiro (Ann. Oper. Res., 2009)

Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. - Flavia Bonomo; Guillermo Durán; Francisco J. Soulignac; Gabriel Sueiro (Discret. Appl. Math., 2009)

Short Models for Unit Interval Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2009)

Partial characterizations of coordinated graphs: line graphs and complements of forests. - Flavia Bonomo; Guillermo Durán; Francisco J. Soulignac; Gabriel Sueiro (Math. Methods Oper. Res., 2009)

The clique operator on circular-arc graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

Subclasses of Normal Helly Circular-Arc Graphs - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (CoRR, 2011)

Powers of cycles, powers of paths, and distance graphs. - Min Chih Lin; Dieter Rautenbach; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2011)

The star and biclique coloring and choosability problems - Marina Groshaus; Francisco J. Soulignac; Pablo Terlisky (CoRR, 2012)

Arboricity, h-index, and dynamic algorithms. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

Normal Helly circular-arc graphs and its subclasses. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2013)

Isomorphism of graph classes related to the circular-ones property. - Andrew R. Curtis; Min Chih Lin; Ross M. McConnell; Yahav Nussbaum; Francisco J. Soulignac; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2013)

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. - Martiniano Eguía; Francisco J. Soulignac (Discret. Math. Theor. Comput. Sci., 2013)

Minimal and short representations of unit interval and unit circular-arc graphs. - Francisco J. Soulignac (CoRR, 2014)

Star and Biclique Coloring and Choosability. - Marina Groshaus; Francisco J. Soulignac; Pablo Terlisky (J. Graph Algorithms Appl., 2014)

Fully Dynamic Recognition of Proper Circular-Arc Graphs. - Francisco J. Soulignac (Algorithmica, 2015)

Disimplicial arcs, transitive vertices, and disimplicial eliminations. - Martiniano Eguía; Francisco J. Soulignac (Discret. Math. Theor. Comput. Sci., 2015)

A faster algorithm for the cluster editing problem on proper interval graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2015)

Integrality of minimal unit circular-arc models. - Francisco J. Soulignac; Pablo Terlisky (CoRR, 2016)

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory. - Francisco J. Soulignac (J. Graph Algorithms Appl., 2017)

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms. - Francisco J. Soulignac (J. Graph Algorithms Appl., 2017)

The eternal dominating set problem for interval graphs. - Martín Rinemberg; Francisco J. Soulignac (Inf. Process. Lett., 2019)

Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (Networks, 2020)

Total 2-domination of proper interval graphs. - Francisco J. Soulignac (Discret. Appl. Math., 2021)

A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. - Francisco J. Soulignac (Theor. Comput. Sci., 2021)

Loop unrolling of UCA models: distance labeling. - Francisco J. Soulignac; Pablo Terlisky (CoRR, 2022)

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (INFORMS J. Comput., 2022)

Complexity of solving a system of difference constraints with variables restricted to a finite set. - Santiago Cifuentes; Francisco J. Soulignac; Pablo Terlisky (Inf. Process. Lett., 2023)

Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone. - Marcos Blufstein; Gonzalo Lera-Romero; Francisco J. Soulignac (INFORMS J. Comput., 2024)

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (Eur. J. Oper. Res., 2024)