The following pages link to Christophe Picouleau (Q411243):
Displaying 8 items.
- On the use of graphs in discrete tomography (Q5900257) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)
- Reconstruction of domino tiling from its two orthogonal projections (Q5941081) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q6350295) (← links)
- On the complexity of Dominating Set for graphs with fixed diameter (Q6433639) (← links)
- The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs (Q6437641) (← links)
- The complexity of the perfect matching-cut problem (Q6667583) (← links)
- Connected (3,2)-bipartite graphs are antimagic (Q6741289) (← links)