Eduard Eiben
Eduard Eiben
Lecturer in Computer Science, Royal Holloway, Univeristy of London
Verified email at rhul.ac.uk - Homepage
TitleCited byYear
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
122019
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
122017
Meta-kernelization using well-structured modulators
E Eiben, R Ganian, S Szeider
Discrete Applied Mathematics 248, 153-167, 2018
92018
On the complexity of rainbow coloring problems
E Eiben, R Ganian, J Lauri
Discrete Applied Mathematics 246, 38-48, 2018
92018
Solving problems on graphs of high rank-width
E Eiben, R Ganian, S Szeider
Algorithmica 80 (2), 742-771, 2018
92018
Equimatchable graphs on surfaces
E Eiben, M KotrbčŪk
Journal of Graph Theory 81 (1), 35-49, 2016
92016
Using decomposition-parameters for QBF: mind the prefix!
E Eiben, R Ganian, S Ordyniak
Journal of Computer and System Sciences, 2020
82020
Counting linear extensions: Parameterizations by treewidth
E Eiben, R Ganian, K Kangas, S Ordyniak
Algorithmica 81 (4), 1657-1683, 2019
82019
Unary Integer Linear Programming with Structural Restrictions.
E Eiben, R Ganian, D Knop, S Ordyniak
IJCAI, 1284-1290, 2018
62018
Improved results for minimum constraint removal
E Eiben, J Gemmell, I Kanj, A Youngdahl
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
52018
Towards a polynomial kernel for directed feedback vertex set
B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan
42nd International Symposium on Mathematical Foundations of Computer Science†…, 2017
52017
Small resolution proofs for QBF using dependency treewidth
E Eiben, R Ganian, S Ordyniak
arXiv preprint arXiv:1711.02120, 2017
42017
Lossy kernels for hitting subgraphs
E Eiben, D Hermelin, MS Ramanujan
42nd International Symposium on Mathematical Foundations of Computer Science†…, 2017
32017
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
E Eiben, R Ganian, O Kwon
arXiv preprint arXiv:1604.06056, 2016
32016
Equimatchable factor-critical graphs and independence number 2
E Eiben, M Kotrbcik
arXiv preprint arXiv:1501.07549, 2015
32015
Integer Programming and Incidence Treedepth
E Eiben, R Ganian, D Knop, S Ordyniak, M Pilipczuk, M Wrochna
International Conference on Integer Programming and Combinatorial†…, 2019
22019
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
22018
Towards Cereceda's conjecture for planar graphs
E Eiben, C Feghali
arXiv preprint arXiv:1810.00731, 2018
22018
How to navigate through obstacles?
E Eiben, I Kanj
arXiv preprint arXiv:1712.04043, 2017
22017
A Structural Approach to Activity Selection.
E Eiben, R Ganian, S Ordyniak
IJCAI, 203-209, 2018
12018
The system can't perform the operation now. Try again later.
Articles 1–20