PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bulteau, Laurent"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Finding Effectors.

, , , , and . Theory Comput. Syst., 60 (2): 253-279 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. Laurent Helden University of Stuttgart

 

Other publications of authors with the same name

Maximal strip recovery problem with gaps: Hardness and approximation algorithms., , and . J. Discrete Algorithms, (2013)Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable., and . SODA, page 102-121. SIAM, (2014)Tractability and approximability of maximal strip recovery., , , and . Theor. Comput. Sci., (2012)Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 710-719. Springer, (2009)Tractability and Approximability of Maximal Strip Recovery., , , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 336-349. Springer, (2011)Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths., , , , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 138-148. Springer, (2012)Co-Clustering Under the Maximum Norm., , , and . CoRR, (2015)Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors., , , and . CoRR, (2018)Finding a Small Number of Colourful Components., , , , , and . CoRR, (2018)Consensus Strings with Small Maximum Distance and Small Distance Sum., and . MFCS, volume 117 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)