Ganian, Robert; Hamm, Thekla; Knop, Dušan; Roy, Sanjukta; Schierreich, Šimon; Suchý, Ondřej Maximizing social welfare in score-based social distance games. (English) Zbl 07810620 Verbrugge, Rineke (ed.), Proceedings of the nineteenth conference on theoretical aspects of rationality and knowledge, TARK, Oxford, United Kingdom, June 28–30, 2023. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 379, 272-286 (2023). MSC: 03-XX 91-XX PDFBibTeX XMLCite \textit{R. Ganian} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 379, 272--286 (2023; Zbl 07810620) Full Text: DOI arXiv
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
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
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for queue layouts. (English) Zbl 1498.05257 J. Graph Algorithms Appl. 26, No. 3, 335-352 (2022). MSC: 05C85 PDFBibTeX XMLCite \textit{S. Bhore} et al., J. Graph Algorithms Appl. 26, No. 3, 335--352 (2022; Zbl 1498.05257) Full Text: DOI
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
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
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
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
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for book embedding problems. (English) Zbl 1451.05222 J. Graph Algorithms Appl. 24, No. 4, 603-620 (2020). MSC: 05C85 PDFBibTeX XMLCite \textit{S. Bhore} et al., J. Graph Algorithms Appl. 24, No. 4, 603--620 (2020; Zbl 1451.05222) Full Text: DOI
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
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; 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
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; 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
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
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter Digraph width measures in parameterized algorithmics. (English) Zbl 1285.05077 Discrete Appl. Math. 168, 88-107 (2014). MSC: 05C20 05C12 05C69 PDFBibTeX XMLCite \textit{R. Ganian} et al., Discrete Appl. Math. 168, 88--107 (2014; Zbl 1285.05077) Full Text: DOI
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 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; 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