Edit Profile (opens in new tab) Ganian, Robert Compute Distance To: Compute Author ID: ganian.robert Published as: Ganian, Robert; Ganian, R. External Links: MGP Documents Indexed: 89 Publications since 2009 3 Contributions as Editor Co-Authors: 63 Co-Authors with 87 Joint Publications 1,389 Co-Co-Authors all top 5 Co-Authors 5 single-authored 27 Szeider, Stefan 23 Eiben, Eduard 22 Ordyniak, Sebastian 18 Hliněný, Petr 15 Obdržálek, Jan 9 Ramanujan, M. S. 7 Nöllenburg, Martin 6 Rossmanith, Peter 5 Hamm, Thekla 5 Kanj, Iyad A. 5 Klute, Fabian 4 Bhore, Sujoy Kumar 4 Bova, Simone 4 Kneis, Joachim 4 Kwon, Ojoung 4 Langer, Alexander 4 Montecchiani, Fabrizio 4 Rahul, C. S. 4 Sikdar, Somnath 3 Kim, Eun Jung 3 Slivovsky, Friedrich 2 Bergougnoux, Benjamin 2 Bergren, Dan 2 de Haan, Ronald 2 Förster, Henry 2 Knop, Dušan 2 Král’, Daniel 2 Kronegger, Martin 2 Lauri, Juho 2 Meister, Daniel 2 Narayanaswamy, N. S. 2 Nešetřil, Jaroslav 2 Ossona de Mendez, Patrice 2 Pfandler, Andreas 2 Popa, Alexandru 2 Schwartz, Jarett 2 Teska, Jakub 1 Boyer, Michel 1 Brand, Cornelius 1 Ceylan, Esra 1 Corneil, Derek Gordon 1 Dvořák, Pavel 1 El Harti, Sif 1 El Ouarari, Amal 1 Gavenčiak, Tomáš 1 Hahn, Gena 1 Hatschka, Christian 1 Kanga, Kustaa 1 Korchemna, Viktoriia 1 Lodha, Neha 1 Moldenauer, Carsten 1 Pilipczuk, Michał 1 Proskurowski, Andrzej 1 Ramadurai, Reshma 1 Rutter, Ignaz 1 Schidler, André 1 Silva, Alexandra 1 Sorge, Manuel 1 Sridharan, Ramanujan 1 Talvitie, Topi 1 Thériault, Benoit 1 Vatshelle, Martin 1 Wrochna, Marcin all top 5 Serials 9 Algorithmica 6 Discrete Applied Mathematics 6 Journal of Computer and System Sciences 5 Artificial Intelligence 3 Journal of Graph Algorithms and Applications 2 SIAM Journal on Discrete Mathematics 2 The Journal of Artificial Intelligence Research (JAIR) 2 Logical Methods in Computer Science 1 Journal of Combinatorial Theory. Series B 1 Theoretical Computer Science 1 European Journal of Combinatorics 1 JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 Fundamenta Informaticae 1 ACM Transactions on Computational Logic 1 ACM Transactions on Algorithms 1 LIPIcs – Leibniz International Proceedings in Informatics 1 ACM Transactions on Computation Theory all top 5 Fields 82 Computer science (68-XX) 44 Combinatorics (05-XX) 12 Mathematical logic and foundations (03-XX) 5 Order, lattices, ordered algebraic structures (06-XX) 3 General and overarching topics; collections (00-XX) 3 Operations research, mathematical programming (90-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 Biology and other natural sciences (92-XX) 1 Statistics (62-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 66 Publications have been cited 409 times in 251 Documents Cited by ▼ Year ▼ On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Zbl 1231.05096Ganian, Robert; Hliněný, Petr 31 2010 Twin-cover: beyond vertex cover in parameterized algorithmics. Zbl 1352.68105Ganian, Robert 20 2012 Digraph width measures in parameterized algorithmics. Zbl 1285.05077Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter 18 2014 Improving vertex cover as a graph parameter. Zbl 1327.05321Ganian, Robert 18 2015 On digraph width measures in parameterized algorithmics. Zbl 1273.68276Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter 17 2009 Algorithmic applications of tree-cut width. Zbl 1465.68211Ganian, Robert; Kim, Eun Jung; Szeider, Stefan 16 2015 When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma 16 2012 The complexity landscape of decompositional parameters for ILP. Zbl 1451.90099Ganian, Robert; Ordyniak, Sebastian 15 2018 Are there any good digraph width measures? Zbl 1309.68150Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 15 2010 Thread graphs, linear rank-width and their algorithmic applications. Zbl 1295.68172Ganian, Robert 15 2011 Shrub-depth: capturing height of dense graphs. Zbl 07029306Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice 13 2019 Are there any good digraph width measures? Zbl 1327.05136Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 11 2016 Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 10 2013 Parameterized algorithms for book embedding problems. Zbl 1451.05222Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 10 2020 Meta-kernelization using well-structured modulators. Zbl 1378.68073Eiben, Eduard; Ganian, Robert; Szeider, Stefan 9 2015 A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 9 2013 On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 1487.68177Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian 9 2018 Combining treewidth and backdoors for CSP. Zbl 1402.68094Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 9 2017 A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199Eiben, Eduard; Ganian, Robert; Kwon, O-Joung 7 2018 Clique-width: when hard does not mean impossible. Zbl 1230.68109Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 7 2011 On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 1487.68178Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian 6 2021 Solving problems on graphs of high rank-width. Zbl 1392.68199Eiben, Eduard; Ganian, Robert; Szeider, Stefan 5 2015 Meta-kernelization with structural parameters. Zbl 1346.68109Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 5 2016 FO model checking of interval graphs. Zbl 1448.68299Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub 5 2015 Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. 5 2017 Expanding the expressive power of monadic second-order logic on restricted graph classes. Zbl 1284.68463Ganian, Robert; Obdržálek, Jan 5 2013 Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 5 2014 New results on the complexity of oriented colouring on restricted digraph classes. Zbl 1274.68138Ganian, Robert; Hliněný, Petr 5 2010 The parameterized complexity of oriented colouring. Zbl 1247.68098Ganian, Robert 5 2009 The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. Zbl 07418701Dvořák, Pavel; Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian 5 2021 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 4 2017 On the complexity of rainbow coloring problems. Zbl 1474.68221Eiben, Eduard; Ganian, Robert; Lauri, Juho 4 2016 Model checking existential logic on partially ordered sets. Zbl 1367.68182Bova, Simone; Ganian, Robert; Szeider, Stefan 4 2016 Cops-and-robbers: remarks and problems. Zbl 1274.05318Boyer, 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 Parameterized algorithms for book embedding problems. Zbl 1482.68170Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 4 2019 On the complexity of rainbow coloring problems. Zbl 1390.05064Eiben, Eduard; Ganian, Robert; Lauri, Juho 4 2018 Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 4 2010 Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin 4 2020 The power of cut-based parameters for computing edge disjoint paths. Zbl 07173300Ganian, Robert; Ordyniak, Sebastian 3 2019 Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S. 3 2019 Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322Ganian, Robert; Szeider, Stefan 3 2015 Backdoor treewidth for SAT. Zbl 1496.68256Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 3 2017 Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258Ganian, Robert; Hliněný, Petr 3 2009 Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07368162Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung 3 2021 Parameterized algorithms for queue layouts. Zbl 07436606Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 3 2020 Meta-kernelization using well-structured modulators. Zbl 1396.68055Eiben, Eduard; Ganian, Robert; Szeider, Stefan 2 2018 Integer programming and incidence treedepth. Zbl 1436.90083Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin 2 2019 SAT-encodings for treecut width and treedepth. Zbl 1430.68206Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan 2 2019 The power of cut-based parameters for computing edge-disjoint paths. Zbl 07328490Ganian, Robert; Ordyniak, Sebastian 2 2021 Solving problems on graphs of high rank-width. Zbl 1390.68342Eiben, Eduard; Ganian, Robert; Szeider, Stefan 2 2018 On structural parameterizations of the edge disjoint paths problem. Zbl 1457.68215Ganian, Robert; Ordyniak, Sebastian; Sridharan, Ramanujan 2 2017 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2016 Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 2 2012 Group activity selection with few agent types. Zbl 07525485Ganian, Robert; Ordyniak, Sebastian; Rahul, C. S. 2 2019 Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 Parameterized complexity of asynchronous border minimization. Zbl 1459.68085Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru 1 2015 New width parameters for model counting. Zbl 1496.68257Ganian, Robert; Szeider, Stefan 1 2017 On strict (outer-)confluent graphs. Zbl 07266113Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin 1 2019 Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian 1 2016 A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228Eiben, Eduard; Ganian, Robert; Kwon, O-joung 1 2016 Model checking existential logic on partially ordered sets. Zbl 1401.68187Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 FO model checking of interval graphs. Zbl 1334.68132Ganian, Robert; Hliněný, Petr; Král’, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub 1 2013 Meta-kernelization with structural parameters. Zbl 1400.68089Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 1 2013 On structural parameterizations of the edge disjoint paths problem. Zbl 07357812Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. 1 2021 Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07561686Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung 1 2019 Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian 1 2023 Parameterized complexity of envy-free resource allocation in social networks. Zbl 07638300Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian 1 2023 On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 1487.68178Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian 6 2021 The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. Zbl 07418701Dvořák, Pavel; Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian 5 2021 Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07368162Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung 3 2021 The power of cut-based parameters for computing edge-disjoint paths. Zbl 07328490Ganian, Robert; Ordyniak, Sebastian 2 2021 On structural parameterizations of the edge disjoint paths problem. Zbl 07357812Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. 1 2021 Parameterized algorithms for book embedding problems. Zbl 1451.05222Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 10 2020 Extending nearly complete \(1\)-planar drawings in polynomial time. Zbl 07559402Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin 4 2020 Parameterized algorithms for queue layouts. Zbl 07436606Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 3 2020 Shrub-depth: capturing height of dense graphs. Zbl 07029306Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice 13 2019 Parameterized algorithms for book embedding problems. Zbl 1482.68170Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin 4 2019 The power of cut-based parameters for computing edge disjoint paths. Zbl 07173300Ganian, Robert; Ordyniak, Sebastian 3 2019 Counting linear extensions: parameterizations by treewidth. Zbl 1421.68074Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S. 3 2019 Integer programming and incidence treedepth. Zbl 1436.90083Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin 2 2019 SAT-encodings for treecut width and treedepth. Zbl 1430.68206Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan 2 2019 Group activity selection with few agent types. Zbl 07525485Ganian, Robert; Ordyniak, Sebastian; Rahul, C. S. 2 2019 On strict (outer-)confluent graphs. Zbl 07266113Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin 1 2019 Measuring what matters: a hybrid approach to dynamic programming with treewidth. Zbl 07561686Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung 1 2019 The complexity landscape of decompositional parameters for ILP. Zbl 1451.90099Ganian, Robert; Ordyniak, Sebastian 15 2018 On structural parameterizations of the bounded-degree vertex deletion problem. Zbl 1487.68177Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian 9 2018 A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1402.68199Eiben, Eduard; Ganian, Robert; Kwon, O-Joung 7 2018 On the complexity of rainbow coloring problems. Zbl 1390.05064Eiben, Eduard; Ganian, Robert; Lauri, Juho 4 2018 Meta-kernelization using well-structured modulators. Zbl 1396.68055Eiben, Eduard; Ganian, Robert; Szeider, Stefan 2 2018 Solving problems on graphs of high rank-width. Zbl 1390.68342Eiben, Eduard; Ganian, Robert; Szeider, Stefan 2 2018 Combining treewidth and backdoors for CSP. Zbl 1402.68094Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 9 2017 Towards a polynomial kernel for directed feedback vertex set. Zbl 1441.68163Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. 5 2017 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 4 2017 Backdoor treewidth for SAT. Zbl 1496.68256Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 3 2017 On structural parameterizations of the edge disjoint paths problem. Zbl 1457.68215Ganian, Robert; Ordyniak, Sebastian; Sridharan, Ramanujan 2 2017 New width parameters for model counting. Zbl 1496.68257Ganian, Robert; Szeider, Stefan 1 2017 Are there any good digraph width measures? Zbl 1327.05136Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 11 2016 Meta-kernelization with structural parameters. Zbl 1346.68109Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 5 2016 On the complexity of rainbow coloring problems. Zbl 1474.68221Eiben, Eduard; Ganian, Robert; Lauri, Juho 4 2016 Model checking existential logic on partially ordered sets. Zbl 1367.68182Bova, Simone; Ganian, Robert; Szeider, Stefan 4 2016 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2016 Counting linear extensions: parameterizations by treewidth. Zbl 1397.68098Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian 1 2016 A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Zbl 1398.68228Eiben, Eduard; Ganian, Robert; Kwon, O-joung 1 2016 Improving vertex cover as a graph parameter. Zbl 1327.05321Ganian, Robert 18 2015 Algorithmic applications of tree-cut width. Zbl 1465.68211Ganian, Robert; Kim, Eun Jung; Szeider, Stefan 16 2015 Meta-kernelization using well-structured modulators. Zbl 1378.68073Eiben, Eduard; Ganian, Robert; Szeider, Stefan 9 2015 Solving problems on graphs of high rank-width. Zbl 1392.68199Eiben, Eduard; Ganian, Robert; Szeider, Stefan 5 2015 FO model checking of interval graphs. Zbl 1448.68299Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub 5 2015 Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322Ganian, Robert; Szeider, Stefan 3 2015 Parameterized complexity of asynchronous border minimization. Zbl 1459.68085Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru 1 2015 Digraph width measures in parameterized algorithmics. Zbl 1285.05077Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter 18 2014 Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath 5 2014 Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 Model checking existential logic on partially ordered sets. Zbl 1401.68187Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1280.68239Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 10 2013 A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Zbl 1257.05168Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 9 2013 Expanding the expressive power of monadic second-order logic on restricted graph classes. Zbl 1284.68463Ganian, Robert; Obdržálek, Jan 5 2013 Cops-and-robbers: remarks and problems. Zbl 1274.05318Boyer, 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 1334.68132Ganian, Robert; Hliněný, Petr; Král’, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub 1 2013 Meta-kernelization with structural parameters. Zbl 1400.68089Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 1 2013 Twin-cover: beyond vertex cover in parameterized algorithmics. Zbl 1352.68105Ganian, Robert 20 2012 When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). Zbl 1365.68323Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma 16 2012 Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107Ganian, 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.68172Ganian, Robert 15 2011 Clique-width: when hard does not mean impossible. Zbl 1230.68109Ganian, 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.05096Ganian, Robert; Hliněný, Petr 31 2010 Are there any good digraph width measures? Zbl 1309.68150Ganian, 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.68138Ganian, Robert; Hliněný, Petr 5 2010 Better algorithms for satisfiability problems for formulas of bounded rank-width. Zbl 1245.68108Ganian, Robert; Hliněný, Petr; Obdržálek, Jan 4 2010 On digraph width measures in parameterized algorithmics. Zbl 1273.68276Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter 17 2009 The parameterized complexity of oriented colouring. Zbl 1247.68098Ganian, Robert 5 2009 Better polynomial algorithms on graphs of bounded rank-width. Zbl 1267.05258Ganian, Robert; Hliněný, Petr 3 2009 all cited Publications top 5 cited Publications all top 5 Cited by 352 Authors 34 Ganian, Robert 23 Kwon, Ojoung 20 Ordyniak, Sebastian 13 Szeider, Stefan 12 Hliněný, Petr 12 Knop, Dušan 11 Eiben, Eduard 10 Gurski, Frank 10 Kanté, Mamadou Moustapha 9 Hanaka, Tesshu 9 Oum, Sang-Il 8 Koutecký, Martin 8 Rossmanith, Peter 8 Thilikos, Dimitrios M. 7 Komander, Dominique 7 Lampis, Michael 7 Nešetřil, Jaroslav 7 Obdržálek, Jan 7 Ossona de Mendez, Patrice 7 Pilipczuk, Michał 6 Giannopoulou, Archontia C. 6 Kreutzer, Stephan 6 Montecchiani, Fabrizio 6 Nöllenburg, Martin 6 Otachi, Yota 6 Paulusma, Daniël 6 Ramanujan, M. S. 6 Rehs, Carolin 6 Sau, Ignasi 6 Saurabh, Saket 6 Sikdar, Somnath 5 Adler, Isolde 5 Bergougnoux, Benjamin 5 Bhore, Sujoy Kumar 5 Huang, Jingui 5 Jansen, Bart M. P. 5 Langer, Alexander 5 Liu, Yunlong 5 Misra, Neeldhara 5 Mitsou, Valia 5 Raymond, Jean-Florent 5 Siebertz, Sebastian 4 Gajarský, Jakub 4 Gavenčiak, Tomáš 4 Kim, Eun Jung 4 Kneis, Joachim 4 Lauri, Juho 4 Ono, Hirotaka 4 Paul, Christophe 4 Telle, Jan Arne 3 Agrawal, Akanksha 3 Belmonte, Rémy 3 Bodlaender, Hans L. 3 Bui-Xuan, Binh-Minh 3 Chen, Jie 3 Courcelle, Bruno 3 De Oliveira Oliveira, Mateus 3 Dvořák, Pavel 3 Gaspers, Serge 3 Hamm, Thekla 3 Kanesh, Lawqueen 3 Kim, Eunjung 3 Kobayashi, Yasuaki 3 Lima, Paloma T. 3 Lokshtanov, Daniel 3 Lozin, Vadim Vladislavovich 3 Masařík, Tomáš 3 Meister, Daniel 3 Pokrývka, Filip 3 Sorge, Manuel 3 Toufar, Tomáš 3 van der Wegen, Marieke 3 Van Leeuwen, Erik Jan 3 Vatshelle, Martin 3 Zehavi, Meirav 2 Abu-Khzam, Faisal N. 2 Ahn, Jungho 2 Aldi, Marco 2 Alecu, Bogdan 2 Coelho, Hebert 2 Da Lozzo, Giordano 2 Dabrowski, Konrad Kazimierz 2 Das, Avinandan 2 Das, Bireswar 2 de Beaudrap, Niel 2 de Werra, Dominique 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 Gaikwad, Ajinkya 2 Gharibian, Sevag 2 Gözüpek, Didem 2 Gravier, Sylvain 2 Hecher, Markus 2 Hunter, Paul 2 Jeong, Jisu ...and 252 more Authors all top 5 Cited in 38 Serials 28 Algorithmica 26 Theoretical Computer Science 23 Discrete Applied Mathematics 12 Journal of Computer and System Sciences 12 SIAM Journal on Discrete Mathematics 9 European Journal of Combinatorics 7 Artificial Intelligence 7 Journal of Combinatorial Theory. Series B 6 Journal of Combinatorial Optimization 4 Discrete Mathematics 4 Theory of Computing Systems 4 Journal of Graph Algorithms and Applications 3 Discrete Optimization 2 Information Processing Letters 2 Journal of Graph Theory 2 Information and Computation 2 Logical Methods in Computer Science 2 Computer Science Review 1 Acta Informatica 1 Communications in Mathematical Physics 1 Memoirs of the American Mathematical Society 1 SIAM Journal on Computing 1 Acta Mathematica Hungarica 1 Graphs and Combinatorics 1 Discrete & Computational Geometry 1 Computers & Operations Research 1 Computational Geometry 1 Mathematical Programming. Series A. Series B 1 Formal Methods in System Design 1 The Journal of Artificial Intelligence Research (JAIR) 1 Annals of Mathematics and Artificial Intelligence 1 Journal of Scheduling 1 Theory and Practice of Logic Programming 1 Journal of Applied Logic 1 Algorithms 1 RAIRO. Theoretical Informatics and Applications 1 Quantum Studies: Mathematics and Foundations 1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences all top 5 Cited in 15 Fields 183 Computer science (68-XX) 145 Combinatorics (05-XX) 22 Operations research, mathematical programming (90-XX) 19 Mathematical logic and foundations (03-XX) 12 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 6 Order, lattices, ordered algebraic structures (06-XX) 3 Convex and discrete geometry (52-XX) 3 Quantum theory (81-XX) 2 Biology and other natural sciences (92-XX) 1 History and biography (01-XX) 1 General algebraic systems (08-XX) 1 Measure and integration (28-XX) 1 Partial differential equations (35-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year