Eduard Eiben
Eduard Eiben
Lecturer in Computer Science, Royal Holloway, Univeristy of London
Verified email at - Homepage
Cited by
Cited by
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
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
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
Meta-kernelization using well-structured modulators
E Eiben, R Ganian, S Szeider
Discrete Applied Mathematics 248, 153-167, 2018
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
Towards a polynomial kernel for directed feedback vertex set
B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan
Algorithmica 83, 1201-1221, 2021
On the complexity of rainbow coloring problems
E Eiben, R Ganian, J Lauri
Discrete Applied Mathematics 246, 38-48, 2018
Extending partial 1-planar drawings
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2004.12222, 2020
Solving problems on graphs of high rank-width
E Eiben, R Ganian, S Szeider
Algorithmica 80, 742-771, 2018
Parameterized complexity of envy-free resource allocation in social networks
E Eiben, R Ganian, T Hamm, S Ordyniak
Artificial Intelligence 315, 103826, 2023
Counting linear extensions: Parameterizations by treewidth
E Eiben, R Ganian, K Kangas, S Ordyniak
Algorithmica 81, 1657-1683, 2019
A unifying framework for characterizing and computing width measures
E Eiben, R Ganian, T Hamm, L Jaffke, O Kwon
arXiv preprint arXiv:2109.14610, 2021
The Parameterized Complexity of Connected Fair Division.
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
IJCAI, 139-145, 2021
Symmetry properties of generalized graph truncations
E Eiben, R Jajcay, P Šparl
Journal of Combinatorial Theory, Series B 137, 291-315, 2019
Lossy kernels for hitting subgraphs
E Eiben, D Hermelin, MS Ramanujan
42nd International Symposium on Mathematical Foundations of Computer Science …, 2017
Toward Cereceda's conjecture for planar graphs
E Eiben, C Feghali
Journal of Graph Theory 94 (2), 267-277, 2020
A Structural Approach to Activity Selection.
E Eiben, R Ganian, S Ordyniak
IJCAI, 203-209, 2018
Equimatchable graphs on surfaces
E Eiben, M Kotrbčík
Journal of Graph Theory 81 (1), 35-49, 2016
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
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
The system can't perform the operation now. Try again later.
Articles 1–20