4 citations · 11 across the 13 of their papers we have counts for
13 papers
The Interplay Between Domination and Separation in Graphs
Dipayan Chakraborty, Annegret K. Wagler
In the literature, several identification problems in graphs have been studied, of which, the most widely studied are the ones based on dominating sets as a tool of identification.…
On lower bounds for cardinalities of several separating-dominating codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
In the literature, several different identification problems in graphs have been studied, the most widely studied such problems are the ones based on dominating sets as a tool of i…
On full-separating sets and related codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
A domination-based identification problem on a graph is one where the objective is to choose a subset of the vertex set of such that has both, a domination property…
On open-separating dominating codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
Using dominating sets to separate vertices of graphs is a well-studied problem in the larger domain of identification problems. In such problems, the objective is to choose a suita…
Location-Domination Type Problems Under the Mycielski Construction
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini +1
We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating se…
Progress towards the two-thirds conjecture on locating-total dominating sets
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen +2
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set of vertices of a graph is a locating-total dominating set if every vertex of $G…
On three domination-based identification problems in block graphs
Dipayan Chakraborty, Florent Foucaud, Aline Parreau +1
The problems of determining the minimum-sized \emph{identifying}, \emph{locating-dominating} and \emph{open locating-dominating codes} of an input graph are special search problems…
Fleet management for autonomous vehicles: Online PDP under special constraints
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
The VIPAFLEET project consists in developing models and algorithms for man- aging a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distr…
Fleet management for autonomous vehicles
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
The VIPAFLEET project consists in developing models and algorithms for man- aging a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distr…
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem
Sahar Bsaybes, Sven O. Krumke, Alain Quilliot +2
In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a sa…
Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler +1
In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a sa…
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation
Victor Campos, Ricardo C. Corrêa, Diego Delle Donne +2
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of vi…
Characterizing N+-perfect line graphs
M. Escalante, G. Nasini, A. Wagler
The subject of this contribution is the study of the Lovász-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly inte…