The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Mathias Weller" ( http://dblp.L3S.de/Authors/Mathias_Weller )

URL (Homepage):  http://www.lirmm.fr/~weller/  Author page on DBLP  Author page in RDF  Community of Mathias Weller in ASPL-2

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

Group by:
No Growbag Graphs found.

Results
Found 57 publication records. Showing 56 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. Search on Bibsonomy IWOCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller New Polynomial-Time Algorithm Around the Scaffolding Problem. Search on Bibsonomy AlCoB The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet On residual approximation in solution extension problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller What is known about Vertex Cover Kernelization? Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller Complexity and lowers bounds for Power Edge Set Problem. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller What Is Known About Vertex Cover Kernelization? Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathias Weller Linear-Time Tree Containment in Phylogenetic Networks. Search on Bibsonomy RECOMB-CG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. Search on Bibsonomy RECOMB-CG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau New Results About the Linearization of Scaffolds Sharing Repeated Contigs. Search on Bibsonomy COCOA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, Josef Malík, Mathias Weller Tree Containment With Soft Polytomies. Search on Bibsonomy SWAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nathann Cohen, Daniel Gonçalves 0001, Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller A polynomial-time algorithm for Outerplanar Diameter Improvement. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mathias Weller Linear-Time Tree Containment in Phylogenetic Networks. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller Constructing a Consensus Phylogeny from a Leaf-Removal Distance. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Edwin Jacox, Mathias Weller, Eric Tannier, Céline Scornavacca Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Search on Bibsonomy Bioinformatics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller Improved Complexity for Power Edge Set Problem. Search on Bibsonomy IWOCA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Rodolphe Giroudeau On the Linearization of Scaffolds Sharing Repeated Contigs. Search on Bibsonomy COCOA (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller New Insights for Power Edge Set Problem. Search on Bibsonomy COCOA (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). Search on Bibsonomy SPIRE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Steven Kelk, Leo van Iersel, Céline Scornavacca, Mathias Weller Phylogenetic incongruence through the lens of Monadic Second Order logic. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Valentin Garnero, Mathias Weller Parameterized certificate dispersal and its variants. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. Search on Bibsonomy COCOA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet On Residual Approximation in Solution Extension Problems. Search on Bibsonomy COCOA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller On the Complexity of Hub Labeling. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy J. Scheduling The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nathann Cohen, Daniel Gonçalves 0001, Eunjung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Search on Bibsonomy CSR The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Rodolphe Giroudeau On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. Search on Bibsonomy COCOA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller On the Complexity of Hub Labeling (Extended Abstract). Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller Exploiting a hypergraph model for finding Golomb rulers. Search on Bibsonomy Acta Inf. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller Constant Thresholds Can Make Target Set Selection Tractable. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nathann Cohen, Daniel Gonçalves 0001, Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller A Polynomial-time Algorithm for Outerplanar Diameter Improvement. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Mathias Weller Optimal Hub Labeling is NP-complete. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller On the parameterized complexity of consensus clustering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller Efficient Algorithms for Eulerian Extension and Rural Postman. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller On tractable cases of Target Set Selection. Search on Bibsonomy Social Netw. Analys. Mining The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Johannes Uhlmann, Mathias Weller Two-Layer Planarization parameterized by feedback edge set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy ISAAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mathias Weller An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. Search on Bibsonomy SEA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mathias Weller Aspects of preprocessing applied to combinatorial graph problems. Search on Bibsonomy 2013   RDF
1Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On making directed graphs transitive. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller A new view on Rural Postman based on Eulerian Extension and Matching. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval Scheduling and Colorful Independent Sets. Search on Bibsonomy ISAAC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller Exploiting a Hypergraph Model for Finding Golomb Rulers. Search on Bibsonomy ISCO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller Constant Thresholds Can Make Target Set Selection Tractable. Search on Bibsonomy MedAlg The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller A New View on Rural Postman Based on Eulerian Extension and Matching. Search on Bibsonomy IWOCA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller On the Parameterized Complexity of Consensus Clustering. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller From Few Components to an Eulerian Graph by Adding Arcs. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller On Tractable Cases of Target Set Selection. Search on Bibsonomy ISAAC (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu 0001 Extended Islands of Tractability for Parsimony Haplotyping. Search on Bibsonomy CPM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller Efficient Algorithms for Eulerian Extension. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Johannes Uhlmann, Mathias Weller Two-Layer Planarization Parameterized by Feedback Edge Set. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On Making Directed Graphs Transitive. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #56 of 56 (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