×
Compute Distance To:
Author ID: ganian.robert Recent zbMATH articles by "Ganian, Robert"
Published as: Ganian, Robert; Ganian, R.
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

55 Publications have been cited 304 times in 193 Documents Cited by Year
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Zbl 1231.05096
Ganian, Robert; Hliněný, Petr
28
2010
Twin-cover: beyond vertex cover in parameterized algorithmics. Zbl 1352.68105
Ganian, Robert
17
2012
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
16
2014
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
16
2009
Thread graphs, linear rank-width and their algorithmic applications. Zbl 1295.68172
Ganian, Robert
15
2011
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma
15
2012
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
Improving vertex cover as a graph parameter. Zbl 1327.05321
Ganian, Robert
13
2015
Shrub-depth: capturing height of dense graphs. Zbl 07029306
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice
11
2019
Algorithmic applications of tree-cut width. Zbl 1465.68211
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan
10
2015
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
9
2013
Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
9
2015
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
9
2016
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
8
2013
The complexity landscape of decompositional parameters for ILP. Zbl 1451.90099
Ganian, Robert; Ordyniak, Sebastian
8
2018
Clique-width: when hard does not mean impossible. Zbl 1230.68109
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
7
2011
On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 07228424
Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian
6
2018
Combining treewidth and backdoors for CSP. Zbl 1402.68094
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
5
2017
The parameterized complexity of oriented colouring. Zbl 1247.68098
Ganian, Robert
5
2009
New results on the complexity of oriented colouring on restricted digraph classes. Zbl 1274.68138
Ganian, Robert; Hliněný, Petr
5
2010
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
5
2015
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
4
2010
Expanding the expressive power of monadic second-order logic on restricted graph classes. Zbl 1284.68463
Ganian, Robert; Obdržálek, Jan
4
2013
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
4
2014
Cops-and-robbers: remarks and problems. Zbl 1274.05318
Boyer, Michel; El Harti, Sif; El Ouarari, Amal; Ganian, Robert; Gavenčiak, Tomáš; Hahn, Geña; Moldenauer, Carsten; Rutter, Ignaz; Thériault, Benoit; Vatshelle, Martin
4
2013
FO model checking of interval graphs. Zbl 1448.68299
Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub
4
2015
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho
4
2016
Meta-kernelization with structural parameters. Zbl 1346.68109
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan
4
2016
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho
3
2018
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung
3
2018
Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258
Ganian, Robert; Hliněný, Petr
3
2009
Model checking existential logic on partially ordered sets. Zbl 1367.68182
Bova, Simone; Ganian, Robert; Szeider, Stefan
3
2016
Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322
Ganian, Robert; Szeider, Stefan
3
2015
Parameterized algorithms for book embedding problems. Zbl 1482.68170
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin
3
2019
Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
2
2016
Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
2
2017
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
The power of cut-based parameters for computing edge disjoint paths. Zbl 07173300
Ganian, Robert; Ordyniak, Sebastian
2
2019
Parameterized algorithms for book embedding problems. Zbl 1451.05222
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin
2
2020
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
1
2018
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian
1
2016
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung
1
2016
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
1
2018
Meta-kernelization with structural parameters. Zbl 1400.68089
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan
1
2013
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
1
2019
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
1
2017
SAT-encodings for treecut width and treedepth. Zbl 1430.68206
Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan
1
2019
Backdoor treewidth for SAT. Zbl 06807216
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
1
2017
New width parameters for model counting. Zbl 06807217
Ganian, Robert; Szeider, Stefan
1
2017
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S.
1
2019
Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096
Bova, Simone; Ganian, Robert; Szeider, Stefan
1
2014
Parameterized complexity of asynchronous border minimization. Zbl 1459.68085
Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru
1
2015
On strict (outer-)confluent graphs. Zbl 07266113
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin
1
2019
On structural parameterizations of the edge disjoint paths problem. Zbl 1457.68215
Ganian, Robert; Ordyniak, Sebastian; Sridharan, Ramanujan
1
2017
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07368162
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung
1
2021
Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07368162
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung
1
2021
Parameterized algorithms for book embedding problems. Zbl 1451.05222
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin
2
2020
Shrub-depth: capturing height of dense graphs. Zbl 07029306
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice
11
2019
Parameterized algorithms for book embedding problems. Zbl 1482.68170
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin
3
2019
The power of cut-based parameters for computing edge disjoint paths. Zbl 07173300
Ganian, Robert; Ordyniak, Sebastian
2
2019
Integer programming and incidence treedepth. Zbl 1436.90083
Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
1
2019
SAT-encodings for treecut width and treedepth. Zbl 1430.68206
Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan
1
2019
Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S.
1
2019
On strict (outer-)confluent graphs. Zbl 07266113
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin
1
2019
The complexity landscape of decompositional parameters for ILP. Zbl 1451.90099
Ganian, Robert; Ordyniak, Sebastian
8
2018
On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 07228424
Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian
6
2018
On the complexity of rainbow coloring problems. Zbl 1390.05064
Eiben, Eduard; Ganian, Robert; Lauri, Juho
3
2018
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung
3
2018
Meta-kernelization using well-structured modulators. Zbl 1396.68055
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
1
2018
Solving problems on graphs of high rank-width. Zbl 1390.68342
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
1
2018
Combining treewidth and backdoors for CSP. Zbl 1402.68094
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
5
2017
Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
2
2017
Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S.
1
2017
Backdoor treewidth for SAT. Zbl 06807216
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
1
2017
New width parameters for model counting. Zbl 06807217
Ganian, Robert; Szeider, Stefan
1
2017
On structural parameterizations of the edge disjoint paths problem. Zbl 1457.68215
Ganian, Robert; Ordyniak, Sebastian; Sridharan, Ramanujan
1
2017
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
9
2016
On the complexity of rainbow coloring problems. Zbl 1474.68221
Eiben, Eduard; Ganian, Robert; Lauri, Juho
4
2016
Meta-kernelization with structural parameters. Zbl 1346.68109
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan
4
2016
Model checking existential logic on partially ordered sets. Zbl 1367.68182
Bova, Simone; Ganian, Robert; Szeider, Stefan
3
2016
Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan
2
2016
Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian
1
2016
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228
Eiben, Eduard; Ganian, Robert; Kwon, O-joung
1
2016
Improving vertex cover as a graph parameter. Zbl 1327.05321
Ganian, Robert
13
2015
Algorithmic applications of tree-cut width. Zbl 1465.68211
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan
10
2015
Meta-kernelization using well-structured modulators. Zbl 1378.68073
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
9
2015
Solving problems on graphs of high rank-width. Zbl 1392.68199
Eiben, Eduard; Ganian, Robert; Szeider, Stefan
5
2015
FO model checking of interval graphs. Zbl 1448.68299
Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub
4
2015
Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322
Ganian, Robert; Szeider, Stefan
3
2015
Parameterized complexity of asynchronous border minimization. Zbl 1459.68085
Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru
1
2015
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
16
2014
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
4
2014
Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096
Bova, Simone; Ganian, Robert; Szeider, Stefan
1
2014
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
9
2013
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
8
2013
Expanding the expressive power of monadic second-order logic on restricted graph classes. Zbl 1284.68463
Ganian, Robert; Obdržálek, Jan
4
2013
Cops-and-robbers: remarks and problems. Zbl 1274.05318
Boyer, Michel; El Harti, Sif; El Ouarari, Amal; Ganian, Robert; Gavenčiak, Tomáš; Hahn, Geña; Moldenauer, Carsten; Rutter, Ignaz; Thériault, Benoit; Vatshelle, Martin
4
2013
Meta-kernelization with structural parameters. Zbl 1400.68089
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan
1
2013
Twin-cover: beyond vertex cover in parameterized algorithmics. Zbl 1352.68105
Ganian, Robert
17
2012
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma
15
2012
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
Thread graphs, linear rank-width and their algorithmic applications. Zbl 1295.68172
Ganian, Robert
15
2011
Clique-width: when hard does not mean impossible. Zbl 1230.68109
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
7
2011
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Zbl 1231.05096
Ganian, Robert; Hliněný, Petr
28
2010
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
New results on the complexity of oriented colouring on restricted digraph classes. Zbl 1274.68138
Ganian, Robert; Hliněný, Petr
5
2010
Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan
4
2010
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
16
2009
The parameterized complexity of oriented colouring. Zbl 1247.68098
Ganian, Robert
5
2009
Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258
Ganian, Robert; Hliněný, Petr
3
2009
all top 5

Cited by 271 Authors

28 Ganian, Robert
20 Kwon, Ojoung
16 Ordyniak, Sebastian
12 Szeider, Stefan
11 Hliněný, Petr
10 Kanté, Mamadou Moustapha
9 Gurski, Frank
9 Knop, Dušan
8 Eiben, Eduard
8 Oum, Sang-Il
8 Rossmanith, Peter
7 Hanaka, Tesshu
7 Obdržálek, Jan
6 Komander, Dominique
6 Nešetřil, Jaroslav
6 Ossona de Mendez, Patrice
6 Sikdar, Somnath
6 Thilikos, Dimitrios M.
5 Adler, Isolde
5 Bergougnoux, Benjamin
5 Giannopoulou, Archontia C.
5 Koutecký, Martin
5 Langer, Alexander
5 Paulusma, Daniël
5 Pilipczuk, Michał
5 Rehs, Carolin
5 Sau, Ignasi
4 Jansen, Bart M. P.
4 Kneis, Joachim
4 Kreutzer, Stephan
4 Lampis, Michael
4 Lauri, Juho
4 Misra, Neeldhara
4 Otachi, Yota
4 Paul, Christophe
4 Raymond, Jean-Florent
4 Telle, Jan Arne
3 Bui-Xuan, Binh-Minh
3 Courcelle, Bruno
3 De Oliveira Oliveira, Mateus
3 Dvořák, Pavel
3 Gajarský, Jakub
3 Gaspers, Serge
3 Gavenčiak, Tomáš
3 Kim, Eunjung
3 Kobayashi, Yasuaki
3 Meister, Daniel
3 Mitsou, Valia
3 Montecchiani, Fabrizio
3 Nöllenburg, Martin
3 Ono, Hirotaka
3 Ramanujan, M. S.
3 Siebertz, Sebastian
3 Vatshelle, Martin
2 Abu-Khzam, Faisal N.
2 Aldi, Marco
2 Bhore, Sujoy Kumar
2 Bodlaender, Hans L.
2 Coelho, Hebert
2 Das, Bireswar
2 de Beaudrap, Niel
2 Durand, Irène A.
2 Enduri, Murali Krishna
2 Eto, Hiroshi
2 Faria, Luerbio
2 Fernau, Henning
2 Fiala, Jiří
2 Fomin, Fedor V.
2 Gharibian, Sevag
2 Gözüpek, Didem
2 Gravier, Sylvain
2 Huang, Jingui
2 Hunter, Paul
2 Jeong, Jisu
2 Kangas, Kustaa
2 Kim, Minki
2 Kiyomi, Masashi
2 Klein, Sulamita
2 Kobayashi, Yusuke
2 Koivisto, Mikko
2 Komusiewicz, Christian
2 Kratochvíl, Jan
2 Kronegger, Martin
2 Li, Shouwei
2 Lima, Paloma T.
2 Lindemann, Marvin
2 Liu, Yunlong
2 Lozin, Vadim Vladislavovich
2 Markarian, Christine
2 Masařík, Tomáš
2 Meyer auf der Heide, Friedhelm
2 Nederlof, Jesper
2 Nishimura, Naomi
2 Ozkan, Sibel
2 Pfandler, Andreas
2 Podlipyan, Pavel
2 Pokrývka, Filip
2 Reddy, I. Vinod
2 Reidl, Felix
2 Roy, Bodhayan
...and 171 more Authors

Citations by Year