×
Author ID: eiben.eduard Recent zbMATH articles by "Eiben, Eduard"
Published as: Eiben, Eduard; Eiben, E.

Publications by Year

Citations contained in zbMATH Open

40 Publications have been cited 168 times in 132 Documents Cited by Year
Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
13
2015
Lossy kernels for connected dominating set on sparse graphs. Zbl 1487.68176
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian
11
2018
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung
9
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
9
2021
Symmetry properties of generalized graph truncations. Zbl 1415.05172
Eiben, Eduard; Jajcay, Robert; Šparl, Primož
9
2019
Lossy kernels for connected dominating set on sparse graphs. Zbl 1430.68195
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian
9
2019
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal
7
2016
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
6
2015
A polynomial kernel for paw-free editing. Zbl 07764101
Eiben, Eduard; Lochet, William; Saurabh, Saket
6
2020
Toward Cereceda’s conjecture for planar graphs. Zbl 1495.05091
Eiben, Eduard; Feghali, Carl
6
2020
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68291
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung
6
2021
Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin
6
2020
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
6
2017
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho
5
2016
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S.
5
2017
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho
5
2018
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68292
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung
5
2019
Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian
4
2023
A polynomial kernel for 3-leaf power deletion. Zbl 07559376
Ahn, Jungho; Eiben, Eduard; Kwon, O-Joung; Oum, Sang-Il
4
2020
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
4
2018
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S.
3
2019
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
3
2019
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
2
2018
Component order connectivity in directed graphs. Zbl 1533.68100
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders
2
2020
Bisection of bounded treewidth graphs by convolutions. Zbl 1477.68220
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E.
2
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
2
2019
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung
2
2016
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S.
2
2019
Small resolution proofs for QBF using dependency treewidth. Zbl 1487.68135
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
2
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
2
2021
A unifying framework for characterizing and computing width measures. Zbl 07829295
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-Joung
2
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
1
2023
A colored path problem and its applications. Zbl 07678779
Eiben, Eduard; Kanj, Iyad
1
2020
How to navigate through obstacles? Zbl 1499.68364
Eiben, Eduard; Kanj, Iyad
1
2018
Using decomposition-parameters for QBF: mind the prefix! Zbl 1435.68123
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
1
2020
Towards a polynomial kernel for directed feedback vertex set. Zbl 1511.68197
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
1
2021
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian
1
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
1
2024
A polynomial kernel for line graph deletion. Zbl 07651181
Eiben, Eduard; Lochet, William
1
2020
Component order connectivity in directed graphs. Zbl 1533.68099
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders
1
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
1
2024
Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian
4
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
1
2023
A unifying framework for characterizing and computing width measures. Zbl 07829295
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-Joung
2
2022
Component order connectivity in directed graphs. Zbl 1533.68099
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders
1
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
9
2021
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68291
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung
6
2021
Bisection of bounded treewidth graphs by convolutions. Zbl 1477.68220
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E.
2
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
2
2021
Towards a polynomial kernel for directed feedback vertex set. Zbl 1511.68197
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
1
2021
A polynomial kernel for paw-free editing. Zbl 07764101
Eiben, Eduard; Lochet, William; Saurabh, Saket
6
2020
Toward Cereceda’s conjecture for planar graphs. Zbl 1495.05091
Eiben, Eduard; Feghali, Carl
6
2020
Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin
6
2020
A polynomial kernel for 3-leaf power deletion. Zbl 07559376
Ahn, Jungho; Eiben, Eduard; Kwon, O-Joung; Oum, Sang-Il
4
2020
Component order connectivity in directed graphs. Zbl 1533.68100
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders
2
2020
A colored path problem and its applications. Zbl 07678779
Eiben, Eduard; Kanj, Iyad
1
2020
Using decomposition-parameters for QBF: mind the prefix! Zbl 1435.68123
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
1
2020
A polynomial kernel for line graph deletion. Zbl 07651181
Eiben, Eduard; Lochet, William
1
2020
Symmetry properties of generalized graph truncations. Zbl 1415.05172
Eiben, Eduard; Jajcay, Robert; Šparl, Primož
9
2019
Lossy kernels for connected dominating set on sparse graphs. Zbl 1430.68195
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian
9
2019
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 1517.68292
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung
5
2019
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S.
3
2019
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
3
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
2
2019
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Zbl 1425.68309
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S.
2
2019
Lossy kernels for connected dominating set on sparse graphs. Zbl 1487.68176
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian
11
2018
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung
9
2018
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho
5
2018
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
4
2018
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
2
2018
Small resolution proofs for QBF using dependency treewidth. Zbl 1487.68135
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
2
2018
How to navigate through obstacles? Zbl 1499.68364
Eiben, Eduard; Kanj, Iyad
1
2018
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
6
2017
Lossy kernels for hitting subgraphs. Zbl 1441.68175
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S.
5
2017
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal
7
2016
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho
5
2016
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung
2
2016
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian
1
2016
Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
13
2015
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
6
2015
all top 5

