- 18
- 6
- 2
Stéphane Vialette
Publications de Stéphane Vialette
26
Documents
Publications
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 26
- 9
- 9
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 4
- 1
- 1
- 4
- 3
- 3
|
|
Permutation Pattern matching in (213, 231)-avoiding permutationsDiscrete Mathematics and Theoretical Computer Science, 2017, Vol. 18 no. 2, Permutation Patterns 2015 (2), pp.#14.1-22. ⟨10.46298/dmtcs.1329⟩
Article dans une revue
hal-01219299v6
|
|
|
Minimum Mosaic Inference of a Set of RecombinantsInternational Journal of Foundations of Computer Science, 2013, 24 (1), pp.51-66. ⟨10.1142/S0129054113400042⟩
Article dans une revue
hal-00679269v1
|
|
|
A faster algorithm for finding minimum Tucker submatricesTheory of Computing Systems, 2012, 51 (3), pp.270-281. ⟨10.1007/s00224-012-9388-1⟩
Article dans une revue
hal-00657340v1
|
|
|
Finding Common Structured Patterns in Linear GraphsTheoretical Computer Science, 2010, 411 (26-28), pp.2475-2486. ⟨10.1016/j.tcs.2010.02.017⟩
Article dans une revue
hal-00482850v1
|
Approximation of RNA Multiple Structural AlignmentJournal of Discrete Algorithms, 2010, ? (?)
Article dans une revue
hal-00619801v1
|
|
Complexity Issues in Color-Preserving Graph EmbeddingsTheoretical Computer Science, 2010, 411 (4-5), pp.716-729. ⟨10.1016/j.tcs.2009.10.010⟩
Article dans une revue
hal-00619754v1
|
|
|
|
Finding Occurrences of Protein Complexes in Protein-Protein Interaction GraphsJournal of Discrete Algorithms, 2009, 7 (1), pp.90-101
Article dans une revue
hal-00416394v1
|
The Minimum Substring Cover ProblemInformation and Computation, 2008, 206 (11), pp.1303-1312
Article dans une revue
hal-00619729v1
|
|
|
|
Comparing Genomes with Duplications: a Computational Complexity Point of ViewACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534. ⟨10.1109/TCBB.2007.1069⟩
Article dans une revue
hal-00417720v1
|
|
|
What makes the Arc-Preserving Subsequence problem hard ?LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
Article dans une revue
hal-00417738v1
|
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⟩
Communication dans un congrès
hal-03860801v1
|
|
|
|
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⟩
Communication dans un congrès
hal-01287040v1
|
|
|
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
Communication dans un congrès
hal-00859708v1
|
|
|
On recognizing words that are squares for the shuffle productThe 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.235-245
Communication dans un congrès
hal-00725429v1
|
|
|
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⟩
Communication dans un congrès
hal-01054925v1
|
|
|
Minimum Mosaic Inference of a Set of Recombinants17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
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⟩
Communication dans un congrès
hal-00620378v1
|
|
|
A faster algorithm for finding minimum Tucker submatrices6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Communication dans un congrès
hal-00620380v1
|
Pattern Matching in Protein-Protein Interaction GraphsProc. 16th International Symposium on Fundamentals of Computation Theory (FCT), 2007, Budapest, Hungary, Croatia. pp.125-136
Communication dans un congrès
hal-00620287v1
|
|
The Minimum Substring Cover Problem5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
Communication dans un congrès
hal-00620289v1
|
|
|
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Communication dans un congrès
hal-00418241v1
|
Approximation of RNA Multiple Structural Alignment17th Symposium on Combinatorial Pattern Matching (CPM'06), 2006, Barcelona, Spain, Spain. pp.211-222
Communication dans un congrès
hal-00620291v1
|
|
Genomes containing duplicates are hard to compareProc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Communication dans un congrès
hal-00620297v1
|
|
|
|
Genomes containing Duplicates are Hard to compareInternational Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Communication dans un congrès
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
Communication dans un congrès
hal-00620359v1
|
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
Communication dans un congrès
hal-00620292v1
|