Henning Fernau 个人学术档案

引用次数

	总计	2019 年至今
引用	5995	1744
h 指数	41	21
i10 指数	148	60

380

190

285

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202419 26 70 49 25 58 52 79 115 162 129 160 179 200 227 221 306 217 305 247 271 220 262 283 275 305 259 332 380 294 160

开放获取的出版物数量

查看全部

41 篇文章

9 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Rolf NiedermeierTU Berlin在 tu-berlin.de 的电子邮件经过验证
Rudolf FreundProfessor of Computer Science, TU Wien在 emcc.at 的电子邮件经过验证
Markus L. SchmidPost-Doc Researcher, Theoretical Computer Science, Humboldt University Berlin在 mlschmid.de 的电子邮件经过验证
Lakshmanan KuppusamyProfessor, School of Comp. Sci. & Engg. (SCOPE), VIT University, Vellore - 632 014, INDIA在 vit.ac.in 的电子邮件经过验证
Mathieu LiedloffProfesseur des Universités, université d'Orléans在 univ-orleans.fr 的电子邮件经过验证
Markus HolzerProfessor für Informatik, Universität Giessen在 in.tum.de 的电子邮件经过验证
Faisal N. Abu-KhzamProfessor of Computer Science, Lebanese American University在 lau.edu.lb 的电子邮件经过验证
Ljiljana BrankovicProfessor in Computational Science, University of New England在 une.edu.au 的电子邮件经过验证
Juan Alberto Rodriguez-VelazquezApplied Mathematics, Universitat Rovira i Virgili (Spain)在 urv.cat 的电子邮件经过验证
Saket SaurabhProfessor at Institute of Mathematical Sciences在 imsc.res.in 的电子邮件经过验证
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
jerome monnotdirecteur de recherche, Lamsade, université Paris-Dauphine在 lamsade.dauphine.fr 的电子邮件经过验证
Yngve VillangerUniversity of Bergen在 uib.no 的电子邮件经过验证
Sergio BermudoUniversidad Pablo de Olavide在 upo.es 的电子邮件经过验证
Serge GaspersProfessor, UNSW Sydney, Australia在 cse.unsw.edu.au 的电子邮件经过验证
Petra WolfUniversity of Bordeaux在 wolfp.net 的电子邮件经过验证
Hans L. BodlaenderProfessor Computer Science, Utrecht University在 uu.nl 的电子邮件经过验证
Daniel LokshtanovProfessor of Computer Science, UCSB在 ucsb.edu 的电子邮件经过验证
Meenakshi ParamasivanUniversity of Trier, Germany在 informatik.uni-trier.de 的电子邮件经过验证
Michael FellowsProfessor of Informatics, University of Bergen在 uib.no 的电子邮件经过验证

关注

Henning Fernau

Professor für Informatik, Universität Trier

在 uni-trier.de 的电子邮件经过验证

Theoretische Informatik Formale Sprachen Lernalgorithmen parameterisierte Algorithmen Graphentheorie


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	385*	2002
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size J Chen, H Fernau, IA Kanj, G Xia SIAM Journal on Computing 37 (4), 1077-1106, 2007	183	2007
Parameterized complexity: exponential speed-up for planar graph problems J Alber, H Fernau, R Niedermeier Journal of Algorithms 52 (1), 26-56, 2004	156	2004
Kernel (s) for problems with no kernel: On out-trees with many leaves D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ... ACM Transactions on Algorithms (TALG) 8 (4), 1-19, 2012	152*	2012
Algorithms for learning regular expressions from positive data H Fernau Information and Computation 207 (4), 521-541, 2009	127*	2009
A refined search tree technique for dominating set on planar graphs J Alber, H Fan, MR Fellows, H Fernau, R Niedermeier, F Rosamond, ... Journal of Computer and System Sciences 71 (4), 385-405, 2005	115*	2005
Parameterized algorithmics: A graph-theoretic approach H Fernau Habilitationsschrift, Universität Tübingen, Germany, 2005	103	2005
Vertex and edge covers with clustering properties: Complexity and algorithms H Fernau, DF Manlove Journal of Discrete Algorithms 7 (2), 149-167, 2009	82	2009
The differential and the Roman domination number of a graph S Bermudo, H Fernau, JM Sigarreta Applicable Analysis and Discrete Mathematics, 155-171, 2014	75	2014
Infinite iterated function systems H Fernau Mathematische Nachrichten 170 (1), 79-91, 1994	75	1994
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results H Fernau, JA Rodríguez-Velázquez Discrete Applied Mathematics 236, 183-202, 2018	74*	2018
On parameterized enumeration H Fernau International Computing and Combinatorics Conference, 564-573, 2002	74	2002
edge dominating set: Efficient Enumeration-Based Exact Algorithms H Fernau International Workshop on Parameterized and Exact Computation, 142-153, 2006	72	2006
An exact algorithm for the maximum leaf spanning tree problem H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ... Theoretical Computer Science 412 (45), 6290-6302, 2011	70	2011
Comparing trees via crossing minimization H Fernau, M Kaufmann, M Poths Journal of Computer and System Sciences 76 (7), 593-608, 2010	69*	2010
Identification of function distinguishable languages H Fernau Theoretical Computer Science 290 (3), 1679-1711, 2003	65*	2003
Exact and parameterized algorithms for max internal spanning tree D Binkele-Raible, H Fernau, S Gaspers, M Liedloff Algorithmica 65 (1), 95-128, 2013	63*	2013
The complexity of probabilistic lobbying D Binkele-Raible, G Erdélyi, H Fernau, J Goldsmith, N Mattei, J Rothe Discrete Optimization 11, 1-21, 2014	62*	2014
Facility location problems: A parameterized view MR Fellows, H Fernau Discrete Applied Mathematics 159 (11), 1118-1130, 2011	62*	2011
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set H Fernau Algorithmica 57, 97-118, 2010	61*	2010

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用