Cited by 247 Authors

14 Eiben, Eduard
13 Ganian, Robert
8 Kwon, O. joung
8 Ordyniak, Sebastian
8 Ramanujan, M. S.
7 Siebertz, Sebastian
6 Saurabh, Saket
5 Agrawal, Akanksha
5 Fomin, Fedor V.
5 Jansen, Bart M. P.
5 Kim, Eunjung
5 Lokshtanov, Daniel
5 Panolan, Fahad
5 Sandeep, R. B.
5 Szeider, Stefan
4 Ahn, Jungho
4 Antony, Dhanyamol
4 Ekim, Tınaz
4 Feghali, Carl
4 Lauri, Juho
4 Mouawad, Amer E.
4 Otachi, Yota
4 Pal, Sagartanu
4 Purohit, Nidhi
4 Subashini, Ramasamy
4 Van Leeuwen, Erik Jan
4 Zehavi, Meirav
3 de Kroon, Jari J. H.
3 Deniz, Zakir
3 Golovach, Petr A.
3 Gutin, Gregory Z.
3 Kanesh, Lawqueen
3 Klute, Fabian
3 Knop, Dušan
3 Lampis, Michael
3 Lima, Paloma T.
3 Marx, Dániel
3 Mitsou, Valia
3 Potočnik, Primož
3 Sau, Ignasi
2 Alspach, Brian R.
2 Bandyapadhyay, Sayan
2 Belmonte, Rémy
2 Bergougnoux, Benjamin
2 Chitnis, Rajesh Hemant
2 Choudhary, Pratibha
2 Das, Avinandan
2 Feldmann, Andreas Emil
2 Garchar, Jay
2 Gaspers, Serge
2 Gima, Tatsuya
2 Gözüpek, Didem
2 Hamm, Thekla
2 Hanaka, Tesshu
2 Issac, Davis
2 Kangas, Kustaa
2 Kim, Eun Jung
2 Kobayashi, Yasuaki
2 Koivisto, Mikko
2 Koutecký, Martin
2 Kublenz, Simeon
2 Lee, Euiwoong
2 Madathil, Jayakrishnan
2 Majumdar, Diptapriyo
2 Misra, Neeldhara
2 Muluk, Komal
2 Nadara, Wojciech
2 Narayanaswamy, N. S.
2 Nisha, K. K.
2 Oum, Sang-Il
2 Paulusma, Daniël
2 Pilipczuk, Marcin L.
2 Rabinovich, Roman
2 Ramamoorthi, Vijayaragunathan
2 Salonen, Sami
2 Sen, Sagnik
2 Shalom, Mordechai
2 Sharma, Roohani
2 Sorge, Manuel
2 Šparl, Primož
2 Thilikos, Dimitrios M.
2 van der Wegen, Marieke
2 Vidali, Janoš
2 Vigny, Alexandre
2 Wahlström, Magnus
2 Włodarczyk, Michał
2 Yeo, Anders
2 Zhou, Jinxin
1 Akbari, Saieed
1 Alambardar, Meybodi Mohsen
1 Arroyo, Alan
1 Bannach, Max
1 Bellitto, Thomas
1 Benedek, Márton
1 Berndt, Sebastian
1 Biró, Peter
1 Bliznets, Ivan A.
1 Bougeret, Marin
1 Bousquet, Nicolas
1 Brinkop, Hauke
...and 147 more Authors

Citations by Year