Francisco J. Soulignac

From MaRDI portal
Person:418736

Available identifiers

zbMath Open soulignac.francisco-juanMaRDI QIDQ418736

List of research outcomes





PublicationDate of PublicationType
Decremental state-space relaxations for the basic traveling salesman problem with a drone2024-09-05Paper
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows2023-11-23Paper
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows2023-11-15Paper
Complexity of solving a system of difference constraints with variables restricted to a finite set2023-06-05Paper
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows2023-01-11Paper
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs2021-10-06Paper
Total 2-domination of proper interval graphs2021-08-02Paper
The eternal dominating set problem for interval graphs2019-04-26Paper
Total 2-domination of proper interval graphs2018-12-03Paper
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms2017-05-16Paper
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory2017-05-16Paper
https://portal.mardi4nfdi.de/entity/Q34550342015-12-03Paper
A faster algorithm for the cluster editing problem on proper interval graphs2015-09-15Paper
Fully dynamic recognition of proper circular-arc graphs2015-06-25Paper
The Star and Biclique Coloring and Choosability Problems2014-07-30Paper
https://portal.mardi4nfdi.de/entity/Q57473802014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57473712014-02-14Paper
Short models for unit interval graphs2013-07-19Paper
Normal Helly circular-arc graphs and its subclasses2013-04-25Paper
Arboricity, \(h\)-index, and dynamic algorithms2012-05-30Paper
Powers of cycles, powers of paths, and distance graphs2011-04-19Paper
The clique operator on circular-arc graphs2010-08-13Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2010-04-28Paper
Exponential families of minimally non-coordinated graphs2009-11-18Paper
NP-hardness of the recognition of coordinated graphs2009-09-03Paper
Partial characterizations of coordinated graphs: Line graphs and complements of forests2009-04-27Paper
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs2008-07-15Paper
Proper Helly Circular-Arc Graphs2008-07-01Paper
On cliques of Helly Circular-arc Graphs2008-06-05Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2008-06-05Paper

Research outcomes over time

This page was built for person: Francisco J. Soulignac