Smallest C2/+1-Critical Graphs of Odd-Girth 2k +1 Laurent Beaudou, Florent Foucaud, and Reza Naserasr

von Beaudou, Laurent
Veröffentlicht in CALDAM (6. : 2020 : Hyderabad, Telangana) Algorithms and discrete applied mathematics (2020)

Monitoring the Edges of a Graph Using Distances

von Foucaud, Florent
Veröffentlicht in CALDAM (6. : 2020 : Hyderabad, Telangana) Algorithms and discrete applied mathematics (2020)

On the Complexity of BROADCAST DOMINATION and MULTIPACKING in Digraphs

von Foucaud, Florent
Veröffentlicht in IWOCA (31. : 2020 : Online) Combinatorial algorithms (2020)

The RED-BLUE SEPARATION Problem on Graphs

von Dev, Subhadeep Ranjan
Veröffentlicht in IWOCA (33. : 2022 : Trier) Combinatorial algorithms (2022)

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes

von Chakraborty, Dibyayan
Veröffentlicht in CALDAM (6. : 2020 : Hyderabad, Telangana) Algorithms and discrete applied mathematics (2020)

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity

von Foucaud, Florent
Veröffentlicht in International Conference on Algorithms and Discrete Applied Mathematics (10. : 2024 : Bhilainagar) Algorithms and discrete applied mathematics (2024)