| 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 | 36 | 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 | 33 | 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 | 33 | 2017 |
| Towards a polynomial kernel for directed feedback vertex set B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan Algorithmica 83, 1201-1221, 2021 | 28 | 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 | 28 | 2018 |
| Extending partial 1-planar drawings E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg arXiv preprint arXiv:2004.12222, 2020 | 23 | 2020 |
| Meta-kernelization using well-structured modulators E Eiben, R Ganian, S Szeider Discrete Applied Mathematics 248, 153-167, 2018 | 23 | 2018 |
| Parameterized complexity of envy-free resource allocation in social networks E Eiben, R Ganian, T Hamm, S Ordyniak Artificial Intelligence 315, 103826, 2023 | 21 | 2023 |
| The Parameterized Complexity of Connected Fair Division. A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak IJCAI, 139-145, 2021 | 20 | 2021 |
| On the complexity of rainbow coloring problems E Eiben, R Ganian, J Lauri Discrete Applied Mathematics 246, 38-48, 2018 | 20 | 2018 |
| Counting linear extensions: Parameterizations by treewidth E Eiben, R Ganian, K Kangas, S Ordyniak Algorithmica 81, 1657-1683, 2019 | 18 | 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 | 17 | 2021 |
| 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 | 15 | 2020 |
| 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 | 15 | 2018 |
| Solving problems on graphs of high rank-width E Eiben, R Ganian, S Szeider Algorithmica 80, 742-771, 2018 | 15 | 2018 |
| 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 | 14 | 2021 |
| Symmetry properties of generalized graph truncations E Eiben, R Jajcay, P Šparl Journal of Combinatorial Theory, Series B 137, 291-315, 2019 | 14 | 2019 |
| The complexity of envy-free graph cutting A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak arXiv preprint arXiv:2312.07043, 2023 | 12 | 2023 |
| Minimizing reachability times on temporal graphs via shifting labels A Deligkas, E Eiben, G Skretas arXiv preprint arXiv:2112.08797, 2021 | 12 | 2021 |
| 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 | 12 | 2019 |
Robert GanianTU Wienac.tuwien.ac.at의 이메일 확인됨
