default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Bulteau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]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: 103546 (2024)- [j34]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): 1315-1350 (2024) - [c38]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: 19:1-19:23 - [i23]Sammy Khalife, Yann Ponty, Laurent Bulteau:
Sequence graphs realizations and ambiguity in language models. CoRR abs/2402.08830 (2024) - 2023
- [j33]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): 18 (2023) - [j32]Laurent Bulteau, Vincent Jugé, Stéphane Vialette:
On shuffled-square-free words. Theor. Comput. Sci. 941: 91-103 (2023) - [c37]Laurent Bulteau, Pierre-Yves David, Florian Horn:
The Problem of Discovery in Version Control Systems. LAGOS 2023: 209-216 - [e1]Laurent Bulteau, Zsuzsanna Lipták:
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. LIPIcs 259, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-276-1 [contents] - 2022
- [j31]Bertrand Marchand, Yann Ponty, Laurent Bulteau:
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. Algorithms Mol. Biol. 17(1): 8 (2022) - [c36]Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau:
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM 2022: 6:1-6:11 - [c35]Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17 - [c34]Laurent Bulteau, Philippe Gambette, Olga Seminck:
Reordering a Tree According to an Order on Its Leaves. CPM 2022: 24:1-24:15 - [c33]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. IJCAI 2022: 24-30 - [c32]Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, Yann Ponty:
Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots. WABI 2022: 7:1-7:24 - [c31]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. WG 2022: 114-128 - [i22]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR abs/2201.11731 (2022) - [i21]Laurent Bulteau, Jiehua Chen:
2-Dimensional Euclidean Preferences. CoRR abs/2205.14687 (2022) - [i20]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. CoRR abs/2207.04983 (2022) - 2021
- [j30]Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, Nimrod Talmon:
Justified Representation for Perpetual Voting. IEEE Access 9: 96598-96612 (2021) - [j29]Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (2021) - [j28]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: 406-421 (2021) - [j27]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: 1413-1439 (2021) - [j26]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: 75-96 (2021) - [j25]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98(4): 557-588 (2021) - [j24]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): 2870-2876 (2021) - [c30]Pallavi Jain, Nimrod Talmon, Laurent Bulteau:
Partition Aggregation for Participatory Budgeting. AAMAS 2021: 665-673 - [c29]Sammy Khalife, Yann Ponty, Laurent Bulteau:
Sequence Graphs Realizations and Ambiguity in Language Models. COCOON 2021: 153-163 - [c28]Laurent Bulteau, Samuele Giraudo, Stéphane Vialette:
Disorders and Permutations. CPM 2021: 11:1-11:15 - [c27]Laurent Bulteau, Bertrand Marchand, Yann Ponty:
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. IPEC 2021: 11:1-11:15 - [c26]Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - [c25]Bertrand Marchand, Yann Ponty, Laurent Bulteau:
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. WABI 2021: 7:1-7:23 - [i19]Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond:
Parameterized String Equations. CoRR abs/2104.14171 (2021) - 2020
- [j23]Laurent Bulteau, Markus L. Schmid:
Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica 82(5): 1378-1409 (2020) - [j22]Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - [j21]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34(3): 1854-1883 (2020) - [j20]Laurent Bulteau, Stéphane Vialette:
Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. 806: 116-132 (2020)
2010 – 2019
- 2019
- [j19]Laurent Bulteau, Mathias Weller:
Parameterized Algorithms in Bioinformatics: An Overview. Algorithms 12(12): 256 (2019) - [c24]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: 99-111 - [c23]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c22]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: 136-145 - 2018
- [c21]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CSR 2018: 53-64 - [c20]Laurent Bulteau, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for k-Track Permutations. IWOCA 2018: 102-114 - [c19]Laurent Bulteau, Markus L. Schmid:
Consensus Strings with Small Maximum Distance and Small Distance Sum. MFCS 2018: 1:1-1:15 - [i18]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - [i17]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR abs/1804.02854 (2018) - [i16]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - [i15]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 abs/1811.09411 (2018) - 2017
- [j18]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): 297-335 (2017) - [j17]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - [c18]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM 2017: 27:1-27:17 - [i14]Laurent Bulteau:
Consensus Patterns parameterized by input string length is W[1]-hard. CoRR abs/1702.08238 (2017) - 2016
- [j16]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. Algorithmica 76(1): 259-278 (2016) - [j15]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering under the Maximum Norm. Algorithms 9(1): 17 (2016) - [j14]Laurent Bulteau, Guillaume Fertin, Eric Tannier:
Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 17(S-14): 225-231 (2016) - [j13]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12(6): 363-380 (2016) - [j12]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37: 44-55 (2016) - [c17]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON 2016: 393-404 - [c16]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: 105-120 - [i13]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR abs/1604.08603 (2016) - [i12]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - 2015
- [j11]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. 50: 255-260 (2015) - [j10]Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015) - [j9]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping is hard. J. Comput. Syst. Sci. 81(8): 1556-1574 (2015) - [j8]Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
Fixed-parameter algorithms for scaffold filling. Theor. Comput. Sci. 568: 72-83 (2015) - [j7]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [c15]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. TAMC 2015: 200-211 - [c14]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - [i11]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. CoRR abs/1512.05693 (2015) - 2014
- [j6]Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS 114 (2014) - [c13]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59 - [c12]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c11]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - [c10]Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
Fixed-Parameter Algorithms for Scaffold Filling. ISCO 2014: 137-148 - [c9]Laurent Bulteau, Christian Komusiewicz:
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. SODA 2014: 102-121 - [i10]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i9]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle counting in dynamic graph streams. CoRR abs/1404.4696 (2014) - [i8]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i7]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. CoRR abs/1410.6663 (2014) - [i6]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. CoRR abs/1411.7838 (2014) - [i5]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. CoRR abs/1412.2544 (2014) - 2013
- [b1]Laurent Bulteau:
Algorithmic Aspects of Genome Rearrangements. (Ordres et désordres dans l'algorithmique du génome). University of Nantes, France, 2013 - [j5]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms 19: 1-22 (2013) - [j4]Laurent Bulteau, Minghui Jiang:
Inapproximability of (1, 2)-Exemplar Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1384-1390 (2013) - [j3]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. 494: 122-133 (2013) - [c8]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu:
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI 2013: 244-258 - [i4]Laurent Bulteau, Christian Komusiewicz:
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable. CoRR abs/1305.0649 (2013) - [i3]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu:
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR abs/1307.7842 (2013) - 2012
- [j2]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. 26(3): 1148-1180 (2012) - [j1]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu:
Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440-441: 14-28 (2012) - [c7]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: 138-148 - [c6]Laurent Bulteau, Minghui Jiang:
Inapproximability of (1, 2)-Exemplar Distance. ISBRA 2012: 13-23 - [c5]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping Is Hard. MFCS 2012: 247-258 - 2011
- [c4]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu:
Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349 - [c3]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Sorting by Transpositions Is Difficult. ICALP (1) 2011: 654-665 - [i2]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping is Hard. CoRR abs/1111.0434 (2011) - 2010
- [c2]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Revisiting the Minimum Breakpoint Linearization Problem. TAMC 2010: 163-174 - [i1]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Sorting by Transpositions is Difficult. CoRR abs/1011.1157 (2010)
2000 – 2009
- 2009
- [c1]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
