|
|
English
version
For å registrere i Cristin må du være vitenskapelig eller administrativt ansatt.
|
|
|
|
|
|
|
|
|
2022
|
1. |
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-joung. A Unifying Framework for Characterizing and Computing Width Measures. Leibniz International Proceedings in Informatics 2022 ;Volum 215. s. 63:1-63:23 UiB
Untitled
|
2021
|
2. |
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.. Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 2021
Untitled
|
2020
|
3. |
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.. Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 2020 s. - UiB
Untitled
|
|
4. |
Eiben, Eduard; Lochet, William; Saurabh, Saket. A Polynomial Kernel for Paw-Free Editing. Leibniz International Proceedings in Informatics 2020 ;Volum 180. s. 10:1-10:15 UiB
Untitled
|
2019
|
5. |
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung. Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Leibniz International Proceedings in Informatics 2019 ;Volum 138. s. 42:1-42:15 UiB
Untitled
|
|
6. |
Eiben, Eduard; Ganian, Robert; Knop, Dusan; Ordyniak, Sebastian. Solving integer quadratic programming via explicit and structural restrictions. Proceedings of the AAAI Conference on Artificial Intelligence 2019 s. - UiB
Untitled
|
|
7. |
Eiben, Eduard; Ganian, Robert; Knop, Dusan; Ordyniak, Sebastian; Pilipczuk, Michal; Wrochna, Marcin. Integer Programming and Incidence Treedepth. Lecture Notes in Computer Science (LNCS) 2019 ;Volum 11480 LNCS. s. 194-204 UiB
Untitled
|
|
8. |
Eiben, Eduard; Hermelin, Danny; Ramanujan, MS. On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Journal of computer and system sciences 2019 ;Volum 105. s. 158-170 UiB
Untitled
|
|
9. |
Eiben, Eduard; Jajcay, Robert; Sparl, Primoz. Symmetry properties of generalized graph truncations. Journal of combinatorial theory. Series B (Print) 2019 ;Volum 137. s. 291-315 UiB
Untitled
|
|
10. |
Eiben, Eduard; Knop, Dusan; Panolan, Fahad; Suchý, Ondřej. Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Leibniz International Proceedings in Informatics 2019 ;Volum 126. s. 25:1-25:17 UiB
Untitled
|
|
11. |
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E.. Bisection of Bounded Treewidth Graphs by Convolutions. Leibniz International Proceedings in Informatics 2019 ;Volum 144. s. 42:1-42:11 UiB
Untitled
|
2018
|
12. |
Eiben, Eduard; Ganian, Robert; Kangas, Kustaa; Ordyniak, Sebastian. Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 2018 s. 1-27 UiB
Untitled
|
|
13. |
Eiben, Eduard; Ganian, Robert; Knop, Dusan; Ordyniak, Sebastian. Unary integer linear programming with structural restrictions. IJCAI International Joint Conference on Artificial Intelligence 2018 ;Volum 2018-July. s. 1284-1290 UiB
Untitled
|
|
14. |
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung. A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of computer and system sciences 2018 ;Volum 97. s. 121-146 UiB
Untitled
|
|
15. |
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian. A structural approach to activity selection. IJCAI International Joint Conference on Artificial Intelligence 2018 ;Volum 2018-July. s. 203-209 UiB
Untitled
|
|
16. |
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian. Small resolution proofs for QBF using dependency treewidth. Leibniz International Proceedings in Informatics 2018 ;Volum 96. s. 28:1-28:15 UiB
Untitled
|
|
17. |
Eiben, Eduard; Kanj, Iyad. How to navigate through obstacles?. Leibniz International Proceedings in Informatics 2018 ;Volum 107. s. 48:1-48:13 UiB
Untitled
|
|
18. |
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian. Lossy kernels for connected dominating set on sparse graphs. Leibniz International Proceedings in Informatics 2018 ;Volum 96. s. 29:1-29:15 UiB
Untitled
|
|