Eduard Eiben

Cited by

	All	Since 2018
Citations	456	422
h-index	11	11
i10-index	16	14

140

105

2015201620172018201920202021202220232 7 17 33 34 67 81 123 69

Public access

View all

32 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Robert GanianTU WienVerified email at ac.tuwien.ac.at
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Dusan KnopCzech Technical University in PragueVerified email at fit.cvut.cz
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
O-joung KwonHanyang UniversityVerified email at hanyang.ac.kr
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.in
Argyrios DeligkasRoyal Holloway University of LondonVerified email at rhul.ac.uk
Lochet WilliamCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Amer MouawadAmerican University of BeirutVerified email at aub.edu.lb
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
Fabian KlutePolytechnic University of CataloniaVerified email at upc.edu
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Juho LauriOP Financial GroupVerified email at op.fi

Eduard Eiben

Lecturer in Computer Science, Royal Holloway, Univeristy of London

Verified email at rhul.ac.uk - Homepage

Algorithms Complexity Theory Parameterized Complexity Graph Theory Artificial Intelligence


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Lossy kernels for connected dominating set on sparse graphs E Eiben, M Kumar, AE Mouawad, F Panolan, S Siebertz SIAM Journal on Discrete Mathematics 33 (3), 1743-1771, 2019	31	2019
Solving integer linear programs with a small number of global variables and constraints P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak arXiv preprint arXiv:1706.06084, 2017	28	2017
Measuring what matters: A hybrid approach to dynamic programming with treewidth E Eiben, R Ganian, T Hamm, O Kwon Journal of Computer and System Sciences 121, 57-75, 2021	23	2021
Improved results for minimum constraint removal E Eiben, J Gemmell, I Kanj, A Youngdahl Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018	23	2018
Meta-kernelization using well-structured modulators E Eiben, R Ganian, S Szeider Discrete Applied Mathematics 248, 153-167, 2018	20	2018
Towards a polynomial kernel for directed feedback vertex set B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan Algorithmica 83, 1201-1221, 2021	19	2021
On the complexity of rainbow coloring problems E Eiben, R Ganian, J Lauri Discrete Applied Mathematics 246, 38-48, 2018	17	2018
Extending partial 1-planar drawings E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg arXiv preprint arXiv:2004.12222, 2020	16	2020
Symmetry properties of generalized graph truncations E Eiben, R Jajcay, P Šparl Journal of Combinatorial Theory, Series B 137, 291-315, 2019	13	2019
Counting linear extensions: Parameterizations by treewidth E Eiben, R Ganian, K Kangas, S Ordyniak Algorithmica 81, 1657-1683, 2019	13	2019
Solving problems on graphs of high rank-width E Eiben, R Ganian, S Szeider Algorithmica 80, 742-771, 2018	13	2018
Parameterized complexity of envy-free resource allocation in social networks E Eiben, R Ganian, T Hamm, S Ordyniak Artificial Intelligence 315, 103826, 2023	11	2023
Lossy kernels for hitting subgraphs E Eiben, D Hermelin, MS Ramanujan 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017	11	2017
Toward Cereceda's conjecture for planar graphs E Eiben, C Feghali Journal of Graph Theory 94 (2), 267-277, 2020	10	2020
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion E Eiben, R Ganian, O Kwon Journal of Computer and System Sciences 97, 121-146, 2018	10	2018
Equimatchable graphs on surfaces E Eiben, M Kotrbčík Journal of Graph Theory 81 (1), 35-49, 2016	10	2016
Extending nearly complete 1-planar drawings in polynomial time E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg arXiv preprint arXiv:2007.05346, 2020	9	2020
A polynomial kernel for paw-free editing E Eiben, W Lochet, S Saurabh arXiv preprint arXiv:1911.03683, 2019	9	2019
Unary Integer Linear Programming with Structural Restrictions. E Eiben, R Ganian, D Knop, S Ordyniak IJCAI, 1284-1290, 2018	9	2018
Small resolution proofs for QBF using dependency treewidth E Eiben, R Ganian, S Ordyniak arXiv preprint arXiv:1711.02120, 2017	9	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