Home
Eduard Eiben's picture

Eduard Eiben

Researcher, hosted by Daniel Lokshtanov.
  • E-mailEduard.Eiben@uib.no
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Journal articles
  • Eiben, Eduard; Hermelin, Danny; Ramanujan, MS. 2019. On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Journal of computer and system sciences (Print). 105: 158-170. doi: 10.1016/j.jcss.2019.05.001
  • Eiben, Eduard; Jajcay, Robert; Sparl, Primoz. 2019. Symmetry properties of generalized graph truncations. Journal of combinatorial theory. Series B (Print). 137: 291-315. doi: 10.1016/j.jctb.2019.01.002
  • Eiben, Eduard; Ganian, Robert; Kangas, Kustaa; Ordyniak, Sebastian. 2018. Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica. 1-27. doi: 10.1007/s00453-018-0496-4
  • Eiben, Eduard; Ganian, Robert; Knop, Dusan; Ordyniak, Sebastian. 2018. Unary integer linear programming with structural restrictions. IJCAI International Joint Conference on Artificial Intelligence. 2018-July: 1284-1290. doi: https://doi.org/10.24963/ijcai.2018/179
  • Eiben, Eduard; Ganian, Robert; Kwon, O-Joung. 2018. A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of computer and system sciences (Print). 97: 121-146. doi: 10.1016/j.jcss.2018.05.005
  • Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian. 2018. Small resolution proofs for QBF using dependency treewidth. Leibniz International Proceedings in Informatics. 96: 28:1-28:15. doi: 10.4230/LIPIcs.STACS.2018.28
  • Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian. 2018. A structural approach to activity selection. IJCAI International Joint Conference on Artificial Intelligence. 2018-July: 203-209. doi: https://doi.org/10.24963/ijcai.2018/28
  • Eiben, Eduard; Kanj, Iyad. 2018. How to navigate through obstacles? Leibniz International Proceedings in Informatics. 107: 48:1-48:13. doi: 10.4230/LIPIcs.ICALP.2018.48
  • Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian. 2018. Lossy kernels for connected dominating set on sparse graphs. Leibniz International Proceedings in Informatics. 96: 29:1-29:15. doi: 10.4230/LIPIcs.STACS.2018.29

More information in national current research information system (CRIStin)

For the list of the publications see my DBLP entry or Google Scholar.