University of Clermont Auvergne

output

20142026

Z

Topological Insulator

280 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing cs.DMShow all

8 papers · 1 filter

cs.DM2025★ 3 cited

Distance-based (and path-based) covering problems for graphs of given cyclomatic number

Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen

We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to…

cs.DM2024★ 9 cited

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs

Florent Foucaud, Clara Marcille, Zin Mar Myint +3

A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M \subseteq V (G)$ such that given any edge $e$ of $G$ , $e$ lies on every shortest $u$ - $v$ p…

cs.DM2023

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs

Sandip Das, Florent Foucaud, Sk Samim Islam +1

For a graph $G = (V, E)$ with a vertex set $V$ and an edge set $E$ , a function $f : V \to {0, 1, 2, ..., d iam (G)}$ is called a \emph{broadcast} on $G$ . For e…

cs.DM2023

List homomorphisms to separable signed graphs

Jan Bok, Richard Brewster, Tomás Feder +2

The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…

cs.DM2023

Contact graphs of boxes with unidirectional contacts

Daniel Gonçalves, Vincent Limouzy, Pascal Ochem

This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these gr…

cs.DM2022★ 5 cited

On graphs coverable by k shortest paths

Maël Dumas, Florent Foucaud, Anthony Perez +1

We show that if the edges or vertices of an undirected graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is upper-bounded by a single-exponential function o…

cs.DM2022

Neighbour sum distinguishing edge-weightings with local constraints

Antoine Dailly, ElÅ1/4bieta Sidorowicz

A $k$ -edge-weighting of $G$ is a mapping $ω : E (G) ⟶ {1, \dots, k}$ . The edge-weighting of $G$ naturally induces a vertex-colouring $σ_{ω} : V (G) ⟶ N$ …

cs.DM2017★ 4 cited

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…