The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Laurent Bulteau" ( http://dblp.L3S.de/Authors/Laurent_Bulteau )

URL (Homepage):  http://tiny.cc/lbulteau  Author page on DBLP  Author page in RDF  Community of Laurent Bulteau in ASPL-2

Publication years (Num. hits)
2009-2013 (18) 2014-2015 (20) 2016-2018 (20) 2019 (2)
Publication types (Num. hits)
article(36) inproceedings(23) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 61 publication records. Showing 60 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette Finding a Small Number of Colourful Components. Search on Bibsonomy CPM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette The Clever Shopper Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette Finding a Small Number of Colourful Components. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Rolf Niedermeier Hardness of Consensus Problems for Circular Strings and Time Series Averaging. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Markus L. Schmid Consensus Strings with Small Maximum Distance and Small Distance Sum. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette The Clever Shopper Problem. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Romeo Rizzi, Stéphane Vialette Pattern Matching for k-Track Permutations. Search on Bibsonomy IWOCA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon The Complexity of Finding Effectors. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau Consensus Patterns parameterized by input string length is W[1]-hard. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Partitioning Perfect Graphs into Stars. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Beyond Adjacency Maximization: Scaffold Filling for New String Distances. Search on Bibsonomy CPM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Nimrod Talmon Multi-Player Diffusion Games on Graph Classes. Search on Bibsonomy Internet Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Eric Tannier Genome rearrangements with indels in intergenes restrict the scenario space. Search on Bibsonomy BMC Bioinformatics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh Triangle Counting in Dynamic Graph Streams. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu Decomposing Cubic Graphs into Connected Subgraphs of Size Three. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-constrained scheduling problems parameterized by partial order width. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier Co-Clustering under the Maximum Norm. Search on Bibsonomy Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. Search on Bibsonomy DOOR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu Decomposing Cubic Graphs into Connected Subgraphs of Size Three. Search on Bibsonomy COCOON The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri Computing an Evolutionary Ordering is Hard. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette Some algorithmic results for [2]-sumset covers. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon Combinatorial voter control in elections. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi Fixed-parameter algorithms for scaffold filling. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Pancake Flipping is hard. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier Co-Clustering Under the Maximum Norm. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Nimrod Talmon Multi-player Diffusion Games on Graph Classes. Search on Bibsonomy TAMC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon The Complexity of Finding Effectors. Search on Bibsonomy TAMC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Nimrod Talmon Multi-Player Diffusion Games on Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon Combinatorial Voter Control in Elections. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh Triangle counting in dynamic graph streams. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Star Partitions of Perfect Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon The Complexity of Finding Effectors. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri Computing an Evolutionary Ordering is Hard. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier Multivariate Algorithmics for NP-Hard String Problems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2014 DBLP  BibTeX  RDF
1Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier Co-Clustering Under the Maximum Norm. Search on Bibsonomy ISAAC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Christian Komusiewicz Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Reversal Distances for Strings with Few Blocks or Small Alphabets. Search on Bibsonomy CPM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Star Partitions of Perfect Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi Fixed-Parameter Algorithms for Scaffold Filling. Search on Bibsonomy ISCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Minghui Jiang 0001 Inapproximability of (1, 2)-Exemplar Distance. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Revisiting the Minimum Breakpoint Linearization Problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Maximal strip recovery problem with gaps: Hardness and approximation algorithms. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Christian Komusiewicz Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Search on Bibsonomy WABI The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau Algorithmic Aspects of Genome Rearrangements. (Ordres et désordres dans l'algorithmique du génome). Search on Bibsonomy 2013   RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Sorting by Transpositions Is Difficult. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Minghui Jiang 0001, Irena Rusu Tractability and approximability of maximal strip recovery. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Guillaume Blin, Laurent Bulteau, Minghui Jiang 0001, Pedro J. Tejada, Stéphane Vialette Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. Search on Bibsonomy CPM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Pancake Flipping Is Hard. Search on Bibsonomy MFCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Minghui Jiang 0001 Inapproximability of (1, 2)-Exemplar Distance. Search on Bibsonomy ISBRA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Pancake Flipping is Hard Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Minghui Jiang 0001, Irena Rusu Tractability and Approximability of Maximal Strip Recovery. Search on Bibsonomy CPM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Sorting by Transpositions Is Difficult. Search on Bibsonomy ICALP (1) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Sorting by Transpositions is Difficult Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Revisiting the Minimum Breakpoint Linearization Problem. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Irena Rusu Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity
Displaying result #1 - #60 of 60 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license