Laurent Bulteau

107 papers A* 2A 2B 18C 12Misc 4Journal 63Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms. Algorithmica Théo Boury, Laurent Bulteau, Bertrand Marchand, Yann Ponty
2025	J	`jnl`	<tt>CREMSA</tt>: compressed indexing of (ultra) large multiple sequence alignments. Bioinform. Mikaël Salson, Arthur Boddaert, Awa Bousso Gueye, Laurent Bulteau, Yohan Hernandez-Courbevoie, Camille Marchet, Nan Pan, Sebastian Will, Yann Ponty
2025	Misc	`conf`	A Coherent Index for Dichotomy in Version-Controlled Repositories. TASE Laurent Bulteau, Pierre-Yves David, Florian Horn, Euxane Tran-Girard
2025	A	`conf`	CARDS: A collection of package, revision, and miscellaneous dependency graphs. MSR Euxane Tran-Girard, Laurent Bulteau, Pierre-Yves David
2025	J	`jnl`	CARDS: A collection of package, revision, and miscellaneous dependency graphs. CoRR Euxane Tran-Girard, Laurent Bulteau, Pierre-Yves David
2025	B	`conf`	Incremental Reachability Index. SEA Laurent Bulteau, Pierre-Yves David, Florian Horn, Euxane Tran-Girard
2025	J	`jnl`	RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs. Algorithms Mol. Biol. Théo Boury, Samuel Gardelle, Laurent Bulteau, Yann Ponty
2025	C	`conf`	String Consensus Problems with Swaps and Substitutions. SPIRE Estéban Gabory, Laurent Bulteau, Gabriele Fici, Hilde Verbeek
2025	J	`jnl`	String Consensus Problems with Swaps and Substitutions. CoRR Estéban Gabory, Laurent Bulteau, Gabriele Fici, Hilde Verbeek
2024	J	`jnl`	An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2024	C	`conf`	RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs. WABI Théo Boury, Laurent Bulteau, Yann Ponty
2024	J	`jnl`	Sequence graphs realizations and ambiguity in language models. CoRR Sammy Khalife, Yann Ponty, Laurent Bulteau
2024	J	`jnl`	The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings. J. Comput. Syst. Sci. Laurent Bulteau, Louxin Zhang
2023	B	`ed.`	34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vallée, France, June 26-28, 2023 CPM Laurent Bulteau, Zsuzsanna Lipták
2023	J	`jnl`	Automated design of dynamic programming schemes for RNA folding with pseudoknots. Algorithms Mol. Biol. Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Yann Ponty, Laurent Bulteau
2023	J	`jnl`	On shuffled-square-free words. Theor. Comput. Sci. Laurent Bulteau, Vincent Jugé, Stéphane Vialette
2023	C	`conf`	The Problem of Discovery in Version Control Systems. LAGOS Laurent Bulteau, Pierre-Yves David, Florian Horn
2022	J	`jnl`	2-Dimensional Euclidean Preferences. CoRR Laurent Bulteau, Jiehua Chen
2022	B	`conf`	An Algorithmic Framework for Locally Constrained Homomorphisms. WG Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022	J	`jnl`	An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022	B	`conf`	An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau
2022	C	`conf`	Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots. WABI Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, Yann Ponty
2022	A*	`conf`	Better Collective Decisions via Uncertainty Reduction. IJCAI Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh
2022	J	`jnl`	Better Collective Decisions via Uncertainty Reduction. CoRR Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh
2022	B	`conf`	Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette
2022	B	`conf`	Reordering a Tree According to an Order on Its Leaves. CPM Laurent Bulteau, Philippe Gambette, Olga Seminck
2022	J	`jnl`	Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. Algorithms Mol. Biol. Bertrand Marchand, Yann Ponty, Laurent Bulteau
2021	B	`conf`	A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. IPEC Laurent Bulteau, Bertrand Marchand, Yann Ponty
2021	J	`jnl`	Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation. J. Artif. Intell. Res. Laurent Bulteau, Gal Shahaf, Ehud Shapiro, Nimrod Talmon
2021	J	`jnl`	Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2021	B	`conf`	Disorders and Permutations. CPM Laurent Bulteau, Samuele Giraudo, Stéphane Vialette
2021	J	`jnl`	Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2021	J	`jnl`	Justified Representation for Perpetual Voting. IEEE Access Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, Nimrod Talmon
2021	J	`jnl`	Parameterized String Equations. CoRR Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
2021	A	`conf`	Partition Aggregation for Participatory Budgeting. AAMAS Pallavi Jain, Nimrod Talmon, Laurent Bulteau
2021	Misc	`conf`	Sequence Graphs Realizations and Ambiguity in Language Models. COCOON Sammy Khalife, Yann Ponty, Laurent Bulteau
2021	J	`jnl`	Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Laurent Bulteau, Ulisses Dias, Zanoni Dias
2021	J	`jnl`	Sorting by Multi-Cut Rearrangements. Algorithms Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021	B	`conf`	Sorting by Multi-cut Rearrangements. SOFSEM Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021	C	`conf`	Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. WABI Bertrand Marchand, Yann Ponty, Laurent Bulteau
2021	J	`jnl`	Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2020	J	`jnl`	Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica Laurent Bulteau, Markus L. Schmid
2020	J	`jnl`	Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. Laurent Bulteau, Stéphane Vialette
2020	J	`jnl`	The Clever Shopper Problem. Theory Comput. Syst. Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
2020	J	`jnl`	Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. Laurent Bulteau, Vincent Froese, Rolf Niedermeier
2019	B	`conf`	Finding a Small Number of Colourful Components. CPM Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2019	J	`jnl`	Parameterized Algorithms in Bioinformatics: An Overview. Algorithms Laurent Bulteau, Mathias Weller
2019	—	`conf`	Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2019	C	`conf`	Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2018	B	`conf`	Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS Laurent Bulteau, Markus L. Schmid
2018	J	`jnl`	Finding a Small Number of Colourful Components. CoRR Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2018	J	`jnl`	Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR Laurent Bulteau, Vincent Froese, Rolf Niedermeier
2018	C	`conf`	Pattern Matching for k-Track Permutations. IWOCA Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
2018	Misc	`conf`	The Clever Shopper Problem. CSR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2018	J	`jnl`	The Clever Shopper Problem. CoRR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2018	J	`jnl`	Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2017	B	`conf`	Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2017	J	`jnl`	Consensus Patterns parameterized by input string length is W[1]-hard. CoRR Laurent Bulteau
2017	J	`jnl`	Partitioning Perfect Graphs into Stars. J. Graph Theory René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2017	J	`jnl`	The Complexity of Finding Effectors. Theory Comput. Syst. Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2016	J	`jnl`	(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2016	J	`jnl`	Co-Clustering under the Maximum Norm. Algorithms Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2016	Misc	`conf`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. Laurent Bulteau, Guillaume Fertin, Eric Tannier
2016	J	`jnl`	Multi-Player Diffusion Games on Graph Classes. Internet Math. Laurent Bulteau, Vincent Froese, Nimrod Talmon
2016	—	`conf`	Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016	J	`jnl`	Precedence-constrained scheduling problems parameterized by partial order width. CoRR René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016	J	`jnl`	Triangle Counting in Dynamic Graph Streams. Algorithmica Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
2015	J	`jnl`	Co-Clustering Under the Maximum Norm. CoRR Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2015	J	`jnl`	Combinatorial voter control in elections. Theor. Comput. Sci. Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015	J	`jnl`	Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
2015	J	`jnl`	Fixed-parameter algorithms for scaffold filling. Theor. Comput. Sci. Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi
2015	C	`conf`	Multi-player Diffusion Games on Graph Classes. TAMC Laurent Bulteau, Vincent Froese, Nimrod Talmon
2015	J	`jnl`	Pancake Flipping is hard. J. Comput. Syst. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2015	J	`jnl`	Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2015	C	`conf`	The Complexity of Finding Effectors. TAMC Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2014	B	`conf`	Co-Clustering Under the Maximum Norm. ISAAC Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2014	J	`jnl`	Combinatorial Voter Control in Elections. CoRR Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	Computing an Evolutionary Ordering is Hard. CoRR Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
2014	C	`conf`	Fixed-Parameter Algorithms for Scaffold Filling. ISCO Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi
2014	A*	`conf`	Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. SODA Laurent Bulteau, Christian Komusiewicz
2014	J	`jnl`	Multi-Player Diffusion Games on Graph Classes. CoRR Laurent Bulteau, Vincent Froese, Nimrod Talmon
2014	J	`jnl`	Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
2014	B	`conf`	Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2014	—	`conf`	Star Partitions of Perfect Graphs. ICALP (1) René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Star Partitions of Perfect Graphs. CoRR René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	The Complexity of Finding Effectors. CoRR Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	Triangle counting in dynamic graph streams. CoRR Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh
2013	C	`conf`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	J	`jnl`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	—	`—`	Algorithmic Aspects of Genome Rearrangements. (Ordres et désordres dans l'algorithmique du génome). Laurent Bulteau
2013	J	`jnl`	Inapproximability of (1, 2)-Exemplar Distance. IEEE ACM Trans. Comput. Biol. Bioinform. Laurent Bulteau, Minghui Jiang
2013	J	`jnl`	Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms Laurent Bulteau, Guillaume Fertin, Irena Rusu
2013	J	`jnl`	Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable CoRR Laurent Bulteau, Christian Komusiewicz
2013	J	`jnl`	Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	B	`conf`	Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
2012	—	`conf`	Inapproximability of (1, 2)-Exemplar Distance. ISBRA Laurent Bulteau, Minghui Jiang
2012	B	`conf`	Pancake Flipping Is Hard. MFCS Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2011	J	`jnl`	Pancake Flipping is Hard CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	—	`conf`	Sorting by Transpositions Is Difficult. ICALP (1) Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	B	`conf`	Tractability and Approximability of Maximal Strip Recovery. CPM Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2010	C	`conf`	Revisiting the Minimum Breakpoint Linearization Problem. TAMC Laurent Bulteau, Guillaume Fertin, Irena Rusu
2010	J	`jnl`	Sorting by Transpositions is Difficult CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009	B	`conf`	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC Laurent Bulteau, Guillaume Fertin, Irena Rusu