Sledovať
Eduard Eiben
Eduard Eiben
Lecturer in Computer Science, Royal Holloway, Univeristy of London
Overená e-mailová adresa na: rhul.ac.uk - Domovská stránka
Názov
Citované v
Citované v
Rok
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
372019
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
342017
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
322021
Towards a polynomial kernel for directed feedback vertex set
B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan
Algorithmica 83, 1201-1221, 2021
282021
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
282018
Extending partial 1-planar drawings
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2004.12222, 2020
232020
Meta-kernelization using well-structured modulators
E Eiben, R Ganian, S Szeider
Discrete Applied Mathematics 248, 153-167, 2018
232018
Parameterized complexity of envy-free resource allocation in social networks
E Eiben, R Ganian, T Hamm, S Ordyniak
Artificial Intelligence 315, 103826, 2023
212023
On the complexity of rainbow coloring problems
E Eiben, R Ganian, J Lauri
Discrete Applied Mathematics 246, 38-48, 2018
212018
The Parameterized Complexity of Connected Fair Division.
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
IJCAI 21, 139-145, 2021
202021
Counting linear extensions: Parameterizations by treewidth
E Eiben, R Ganian, K Kangas, S Ordyniak
Algorithmica 81, 1657-1683, 2019
182019
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
172021
Determinantal sieving
E Eiben, T Koana, M Wahlström
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
152024
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
152020
Complexity of the Steiner network problem with respect to the number of terminals
E Eiben, D Knop, F Panolan, O Suchý
arXiv preprint arXiv:1802.08189, 2018
152018
Solving problems on graphs of high rank-width
E Eiben, R Ganian, S Szeider
Algorithmica 80, 742-771, 2018
152018
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints
P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak
Artificial Intelligence 300, 103561, 2021
142021
Minimizing reachability times on temporal graphs via shifting labels
A Deligkas, E Eiben, G Skretas
arXiv preprint arXiv:2112.08797, 2021
132021
Symmetry properties of generalized graph truncations
E Eiben, R Jajcay, P Šparl
Journal of Combinatorial Theory, Series B 137, 291-315, 2019
132019
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
132019
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20