Pôle de recherche et d'enseignement supérieur Université Paris-Est

output

20062026

most citedPerceptual Adversarial Networks for Image-to-Image Transformation

396 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

10 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★ 4 cited

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Laurent Bulteau, Guillaume Fertin, Anthony Labarre +2

Let $S = {K_{1, 3}, K_{3}, P_{4}}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subs…

cs.DS2015

Pattern matching in $(213, 231)$ -avoiding permutations

Both Emerite Neou, Romeo Rizzi, Stéphane Vialette

Given permutations $σ \in S_{k}$ and $π \in S_{n}$ with $k < n$ , the \emph{pattern matching} problem is to decide whether $π$ matches $σ$ as an order-isomorphic subsequence. We give a line…

cs.DS2015★ 1 cited

Hyper Temporal Networks

Carlo Comin, Roberto Posenato, Romeo Rizzi

Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this pap…

cs.DS2015★ 34 cited

Locating a Tree in a Phylogenetic Network in Quadratic Time

Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre +2

A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-t…

cs.DS2013

A Note on the Longest Common Compatible Prefix Problem for Partial Words

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6

For a partial word $w$ the longest common compatible prefix of two positions $i, j$ , denoted $l cc p (i, j)$ , is the largest $k$ such that $w [i, i + k - 1] ↑ w [j, j + k - 1]$ , where $\uparr…

cs.DS2012

A Note on Efficient Computation of All Abelian Periods in a String

Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka +6

We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in…

cs.DS2011

On-line construction of position heaps

Gregory Kucherov

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the…

cs.DS2011★ 9 cited

Linear pattern matching on sparse suffix trees

Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya

Packing several characters into one computer word is a simple and natural way to compress the representation of a string and to speed up its processing. Exploiting this idea, we pr…