Mathias Weller

Cited by

	All	Since 2018
Citations	881	563
h-index	17	13
i10-index	23	19

120

201120122013201420152016201720182019202020212022202310 16 43 52 44 62 75 108 103 107 97 108 38

Public access

View all

19 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
Annie ChateauMaître de conférences, Université de MontpellierVerified email at lirmm.fr
Rodolphe GiroudeauVerified email at lirmm.fr
Manuel SorgeTU WienVerified email at ac.tuwien.ac.at
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
René van BevernHuawei Technologies Co., Ltd.Verified email at huawei.com
Celine ScornavaccaInstitut des Sciences de l'Evolution, MontpellierVerified email at umontpellier.fr
André NichterleinTU BerlinVerified email at tu-berlin.de
Davot TomLIRMMVerified email at lirmm.fr
Benoît DartiesMaître de conférence, LE2I - Université de BourgogneVerified email at u-bourgogne.fr
Holger DellGoethe University FrankfurtVerified email at uni-frankfurt.de
Leo van IerselAssociate professor, TU DelftVerified email at tudelft.nl
Morgan ChopinLAMSADE, Université Paris-DauphineVerified email at lamsade.dauphine.fr
Matthias MnichTU HamburgVerified email at tuhh.de
Ondra SuchýAssistant Professor of Theoretical Computer Science, Czech Technical UniversityVerified email at fit.cvut.cz
Jiehua ChenTU ViennaVerified email at tuwien.ac.at
Clément DallardLIFO, Université d'Orléans, FranceVerified email at univ-orleans.fr
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Lars JaffkeUniversity of Bergen, NorwayVerified email at uib.no

Mathias Weller

LIGM, Paris, France

Verified email at u-pem.fr - Homepage

Graph Theory Parameterized Complexity Bioinformatics Algorithmics NP-hardness


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	88	2018
On tractable cases of target set selection A Nichterlein, R Niedermeier, J Uhlmann, M Weller Social Network Analysis and Mining 3, 233-256, 2013	87	2013
Constant thresholds can make target set selection tractable M Chopin, A Nichterlein, R Niedermeier, M Weller Theory of Computing Systems 55, 61-83, 2014	67	2014
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015	66	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	47	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	44*	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	37	2012
From Few Components to an Eulerian Graph by Adding Arcs. M Sorge, R Van Bevern, R Niedermeier, M Weller WG, 307-318, 2011	30	2011
Exact approaches for scaffolding M Weller, A Chateau, R Giroudeau BMC bioinformatics 16 (14), 1-18, 2015	29	2015
The graph parameter hierarchy M Sorge, M Weller Unpublished manuscript, 3, 2019	28	2019
On the complexity of hub labeling M Babenko, AV Goldberg, H Kaplan, R Savchenko, M Weller Mathematical Foundations of Computer Science 2015: 40th International …, 2015	25*	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	23	2012
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: Essays Dedicated to …, 2018	21	2018
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	21*	2015
Two-layer planarization parameterized by feedback edge set J Uhlmann, M Weller Theoretical Computer Science 494, 99-111, 2013	21	2013
On the parameterized complexity of consensus clustering M Dörnfelder, J Guo, C Komusiewicz, M Weller Theoretical Computer Science 542, 71-82, 2014	19	2014
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 Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012	18	2012
Phylogenetic incongruence through the lens of Monadic Second Order logic S Kelk, L Van Iersel, C Scornavacca arXiv preprint arXiv:1503.00368, 2015	15	2015
Parameterized algorithms in bioinformatics: an overview L Bulteau, M Weller Algorithms 12 (12), 256, 2019	14	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	14	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors