Eduard Eiben

 
  • Project Assistant, MSc
  • TU Wien
  • Algorithms and Complexity Group
  • Institute of Computer Graphics and Algorithms 186/1
  • Favoritenstraße 9–11
  • 1040 Wien
  • Austria


Research Interests

  • Algorithms, Complexity Theory, Parameterized Complexity, Graph Theory, Artificial Inteligence

Current Position


Education


Publications

2017

  • Eduard Eiben, Robert Ganian, and Stefan Szeider. Solving Problems on Graphs of High Rank-Width. In: Algorithmica. To appear.
  • 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. To appear.
  • 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. To appear.
  • 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. To appear.

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.