|
Generalizing Roberts' Characterization of Unit Interval Graphs
Virginia Ardévol Martínez
,
Romeo Rizzi
,
Abdallah Saffidine
,
Florian Sikora
,
Stéphane Vialette
49th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPICS.MFCS.2024.12⟩
Communication dans un congrès
hal-04698633
v1
|
|
Parity Permutation Pattern Matching
Virginia Ardévol Martínez
,
Florian Sikora
,
Stéphane Vialette
Communication dans un congrès
hal-03922884
v1
|
|
Recognizing Unit Multiple Intervals Is Hard
Virginia Ardévol Martínez
,
Florian Sikora
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-04485941
v1
|
|
The Maximum Zero-Sum Partition Problem
Guillaume Fertin
,
Oscar Fontaine
,
Géraldine Jean
,
Stéphane Vialette
Communication dans un congrès
hal-04293802
v1
|
|
Permutation Pattern Matching for Doubly Partially Ordered Patterns
Laurent Bulteau
,
Guillaume Fertin
,
Vincent Jugé
,
Stéphane Vialette
33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic. ⟨10.4230/lipics.cpm.2022.21⟩
Communication dans un congrès
hal-03624311
v1
|
|
Algorithmic Aspects of Small Quasi-Kernels
Hélène Langlois
,
Frédéric Meunier
,
Romeo Rizzi
,
Stéphane Vialette
48TH International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2022, Tubingen/Germany, Germany. pp.370-382, ⟨10.1007/978-3-031-15914-5_27⟩
Communication dans un congrès
hal-03860801
v1
|
|
Algorithmic aspects of quasi-kernels
Hélène Langlois
,
Frédéric Meunier
,
Romeo Rizzi
,
Stéphane Vialette
23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03596166
v1
|
|
Disorders and Permutations
Laurent Bulteau
,
Samuele Giraudo
,
Stéphane Vialette
Communication dans un congrès
hal-03388489
v1
|
|
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data
Pierre Andrieu
,
Bryan Brancotte
,
Laurent Bulteau
,
Sarah Cohen-Boulakia
,
Alain Denise
et al.
Communication dans un congrès
hal-02527738
v1
|
|
Finding a Small Number of Colourful Components
Laurent Bulteau
,
Konrad K. Dabrowski
,
Guillaume Fertin
,
Matthew Johnson
,
Daniël Paulusma
et al.
Communication dans un congrès
hal-02304030
v1
|
|
Unshuffling Permutations
Guillaume Fertin
,
Samuele Giraudo
,
Sylvie Hamel
,
Stéphane Vialette
Communication dans un congrès
hal-02304028
v1
|
|
The Clever Shopper Problem
Laurent Bulteau
,
Danny Hermelin
,
Anthony Labarre
,
Stéphane Vialette
Communication dans un congrès
hal-01715824
v1
|
|
Pattern Matching for k-Track Permutations
Laurent Bulteau
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-01935941
v1
|
|
Pattern Matching for Separable Permutations
Both Emerite Neou
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-01798554
v1
|
|
Unshuffling Words and Permutations
Stéphane Vialette
AAIM 2016, Jul 2016, Bergame, Italy
Communication dans un congrès
hal-01798536
v1
|
|
Unshuffling Permutations
Samuele Giraudo
,
Stéphane Vialette
Communication dans un congrès
hal-01260549
v2
|
|
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
Philippe Gambette
,
Andreas D.M. Gunawan
,
Anthony Labarre
,
Stéphane Vialette
,
Louxin Zhang
Communication dans un congrès
hal-01226035
v1
|
|
Sorting With Forbidden Intermediates
Carlo Comin
,
Anthony Labarre
,
Romeo Rizzi
,
Stéphane Vialette
Third International Conference on Algorithms for Computational Biology (AlCoB 2016), María Botón-Fernández; Carlos Martín-Vide; Miguel A. Vega-Rodríguez; Florentina Lilica Voicu, Jun 2016, Trujillo, Spain. ⟨10.1016/j.dam.2019.10.025⟩
Communication dans un congrès
hal-01287040
v1
|
|
Locating a Tree in a Phylogenetic Network in Quadratic Time
Philippe Gambette
,
Andreas D.M. Gunawan
,
Anthony Labarre
,
Stéphane Vialette
,
Louxin Zhang
Communication dans un congrès
hal-01116231
v1
|
|
Algorithmic aspects of the S-Labeling problem
Guillaume Fertin
,
Irena Rusu
,
Stéphane Vialette
26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Communication dans un congrès
hal-01311584
v1
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations
Guillaume Fertin
,
Irena Rusu
,
Stéphane Vialette
Communication dans un congrès
hal-01189621
v1
|
|
On recognizing words that are squares for the shuffle product
Romeo Rizzi
,
Stéphane Vialette
The 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.235-245
Communication dans un congrès
hal-00725429
v1
|
|
Single and multiple consecutive permutation motif search
Djamal Belazzougui
,
Adeline Pierrot
,
Mathieu Raffinot
,
Stéphane Vialette
Communication dans un congrès
hal-00859363
v1
|
|
Flexible RNA design under structure and sequence constraints using formal languages
Yu Zhou
,
Yann Ponty
,
Stéphane Vialette
,
Jérôme Waldispühl
,
Yi Zhang
et al.
ACM-BCB - ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics - 2013, Sep 2013, Bethesda, Washigton DC, United States
Communication dans un congrès
hal-00823279
v2
|
|
Towards unlocking the full potential of Multileaf Collimators
Guillaume Blin
,
Paul Morel
,
Romeo Rizzi
,
Stéphane Vialette
40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Communication dans un congrès
hal-00859708
v1
|
|
The longest common subsequence problem with crossing-free arc-annotated sequences
Guillaume Blin
,
Minghui Jiang
,
Stéphane Vialette
19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
Communication dans un congrès
hal-00713431
v1
|
|
Hardness of longest common subsequence for sequences with bounded run-lengths
Guillaume Blin
,
Laurent Bulteau
,
Minghui Jiang
,
Pedro J. Tejada
,
Stéphane Vialette
Communication dans un congrès
hal-00683311
v1
|
|
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-01054925
v1
|
|
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Guillaume Blin
,
Guillaume Fertin
,
Hafedh Mohamed-Babou
,
Irena Rusu
,
Florian Sikora
et al.
Communication dans un congrès
hal-00606375
v1
|
|
Finding Approximate and Constrained Motifs in Graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Communication dans un congrès
hal-00606173
v1
|
|
Minimum Mosaic Inference of a Set of Recombinants
Guillaume Blin
,
Romeo Rizzi
,
Florian Sikora
,
Stéphane Vialette
17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
hal-00620371
v1
|
|
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row
Guillaume Blin
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-00620378
v1
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks
Guillaume Blin
,
Florian Sikora
,
Stéphane Vialette
Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Communication dans un congrès
hal-00425661
v1
|
|
A faster algorithm for finding minimum Tucker submatrices
Guillaume Blin
,
Romeo Rizzi
,
Stéphane Vialette
6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Communication dans un congrès
hal-00620380
v1
|
|
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions
Guillaume Blin
,
Sylvie Hamel
,
Stéphane Vialette
4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Communication dans un congrès
hal-00620327
v1
|
|
Pseudo-Boolean Programming for Partially Ordered Genomes
Sébastien Angibaud
,
Guillaume Fertin
,
Annelyse Thevenin
,
Stéphane Vialette
Communication dans un congrès
hal-00416458
v1
|
|
Finding the median of three permutations under the Kendall-tau distance
Guillaume Blin
,
Maxime Crochemore
,
Sylvie Hamel
,
Stéphane Vialette
7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Communication dans un congrès
hal-00620459
v1
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
Guillaume Blin
,
Guillaume Fertin
,
Florian Sikora
,
Stéphane Vialette
WALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491
v1
|
|
Pattern matching for 321-avoiding permutations
Sylvain Guillemot
,
Stéphane Vialette
20th International Symposium on Algorithms and Computation (ISAAC'09), 2009, United States. pp.1064-1073
Communication dans un congrès
hal-00620322
v1
|
|
Querying Protein-Protein Interaction Networks
Guillaume Blin
,
Florian Sikora
,
Stéphane Vialette
5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Communication dans un congrès
hal-00620391
v1
|
|
On the S-labeling Problem
Guillaume Fertin
,
Stéphane Vialette
Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
Communication dans un congrès
hal-00416570
v1
|
|
On Finding Small 2-Generating Sets
Isabelle Fagnot
,
Guillaume Fertin
,
Stéphane Vialette
Communication dans un congrès
hal-00416577
v1
|
|
Maximum Motif Problem in Vertex-Colored Graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Communication dans un congrès
hal-00416463
v1
|
|
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes
Sébastien Angibaud
,
Guillaume Fertin
,
Irena Rusu
,
Annelyse Thevenin
,
Stéphane Vialette
5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Communication dans un congrès
hal-00417902
v1
|
|
Longest Common Separable Pattern between Permutations
Mathilde Bouvel
,
Dominique Rossin
,
Stéphane Vialette
Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Communication dans un congrès
hal-00128750
v1
|
|
Pattern Matching in Protein-Protein Interaction Graphs
Gaëlle Brevier-Giberti
,
Roméo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-00199009
v1
|
|
Longest Common Separable Pattern between Permutations
Mathilde Bouvel
,
Dominique Rossin
,
Stéphane Vialette
Symposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327
Communication dans un congrès
hal-00620293
v1
|
|
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems
Guillaume Blin
,
Guillaume Fertin
,
Gaël Herry
,
Stéphane Vialette
Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Communication dans un congrès
hal-00417918
v1
|
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
Michael R. Fellows
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Communication dans un congrès
hal-00417928
v1
|
|
On restrictions of balanced 2-interval graphs
Philippe Gambette
,
Stéphane Vialette
33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), ?, Jun 2007, Dornburg, Germany. pp.55-65, ⟨10.1007/978-3-540-74839-7_6⟩
Communication dans un congrès
hal-00141338
v2
|
|
Pattern Matching in Protein-Protein Interaction Graphs
Gaëlle Brevier
,
Romeo Rizzi
,
Stéphane Vialette
Proc. 16th International Symposium on Fundamentals of Computation Theory (FCT), 2007, Budapest, Hungary, Croatia. pp.125-136
Communication dans un congrès
hal-00620287
v1
|
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics
Guillaume Fertin
,
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Communication dans un congrès
hal-00418241
v1
|
|
The Minimum Substring Cover Problem
Danny Hermelin
,
Dror Rawitz
,
Romeo Rizzi
,
Stéphane Vialette
5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
Communication dans un congrès
hal-00620289
v1
|
|
Weak pattern matching in colored graphs: Minimizing the number of connected components
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Communication dans un congrès
hal-00417910
v1
|
|
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation
Sébastien Angibaud
,
Guillaume Fertin
,
Irena Rusu
,
Stéphane Vialette
4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Communication dans un congrès
hal-00619848
v1
|
|
Genomes containing duplicates are hard to compare
Cedric Chauve
,
Guillaume Fertin
,
Romeo Rizzi
,
Stéphane Vialette
Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Communication dans un congrès
hal-00620297
v1
|
|
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation
Sébastien Angibaud
,
Guillaume Fertin
,
Irena Rusu
,
Stéphane Vialette
4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Communication dans un congrès
hal-00418258
v1
|
|
Exemplar Longest Common Subsequences
Paola Bonizzoni
,
Gianuca Della Vedova
,
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Communication dans un congrès
hal-00620296
v1
|
|
Approximation of RNA Multiple Structural Alignment
Marcin Kubica
,
Romeo Rizzi
,
Stéphane Vialette
,
Thomas Waleń
17th Symposium on Combinatorial Pattern Matching (CPM'06), 2006, Barcelona, Spain, Spain. pp.211-222
Communication dans un congrès
hal-00620291
v1
|
|
Exemplar Longest Common Subsequence (extended abstract)
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
Communication dans un congrès
hal-00461780
v1
|
|
Genomes containing Duplicates are Hard to compare
Cedric Chauve
,
Guillaume Fertin
,
Romeo Rizzi
,
Stéphane Vialette
International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Communication dans un congrès
hal-00418260
v1
|
|
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Guillaume Blin
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France. pp.271-282
Communication dans un congrès
hal-00620363
v1
|
|
Linear graph non-crossing structural alignment under the RNA stacking-pair scoring scheme
Claire Herrbach
,
Stéphane Vialette
2nd Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'05), 2005, Lyon, France, France. 10pp
Communication dans un congrès
hal-00620303
v1
|
|
Approximating the 2-Interval Pattern Problem
Maxime Crochemore
,
Danny Hermelin
,
Gad M. Landau
,
Stéphane Vialette
13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Communication dans un congrès
hal-00619979
v1
|
|
What Makes the Arc-Preserving Subsequence Problem Hard?
Guillaume Blin
,
Guillaume Fertin
,
Romeo Rizzi
,
Stéphane Vialette
5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
Communication dans un congrès
hal-00620359
v1
|
|
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
Guillaume Fertin
,
Romeo Rizzi
,
Stéphane Vialette
30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Communication dans un congrès
hal-00620292
v1
|
|
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs
Isabelle Fagnot
,
Gaëlle Lelandais
,
Stéphane Vialette
1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionar, Dec 2004, Recife,Brazil, Brazil. pp.45-70
Communication dans un congrès
hal-00620023
v1
|
|
New Results for the 2-Interval Pattern Problem
Guillaume Blin
,
Guillaume Fertin
,
Stéphane Vialette
15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey. pp.311-322
Communication dans un congrès
hal-00620366
v1
|
|
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem
Guillaume Blin
,
Guillaume Fertin
,
Roméo Rizzi
,
Stéphane Vialette
5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Communication dans un congrès
hal-00620330
v1
|
|
Pattern Matching over 2-intervals sets
Stéphane Vialette
Symposium on Combinatorial Pattern Matching (CPM'02), 2002, Fukuoka, Japan, Japan. pp.53-63
Communication dans un congrès
hal-00620286
v1
|