Ganian, Robert; Hamm, Thekla; Knop, Dušan; Schierreich, Šimon; Suchý, Ondřej Hedonic diversity games: a complexity picture with more than two colors. (English) Zbl 07777844 Artif. Intell. 325, Article ID 104017, 20 p. (2023). MSC: 91A12 68Q27 91B68 PDFBibTeX XMLCite \textit{R. Ganian} et al., Artif. Intell. 325, Article ID 104017, 20 p. (2023; Zbl 07777844) Full Text: DOI arXiv
Chaplick, Steven; Di Giacomo, Emilio; Frati, Fabrizio; Ganian, Robert; Raftopoulou, Chrysanthi N.; Simonov, Kirill Testing upward planarity of partial 2-trees. (English) Zbl 07727760 Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 175-187 (2023). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 13764, 175--187 (2023; Zbl 07727760) Full Text: DOI arXiv
Ganian, Robert; Ordyniak, Sebastian; Rahul, C. S. Group activity selection with few agent types. (English) Zbl 07680772 Algorithmica 85, No. 5, 1111-1155 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 85, No. 5, 1111--1155 (2023; Zbl 07680772) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Kanj, Iyad; Ordyniak, Sebastian; Szeider, Stefan On the parameterized complexity of clustering problems for incomplete data. (English) Zbl 07661813 J. Comput. Syst. Sci. 134, 1-19 (2023). MSC: 68T09 62H30 68Q27 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 134, 1--19 (2023; Zbl 07661813) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Ordyniak, Sebastian Parameterized complexity of envy-free resource allocation in social networks. (English) Zbl 07638300 Artif. Intell. 315, Article ID 103826, 20 p. (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{E. Eiben} et al., Artif. Intell. 315, Article ID 103826, 20 p. (2023; Zbl 07638300) Full Text: DOI
Brand, Cornelius; Ceylan, Esra; Ganian, Robert; Hatschka, Christian; Korchemna, Viktoriia Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts. (English) Zbl 07682404 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 98-113 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Brand} et al., Lect. Notes Comput. Sci. 13453, 98--113 (2022; Zbl 07682404) Full Text: DOI arXiv
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan Algorithmic applications of tree-cut width. (English) Zbl 1503.05117 SIAM J. Discrete Math. 36, No. 4, 2635-2666 (2022). MSC: 05C85 68Q25 90C05 90C10 PDFBibTeX XMLCite \textit{R. Ganian} et al., SIAM J. Discrete Math. 36, No. 4, 2635--2666 (2022; Zbl 1503.05117) Full Text: DOI arXiv
Szeider, Stefan (ed.); Ganian, Robert (ed.); Silva, Alexandra (ed.) 47th international symposium on mathematical foundations of computer science, MFCS 2022, Vienna, Austria, August 22–26, 2022. (English) Zbl 1496.68034 LIPIcs – Leibniz International Proceedings in Informatics 241. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik (ISBN 978-3-95977-256-3). xvii, 83 articles, not consecutively paged, electronic only, open access (2022). MSC: 68-06 68Qxx 00B25 PDFBibTeX XMLCite \textit{S. Szeider} (ed.) et al., 47th international symposium on mathematical foundations of computer science, MFCS 2022, Vienna, Austria, August 22--26, 2022. Wadern: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik (2022; Zbl 1496.68034) Full Text: DOI Link
Ganian, Robert; Schidler, André; Sorge, Manuel; Szeider, Stefan Threshold treewidth and hypertree width. (English) Zbl 07577520 J. Artif. Intell. Res. (JAIR) 74, 1687-1713 (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{R. Ganian} et al., J. Artif. Intell. Res. (JAIR) 74, 1687--1713 (2022; Zbl 07577520) Full Text: DOI arXiv
Bergren, Dan; Eiben, Eduard; Ganian, Robert; Kanj, Iyad On covering segments with unit intervals. (English) Zbl 07537554 SIAM J. Discrete Math. 36, No. 2, 1200-1230 (2022). MSC: 68Q27 68Q25 PDFBibTeX XMLCite \textit{D. Bergren} et al., SIAM J. Discrete Math. 36, No. 2, 1200--1230 (2022; Zbl 07537554) Full Text: DOI
Ganian, Robert; Kim, Eun Jung; Slivovsky, Friedrich; Szeider, Stefan Sum-of-products with default values: algorithms and complexity results. (English) Zbl 07527533 J. Artif. Intell. Res. (JAIR) 73, 535-552 (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{R. Ganian} et al., J. Artif. Intell. Res. (JAIR) 73, 535--552 (2022; Zbl 07527533) Full Text: DOI
Ganian, Robert (ed.); Kratochvíl, Jan (ed.); Szeider, Stefan (ed.) Preface: Ninth workshop on graph classes, optimization, and width parameters, Vienna, Austria. (English) Zbl 1484.00103 Discrete Appl. Math. 312, 1-2 (2022). MSC: 00B15 00B25 05-06 68-06 PDFBibTeX XMLCite \textit{R. Ganian} (ed.) et al., Discrete Appl. Math. 312, 1--2 (2022; Zbl 1484.00103) Full Text: DOI
Ganian, Robert; Hamm, Thekla; Talvitie, Topi An efficient algorithm for counting Markov equivalent DAGs. (English) Zbl 07482901 Artif. Intell. 304, Article ID 103648, 13 p. (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{R. Ganian} et al., Artif. Intell. 304, Article ID 103648, 13 p. (2022; Zbl 07482901) Full Text: DOI
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin On strict (outer-)confluent graphs. (English) Zbl 1490.68152 J. Graph Algorithms Appl. 25, No. 1, 481-512 (2021). MSC: 68R10 05C62 05C69 05C85 PDFBibTeX XMLCite \textit{H. Förster} et al., J. Graph Algorithms Appl. 25, No. 1, 481--512 (2021; Zbl 1490.68152) Full Text: DOI
Dvořák, Pavel; Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints. (English) Zbl 1520.90171 Artif. Intell. 300, Article ID 103561, 21 p. (2021). MSC: 90C10 68Q25 68Q27 68W25 PDFBibTeX XMLCite \textit{P. Dvořák} et al., Artif. Intell. 300, Article ID 103561, 21 p. (2021; Zbl 1520.90171) Full Text: DOI
Ganian, Robert; Szeider, Stefan New width parameters for SAT and #SAT. (English) Zbl 1519.68168 Artif. Intell. 295, Article ID 103460, 18 p. (2021). MSC: 68R07 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Szeider}, Artif. Intell. 295, Article ID 103460, 18 p. (2021; Zbl 1519.68168) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung Measuring what matters: a hybrid approach to dynamic programming with treewidth. (English) Zbl 1517.68291 J. Comput. Syst. Sci. 121, 57-75 (2021). MSC: 68R10 05C85 68Q27 90C39 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 121, 57--75 (2021; Zbl 1517.68291) Full Text: DOI arXiv
Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. On structural parameterizations of the edge disjoint paths problem. (English) Zbl 1516.68061 Algorithmica 83, No. 6, 1605-1637 (2021). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 83, No. 6, 1605--1637 (2021; Zbl 1516.68061) Full Text: DOI
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. Towards a polynomial kernel for directed feedback vertex set. (English) Zbl 1511.68197 Algorithmica 83, No. 5, 1201-1221 (2021). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{B. Bergougnoux} et al., Algorithmica 83, No. 5, 1201--1221 (2021; Zbl 1511.68197) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian The power of cut-based parameters for computing edge-disjoint paths. (English) Zbl 1512.68220 Algorithmica 83, No. 2, 726-752 (2021). MSC: 68R10 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Ordyniak}, Algorithmica 83, No. 2, 726--752 (2021; Zbl 1512.68220) Full Text: DOI
Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian On structural parameterizations of the bounded-degree vertex deletion problem. (English) Zbl 1487.68178 Algorithmica 83, No. 1, 297-336 (2021). MSC: 68R10 05C07 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 83, No. 1, 297--336 (2021; Zbl 1487.68178) Full Text: DOI
Bergren, Dan; Eiben, Eduard; Ganian, Robert; Kanj, Iyad On covering segments with unit intervals. (English) Zbl 07650898 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 13, 17 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Bergren} et al., LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 13, 17 p. (2020; Zbl 07650898) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Klute, Fabian; Nöllenburg, Martin Extending nearly complete \(1\)-planar drawings in polynomial time. (English) Zbl 07559402 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 31, 16 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 31, 16 p. (2020; Zbl 07559402) Full Text: DOI arXiv
Ganian, Robert; de Haan, Ronald; Kanj, Iyad; Szeider, Stefan On existential MSO and its relation to ETH. (English) Zbl 1495.68088 ACM Trans. Comput. Theory 12, No. 4, Article No. 22, 32 p. (2020). MSC: 68Q15 03B16 03B70 PDFBibTeX XMLCite \textit{R. Ganian} et al., ACM Trans. Comput. Theory 12, No. 4, Article No. 22, 32 p. (2020; Zbl 1495.68088) Full Text: DOI Link
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for queue layouts. (English) Zbl 07436606 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 40-54 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 12590, 40--54 (2020; Zbl 07436606) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian Using decomposition-parameters for QBF: mind the prefix! (English) Zbl 1435.68123 J. Comput. Syst. Sci. 110, 1-21 (2020). MSC: 68Q27 68R07 68T20 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 110, 1--21 (2020; Zbl 1435.68123) Full Text: DOI Link
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-Joung Measuring what matters: a hybrid approach to dynamic programming with treewidth. (English) Zbl 1517.68292 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 42, 15 p. (2019). MSC: 68R10 05C85 68Q27 90C39 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 42, 15 p. (2019; Zbl 1517.68292) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian; Rahul, C. S. Group activity selection with few agent types. (English) Zbl 07525485 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 48, 16 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 48, 16 p. (2019; Zbl 07525485) Full Text: DOI arXiv
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for book embedding problems. (English) Zbl 1482.68170 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 365-378 (2019). MSC: 68R10 05C10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 11904, 365--378 (2019; Zbl 1482.68170) Full Text: DOI arXiv
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin On strict (outer-)confluent graphs. (English) Zbl 07266113 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 147-161 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{H. Förster} et al., Lect. Notes Comput. Sci. 11904, 147--161 (2019; Zbl 07266113) Full Text: DOI arXiv
Ganian, Robert; Ordyniak, Sebastian The power of cut-based parameters for computing edge disjoint paths. (English) Zbl 1512.68219 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 190-204 (2019). MSC: 68R10 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Ordyniak}, Lect. Notes Comput. Sci. 11789, 190--204 (2019; Zbl 1512.68219) Full Text: DOI arXiv Link
Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan SAT-encodings for treecut width and treedepth. (English) Zbl 1430.68206 Kobourov, Stephen (ed.) et al., Proceedings of the 21st workshop on algorithm engineering and experiments, ALENEX ’19, San Diego, CA, USA, January 7–8, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 117-129 (2019). MSC: 68R10 05C70 68R07 68W40 PDFBibTeX XMLCite \textit{R. Ganian} et al., in: Proceedings of the 21st workshop on algorithm engineering and experiments, ALENEX '19, San Diego, CA, USA, January 7--8, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 117--129 (2019; Zbl 1430.68206) Full Text: DOI arXiv
Ganian, R.; Narayanaswamy, N. S.; Ordyniak, S.; Rahul, C. S.; Ramanujan, M. S. On the complexity landscape of connected \(f\)-factor problems. (English) Zbl 1422.68110 Algorithmica 81, No. 6, 2606-2632 (2019). MSC: 68Q25 05C40 68Q17 68W20 PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 81, No. 6, 2606--2632 (2019; Zbl 1422.68110) Full Text: DOI
Eiben, E.; Ganian, R.; Kangas, K.; Ordyniak, S. Counting linear extensions: parameterizations by treewidth. (English) Zbl 1421.68074 Algorithmica 81, No. 4, 1657-1683 (2019). MSC: 68Q25 06A05 06A06 06A07 PDFBibTeX XMLCite \textit{E. Eiben} et al., Algorithmica 81, No. 4, 1657--1683 (2019; Zbl 1421.68074) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice Shrub-depth: capturing height of dense graphs. (English) Zbl 1515.03150 Log. Methods Comput. Sci. 15, No. 1, Paper No. 7, 25 p. (2019). MSC: 03C13 05C75 03B16 68Q60 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., Log. Methods Comput. Sci. 15, No. 1, Paper No. 7, 25 p. (2019; Zbl 1515.03150) Full Text: arXiv
Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru Parameterized complexity of asynchronous border minimization. (English) Zbl 1410.68165 Algorithmica 81, No. 1, 201-223 (2019). MSC: 68Q25 68Q17 92C40 PDFBibTeX XMLCite \textit{R. Ganian} et al., Algorithmica 81, No. 1, 201--223 (2019; Zbl 1410.68165) Full Text: DOI arXiv
Ganian, Robert; Klute, Fabian; Ordyniak, Sebastian On structural parameterizations of the bounded-degree vertex deletion problem. (English) Zbl 1487.68177 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 33, 14 p. (2018). MSC: 68R10 05C07 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 33, 14 p. (2018; Zbl 1487.68177) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian Small resolution proofs for QBF using dependency treewidth. (English) Zbl 1487.68135 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 28, 15 p. (2018). MSC: 68Q27 03F20 68R07 68T20 68V15 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 28, 15 p. (2018; Zbl 1487.68135) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Szeider, Stefan Meta-kernelization using well-structured modulators. (English) Zbl 1396.68055 Discrete Appl. Math. 248, 153-167 (2018). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{E. Eiben} et al., Discrete Appl. Math. 248, 153--167 (2018; Zbl 1396.68055) Full Text: DOI arXiv Link
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. (English) Zbl 1402.68199 J. Comput. Syst. Sci. 97, 121-146 (2018). Reviewer: Vladimír Lacko (Košice) MSC: 68W40 05C12 05C85 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 97, 121--146 (2018; Zbl 1402.68199) Full Text: DOI arXiv Link
Eiben, Eduard; Ganian, Robert; Lauri, Juho On the complexity of rainbow coloring problems. (English) Zbl 1390.05064 Discrete Appl. Math. 246, 38-48 (2018). MSC: 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{E. Eiben} et al., Discrete Appl. Math. 246, 38--48 (2018; Zbl 1390.05064) Full Text: DOI arXiv
Ganian, Robert; Ordyniak, Sebastian The complexity landscape of decompositional parameters for ILP. (English) Zbl 1451.90099 Artif. Intell. 257, 61-71 (2018). MSC: 90C10 68Q17 68Q25 90C60 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Ordyniak}, Artif. Intell. 257, 61--71 (2018; Zbl 1451.90099) Full Text: DOI arXiv Link
Eiben, Eduard; Ganian, Robert; Szeider, Stefan Solving problems on graphs of high rank-width. (English) Zbl 1390.68342 Algorithmica 80, No. 2, 742-771 (2018). MSC: 68Q25 03B25 05C75 05C85 PDFBibTeX XMLCite \textit{E. Eiben} et al., Algorithmica 80, No. 2, 742--771 (2018; Zbl 1390.68342) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian; Sridharan, Ramanujan On structural parameterizations of the edge disjoint paths problem. (English) Zbl 1457.68215 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 36, 13 p. (2017). MSC: 68R10 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 36, 13 p. (2017; Zbl 1457.68215) Full Text: DOI arXiv
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. Towards a polynomial kernel for directed feedback vertex set. (English) Zbl 1441.68163 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 36, 15 p. (2017). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{B. Bergougnoux} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 36, 15 p. (2017; Zbl 1441.68163) Full Text: DOI
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan Discovering archipelagos of tractability for constraint satisfaction and counting. (English) Zbl 1446.68073 ACM Trans. Algorithms 13, No. 2, Article No. 29, 32 p. (2017). MSC: 68Q25 68Q27 68T20 PDFBibTeX XMLCite \textit{R. Ganian} et al., ACM Trans. Algorithms 13, No. 2, Article No. 29, 32 p. (2017; Zbl 1446.68073) Full Text: DOI arXiv
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan Combining treewidth and backdoors for CSP. (English) Zbl 1402.68094 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 36, 17 p. (2017). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 36, 17 p. (2017; Zbl 1402.68094) Full Text: DOI arXiv
Ganian, Robert; Szeider, Stefan New width parameters for model counting. (English) Zbl 1496.68257 Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 38-52 (2017). MSC: 68R07 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Szeider}, Lect. Notes Comput. Sci. 10491, 38--52 (2017; Zbl 1496.68257) Full Text: DOI
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan Backdoor treewidth for SAT. (English) Zbl 1496.68256 Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 20-37 (2017). MSC: 68R07 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 10491, 20--37 (2017; Zbl 1496.68256) Full Text: DOI
Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan Discovering archipelagos of tractability for constraint satisfaction and counting. (English) Zbl 1410.68166 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1670-1681 (2016). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{R. Ganian} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1670--1681 (2016; Zbl 1410.68166) Full Text: DOI
Ganian, Robert; de Haan, Ronald; Kanj, Iyad; Szeider, Stefan On existential MSO and its relation to ETH. (English) Zbl 1398.68179 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 42, 14 p. (2016). MSC: 68Q15 03B15 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 42, 14 p. (2016; Zbl 1398.68179) Full Text: DOI
Ganian, Robert; Narayanaswamy, N. S.; Ordyniak, Sebastian; Rahul, C. S.; Ramanujan, M. S. On the complexity landscape of connected \(f\)-factor problems. (English) Zbl 1398.68233 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 41, 14 p. (2016). MSC: 68Q25 05C40 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 41, 14 p. (2016; Zbl 1398.68233) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Kwon, O-joung A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. (English) Zbl 1398.68228 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 34, 14 p. (2016). MSC: 68Q25 05C75 68Q17 68R10 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 34, 14 p. (2016; Zbl 1398.68228) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Kanga, Kustaa; Ordyniak, Sebastian Counting linear extensions: parameterizations by treewidth. (English) Zbl 1397.68098 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 39, 18 p. (2016). MSC: 68Q25 06A05 06A06 06A07 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 39, 18 p. (2016; Zbl 1397.68098) Full Text: DOI
Bova, Simone; Ganian, Robert; Szeider, Stefan Model checking existential logic on partially ordered sets. (English) Zbl 1367.68182 ACM Trans. Comput. Log. 17, No. 2, Article No. 10, 35 p. (2016). MSC: 68Q60 03B70 68Q25 PDFBibTeX XMLCite \textit{S. Bova} et al., ACM Trans. Comput. Log. 17, No. 2, Article No. 10, 35 p. (2016; Zbl 1367.68182) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Lauri, Juho On the complexity of rainbow coloring problems. (English) Zbl 1474.68221 Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9538, 209-220 (2016). MSC: 68R10 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. Eiben} et al., Lect. Notes Comput. Sci. 9538, 209--220 (2016; Zbl 1474.68221) Full Text: DOI arXiv
Bova, Simone; Ganian, Robert; Szeider, Stefan Quantified conjunctive queries on partially ordered sets. (English) Zbl 1335.68133 Theor. Comput. Sci. 618, 72-84 (2016). MSC: 68Q60 06A06 68Q25 PDFBibTeX XMLCite \textit{S. Bova} et al., Theor. Comput. Sci. 618, 72--84 (2016; Zbl 1335.68133) Full Text: DOI
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan Meta-kernelization with structural parameters. (English) Zbl 1346.68109 J. Comput. Syst. Sci. 82, No. 2, 333-346 (2016). MSC: 68Q25 03B25 05C70 05C85 68W05 PDFBibTeX XMLCite \textit{R. Ganian} et al., J. Comput. Syst. Sci. 82, No. 2, 333--346 (2016; Zbl 1346.68109) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Szeider, Stefan Meta-kernelization using well-structured modulators. (English) Zbl 1378.68073 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 114-126 (2015). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 114--126 (2015; Zbl 1378.68073) Full Text: DOI
Ganian, Robert; Hliněny, Petr; Král, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub FO model checking of interval graphs. (English) Zbl 1448.68299 Log. Methods Comput. Sci. 11, No. 4, Paper No. 11, 20 p. (2015). MSC: 68Q60 68Q27 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., Log. Methods Comput. Sci. 11, No. 4, Paper No. 11, 20 p. (2015; Zbl 1448.68299) Full Text: DOI
Ganian, Robert; Szeider, Stefan Community structure inspired algorithms for SAT and #SAT. (English) Zbl 1471.68322 Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 223-237 (2015). MSC: 68W05 68Q25 68Q27 68R07 68R10 68T20 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Szeider}, Lect. Notes Comput. Sci. 9340, 223--237 (2015; Zbl 1471.68322) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Szeider, Stefan Solving problems on graphs of high rank-width. (English) Zbl 1392.68199 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21839-7/pbk; 978-3-319-21840-3/ebook). Lecture Notes in Computer Science 9214, 314-326 (2015). MSC: 68Q25 03B25 05C75 05C85 PDFBibTeX XMLCite \textit{E. Eiben} et al., Lect. Notes Comput. Sci. 9214, 314--326 (2015; Zbl 1392.68199) Full Text: DOI arXiv
Ganian, Robert; Kronegger, Martin; Pfandler, Andreas; Popa, Alexandru Parameterized complexity of asynchronous border minimization. (English) Zbl 1459.68085 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9076, 428-440 (2015). MSC: 68Q27 68Q17 92-08 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 9076, 428--440 (2015; Zbl 1459.68085) Full Text: DOI arXiv
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan Algorithmic applications of tree-cut width. (English) Zbl 1465.68211 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 348-360 (2015). MSC: 68R10 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 9235, 348--360 (2015; Zbl 1465.68211) Full Text: DOI
Bova, Simone; Ganian, Robert; Szeider, Stefan Model checking existential logic on partially ordered sets. (English) Zbl 1401.68187 Proceedings of the joint meeting of the twenty-third EACSL annual conference on computer science logic, CSL, and the 2014 29th annual ACM/IEEE symposium on logic in computer science, LICS 2014, Vienna, Austria, July 14–18, 2014. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4503-2886-9). Paper No. 21, 10 p. (2014). MSC: 68Q60 03B70 06A06 68Q25 PDFBibTeX XMLCite \textit{S. Bova} et al., in: Proceedings of the joint meeting of the twenty-third EACSL annual conference on computer science logic, CSL, and the 2014 29th annual ACM/IEEE symposium on logic in computer science, LICS 2014, Vienna, Austria, July 14--18, 2014. Los Alamitos, CA: IEEE Computer Society. Paper No. 21, 10 p. (2014; Zbl 1401.68187) Full Text: DOI arXiv
Bova, Simone; Ganian, Robert; Szeider, Stefan Quantified conjunctive queries on partially ordered sets. (English) Zbl 1456.68096 Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 122-134 (2014). MSC: 68Q60 06A06 68Q27 PDFBibTeX XMLCite \textit{S. Bova} et al., Lect. Notes Comput. Sci. 8894, 122--134 (2014; Zbl 1456.68096) Full Text: DOI arXiv
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. (English) Zbl 1311.68087 J. Comput. Syst. Sci. 80, No. 1, 180-194 (2014). MSC: 68Q60 05C85 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., J. Comput. Syst. Sci. 80, No. 1, 180--194 (2014; Zbl 1311.68087) Full Text: DOI arXiv
Ganian, Robert; Obdržálek, Jan Expanding the expressive power of monadic second-order logic on restricted graph classes. (English) Zbl 1284.68463 Lecroq, Thierry (ed.) et al., Combinatorial algorithms. 24th international workshop, IWOCA 2013, Rouen, France, July 10–12, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-642-45277-2/pbk). Lecture Notes in Computer Science 8288, 164-177 (2013). Reviewer: Alex Nabebin (Moskva) MSC: 68R10 03B15 03B70 68Q17 68Q25 68Q60 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{J. Obdržálek}, Lect. Notes Comput. Sci. 8288, 164--177 (2013; Zbl 1284.68463) Full Text: DOI arXiv
Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan Meta-kernelization with structural parameters. (English) Zbl 1400.68089 Chatterjee, Krishnendu (ed.) et al., Mathematical foundations of computer science 2013. 38th international symposium, MFCS 2013, Klosterneuburg, Austria, August 26–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40312-5/pbk). Lecture Notes in Computer Science 8087, 457-468 (2013). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 8087, 457--468 (2013; Zbl 1400.68089) Full Text: DOI arXiv
Ganian, Robert; Hliněný, Petr; Král’, Daniel; Obdržálek, Jan; Schwartz, Jarett; Teska, Jakub FO model checking of interval graphs. (English) Zbl 1334.68132 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 250-262 (2013). MSC: 68Q60 68Q25 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 7966, 250--262 (2013; Zbl 1334.68132) Full Text: DOI arXiv
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan Better algorithms for satisfiability problems for formulas of bounded rank-width. (English) Zbl 1280.68239 Fundam. Inform. 123, No. 1, 59-76 (2013). MSC: 68T20 68Q25 68W05 PDFBibTeX XMLCite \textit{R. Ganian} et al., Fundam. Inform. 123, No. 1, 59--76 (2013; Zbl 1280.68239) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. (English) Zbl 1257.05168 Eur. J. Comb. 34, No. 3, 680-701 (2013). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Ganian} et al., Eur. J. Comb. 34, No. 3, 680--701 (2013; Zbl 1257.05168) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Nešetřil, Jaroslav; Obdržálek, Jan; Ossona de Mendez, Patrice; Ramadurai, Reshma When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\). (English) Zbl 1365.68323 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 419-430 (2012). MSC: 68Q60 03B15 05C05 05C75 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 7464, 419--430 (2012; Zbl 1365.68323) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. (English) Zbl 1245.68107 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 326-337, electronic only (2012). MSC: 68Q25 03B25 68Q60 68R10 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 14, 326--337 (2012; Zbl 1245.68107) Full Text: DOI
Ganian, Robert Twin-cover: beyond vertex cover in parameterized algorithmics. (English) Zbl 1352.68105 Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 259-271 (2012). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{R. Ganian}, Lect. Notes Comput. Sci. 7112, 259--271 (2012; Zbl 1352.68105) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan Clique-width: when hard does not mean impossible. (English) Zbl 1230.68109 Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 404-415, electronic only (2011). MSC: 68Q25 05C85 05C69 05C20 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 9, 404--415 (2011; Zbl 1230.68109) Full Text: DOI Link
Ganian, Robert Thread graphs, linear rank-width and their algorithmic applications. (English) Zbl 1295.68172 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 38-42 (2011). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{R. Ganian}, Lect. Notes Comput. Sci. 6460, 38--42 (2011; Zbl 1295.68172) Full Text: DOI
Ganian, Robert New results on the complexity of the Max- and Min-Rep problems. (English) Zbl 1298.68112 Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 238-247 (2011). MSC: 68Q25 05C35 PDFBibTeX XMLCite \textit{R. Ganian}, Lect. Notes Comput. Sci. 6543, 238--247 (2011; Zbl 1298.68112) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Obdržálek, Jan Better algorithms for satisfiability problems for formulas of bounded rank-width. (English) Zbl 1245.68108 Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 73-83, electronic only (2010). MSC: 68Q25 68R10 68T20 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 8, 73--83 (2010; Zbl 1245.68108) Full Text: DOI Link
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath Are there any good digraph width measures? (English) Zbl 1309.68150 Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 135-146 (2010). MSC: 68R10 05C10 05C20 05C83 05C85 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 6478, 135--146 (2010; Zbl 1309.68150) Full Text: DOI arXiv
Ganian, Robert; Hliněný, Petr On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. (English) Zbl 1231.05096 Discrete Appl. Math. 158, No. 7, 851-867 (2010). MSC: 05C15 68Q17 68R10 05C70 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{P. Hliněný}, Discrete Appl. Math. 158, No. 7, 851--867 (2010; Zbl 1231.05096) Full Text: DOI
Ganian, Robert; Hliněný, Petr New results on the complexity of oriented colouring on restricted digraph classes. (English) Zbl 1274.68138 van Leeuwen, Jan (ed.) et al., SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11265-2/pbk). Lecture Notes in Computer Science 5901, 428-439 (2010). MSC: 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{P. Hliněný}, Lect. Notes Comput. Sci. 5901, 428--439 (2010; Zbl 1274.68138) Full Text: DOI
Ganian, Robert The parameterized complexity of oriented colouring. (English) Zbl 1247.68098 Hlinený, Petr (ed.) et al., Annual doctoral workshop on mathematical and engineering methods in computer science (MEMICS’09). Selected papers based on the presentations at the workshop, November 13-15, 2009, Znojmo, Czech Republic. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-15-6). OASIcs – OpenAccess Series in Informatics 13, 86-93, electronic only (2009). MSC: 68Q17 05C15 05C85 PDFBibTeX XMLCite \textit{R. Ganian}, OASIcs -- OpenAccess Ser. Inform. 13, 86--93 (2009; Zbl 1247.68098) Full Text: DOI
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter On digraph width measures in parameterized algorithmics. (English) Zbl 1273.68276 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 185-197 (2009). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., Lect. Notes Comput. Sci. 5917, 185--197 (2009; Zbl 1273.68276) Full Text: DOI