I am now a Lecturer in Computer Science at Royal Holloway, University of London.

Email: Eduard.Eiben [at] rhul.ac.uk
Web: link
Address:
- Royal Holloway, University of London
- Department of Computer Science
- Egham Hill
- Egham
- TW20 0EX
- United Kingdom

Research Interests

Algorithms, Complexity Theory, Parameterized Complexity, Graph Theory, Artificial Intelligence

Former Positions

Between October 2017 and October 2019, I was a Postdoctoral researcher in the Algorithms group at the Department of Informatics, University of Bergen, Norway, hosted by Daniel Lokshtanov.

Education

I completed my PhD in Theoretical Computer Science as a member of the Doctoral College Logical Methods in Computer Science and of the Algorithms and Complexity Group at TU Wien under the supervision of Prof. Dr. Stefan Szeider in April 2018. My dissertation thesis titled "Exploiting new types of structure for fixed-parameter tractability" can be found here.
I did my master and bachelor studies in Computer Science at Comenius University, Bratislava, Slovakia.

Publications

For more up-to-date list of publications see my DBLP entry or Google Scholar.

2018

Eduard Eiben, Robert Ganian, and Stefan Szeider. Solving Problems on Graphs of High Rank-Width. In: Algorithmica 80.2 (2018), pages 742--771.
Eduard Eiben, Jonathan Gemmell, Iyad Kanj, and Andrew Youngdahl. Improved Results for Minimum Constraint Removal. In: The Thirty-Second AAAI Conference on Artificial Intelligence, AAAI 2018, February 2–7, 2018, New Orleans, LA, USA. To appear.
Eduard Eiben, Robert Ganian, and Sebastian Ordyniak. Small Resolution Proofs for QBF using Dependency Treewidth. In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 - March 3, 2018, Caen, France, pages 28:1--28:15.
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, and Sebastian Siebertz. Lossy Kernels for Connected Dominating Set on Sparse Graphs. In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 - March 3, 2018, Caen, France, pages 29:1-29:15.
Eduard Eiben and Iyad Kanj. How to navigate through obstacles? In: The 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. To appear.
Eduard Eiben, Robert Ganian, and Sebastian Ordyniak. A Structural Approach to Activity Selection. In: The 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, Stockholm, Sweden. To appear.
Eduard Eiben, Robert Ganian, Dušan Knop, and Sebastian Ordyniak. Unary Integer Linear Programming with Structural Restrictions. In: The 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, Stockholm, Sweden. To appear.

2017

Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak. Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. In: International Joint Conference on Artificial Intelligence, IJCAI 2017, August 19-25, 2017, Melbourne, Australia, pages 607--613.
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, and M. S. Ramanujan. Towards a Polynomial Kernel for Directed Feedback Vertex Set. In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017, Aalborg, Denmark, pages 36:1--36:15.
Eduard Eiben, Danny Hermelin, and M. S. Ramanujan. Lossy Kernels for Hitting Subgraphs. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, pages 67:1--67:14.

2016

Eduard Eiben, Robert Ganian, and Juho Lauri. On the Complexity of Rainbow Coloring Problems. In: Discrete Applied Mathematics. To appear.
Eduard Eiben, Robert Ganian, Kustaa Kangas, and Sebastian Ordyniak. Counting Linear Extensions: Parameterizations by Treewidth. In: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pages 39:1--39:18.
Eduard Eiben, Robert Ganian, and O-joung Kwon. A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, pages 34:1--34:14.
Eduard Eiben, Robert Ganian, and Sebastian Ordyniak. Using Decomposition-Parameters for QBF: Mind the Prefix! In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, pages 964--970.
Eduard Eiben and Michal Kotrbčík. Equimatchable Graphs on Surfaces. In: Journal of Graph Theory 81.1 (2016), pages 35--49.

2015

Eduard Eiben, Robert Ganian, and Juho Lauri. On the Complexity of Rainbow Coloring Problems. In: Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, pages 209--220.
Eduard Eiben, Robert Ganian, and Stefan Szeider. Solving Problems on Graphs of High Rank-Width. In: Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314--326.
Eduard Eiben, Robert Ganian, and Stefan Szeider. Meta-Kernelization using Well-Structured Modulators. In: Parameterized and Exact Computation - 10th International Symposium, IPEC 2015, Patras, Greece, September 16-18, 2015, pages 114--126.