| Publication | Date of Publication | Type |
|---|
Decremental state-space relaxations for the basic traveling salesman problem with a drone
INFORMS Journal on Computing | 2024-09-05 | Paper |
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
Networks | 2023-11-23 | Paper |
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
European Journal of Operational Research | 2023-11-15 | Paper |
Complexity of solving a system of difference constraints with variables restricted to a finite set
Information Processing Letters | 2023-06-05 | Paper |
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing | 2023-01-11 | Paper |
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
Theoretical Computer Science | 2021-10-06 | Paper |
Total 2-domination of proper interval graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
The eternal dominating set problem for interval graphs
Information Processing Letters | 2019-04-26 | Paper |
Total 2-domination of proper interval graphs
(available as arXiv preprint) | 2018-12-03 | Paper |
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
Disimplicial arcs, transitive vertices, and disimplicial eliminations
(available as arXiv preprint) | 2015-12-03 | Paper |
| Disimplicial arcs, transitive vertices, and disimplicial eliminations | 2015-12-03 | Paper |
A faster algorithm for the cluster editing problem on proper interval graphs
Information Processing Letters | 2015-09-15 | Paper |
Fully dynamic recognition of proper circular-arc graphs
Algorithmica | 2015-06-25 | Paper |
Fully dynamic recognition of proper circular-arc graphs
Algorithmica | 2015-06-25 | Paper |
The Star and Biclique Coloring and Choosability Problems
Journal of Graph Algorithms and Applications | 2014-07-30 | Paper |
Isomorphism of graph classes related to the circular-ones property
(available as arXiv preprint) | 2014-02-14 | Paper |
| Isomorphism of graph classes related to the circular-ones property | 2014-02-14 | Paper |
| Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration | 2014-02-14 | Paper |
Short models for unit interval graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics | 2013-04-25 | Paper |
Arboricity, \(h\)-index, and dynamic algorithms
Theoretical Computer Science | 2012-05-30 | Paper |
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
The clique operator on circular-arc graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
| Exponential families of minimally non-coordinated graphs | 2009-11-18 | Paper |
NP-hardness of the recognition of coordinated graphs
Annals of Operations Research | 2009-09-03 | Paper |
Partial characterizations of coordinated graphs: Line graphs and complements of forests
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Proper Helly Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
On cliques of Helly Circular-arc Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
