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
Academic article
  • 2019. Symmetry properties of generalized graph truncations. Journal of combinatorial theory. Series B (Print). 291-315.
  • 2019. On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Journal of computer and system sciences (Print). 158-170.
  • 2019. Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Leibniz International Proceedings in Informatics. 42:1-42:15.
  • 2019. Integer Programming and Incidence Treedepth. Lecture Notes in Computer Science (LNCS). 194-204.
  • 2019. Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Leibniz International Proceedings in Informatics. 25:1-25:17.
  • 2019. Bisection of Bounded Treewidth Graphs by Convolutions. Leibniz International Proceedings in Informatics. 42:1-42:11.
  • 2018. Unary integer linear programming with structural restrictions. IJCAI International Joint Conference on Artificial Intelligence. 1284-1290.
  • 2018. Small resolution proofs for QBF using dependency treewidth. Leibniz International Proceedings in Informatics. 28:1-28:15.
  • 2018. Lossy kernels for connected dominating set on sparse graphs. Leibniz International Proceedings in Informatics. 29:1-29:15.
  • 2018. How to navigate through obstacles? Leibniz International Proceedings in Informatics. 48:1-48:13.
  • 2018. Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica. 1-27.
  • 2018. A structural approach to activity selection. IJCAI International Joint Conference on Artificial Intelligence. 203-209.
  • 2018. A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of computer and system sciences (Print). 121-146.

More information in national current research information system (CRIStin)

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