output
20072025
most citedDeep Ordinal Regression Network for Monocular Depth Estimation

172 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.DSShow all

5 papers · 1 filter

cs.DS2018

Algorithmic and algebraic aspects of unshuffling permutations

Samuele Giraudo, Stéphane Vialette

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuf…

cs.DS2018★ 2 cited

The Clever Shopper Problem

Laurent Bulteau, Danny Hermelin, Anthony Labarre +1

We investigate a variant of the so-called "Internet Shopping Problem" introduced by Blazewicz et al. (2010), where a customer wants to buy a list of products at the lowest possible…

cs.DS2016

A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals

Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay

For an undirected edge-weighted graph and a set of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from disconn…

cs.DS2016★ 4 cited

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Laurent Bulteau, Guillaume Fertin, Anthony Labarre +2

Let be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph into graphs taken from any non-empty $S'\subs…

cs.DS2015

Pattern matching in -avoiding permutations

Both Emerite Neou, Romeo Rizzi, Stéphane Vialette

Given permutations and with , the \emph{pattern matching} problem is to decide whether matches as an order-isomorphic subsequence. We give a line…