Laurent Bulteau
                                    87 
                                    
                            Documents
                                Présentation
Publications
                    
                    
                    24
                
                            
                    
                    
                    13
                
                            
                    
                    
                    12
                
                            
                    
                    
                    12
                
                            
                    
                    
                    11
                
                            
                    
                    
                    9
                
                            
                    
                    
                    8
                
                            
                    
                    
                    7
                
                            
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    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
                
                            
                    
                    
                    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
                
                    
                    
                    
                    6
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    6
                
                            
                    
                    
                    13
                
                            
                    
                    
                    5
                
                            
                    
                    
                    6
                
                            
                    
                    
                    3
                
                            
                    
                    
                    4
                
                            
                    
                    
                    9
                
                            
                    
                    
                    7
                
                            
                    
                    
                    6
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    Publications
| 
        
                             | 
        
        
            A coherent index for dichotomy in version-controlled repositories19th International Symposium on Theoretical Aspects of Software Engineering (TASE 2025), University of Cyprus, Jul 2025, Limassol, Cyprus 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04778558
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            CREMSA: Compressed indexing of (ultra) large multiple sequence alignmentsISMB/ECCB 2025 - 33rd International conference on Intelligent Systems for Molecular Biology and 24th European Conference on Computational Biology, 2025, Liverpool United Kingdom, United Kingdom. pp.i246-i254, ⟨10.1093/bioinformatics/btaf211⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04910677
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            Incremental Reachability Index23rd Symposium on Experimental Algorithms (SEA 2025), Jul 2025, Venice, Italy 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04929088
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            Compressed indexing of (ultra) large viral alignmentsSEQBIM 2024 - Journées du groupe de travail Séquences en Bioinformatique, Nov 2024, Rennes, France 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04773755
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairsSEQBIM 2024 - Journées du groupe de travail Séquences en Bioinformatique, Nov 2024, Rennes, France 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04773768
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairsWABI 2024 - 24th Workshop on Algorithms in Bioinformatics, 2024, London, United Kingdom 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04589901
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            The Problem of Discovery in Version Control SystemsXII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), Sep 2023, Huatulco, Oaxaca, México, Mexico. pp.209-216, ⟨10.1016/j.procs.2023.08.231⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03830513
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            Reordering a tree according to an order on its leavesCPM 2022, Jun 2022, Prague, Czech Republic. pp.24:1-24:15, ⟨10.4230/LIPIcs.CPM.2022.24⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03413413
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            Automated design of dynamic programming schemes for RNA folding with pseudoknotsWABI 2022 - 22nd Workshop on Algorithms in Bioinformatics, Sep 2022, Potsdam, Germany 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03676377
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), Jun 2022, Pragues (CZ), Czech Republic. ⟨10.4230/LIPIcs.CPM.2022.6⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03852740
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Permutation Pattern Matching for Doubly Partially Ordered Patterns33rd 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
                                    
            
        
     | 
| 
        
                             | 
        
        
            An Algorithmic Framework for Locally Constrained HomomorphismsInternational Workshop on Graph-Theoretic Concepts in Computer Science, 2022, Tübingen, Germany. pp.114-128, ⟨10.1007/978-3-031-15914-5_9⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04495171
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            A new parametrization for independent set reconfiguration and applications to RNA kineticsIPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Lisbon, Portugal. ⟨10.4230/lipics.ipec.2021.11⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03272963
                                            v2
                                    
            
        
     | 
        
            Partition Aggregation for Participatory BudgetingAAMAS'21, 2021, London (virtual), United Kingdom 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03388463
                                            v1
                                    
            
        
     | 
|
| 
        
                             | 
        
        
            Sequence graphs realizations and ambiguity in language modelsCOCOON 2021 - 27th International Computing and Combinatorics Conference, Oct 2021, Tainan, Taiwan. ⟨10.1007/978-3-030-89543-3_13⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-02495333
                                            v4
                                    
            
        
     | 
