output
19952026
most citedLand Cover Classification via Multi-temporal Spatial Data by Recurrent Neural Networks

291 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 2017 · cs.DMShow all

6 papers · 2 filters

cs.DM2017★ 1 cited

Out-colourings of Digraphs

Noga Alon, Joergen Bang-Jensen, Stéphane Bessy

We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an {\bf out-colouring}. The problem of deciding whether a given digra…

cs.DM2017

On some interesting ternary formulas

Pascal Ochem, Matthieu Rosenfeld

We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula (…

cs.DM2017

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

François Dross, Mickael Montassier, Alexandre Pinlou

We prove that every triangle-free planar graph of order and size has an induced linear forest with at least vertices, and thus at least $\frac{5n + 8}{…

cs.DM2017

The Geodetic Hull Number is Hard for Chordal Graphs

Stéphane Bessy, Mitre C. Dourado, Lucia D. Penso +1

We show the hardness of the geodetic hull number for chordal graphs.

cs.DM2017

2-subcoloring is NP-complete for planar comparability graphs

Pascal Ochem

A -subcoloring of a graph is a partition of the vertex set into at most cluster graphs, that is, graphs with no induced . 2-subcoloring is known to be NP-complete for c…

cs.DM2017

On repetition thresholds of caterpillars and trees of bounded degree

Borut Lužar, Pascal Ochem, Alexandre Pinlou

The repetition threshold is the smallest real number such that there exists an infinite word over a -letter alphabet that avoids repetition of exponent strictly greater than…