Mathias Weller
Mathias Weller
LIGM, Paris, France
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
On tractable cases of target set selection
A Nichterlein, R Niedermeier, J Uhlmann, M Weller
Social Network Analysis and Mining 3 (2), 233-256, 2013
The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration
H Dell, C Komusiewicz, N Talmon, M Weller
12th international symposium on parameterized and exact computation (IPEC 2017), 2018
Interval scheduling and colorful independent sets
R Van Bevern, M Mnich, R Niedermeier, M Weller
Journal of Scheduling 18 (5), 449-469, 2015
Constant thresholds can make target set selection tractable
M Chopin, A Nichterlein, R Niedermeier, M Weller
Theory of Computing Systems 55 (1), 61-83, 2014
Chapter 2: The complexity of arc routing problems
R van Bevern, R Niedermeier, M Sorge, M Weller
Arc routing: Problems, methods, and applications, 19-52, 2015
Efficient algorithms for Eulerian extension and rural postman
F Dorn, H Moser, R Niedermeier, M Weller
SIAM Journal on Discrete Mathematics 27 (1), 75-94, 2013
A new view on Rural Postman based on Eulerian Extension and Matching
M Sorge, R Van Bevern, R Niedermeier, M Weller
Journal of Discrete Algorithms 16, 12-33, 2012
From few components to an Eulerian graph by adding arcs
M Sorge, R Bevern, R Niedermeier, M Weller
International Workshop on Graph-Theoretic Concepts in Computer Science, 307-318, 2011
Exact approaches for scaffolding
M Weller, A Chateau, R Giroudeau
BMC bioinformatics 16 (14), 1-18, 2015
On the complexity of hub labeling
M Babenko, AV Goldberg, H Kaplan, R Savchenko, M Weller
International Symposium on Mathematical Foundations of Computer Science, 62-74, 2015
On making directed graphs transitive
M Weller, C Komusiewicz, R Niedermeier, J Uhlmann
Journal of Computer and System Sciences 78 (2), 559-574, 2012
Polynomial-time data reduction for the subset interconnection design problem
J Chen, C Komusiewicz, R Niedermeier, M Sorge, O Suchy, M Weller
SIAM Journal on Discrete Mathematics 29 (1), 1-25, 2015
On the parameterized complexity of consensus clustering
M Dörnfelder, J Guo, C Komusiewicz, M Weller
Theoretical Computer Science 542, 71-82, 2014
Two-layer planarization parameterized by feedback edge set
J Uhlmann, M Weller
Theoretical Computer Science 494, 99-111, 2013
Linear-time computation of a linear problem kernel for dominating set on planar graphs
R Bevern, S Hartung, F Kammer, R Niedermeier, M Weller
International Symposium on Parameterized and Exact Computation, 194-206, 2011
What is known about vertex cover kernelization?
MR Fellows, L Jaffke, AI Király, FA Rosamond, M Weller
Adventures Between Lower Bounds and Higher Altitudes, 330-356, 2018
On the fixed parameter tractability of agreement-based phylogenetic distances
M Bordewich, C Scornavacca, N Tokac, M Weller
Journal of mathematical biology 74 (1), 239-257, 2017
Phylogenetic incongruence through the lens of Monadic Second Order logic
S Kelk, L Van Iersel, C Scornavacca
arXiv preprint arXiv:1503.00368, 2015
Parameterized algorithms in bioinformatics: an overview
L Bulteau, M Weller
Algorithms 12 (12), 256, 2019
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses
E Jacox, M Weller, E Tannier, C Scornavacca
Bioinformatics 33 (7), 980-987, 2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20