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
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
Wolf, Petra On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. (English) Zbl 07578097 Acta Inf. 59, No. 4, 505-519 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Wolf}, Acta Inf. 59, No. 4, 505--519 (2022; Zbl 07578097) Full Text: DOI
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601 SIAM J. Discrete Math. 36, No. 3, 1761-1787 (2022). MSC: 68Q27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 36, No. 3, 1761--1787 (2022; Zbl 07572601) Full Text: DOI arXiv
Chan, Timothy F.; Cooper, Jacob W.; Koutecký, Martin; Král, Daniel; Pekárková, Kristýna Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming. (English) Zbl 1493.90110 SIAM J. Comput. 51, No. 3, 664-700 (2022). MSC: 90C10 90C27 05B35 PDFBibTeX XMLCite \textit{T. F. Chan} et al., SIAM J. Comput. 51, No. 3, 664--700 (2022; Zbl 1493.90110) Full Text: DOI arXiv
Luo, Weidong On some FPT problems without polynomial Turing compressions. (English) Zbl 07467480 Theor. Comput. Sci. 905, 87-98 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Luo}, Theor. Comput. Sci. 905, 87--98 (2022; Zbl 07467480) 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
Chen, Lin; Koutecký, Martin; Xu, Lei; Shi, Weidong New bounds on augmenting steps of block-structured integer programs. (English) Zbl 07651172 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 33, 19 p. (2020). MSC: 90C10 15B36 68Q27 68W40 PDFBibTeX XMLCite \textit{L. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 33, 19 p. (2020; Zbl 07651172) Full Text: DOI arXiv
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020; Zbl 07651153) Full Text: DOI
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
Knop, Dušan; Koutecký, Martin; Mnich, Matthias Combinatorial \(n\)-fold integer programming and applications. (English) Zbl 1451.90100 Math. Program. 184, No. 1-2 (A), 1-34 (2020). MSC: 90C10 90C27 90C39 PDFBibTeX XMLCite \textit{D. Knop} et al., Math. Program. 184, No. 1--2 (A), 1--34 (2020; Zbl 1451.90100) 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
Kronegger, Martin; Ordyniak, Sebastian; Pfandler, Andreas Backdoors to planning. (English) Zbl 1478.68323 Artif. Intell. 269, 49-75 (2019). MSC: 68T20 68Q27 68W40 PDFBibTeX XMLCite \textit{M. Kronegger} et al., Artif. Intell. 269, 49--75 (2019; Zbl 1478.68323) Full Text: DOI
Koutecký, Martin; Levin, Asaf; Onn, Shmuel A parameterized strongly polynomial algorithm for block structured integer programs. (English) Zbl 1499.68153 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 85, 14 p. (2018). MSC: 68Q27 90C10 PDFBibTeX XMLCite \textit{M. Koutecký} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 85, 14 p. (2018; Zbl 1499.68153) Full Text: DOI arXiv
Dvořák, Pavel; Knop, Dušan Parameterized complexity of length-bounded cuts and multicuts. (English) Zbl 1400.90258 Algorithmica 80, No. 12, 3597-3617 (2018). MSC: 90C27 90C35 05C12 PDFBibTeX XMLCite \textit{P. Dvořák} and \textit{D. Knop}, Algorithmica 80, No. 12, 3597--3617 (2018; Zbl 1400.90258) Full Text: DOI arXiv
Knop, Dušan; Koutecký, Martin; Mnich, Matthias Combinatorial \(n\)-fold integer programming and applications. (English) Zbl 1442.90129 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 54, 14 p. (2017). MSC: 90C10 68Q27 68W40 90C27 PDFBibTeX XMLCite \textit{D. Knop} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 54, 14 p. (2017; Zbl 1442.90129) Full Text: DOI