Eiben, Eduard; Gutin, Gregory; Neary, Philip R.; Rambaud, Clément; Wahlström, Magnus; Yeo, Anders Preference swaps for the stable matching problem. (English) Zbl 07676483 Theor. Comput. Sci. 940, 222-230 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Eiben} et al., Theor. Comput. Sci. 940, 222--230 (2023; Zbl 07676483) Full Text: DOI arXiv
Einarson, Carl; Gutin, Gregory; Jansen, Bart M. P.; Majumdar, Diptapriyo; Wahlström, Magnus \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms. (English) Zbl 07639162 J. Comput. Syst. Sci. 133, 23-40 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{C. Einarson} et al., J. Comput. Syst. Sci. 133, 23--40 (2023; Zbl 07639162) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders Component order connectivity in directed graphs. (English) Zbl 07572801 Algorithmica 84, No. 9, 2767-2784 (2022). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 84, No. 9, 2767--2784 (2022; Zbl 07572801) Full Text: DOI arXiv
Kowalik, Łukasz; Li, Shaohua; Nadara, Wojciech; Smulewicz, Marcin; Wahlström, Magnus Many-visits TSP revisited. (English) Zbl 1478.68464 J. Comput. Syst. Sci. 124, 112-128 (2022). MSC: 68W40 68W20 90C27 PDFBibTeX XMLCite \textit{Ł. Kowalik} et al., J. Comput. Syst. Sci. 124, 112--128 (2022; Zbl 1478.68464) Full Text: DOI arXiv
Gutin, Gregory; Majumdar, Diptapriyo; Ordyniak, Sebastian; Wahlström, Magnus Parameterized pre-coloring extension and list coloring problems. (English) Zbl 1462.68083 SIAM J. Discrete Math. 35, No. 1, 575-596 (2021). MSC: 68Q27 05C15 05C85 68R10 68W05 68W20 PDFBibTeX XMLCite \textit{G. Gutin} et al., SIAM J. Discrete Math. 35, No. 1, 575--596 (2021; Zbl 1462.68083) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Eiben, Eduard; Gutin, Gregory; Wahlström, Magnus; Yeo, Anders Component order connectivity in directed graphs. (English) Zbl 07764093 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 2, 16 p. (2020). MSC: 68Q25 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 2, 16 p. (2020; Zbl 07764093) Full Text: DOI
Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus Multi-budgeted directed cuts. (English) Zbl 1477.68236 Algorithmica 82, No. 8, 2135-2155 (2020). Reviewer: Petr Kolman (Praha) MSC: 68R10 05C20 05C21 05C85 68Q17 68Q27 68W05 PDFBibTeX XMLCite \textit{S. Kratsch} et al., Algorithmica 82, No. 8, 2135--2155 (2020; Zbl 1477.68236) Full Text: DOI arXiv
Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus Alternative parameterizations of Metric Dimension. (English) Zbl 1436.68146 Theor. Comput. Sci. 806, 133-143 (2020). MSC: 68Q27 05C12 68R10 68W20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Theor. Comput. Sci. 806, 133--143 (2020; Zbl 1436.68146) Full Text: DOI arXiv
Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus Multi-budgeted directed cuts. (English) Zbl 1477.68237 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 18, 14 p. (2019). MSC: 68R10 05C20 05C21 05C85 68Q17 68Q27 68W05 PDFBibTeX XMLCite \textit{S. Kratsch} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 18, 14 p. (2019; Zbl 1477.68237) Full Text: DOI
Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus Path-contractions, edge deletions and connectivity preservation. (English) Zbl 1412.68084 J. Comput. Syst. Sci. 101, 1-20 (2019). MSC: 68Q25 05C40 PDFBibTeX XMLCite \textit{G. Gutin} et al., J. Comput. Syst. Sci. 101, 1--20 (2019; Zbl 1412.68084) Full Text: DOI arXiv Link
Gutin, Gregory; Reidl, Felix; Wahlström, Magnus \(k\)-distinct in- and out-branchings in digraphs. (English) Zbl 1391.68054 J. Comput. Syst. Sci. 95, 86-97 (2018). MSC: 68Q25 05C20 PDFBibTeX XMLCite \textit{G. Gutin} et al., J. Comput. Syst. Sci. 95, 86--97 (2018; Zbl 1391.68054) Full Text: DOI arXiv
Gutin, Gregory; Reidl, Felix; Wahlström, Magnus; Zehavi, Meirav Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. (English) Zbl 1391.68055 J. Comput. Syst. Sci. 95, 69-85 (2018). MSC: 68Q25 05C15 05C31 05C50 05C69 05C85 PDFBibTeX XMLCite \textit{G. Gutin} et al., J. Comput. Syst. Sci. 95, 69--85 (2018; Zbl 1391.68055) Full Text: DOI arXiv Link
Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus Path-contractions, edge deletions and connectivity preservation. (English) Zbl 1442.68074 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 47, 13 p. (2017). MSC: 68Q27 05C40 PDFBibTeX XMLCite \textit{G. Gutin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 47, 13 p. (2017; Zbl 1442.68074) Full Text: DOI
Gutin, Gregory; Jones, Mark; Sheng, Bin; Wahlström, Magnus; Yeo, Anders Acyclicity in edge-colored graphs. (English) Zbl 1351.05075 Discrete Math. 340, No. 2, 1-8 (2017). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Math. 340, No. 2, 1--8 (2017; Zbl 1351.05075) Full Text: DOI arXiv
Gutin, Gregory; Jones, Mark; Wahlström, Magnus The mixed Chinese postman problem parameterized by pathwidth and treedepth. (English) Zbl 1351.05100 SIAM J. Discrete Math. 30, No. 4, 2177-2205 (2016). MSC: 05C22 05C45 05C85 68R10 90C35 68Q17 PDFBibTeX XMLCite \textit{G. Gutin} et al., SIAM J. Discrete Math. 30, No. 4, 2177--2205 (2016; Zbl 1351.05100) Full Text: DOI
Gutin, Gregory; Wahlström, Magnus Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis. (English) Zbl 1347.68168 Inf. Process. Lett. 116, No. 3, 223-226 (2016). MSC: 68Q17 68Q25 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{M. Wahlström}, Inf. Process. Lett. 116, No. 3, 223--226 (2016; Zbl 1347.68168) Full Text: DOI arXiv
Gutin, Gregory; Jones, Mark; Wahlström, Magnus Structural parameterizations of the mixed Chinese postman problem. (English) Zbl 1467.68074 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 668-679 (2015). MSC: 68Q27 90C27 PDFBibTeX XMLCite \textit{G. Gutin} et al., Lect. Notes Comput. Sci. 9294, 668--679 (2015; Zbl 1467.68074) Full Text: DOI arXiv
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi A completeness theory for polynomial (Turing) kernelization. (English) Zbl 1312.68102 Algorithmica 71, No. 3, 702-730 (2015). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 71, No. 3, 702--730 (2015; Zbl 1312.68102) Full Text: DOI
Kratsch, Stefan; Wahlström, Magnus Compression via matroids: a randomized polynomial kernel for odd cycle transversal. (English) Zbl 1423.68217 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 94-103 (2012). MSC: 68Q25 05B35 05C85 PDFBibTeX XMLCite \textit{S. Kratsch} and \textit{M. Wahlström}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 94--103 (2012; Zbl 1423.68217) Full Text: Link
Wahlström, Magnus New plain-exponential time classes for graph homomorphism. (English) Zbl 1232.05138 Theory Comput. Syst. 49, No. 2, 273-282 (2011). MSC: 05C60 05C69 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{M. Wahlström}, Theory Comput. Syst. 49, No. 2, 273--282 (2011; Zbl 1232.05138) Full Text: DOI
Wahlström, Magnus New plain-exponential time classes for graph homomorphism. (English) Zbl 1248.68264 Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 346-355 (2009). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Wahlström}, Lect. Notes Comput. Sci. 5675, 346--355 (2009; Zbl 1248.68264) Full Text: DOI
Wahlström, Magnus A tighter bound for counting max-weight solutions to 2SAT instances. (English) Zbl 1142.68377 Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 202-213 (2008). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{M. Wahlström}, Lect. Notes Comput. Sci. 5018, 202--213 (2008; Zbl 1142.68377) Full Text: DOI