Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2015
|
Lossy kernels for connected dominating set on sparse graphs. Zbl 1487.68176
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian |
|
2018
|
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung |
|
2018
|
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. Zbl 1520.90171
Dvořák, Pavel; Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian |
|
2021
|
Symmetry properties of generalized graph truncations. Zbl 1415.05172
Eiben, Eduard; Jajcay, Robert; Šparl, Primož |
|
2019
|
Lossy kernels for connected dominating set on sparse graphs. Zbl 1430.68195
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian |
|
2019
|
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal |
|
2016
|
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2015
|
A polynomial kernel for paw-free editing. Zbl 07764101
Eiben, Eduard; Lochet, William; Saurabh, Saket |
|
2020
|
Toward Cereceda’s conjecture for planar graphs. Zbl 1495.05091
Eiben, Eduard; Feghali, Carl |
|
2020
|
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68291
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung |
|
2021
|
Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin |
|
2020
|
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. |
|
2017
|
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho |
|
2016
|
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2017
|
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho |
|
2018
|
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68292
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung |
|
2019
|
Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian |
|
2023
|
A polynomial kernel for 3-leaf power deletion. Zbl 07559376
Ahn, Jungho; Eiben, Eduard; Kwon, O-Joung; Oum, Sang-Il |
|
2020
|
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2018
|
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S. |
|
2019
|
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin |
|
2019
|
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2018
|
Component order connectivity in directed graphs. Zbl 1533.68100
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2020
|
Bisection of bounded treewidth graphs by convolutions. Zbl 1477.68220
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E. |
|
2021
|
Complexity of the Steiner network problem with respect to the number of terminals. Zbl 07559134
Eiben, Eduard; Knop, Dušan; Panolan, Fahad; Suchý, Ondřej |
|
2019
|
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung |
|
2016
|
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2019
|
Small resolution proofs for QBF using dependency treewidth. Zbl 1487.68135
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian |
|
2018
|
EPTAS for k-means clustering of affine subspaces. Zbl 07788495
Eiben, Eduard; Fomin, Fedor V.; Golovach, Petr A.; Lochet, Willian; Panolan, Fahad; Simonov, Kirill |
|
2021
|
A unifying framework for characterizing and computing width measures. Zbl 07829295
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-Joung |
|
2022
|
Preference swaps for the stable matching problem. Zbl 07676483
Eiben, Eduard; Gutin, Gregory; Neary, Philip R.; Rambaud, Clément; Wahlström, Magnus; Yeo, Anders |
|
2023
|
A colored path problem and its applications. Zbl 07678779
Eiben, Eduard; Kanj, Iyad |
|
2020
|
How to navigate through obstacles? Zbl 1499.68364
Eiben, Eduard; Kanj, Iyad |
|
2018
|
Using decomposition-parameters for QBF: mind the prefix! Zbl 1435.68123
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian |
|
2020
|
Towards a polynomial kernel for directed feedback vertex set. Zbl 1511.68197
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. |
|
2021
|
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian |
|
2016
|
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source. Zbl 07868759
Deligkas, Argyrios; Döring, Michelle; Eiben, Eduard; Goldsmith, Tiger-Lily; Skretas, George |
|
2024
|
A polynomial kernel for line graph deletion. Zbl 07651181
Eiben, Eduard; Lochet, William |
|
2020
|
Component order connectivity in directed graphs. Zbl 1533.68099
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2022
|
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source. Zbl 07868759
Deligkas, Argyrios; Döring, Michelle; Eiben, Eduard; Goldsmith, Tiger-Lily; Skretas, George |
|
2024
|
Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian |
|
2023
|
Preference swaps for the stable matching problem. Zbl 07676483
Eiben, Eduard; Gutin, Gregory; Neary, Philip R.; Rambaud, Clément; Wahlström, Magnus; Yeo, Anders |
|
2023
|
A unifying framework for characterizing and computing width measures. Zbl 07829295
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-Joung |
|
2022
|
Component order connectivity in directed graphs. Zbl 1533.68099
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2022
|
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. Zbl 1520.90171
Dvořák, Pavel; Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian |
|
2021
|
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68291
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung |
|
2021
|
Bisection of bounded treewidth graphs by convolutions. Zbl 1477.68220
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E. |
|
2021
|
EPTAS for k-means clustering of affine subspaces. Zbl 07788495
Eiben, Eduard; Fomin, Fedor V.; Golovach, Petr A.; Lochet, Willian; Panolan, Fahad; Simonov, Kirill |
|
2021
|
Towards a polynomial kernel for directed feedback vertex set. Zbl 1511.68197
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. |
|
2021
|
A polynomial kernel for paw-free editing. Zbl 07764101
Eiben, Eduard; Lochet, William; Saurabh, Saket |
|
2020
|
Toward Cereceda’s conjecture for planar graphs. Zbl 1495.05091
Eiben, Eduard; Feghali, Carl |
|
2020
|
Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin |
|
2020
|
A polynomial kernel for 3-leaf power deletion. Zbl 07559376
Ahn, Jungho; Eiben, Eduard; Kwon, O-Joung; Oum, Sang-Il |
|
2020
|
Component order connectivity in directed graphs. Zbl 1533.68100
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders |
|
2020
|
A colored path problem and its applications. Zbl 07678779
Eiben, Eduard; Kanj, Iyad |
|
2020
|
Using decomposition-parameters for QBF: mind the prefix! Zbl 1435.68123
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian |
|
2020
|
A polynomial kernel for line graph deletion. Zbl 07651181
Eiben, Eduard; Lochet, William |
|
2020
|
Symmetry properties of generalized graph truncations. Zbl 1415.05172
Eiben, Eduard; Jajcay, Robert; Šparl, Primož |
|
2019
|
Lossy kernels for connected dominating set on sparse graphs. Zbl 1430.68195
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian |
|
2019
|
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68292
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung |
|
2019
|
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S. |
|
2019
|
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin |
|
2019
|
Complexity of the Steiner network problem with respect to the number of terminals. Zbl 07559134
Eiben, Eduard; Knop, Dušan; Panolan, Fahad; Suchý, Ondřej |
|
2019
|
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2019
|
Lossy kernels for connected dominating set on sparse graphs. Zbl 1487.68176
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian |
|
2018
|
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung |
|
2018
|
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho |
|
2018
|
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2018
|
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2018
|
Small resolution proofs for QBF using dependency treewidth. Zbl 1487.68135
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian |
|
2018
|
How to navigate through obstacles? Zbl 1499.68364
Eiben, Eduard; Kanj, Iyad |
|
2018
|
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. |
|
2017
|
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. |
|
2017
|
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal |
|
2016
|
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho |
|
2016
|
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung |
|
2016
|
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian |
|
2016
|
Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2015
|
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan |
|
2015
|