-
Professional Trajectories of Workers Using Disconnected Self-Organizing Maps
International audience -
Professional trajectories of workers using disconnected self-organizing maps
International audience -
On strong edge-colouring of subcubic graphs
International audience -
On packing, colouring and identification problems
In this thesis we study three theoretical computer science problems, namely the orthogonal packing problem (OPP for short), strong edge-colouring and identifying... -
Locally identifying coloring in bounded expansion classes of graphs
International audience -
A linear kernel for planar red-blue dominating set
International audience -
Strong edge-colouring and induced matchings
International audience -
Chordal embeddings of planar graphs
Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved this conjecture in... -
Circular Choosability
In this paper, we study the notion of circular choosability recently introduced by Mohar and Zhu. First, we provide a negative answer to a question of Zhu about... -
Strong chromatic index of planar graphs with large girth
International audience -
NP-Completeness Results for Minimum Planar Spanners
International audience -
Connectivity Labeling Scheme for Graphs on Surface
International audience -
Random Sampling of Large Planar Maps and Convex Polyhedra
Colloque avec actes et comité de lecture. -
On edge-intersection graphs of k-bend paths in grids
International audience -
Lower Bounds on the Area Requirements of Series-Parallel Graphs
Graphs and Algorithms
