- 76
- 22
- 13
- 7
- 4
- 1
- 1
- 1
- 1
Stéphane Vialette
Publications de Stéphane Vialette
126
Documents
Publications
- 6
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 47
- 29
- 26
- 12
- 11
- 11
- 10
- 8
- 8
- 6
- 6
- 6
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 11
- 5
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 4
- 2
- 1
- 6
- 5
- 1
- 4
- 7
- 1
- 6
- 4
- 8
- 9
- 12
- 9
- 16
- 9
- 6
- 7
- 1
- 2
- 1
Generalizing Roberts' Characterization of Unit Interval Graphs49th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPICS.MFCS.2024.12⟩
Conference papers
hal-04698633v1
|
|
|
|
Parity Permutation Pattern MatchingWALCOM, Mar 2023, Hsinchu, Taiwan
Conference papers
hal-03922884v1
|
|
|
Recognizing Unit Multiple Intervals Is Hard34th International Symposium on Algorithms and Computation (ISAAC 2023), Dec 2023, Kyoto, Japan. ⟨10.4230/LIPIcs.ISAAC.2023.8⟩
Conference papers
hal-04485941v1
|
|
|
Permutation Pattern Matching for Doubly Partially Ordered Patterns33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic
Conference papers
hal-03624311v1
|
|
|
Algorithmic aspects of quasi-kernels23è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
Conference papers
hal-03596166v1
|
Algorithmic Aspects of Small Quasi-Kernels48TH 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⟩
Conference papers
hal-03860801v1
|
|
|
|
The Maximum Zero-Sum Partition Problem25th International Computer Symposium, ICS 2022, Dec 2022, Taoyuan, Taiwan. pp.73-85, ⟨10.1007/978-981-19-9582-8_7⟩
Conference papers
hal-04293802v1
|
|
|
Disorders and Permutations32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland. ⟨10.4230/LIPIcs.CPM.2021.11⟩
Conference papers
hal-03388489v1
|
|
|
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data2019 15th International Conference on eScience (eScience), Sep 2019, San Diego, France. pp.136-145, ⟨10.1109/eScience.2019.00022⟩
Conference papers
hal-02527738v1
|
|
|
Unshuffling PermutationsTAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩
Conference papers
hal-02304028v1
|
|
|
Finding a Small Number of Colourful ComponentsCPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩
Conference papers
hal-02304030v1
|
Pattern Matching for k-Track PermutationsInternational Workshop on Combinatorial Algorithms (IWOCA), Jul 2018, Singapore, Singapore. pp.102-114, ⟨10.1007/978-3-319-94667-2_9⟩
Conference papers
hal-01935941v1
|
|
The Clever Shopper ProblemThe 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩
Conference papers
hal-01715824v1
|
|
Unshuffling Words and PermutationsAAIM 2016, Jul 2016, Bergame, Italy
Conference papers
hal-01798536v1
|
|
|
|
Pattern Matching for Separable PermutationsSPIRE 2016, Oct 2016, Beppu, Japan. pp.260-272, ⟨10.1007/978-3-319-46049-9_25⟩
Conference papers
hal-01798554v1
|
|
|
Sorting With Forbidden IntermediatesThird 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⟩
Conference papers
hal-01287040v1
|
|
|
Unshuffling PermutationsLATIN 2016, Apr 2016, Ensenada, Mexico. pp.509-521, ⟨10.1007/978-3-662-49529-2_38⟩
Conference papers
hal-01260549v2
|
|
|
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic TimeIWOCA 2015, Oct 2015, Verona, Italy. pp.197-208, ⟨10.1007/978-3-319-29516-9_17⟩
Conference papers
hal-01226035v1
|
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. ⟨10.1007/978-3-662-48971-0_15⟩
Conference papers
hal-01189621v1
|
|
|
Locating a Tree in a Phylogenetic Network in Quadratic TimeRECOMB 2015, Apr 2015, Varsovie, Poland. pp.96-107, ⟨10.1007/978-3-319-16706-0_12⟩
Conference papers
hal-01116231v1
|
Algorithmic aspects of the S-Labeling problem26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Conference papers
hal-01311584v1
|
|
|
|
Towards unlocking the full potential of Multileaf Collimators40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Conference papers
hal-00859708v1
|
|
|
Flexible RNA design under structure and sequence constraints using formal languagesACM-BCB - ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics - 2013, Sep 2013, Bethesda, Washigton DC, United States
Conference papers
hal-00823279v2
|
|
|
Single and multiple consecutive permutation motif searchISAAC 2013, Dec 2013, Hong-Kong, Hong Kong SAR China. pp.66-77, ⟨10.1007/978-3-642-45030-3_7⟩
Conference papers
hal-00859363v1
|
|
|
On recognizing words that are squares for the shuffle productThe 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.235-245
Conference papers
hal-00725429v1
|
|
|
Hardness of longest common subsequence for sequences with bounded run-lengths23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩
Conference papers
hal-00683311v1
|
|
|
The longest common subsequence problem with crossing-free arc-annotated sequences19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
Conference papers
hal-00713431v1
|
|
|
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphISAAC 2012, Dec 2012, Taipei, Taiwan. pp.465-474, ⟨10.1007/978-3-642-35261-4_49⟩
Conference papers
hal-01054925v1
|
|
|
Finding Approximate and Constrained Motifs in GraphsCPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩
Conference papers
hal-00606173v1
|
|
|
Minimum Mosaic Inference of a Set of Recombinants17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Conference papers
hal-00620371v1
|
|
|
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384, ⟨10.1007/978-3-642-20712-9_29⟩
Conference papers
hal-00620378v1
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Conference papers
hal-00606375v1
|
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networksBioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Conference papers
hal-00425661v1
|
|
|
A faster algorithm for finding minimum Tucker submatrices6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Conference papers
hal-00620380v1
|
|
|
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Conference papers
hal-00620327v1
|
|
|
Pseudo-Boolean Programming for Partially Ordered GenomesRECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137, ⟨10.1007/978-3-642-04744-2_11⟩
Conference papers
hal-00416458v1
|
|
|
On the S-labeling ProblemProc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
Conference papers
hal-00416570v1
|
|
|
On Finding Small 2-Generating SetsCOCOON 2009, 2009, Niagara Falls, United States. pp.378-387, ⟨10.1007/978-3-642-02882-3_38⟩
Conference papers
hal-00416577v1
|
Querying Protein-Protein Interaction Networks5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Conference papers
hal-00620391v1
|
|
Pattern matching for 321-avoiding permutations20th International Symposium on Algorithms and Computation (ISAAC'09), 2009, United States. pp.1064-1073
Conference papers
hal-00620322v1
|
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Conference papers
hal-00416491v1
|
|
|
Finding the median of three permutations under the Kendall-tau distance7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Conference papers
hal-00620459v1
|
|
|
Maximum Motif Problem in Vertex-Colored Graphs20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235, ⟨10.1007/978-3-642-02441-2_20⟩
Conference papers
hal-00416463v1
|
|
|
On restrictions of balanced 2-interval graphs33rd 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⟩
Conference papers
hal-00141338v2
|
|
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Conference papers
hal-00418241v1
|
The Minimum Substring Cover Problem5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
Conference papers
hal-00620289v1
|
|
Pattern Matching in Protein-Protein Interaction GraphsProc. 16th International Symposium on Fundamentals of Computation Theory (FCT), 2007, Budapest, Hungary, Croatia. pp.125-136
Conference papers
hal-00620287v1
|
|
|
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Conference papers
hal-00417928v1
|
|
|
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS ProblemsBrazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Conference papers
hal-00417918v1
|
Longest Common Separable Pattern between PermutationsSymposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327
Conference papers
hal-00620293v1
|
|
|
|
Pattern Matching in Protein-Protein Interaction GraphsFCT 2007, Aug 2007, Budapest, Hungary. pp.137-148, ⟨10.1007/978-3-540-74240-1_13⟩
Conference papers
hal-00199009v1
|
|
|
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Conference papers
hal-00417902v1
|
|
|
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Conference papers
hal-00418258v1
|
|
|
Longest Common Separable Pattern between PermutationsCombinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Conference papers
hal-00128750v1
|
|
|
Weak pattern matching in colored graphs: Minimizing the number of connected components10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Conference papers
hal-00417910v1
|
Approximation of RNA Multiple Structural Alignment17th Symposium on Combinatorial Pattern Matching (CPM'06), 2006, Barcelona, Spain, Spain. pp.211-222
Conference papers
hal-00620291v1
|
|
|
|
Exemplar Longest Common Subsequence (extended abstract)International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
Conference papers
hal-00461780v1
|
Exemplar Longest Common SubsequencesInt. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Conference papers
hal-00620296v1
|
|
Genomes containing duplicates are hard to compareProc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Conference papers
hal-00620297v1
|
|
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Conference papers
hal-00619848v1
|
|
|
|
Genomes containing Duplicates are Hard to compareInternational Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Conference papers
hal-00418260v1
|
|
|
What Makes the Arc-Preserving Subsequence Problem Hard?5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
Conference papers
hal-00620359v1
|
|
|
Approximating the 2-Interval Pattern Problem13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Conference papers
hal-00619979v1
|
Linear graph non-crossing structural alignment under the RNA stacking-pair scoring scheme2nd Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'05), 2005, Lyon, France, France. 10pp
Conference papers
hal-00620303v1
|
|
|
|
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Conference papers
hal-00620363v1
|
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Conference papers
hal-00620292v1
|
|
|
|
New Results for the 2-Interval Pattern Problem15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
Conference papers
hal-00620366v1
|
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionar, Dec 2004, Recife,Brazil, Brazil. pp.45-70
Conference papers
hal-00620023v1
|
|
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Conference papers
hal-00620330v1
|
|
Pattern Matching over 2-intervals setsSymposium on Combinatorial Pattern Matching (CPM'02), 2002, Fukuoka, Japan, Japan. pp.53-63
Conference papers
hal-00620286v1
|
RECOMB - Comparative Genomics Special IssueMary Ann Liebert, Inc., pp.1285-1500, 2010
Books
hal-00620536v1
|
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Books
hal-00416453v1
|
|
Comparative Genomics: International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008Springer, 276pp., 2008
Books
hal-00620537v1
|
Algorithmic Aspects of Arc-Annotated SequencesElloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011
Book sections
hal-00620821v1
|
|
Two-Interval Pattern ProblemsKao Ming-Yang. Encyclopedia of Algorithms, Springer-Verlag, pp.985-989, 2008
Book sections
hal-00620812v1
|
Finding a Small Number of Colourful Components2019
Preprints, Working Papers, ...
hal-01986725v1
|
|
|
|
Comparing RNA structures using a full set of biologically relevant edit operations is intractable2008
Preprints, Working Papers, ...
hal-00347464v1
|
|
|
On the Approximability of Comparing Genomes with Duplicates2008
Preprints, Working Papers, ...
hal-00285511v1
|
|
|
Aspects algorithmiques de la prédiction des structures secondaires d'ARNInformatique [cs]. Université Paris-Diderot - Paris VII, 2001. Français. ⟨NNT : ⟩
Theses
tel-00628623v1
|
|
|
Algorithmic Contributions to Computational Molecular BiologyData Structures and Algorithms [cs.DS]. Université Paris-Est, 2010
Habilitation à diriger des recherches
tel-00862069v1
|