Laurent Bulteau

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 59

Top Venues

CoRR

CPM

Theor. Comput. Sci.

J. Comput. Syst. Sci.

University of Nantes, France (PHD)

Education History

University of Nantes, France

PHD

Publications

Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38 (2) (2024)
Laurent Bulteau, Louxin Zhang
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings. J. Comput. Syst. Sci. 144 (2024)
Sammy Khalife, Yann Ponty, Laurent Bulteau
Sequence graphs realizations and ambiguity in language models. CoRR (2024)
Théo Boury, Laurent Bulteau, Yann Ponty
RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs. WABI (2024)
Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Yann Ponty, Laurent Bulteau
Automated design of dynamic programming schemes for RNA folding with pseudoknots. Algorithms Mol. Biol. 18 (1) (2023)
Laurent Bulteau, Pierre-Yves David, Florian Horn
The Problem of Discovery in Version Control Systems. LAGOS (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)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. WG (2022)
Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM (2022)
Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, Yann Ponty
Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots. WABI (2022)
Bertrand Marchand, Yann Ponty, Laurent Bulteau
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. Algorithms Mol. Biol. 17 (1) (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR (2022)
Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh
Better Collective Decisions via Uncertainty Reduction. IJCAI (2022)
Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh
Better Collective Decisions via Uncertainty Reduction. CoRR (2022)
Laurent Bulteau, Philippe Gambette, Olga Seminck
Reordering a Tree According to an Order on Its Leaves. CPM (2022)
Laurent Bulteau, Jiehua Chen
2-Dimensional Euclidean Preferences. CoRR (2022)
Sammy Khalife, Yann Ponty, Laurent Bulteau
Sequence Graphs Realizations and Ambiguity in Language Models. COCOON (2021)
Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98 (4) (2021)
Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, Nimrod Talmon
Justified Representation for Perpetual Voting. IEEE Access 9 (2021)
Laurent Bulteau, Gal Shahaf, Ehud Shapiro, Nimrod Talmon
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation. J. Artif. Intell. Res. 70 (2021)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120 (2021)
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
Sorting by Multi-Cut Rearrangements. Algorithms 14 (6) (2021)
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)
Pallavi Jain, Nimrod Talmon, Laurent Bulteau
Partition Aggregation for Participatory Budgeting. AAMAS (2021)
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
Sorting by Multi-cut Rearrangements. SOFSEM (2021)
Laurent Bulteau, Samuele Giraudo, Stéphane Vialette
Disorders and Permutations. CPM (2021)
Laurent Bulteau, Bertrand Marchand, Yann Ponty
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. IPEC (2021)
Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Laurent Bulteau, Ulisses Dias, Zanoni Dias
Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (6) (2021)
Bertrand Marchand, Yann Ponty, Laurent Bulteau
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. WABI (2021)
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
Parameterized String Equations. CoRR (2021)
Laurent Bulteau, Vincent Froese, Rolf Niedermeier
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34 (3) (2020)
Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. Theory Comput. Syst. 64 (1) (2020)
Laurent Bulteau, Markus L. Schmid
Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica 82 (5) (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)
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, Mathias Weller
Parameterized Algorithms in Bioinformatics: An Overview. Algorithms 12 (12) (2019)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC (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)
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)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR (2018)
Laurent Bulteau, Markus L. Schmid
Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS (2018)
Laurent Bulteau, Vincent Froese, Rolf Niedermeier
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR (2018)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Partitioning Perfect Graphs into Stars. J. Graph Theory 85 (2) (2017)
Laurent Bulteau
Consensus Patterns parameterized by input string length is W[1]-hard. CoRR (2017)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM (2017)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. Theory Comput. Syst. 60 (2) (2017)
Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR (2016)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37 (2016)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering under the Maximum Norm. Algorithms 9 (1) (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR (2016)
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
Triangle Counting in Dynamic Graph Streams. Algorithmica 76 (1) (2016)
Laurent Bulteau, Guillaume Fertin, Eric Tannier
Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 17 (S-14) (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-constrained scheduling problems parameterized by partial order width. CoRR (2016)
Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON (2016)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12 (6) (2016)
Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115 (1) (2015)
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. 50 (2015)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Pancake Flipping is hard. J. Comput. Syst. Sci. 81 (8) (2015)
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
Combinatorial voter control in elections. Theor. Comput. Sci. 589 (2015)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-player Diffusion Games on Graph Classes. TAMC (2015)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. CoRR (2015)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. TAMC (2015)
Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi
Fixed-parameter algorithms for scaffold filling. Theor. Comput. Sci. 568 (2015)
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Co-Clustering Under the Maximum Norm. ISAAC (2014)
Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi
Fixed-Parameter Algorithms for Scaffold Filling. ISCO (2014)
Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS 114 (2014)
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
Triangle counting in dynamic graph streams. CoRR (2014)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM (2014)
Laurent Bulteau, Vincent Froese, Nimrod Talmon
Multi-Player Diffusion Games on Graph Classes. CoRR (2014)
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
Combinatorial Voter Control in Elections. CoRR (2014)
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
Computing an Evolutionary Ordering is Hard. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. ICALP (1) (2014)
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
The Complexity of Finding Effectors. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. CoRR (2014)
Laurent Bulteau, Christian Komusiewicz
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. SODA (2014)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI (2013)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. 494 (2013)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms 19 (2013)
Laurent Bulteau, Minghui Jiang
Inapproximability of (1, 2)-Exemplar Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (6) (2013)
Laurent Bulteau, Christian Komusiewicz
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable CoRR (2013)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR (2013)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Pancake Flipping Is Hard. MFCS (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)
Laurent Bulteau, Minghui Jiang
Inapproximability of (1, 2)-Exemplar Distance. ISBRA (2012)
Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. (2012)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. 26 (3) (2012)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Pancake Flipping is Hard CoRR (2011)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Sorting by Transpositions Is Difficult. ICALP (1) (2011)
Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
Tractability and Approximability of Maximal Strip Recovery. CPM (2011)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Sorting by Transpositions is Difficult CoRR (2010)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Revisiting the Minimum Breakpoint Linearization Problem. TAMC (2010)
Laurent Bulteau, Guillaume Fertin, Irena Rusu
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC (2009)

Laurent Bulteau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Laurent Bulteau