CIFUENTES, SANTIAGO; SOULIGNAC, FRANCISCO J.; TERLISKY, PABLO

Complexity of solving a system of difference constraints with variables restricted to a finite set

INFORMATION PROCESSING LETTERS; Año: 2023

GONZALO LERA-ROMERO; JUAN JOSÉ MIRANDA-BRONT; FRANCISCO J. SOULIGNAC

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows

INFORMS JOURNAL ON COMPUTING (ONLINE); Año: 2022

SOULIGNAC, FRANCISCO J.

Total 2-domination of proper interval graphs

DISCRETE APPLIED MATHEMATICS; Año: 2021 vol. 302 p. 256 - 262

SOULIGNAC, FRANCISCO J.

A certifying and dynamic algorithm for the recognition of proper circular-arc graphs

THEORETICAL COMPUTER SCIENCE; Año: 2021 vol. 889 p. 105 - 134

LERA-ROMERO, GONZALO; MIRANDA BRONT, JUAN J.; SOULIGNAC, FRANCISCO J.

Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows

NETWORKS; Año: 2020 vol. 76 p. 24 - 53

RINEMBERG, MARTÍN; SOULIGNAC, FRANCISCO J.

The eternal dominating set problem for interval graphs

INFORMATION PROCESSING LETTERS; Año: 2019 vol. 146 p. 27 - 29

SOULIGNAC, FRANCISCO J.

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

Journal of Graph Algorithms and Applications; Año: 2017 vol. 21 p. 455 - 489

SOULIGNAC, FRANCISCO J.

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

Journal of Graph Algorithms and Applications; Año: 2017 vol. 21 p. 491 - 525

FRANCISCO J. SOULIGNAC

Fully dynamic recognition of proper circular-arc graphs

ALGORITHMICA; Lugar: Berlin; Año: 2015 vol. 71 p. 904 - 968

MARTINIANO EGUÍA; FRANCISCO J. SOULIGNAC

Disimplicial arcs, transitive vertices, and disimplicial eliminations

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (DMTCS); Lugar: Nancy; Año: 2015 vol. 17 p. 101 - 118

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

A faster algorithm for the cluster editing problem on proper interval graphs

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2015 vol. 115 p. 913 - 916

CELINA M. H. DE FIGUEIREDO; MARINA GROSHAUS; FÁBIO PROTTI; FRANCISCO J. SOULIGNAC

5th Latin-American Workshop on Cliques in Graphs

MATEMáTICA CONTEMPORâNEA; Lugar: Rio de Janeiro; Año: 2014 vol. 42 p. 1 - 142

MARINA GROSHAUS; FRANCISCO J. SOULIGNAC; PABLO TERLISKY

The Star and Biclique Coloring and Choosability Problems

Journal of graph algorithms and applications; Año: 2014 vol. 18 p. 347 - 383

MARTINIANO EGUÍA; FRANCISCO J. SOULIGNAC

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (DMTCS); Lugar: Nancy; Año: 2013 vol. 15 p. 55 - 74

ANDREW R. CURTIS; MIN CHIH LIN; ROSS M. MCCONNELL; YAHAV NUSSBAUM; FRANCISCO J. SOULIGNAC; JEREMY P. SPINRAD; JAYME L. SZWARCFITER

Isomorphism of graph classes related to the circular-ones property

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (DMTCS); Lugar: Nancy; Año: 2013 vol. 15 p. 157 - 182

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Normal Helly circular-arc graphs and its subclasses

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2013 vol. 161 p. 1037 - 1059

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Arboricity, h-Index, and Dynamic Algorithms

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2012 vol. 426 p. 75 - 90

MIN CHIH LIN; DIETER RAUTENBACH; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Powers of cycles, powers of paths, and distance graphs

DISCRETE APPLIED MATHEMATICS; Año: 2011 vol. 159 p. 621 - 627

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

The clique operator on circular-arc graphs

DISCRETE APPLIED MATHEMATICS; Año: 2010 vol. 158 p. 1259 - 1267

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Short models for unit interval graphs

Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2009 vol. 35 p. 247 - 255

FLAVIA BONOMO; GUILLERMO DURÁN; FRANCISCO SOULIGNAC; GABRIEL SUEIRO

Partial characterizations of coordinated graphs: line graphs and complements of forests

MATHEMATICAL METHODS OF OPERATIONS RESEARCH (HEIDELBERG); Año: 2009 vol. 69 p. 251 - 270

FRANCISCO J. SOULIGNAC; GABRIEL SUEIRO

NP-hardness of the recognition of coordinated graphs

ANNALS OF OPERATIONS RESEARCH; Año: 2009 vol. 169 p. 17 - 34

FLAVIA BONOMO; GUILLERMO DURÁN; FRANCISCO SOULIGNAC; GABRIEL SUEIRO

Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs

DISCRETE APPLIED MATHEMATICS; Año: 2009 vol. 157 p. 3511 - 3518

FRANCISCO SOULIGNAC; GABRIEL SUEIRO

Exponential families of minimally non-coordinated graphs

REVISTA DE LA UNIóN MATEMáTICA ARGENTINA; Año: 2009 vol. 50 p. 75 - 85

FLAVIA BONOMO; GUILLERMO DURÁN; FRANCISCO J. SOULIGNAC; GABRIEL SUEIRO

Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs

Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2008 vol. 30 p. 51 - 56

MIN CHIH LIN; ROSS M. MCCONNELL; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

On cliques of Helly circular-arc graphs

Electronic Notes in Discrete Mathematics; Lugar: Amsterdam; Año: 2008 vol. 30 p. 117 - 122

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs

LECTURE NOTES IN COMPUTER SCIENCE; Lugar: Berlin; Año: 2008 vol. 5124 p. 355 - 366

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Proper Helly Circular-Arc Graphs

LECTURE NOTES IN COMPUTER SCIENCE; Lugar: Berlin; Año: 2007 vol. 4769 p. 248 - 257