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
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
Belmonte, Rémy; Sau, Ignasi On the complexity of finding large odd induced subgraphs and odd colorings. (English) Zbl 1515.68224 Algorithmica 83, No. 8, 2351-2373 (2021). MSC: 68R10 05C15 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{I. Sau}, Algorithmica 83, No. 8, 2351--2373 (2021; Zbl 1515.68224) Full Text: DOI arXiv
Aldi, Marco; de Beaudrap, Niel; Gharibian, Sevag; Saeedi, Seyran On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1462.81085 Commun. Math. Phys. 381, No. 1, 209-256 (2021). Reviewer: Eric Stachura (Marietta) MSC: 81Q10 81P68 68Q15 35P05 82B20 81P65 PDFBibTeX XMLCite \textit{M. Aldi} et al., Commun. Math. Phys. 381, No. 1, 209--256 (2021; Zbl 1462.81085) 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
Aldi, Marco; De Beaudrap, Niel; Gharibian, Sevag; Saeedi, Seyran On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1512.68099 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 38, 16 p. (2018). MSC: 68Q12 68R10 68T20 81P65 81P68 81Q10 PDFBibTeX XMLCite \textit{M. Aldi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 38, 16 p. (2018; Zbl 1512.68099) Full Text: DOI arXiv
Kreutzer, Stephan; Kwon, O-Joung Digraphs of bounded width. (English) Zbl 1407.05113 Bang-Jensen, Jørgen (ed.) et al., Classes of directed graphs. Cham: Springer. Springer Monogr. Math., 405-466 (2018). MSC: 05C20 PDFBibTeX XMLCite \textit{S. Kreutzer} and \textit{O-J. Kwon}, in: Classes of directed graphs. Cham: Springer. 405--466 (2018; Zbl 1407.05113) Full Text: DOI
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
Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan Model counting for CNF formulas of bounded modular treewidth. (English) Zbl 1353.68137 Algorithmica 76, No. 1, 168-194 (2016). MSC: 68Q25 PDFBibTeX XMLCite \textit{D. Paulusma} et al., Algorithmica 76, No. 1, 168--194 (2016; Zbl 1353.68137) Full Text: DOI Link
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