Stéphane Vialette

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 35

Top Venues

Paris Diderot University, France (PHD)

Education History

Paris Diderot University, France

PHD

Publications

Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS (2024)
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
Parity Permutation Pattern Matching. Algorithmica 86 (8) (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
Generalizing Roberts' characterization of unit interval graphs. CoRR (2024)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing unit multiple intervals is hard. CoRR (2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Recognizing Unit Multiple Intervals Is Hard. ISAAC (2023)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Quasi-kernels in split graphs. CoRR (2023)
Romeo Rizzi, Stéphane Vialette
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956 (2023)
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
Parity Permutation Pattern Matching. WALCOM (2023)
Laurent Bulteau, Vincent Jugé, Stéphane Vialette
On shuffled-square-free words. Theor. Comput. Sci. 941 (2023)
Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM (2022)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic Aspects of Small Quasi-Kernels. WG (2022)
Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
The Maximum Zero-Sum Partition Problem. ICS (2022)
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. 124 (2021)
Laurent Bulteau, Samuele Giraudo, Stéphane Vialette
Disorders and Permutations. CPM (2021)
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic aspects of quasi-kernels. CoRR (2021)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting with forbidden intermediates. Discret. Appl. Math. 279 (2020)
Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. Theory Comput. Syst. 64 (1) (2020)
Laurent Bulteau, Stéphane Vialette
Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. 806 (2020)
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
Finding a Small Number of Colourful Components. CPM (2019)
Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC (2019)
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience (2019)
Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. CoRR (2018)
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
Finding a Small Number of Colourful Components. CoRR (2018)
Guillaume Fertin, Irena Rusu, Stéphane Vialette
The S-labeling problem: An algorithmic tour. Discret. Appl. Math. 246 (2018)
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246 (2018)
Samuele Giraudo, Stéphane Vialette
Algorithmic and algebraic aspects of unshuffling permutations. CoRR (2018)
Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
Pattern Matching for k-Track Permutations. IWOCA (2018)
Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. CSR (2018)
Samuele Giraudo, Stéphane Vialette
Algorithmic and algebraic aspects of unshuffling permutations. Theor. Comput. Sci. 729 (2018)
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Pattern Matching for Separable Permutations. SPIRE (2016)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting With Forbidden Intermediates. CoRR (2016)
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting with Forbidden Intermediates. AlCoB (2016)
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. 18 (2) (2016)
Samuele Giraudo, Stéphane Vialette
Unshuffling Permutations. CoRR (2016)
Samuele Giraudo, Stéphane Vialette
Unshuffling Permutations. LATIN (2016)
Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115 (1) (2015)
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA (2015)
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB (2015)
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Pattern matching in $(213, 231)$-avoiding permutations. CoRR (2015)
Guillaume Fertin, Irena Rusu, Stéphane Vialette
Algorithmic Aspects of the S-Labeling Problem. IWOCA (2015)
Guillaume Fertin, Irena Rusu, Stéphane Vialette
Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC (2015)
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
Locating a Tree in a Phylogenetic Network in Quadratic Time. CoRR (2015)
Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette
Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM (2014)
Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, Alain Denise
Flexible RNA design under structure and sequence constraints using formal languages. BCB (2013)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483 (2013)
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
Single and Multiple Consecutive Permutation Motif Search. ISAAC (2013)
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
On the combinatorics of suffix arrays. Inf. Process. Lett. 113 (22-24) (2013)
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. 24 (1) (2013)
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
Single and multiple consecutive permutation motif search CoRR (2013)
Romeo Rizzi, Stéphane Vialette
On Recognizing Words That Are Squares for the Shuffle Product. CSR (2013)
Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC (2012)
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM (2012)
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51 (3) (2012)
Guillaume Blin, Minghui Jiang, Stéphane Vialette
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE (2012)
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
On the combinatorics of suffix arrays CoRR (2012)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Finding Approximate and Constrained Motifs in Graphs. CPM (2011)
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9 (4) (2011)
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR (2011)
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. CATS (2011)
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA (2011)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9 (1) (2011)
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77 (4) (2011)
Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. 411 (4-5) (2010)
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (4) (2010)
Guillaume Blin, Florian Sikora, Stéphane Vialette
GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB (2010)
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE (2010)
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411 (26-28) (2010)
Guillaume Blin, Sylvie Hamel, Stéphane Vialette
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. WALCOM (2010)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. 13 (1) (2009)
Sylvain Guillemot, Stéphane Vialette
Pattern Matching for 321-Avoiding Permutations. ISAAC (2009)
Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette
On Finding Small 2-Generating Sets. COCOON (2009)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Maximum Motif Problem in Vertex-Colored Graphs. CPM (2009)
Guillaume Fertin, Stéphane Vialette
On the S-Labeling problem. Electron. Notes Discret. Math. 34 (2009)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410 (1) (2009)
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Protein-Protein Interaction Networks. ISBRA (2009)
Craig E. Nelson, Stéphane Vialette
RECOMB-Comparative Genomics Special Issue. J. Comput. Biol. 16 (10) (2009)
Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette
Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG (2009)
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7 (1) (2009)
Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM (2009)
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6 (4) (2008)
Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395 (2-3) (2008)
Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. J. Discrete Algorithms 6 (2) (2008)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
On the Approximability of Comparing Genomes with Duplicates CoRR (2008)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. 15 (8) (2008)
Guillaume Blin, Sylvie Hamel, Stéphane Vialette
Comparing RNA structures using a full set of biologically relevant edit operations is intractable CoRR (2008)
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
The Minimum Substring Cover problem. Inf. Comput. 206 (11) (2008)
Philippe Gambette, Stéphane Vialette
On Restrictions of Balanced 2-Interval Graphs. WG (2007)
Philippe Gambette, Stéphane Vialette
On restrictions of balanced 2-interval graphs CoRR (2007)
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS (2007)
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM (2007)
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
The Minimum Substring Cover Problem. WAOA (2007)
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern between Permutations CoRR (2007)
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette
Exemplar Longest Common Subsequence. IEEE ACM Trans. Comput. Biol. Bioinform. 4 (4) (2007)
Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. 4 (4) (2007)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG (2007)
Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
Pattern Matching in Protein-Protein Interaction Graphs. FCT (2007)
Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB (2007)
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. J. Comput. Biol. 14 (4) (2007)
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP (2007)
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern Among Permutations. CPM (2007)

Stéphane Vialette.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stéphane Vialette