Henning Fernau

Citada per

	Totes	Des de 2020
Citacions	6318	1675
Índex h	43	20
Índex i10	152	58

400

200

100

300

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202519 26 70 49 25 59 56 83 123 168 132 159 197 192 228 220 304 220 304 253 276 225 282 295 274 312 263 349 393 290 303 66

Accés públic

Mostra-ho tot

47 articles

5 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Rolf NiedermeierTU BerlinCorreu electrònic verificat a tu-berlin.de
Markus L. SchmidPost-Doc Researcher, Theoretical Computer Science, Humboldt University BerlinCorreu electrònic verificat a mlschmid.de
Rudolf FreundProfessor of Computer Science, TU WienCorreu electrònic verificat a emcc.at
Lakshmanan KuppusamyProfessor, School of Comp. Sci. & Engg. (SCOPE), VIT University, Vellore - 632 014, INDIACorreu electrònic verificat a vit.ac.in
Indhumathi RamanProfessorCorreu electrònic verificat a srmist.edu.in
Katrin CaselHumboldt-University BerlinCorreu electrònic verificat a hu-berlin.de
Mathieu LiedloffProfesseur des Universités, université d'OrléansCorreu electrònic verificat a univ-orleans.fr
Markus HolzerProfessor für Informatik, Universität GiessenCorreu electrònic verificat a in.tum.de
Ljiljana BrankovicProfessor in Computational Science, University of New EnglandCorreu electrònic verificat a une.edu.au
Faisal N. Abu-KhzamProfessor of Computer Science, Lebanese American UniversityCorreu electrònic verificat a lau.edu.lb
Juan Alberto Rodriguez-VelazquezApplied Mathematics, Universitat Rovira i Virgili (Spain)Correu electrònic verificat a urv.cat
Saket SaurabhProfessor at Institute of Mathematical SciencesCorreu electrònic verificat a imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenCorreu electrònic verificat a uib.no
jerome monnotdirecteur de recherche, Lamsade, université Paris-DauphineCorreu electrònic verificat a lamsade.dauphine.fr
Yngve VillangerUniversity of BergenCorreu electrònic verificat a uib.no
Sergio BermudoUniversidad Pablo de OlavideCorreu electrònic verificat a upo.es
Petra WolfUniversity of BordeauxCorreu electrònic verificat a wolfp.net
Serge GaspersProfessor, UNSW Sydney, AustraliaCorreu electrònic verificat a cse.unsw.edu.au
Meenakshi ParamasivanUniversity of Trier, GermanyCorreu electrònic verificat a informatik.uni-trier.de
Daniel LokshtanovProfessor of Computer Science, UCSBCorreu electrònic verificat a ucsb.edu

Segueix

Henning Fernau

Professor für Informatik, Universität Trier

Correu electrònic verificat a uni-trier.de

Theoretische Informatik Formale Sprachen Lernalgorithmen parameterisierte Algorithmen Graphentheorie


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	388*	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	185	2007
Parameterized complexity: exponential speed-up for planar graph problems J Alber, H Fernau, R Niedermeier Journal of Algorithms 52 (1), 26-56, 2004	158	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	154*	2012
Algorithms for learning regular expressions from positive data H Fernau Information and Computation 207 (4), 521-541, 2009	129*	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	114*	2005
Parameterized algorithmics: A graph-theoretic approach H Fernau Habilitationsschrift, Universität Tübingen, Germany, 2005	102	2005
Vertex and edge covers with clustering properties: Complexity and algorithms H Fernau, DF Manlove Journal of Discrete Algorithms 7 (2), 149-167, 2009	87	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	82	2014
On parameterized enumeration H Fernau International Computing and Combinatorics Conference, 564-573, 2002	80	2002
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	79*	2018
Infinite iterated function systems H Fernau Mathematische Nachrichten 170 (1), 79-91, 1994	78	1994
edge dominating set: Efficient Enumeration-Based Exact Algorithms H Fernau International Workshop on Parameterized and Exact Computation, 142-153, 2006	75	2006
Comparing trees via crossing minimization H Fernau, M Kaufmann, M Poths Journal of Computer and System Sciences 76 (7), 593-608, 2010	74*	2010
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	71	2011
Fixed parameter algorithms for one-sided crossing minimization revisited V Dujmović, H Fernau, M Kaufmann Journal of Discrete Algorithms 6 (2), 313-323, 2008	70*	2008
Identification of function distinguishable languages H Fernau Theoretical Computer Science 290 (3), 1679-1711, 2003	70*	2003
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set H Fernau Algorithmica 57, 97-118, 2010	66*	2010
Exact and parameterized algorithms for max internal spanning tree D Binkele-Raible, H Fernau, S Gaspers, M Liedloff Algorithmica 65 (1), 95-128, 2013	65*	2013
Facility location problems: A parameterized view MR Fellows, H Fernau Discrete Applied Mathematics 159 (11), 1118-1130, 2011	62*	2011

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors