Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel High-multiplicity \(N\)-fold IP via configuration LP. (English) Zbl 1519.90120 Math. Program. 200, No. 1 (A), 199-227 (2023). MSC: 90C10 90C27 49M27 PDFBibTeX XMLCite \textit{D. Knop} et al., Math. Program. 200, No. 1 (A), 199--227 (2023; Zbl 1519.90120) Full Text: DOI
Gavenčiak, Tomáš; Koutecký, Martin; Knop, Dušan Integer programming in parameterized complexity: five miniatures. (English) Zbl 1510.90185 Discrete Optim. 44, Part 1, Article ID 100596, 33 p. (2022). MSC: 90C10 05C15 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{T. Gavenčiak} et al., Discrete Optim. 44, Part 1, Article ID 100596, 33 p. (2022; Zbl 1510.90185) Full Text: DOI
Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel Parameterized complexity of configuration integer programs. (English) Zbl 1525.90279 Oper. Res. Lett. 49, No. 6, 908-913 (2021). MSC: 90C10 90B80 90C27 PDFBibTeX XMLCite \textit{D. Knop} et al., Oper. Res. Lett. 49, No. 6, 908--913 (2021; Zbl 1525.90279) 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
Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin Integer programming in parameterized complexity: three miniatures. (English) Zbl 1520.68049 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 21, 16 p. (2019). MSC: 68Q27 05C15 05C85 68R10 90C10 PDFBibTeX XMLCite \textit{T. Gavenčiak} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 21, 16 p. (2019; Zbl 1520.68049) Full Text: DOI arXiv
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1427.68125 Log. Methods Comput. Sci. 15, No. 4, Paper No. 12, 32 p. (2019). MSC: 68Q25 03B16 68Q60 68R10 PDFBibTeX XMLCite \textit{D. Knop} et al., Log. Methods Comput. Sci. 15, No. 4, Paper No. 12, 32 p. (2019; Zbl 1427.68125) Full Text: arXiv
Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel Multitype Integer Monoid Optimization and Applications. arXiv:1909.07326 Preprint, arXiv:1909.07326 [cs.DS] (2019). BibTeX Cite \textit{D. Knop} et al., ``Multitype Integer Monoid Optimization and Applications'', Preprint, arXiv:1909.07326 [cs.DS] (2019) Full Text: arXiv OA License
Altmanová, Katerina; Knop, Dusan; Koutecký, Martin Evaluating and tuning \(n\)-fold integer programming. (English) Zbl 1496.90036 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 10, 14 p. (2018). MSC: 90C10 68W40 PDFBibTeX XMLCite \textit{K. Altmanová} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 10, 14 p. (2018; Zbl 1496.90036) Full Text: DOI arXiv
Knop, Dušan; Koutecký, Martin Scheduling meets \(n\)-fold integer programming. (English) Zbl 1418.90113 J. Sched. 21, No. 5, 493-503 (2018). MSC: 90B35 68M20 90C10 PDFBibTeX XMLCite \textit{D. Knop} and \textit{M. Koutecký}, J. Sched. 21, No. 5, 493--503 (2018; Zbl 1418.90113) Full Text: DOI arXiv
Fiala, Jiří; Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin; Kratochvíl, Jan Parameterized complexity of distance labeling and uniform channel assignment problems. (English) Zbl 1395.05143 Discrete Appl. Math. 248, 46-55 (2018). MSC: 05C78 05C82 05C12 90B80 PDFBibTeX XMLCite \textit{J. Fiala} et al., Discrete Appl. Math. 248, 46--55 (2018; Zbl 1395.05143) Full Text: DOI
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
Knop, Dušan; Koutecký, Martin; Mnich, Matthias Voting and bribing in single-exponential time. (English) Zbl 1402.68098 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 46, 14 p. (2017). MSC: 68Q25 90C10 91B12 91B14 PDFBibTeX XMLCite \textit{D. Knop} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 46, 14 p. (2017; Zbl 1402.68098) Full Text: DOI arXiv
Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1484.68072 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 344-357 (2017). MSC: 68Q25 03B16 68Q60 68R10 PDFBibTeX XMLCite \textit{D. Knop} et al., Lect. Notes Comput. Sci. 10520, 344--357 (2017; Zbl 1484.68072) Full Text: DOI arXiv
Fiala, Jiří; Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin; Kratochvíl, Jan Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems (extended abstract). (English) Zbl 1476.68207 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 67-78 (2016). MSC: 68R10 05C78 68Q27 PDFBibTeX XMLCite \textit{J. Fiala} et al., Lect. Notes Comput. Sci. 9797, 67--78 (2016; Zbl 1476.68207) Full Text: DOI arXiv