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 | 12 | 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 | 12 | 2017 |

Meta-kernelization using well-structured modulators E Eiben, R Ganian, S Szeider Discrete Applied Mathematics 248, 153-167, 2018 | 9 | 2018 |

On the complexity of rainbow coloring problems E Eiben, R Ganian, J Lauri Discrete Applied Mathematics 246, 38-48, 2018 | 9 | 2018 |

Solving problems on graphs of high rank-width E Eiben, R Ganian, S Szeider Algorithmica 80 (2), 742-771, 2018 | 9 | 2018 |

Equimatchable graphs on surfaces E Eiben, M Kotrbčík Journal of Graph Theory 81 (1), 35-49, 2016 | 9 | 2016 |

Using decomposition-parameters for QBF: mind the prefix! E Eiben, R Ganian, S Ordyniak Journal of Computer and System Sciences, 2020 | 8 | 2020 |

Counting linear extensions: Parameterizations by treewidth E Eiben, R Ganian, K Kangas, S Ordyniak Algorithmica 81 (4), 1657-1683, 2019 | 8 | 2019 |

Unary Integer Linear Programming with Structural Restrictions. E Eiben, R Ganian, D Knop, S Ordyniak IJCAI, 1284-1290, 2018 | 6 | 2018 |

Improved results for minimum constraint removal E Eiben, J Gemmell, I Kanj, A Youngdahl Thirty-Second AAAI Conference on Artificial Intelligence, 2018 | 5 | 2018 |

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 | 5 | 2017 |

Small resolution proofs for QBF using dependency treewidth E Eiben, R Ganian, S Ordyniak arXiv preprint arXiv:1711.02120, 2017 | 4 | 2017 |

Lossy kernels for hitting subgraphs E Eiben, D Hermelin, MS Ramanujan 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 3 | 2017 |

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion E Eiben, R Ganian, O Kwon arXiv preprint arXiv:1604.06056, 2016 | 3 | 2016 |

Equimatchable factor-critical graphs and independence number 2 E Eiben, M Kotrbcik arXiv preprint arXiv:1501.07549, 2015 | 3 | 2015 |

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 | 2 | 2019 |

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 | 2 | 2018 |

Towards Cereceda's conjecture for planar graphs E Eiben, C Feghali arXiv preprint arXiv:1810.00731, 2018 | 2 | 2018 |

How to navigate through obstacles? E Eiben, I Kanj arXiv preprint arXiv:1712.04043, 2017 | 2 | 2017 |

A Structural Approach to Activity Selection. E Eiben, R Ganian, S Ordyniak IJCAI, 203-209, 2018 | 1 | 2018 |