Mathias Weller
Mathias Weller
LIGM, Paris, France
Verified email at - Homepage
TitleCited byYear
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
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
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
Interval scheduling and colorful independent sets
R Van Bevern, M Mnich, R Niedermeier, M Weller
Journal of Scheduling 18 (5), 449-469, 2015
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
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
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
Exact approaches for scaffolding
M Weller, A Chateau, R Giroudeau
BMC bioinformatics 16 (14), S2, 2015
From few components to an Eulerian graph by adding arcs
M Sorge, R Van Bevern, R Niedermeier, M Weller
International Workshop on Graph-Theoretic Concepts in Computer Science, 307-318, 2011
On making directed graphs transitive
M Weller, C Komusiewicz, R Niedermeier, J Uhlmann
Journal of Computer and System Sciences 78 (2), 559-574, 2012
Linear-time computation of a linear problem kernel for dominating set on planar graphs
R Van Bevern, S Hartung, F Kammer, R Niedermeier, M Weller
International Symposium on Parameterized and Exact Computation, 194-206, 2011
Two-layer planarization parameterized by feedback edge set
J Uhlmann, M Weller
Theoretical Computer Science 494, 99-111, 2013
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
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
Dissolution dynamic nuclear polarization of deuterated molecules enhanced by cross-polarization
D Kurzbach, EMM Weber, A Jhajharia, SF Cousin, A Sadet, S Marhabaie, ...
The Journal of chemical physics 145 (19), 194203, 2016
On the fixed parameter tractability of agreement-based phylogenetic distances
M Bordewich, C Scornavacca, N Tokac, M Weller
Journal of mathematical biology 74 (1-2), 239-257, 2017
On the complexity of scaffolding problems: from cliques to sparse graphs
M Weller, A Chateau, R Giroudeau
Combinatorial Optimization and Applications, 409-423, 2015
Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
M Weller, A Chateau, C Dallard, R Giroudeau
Algorithmica 80 (6), 1771-1803, 2018
Extended islands of tractability for parsimony haplotyping
R Fleischer, J Guo, R Niedermeier, J Uhlmann, Y Wang, M Weller, X Wu
Annual Symposium on Combinatorial Pattern Matching, 214-226, 2010
The system can't perform the operation now. Try again later.
Articles 1–20