| 
        
                             | 
        
        
            Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA BioinformaticsWABI 2021 - 21st Workshop on Algorithms in Bioinformatics, 2021, Paris, France 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03206132
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            Sorting by Multi-cut RearrangementsSOFSEM 2021, Jan 2021, Bolzano-Bozen, Italy. pp.593-607, ⟨10.1007/978-3-030-67731-2_43⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03346830
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Disorders and Permutations32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland. ⟨10.4230/LIPIcs.CPM.2021.11⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03388489
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Partition Aggregation for BudgetingM-PREF2020, 2020, Santiago de Compostela, Spain 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-03388503
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            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⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-02527738
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Finding a Small Number of Colourful ComponentsCPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-02304030
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge ColorsCIAC 2019, May 2019, Rome, Italy. pp.99-111, ⟨10.1007/978-3-030-17402-6_9⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-02382897
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Consensus Strings with Small Maximum Distance and Small Distance Sum43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)., Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.1⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01930623
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            The Clever Shopper ProblemThe 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01715824
                                            v1
                                    
            
        
     | 
        
            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⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01935941
                                            v1
                                    
            
        
     | 
|
| 
        
                             | 
        
        
            Beyond Adjacency Maximization: Scaffold Filling for New String Distances28th Annual Symposium on Combinatorial Pattern Matching, 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.27⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01615671
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeThe 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01309152
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Precedence-Constrained Scheduling Problems Parameterized by Partial Order WidthDOOR 2016: Discrete Optimization and Operations Research, Sep 2016, Vladivostok, Russia. pp.345 - 120, ⟨10.1007/978-3-319-44914-2_9⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01495042
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            The Complexity of Finding EffectorsTAMC, 2015, Singapore, China. ⟨10.1007/978-3-319-17142-5_20⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01260613
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Multi-player Diffusion Games on Graph ClassesTAMC, May 2015, Singapore, Singapore. ⟨10.1007/978-3-319-17142-5_18⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01260620
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Fixed-Parameter Algorithms for Scaffold FillingISCO, 2014, Lisbon, Portugal. ⟨10.1007/978-3-319-09174-7_12⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01260583
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Star Partitions of Perfect GraphsICALP, 2014, Copenhague, Denmark. ⟨10.1007/978-3-662-43948-7_15⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01260593
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Reversal Distances for Strings with Few Blocks or Small Alphabets25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. pp.50-59, ⟨10.1007/978-3-319-07566-2_6⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01044938
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter TractableSODA, 2014, University of Illinois, Urbana-Champaign, Illinois, United States. pp.102-121, ⟨10.1137/1.9781611973402.8⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01176597
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Co-Clustering Under the Maximum NormISAAC, 2014, Jeonju, South Korea. ⟨10.1007/978-3-319-13075-0_24⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01260592
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00906903
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            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⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00683311
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Inapproximability of (1,2)-Exemplar DistanceBioinformatics Research and Applications, 2012, Dallas, United States. pp.13-23, ⟨10.1007/978-3-642-30191-9_2⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01171579
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Pancake Flipping is Hard37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00717712
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Sorting by Transpositions is Difficult38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00606223
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Tractability and Approximability of Maximal Strip Recovery22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00606167
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Revisiting the Minimum Breakpoint Linearization Problem7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00482856
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-00425145
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            MultiPus: Conception de communautés microbiennes pour la production de composés d'intérêtJobim, Jun 2016, Lyon, France 
                 Poster de conférence
                    
        
        
            
                
                    hal-01394119
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Independent set reconfiguration: general and RNA-focused parameterized algorithms2025 
                 Pré-publication, Document de travail
                             (working paper)
                    
        
        
            
                
                    hal-04094405
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            CARDS: A collection of package, revision, and miscellaneous dependency graphs2024 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    hal-04929691
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            On Turning A Graph Into A Phylogenetic Network2023 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    hal-04085424
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions2021 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    hal-03322887
                                            v1
                                    
            
        
     | 
| 
        
                                                 | 
        
        
            Finding a Small Number of Colourful Components2019 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    hal-01986725
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Algorithmic Aspects of Genome RearrangementsData Structures and Algorithms [cs.DS]. Université de Nantes, 2013. English. ⟨NNT : ⟩ 
                 Thèse
                    
        
        
            
                
                    tel-00906929
                                            v1
                                    
            
        
     | 
                Chargement...
            
            Chargement...