Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Bulteau
- > Home > Persons > Laurent Bulteau
Publications
- 2022
[c35]Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17- 2021
- [j29]Laurent Bulteau
, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (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) - [c26]Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - 2019
- [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 - 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) - 2017
- [c18]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM 2017: 27:1-27: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) - [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 - [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) - 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) - 2014
- [c13]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59 - 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) - [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 - [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) - [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) - 2009
- [c1]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719
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-02-20 20:11 CET 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:
