Francisco J. Soulignac

Juan José Miranda Bront

Eur. J. Oper. Res., February, 2024

Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone.

[BibT_eX]

[DOI]

Marcos Blufstein

INFORMS J. Comput., 2024

2023

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

[BibT_eX]

[DOI]

Santiago Cifuentes

Inf. Process. Lett., August, 2023

2022

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

[BibT_eX]

[DOI]

Juan José Miranda Bront

INFORMS J. Comput., 2022

Loop unrolling of UCA models: distance labeling.

[BibT_eX]

[DOI]

CoRR, 2022

2021

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Total 2-domination of proper interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

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

[BibT_eX]

[DOI]

Juan José Miranda Bront

Networks, 2020

2019

The eternal dominating set problem for interval graphs.

[BibT_eX]

[DOI]

Martín Rinemberg

Inf. Process. Lett., 2019

2017

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

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

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

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

2016

Integrality of minimal unit circular-arc models.

[BibT_eX]

[DOI]

CoRR, 2016

2015

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Disimplicial arcs, transitive vertices, and disimplicial eliminations.

[BibT_eX]

[DOI]

Martiniano Eguía

Discret. Math. Theor. Comput. Sci., 2015

Fully Dynamic Recognition of Proper Circular-Arc Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Star and Biclique Coloring and Choosability.

[BibT_eX]

[DOI]

Marina Groshaus

J. Graph Algorithms Appl., 2014

Minimal and short representations of unit interval and unit circular-arc graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration.

[BibT_eX]

[DOI]

Martiniano Eguía

Discret. Math. Theor. Comput. Sci., 2013

Isomorphism of graph classes related to the circular-ones property.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Discret. Math. Theor. Comput. Sci., 2013

Normal Helly circular-arc graphs and its subclasses.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Arboricity, h-index, and dynamic algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The star and biclique coloring and choosability problems

[BibT_eX]

[DOI]

Marina Groshaus

CoRR, 2012

2011

Powers of cycles, powers of paths, and distance graphs.

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Appl. Math., 2011

Subclasses of Normal Helly Circular-Arc Graphs

[BibT_eX]

[DOI]

CoRR, 2011

2010

The clique operator on circular-arc graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

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

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Gabriel Sueiro

Math. Methods Oper. Res., 2009

Short Models for Unit Interval Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

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

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Durán

Gabriel Sueiro

Discret. Appl. Math., 2009

NP-hardness of the recognition of coordinated graphs.

[BibT_eX]

[DOI]

Gabriel Sueiro

Ann. Oper. Res., 2009

2008

On cliques of Helly Circular-arc Graphs.

[BibT_eX]

[DOI]

Ross M. McConnell

Electron. Notes Discret. Math., 2008

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

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

2007

Proper Helly Circular-Arc Graphs.

[BibT_eX]

[DOI]