Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill Parameterized \(k\)-clustering: tractability island. (English) Zbl 07304641 J. Comput. Syst. Sci. 117, 50-74 (2021). MSC: 68 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 117, 50--74 (2021; Zbl 07304641) Full Text: DOI
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf Parameterized dynamic cluster editing. (English) Zbl 07303842 Algorithmica 83, No. 1, 1-44 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{J. Luo} et al., Algorithmica 83, No. 1, 1--44 (2021; Zbl 07303842) Full Text: DOI
Munier Kordon, Alix A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. (English) Zbl 07293738 Discrete Appl. Math. 290, 1-6 (2021). MSC: 68Q 90B PDF BibTeX XML Cite \textit{A. Munier Kordon}, Discrete Appl. Math. 290, 1--6 (2021; Zbl 07293738) Full Text: DOI
Miasnikov, Alexei; Nikolaev, Andrey On parameterized complexity of the word search problem in the Baumslag-Gersten group. (English) Zbl 07300092 Mantzaflaris, Angelos (ed.), Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC ’20, Kalamata, Greece, July 20–23, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7100-1). 360-363 (2020). MSC: 68W30 PDF BibTeX XML Cite \textit{A. Miasnikov} and \textit{A. Nikolaev}, in: Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC '20, Kalamata, Greece, July 20--23, 2020. New York, NY: Association for Computing Machinery (ACM). 360--363 (2020; Zbl 07300092) Full Text: DOI
Fichte, Johannes K.; Hecher, Markus; Pfandler, Andreas Lower bounds for QBFs of bounded treewidth. (English) Zbl 07299485 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 410-424 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{J. K. Fichte} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 410--424 (2020; Zbl 07299485) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Hitting topological minors is FPT. (English) Zbl 07298330 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1317-1326 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{F. V. Fomin} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1317--1326 (2020; Zbl 07298330) Full Text: DOI
Lokshtanov, Daniel; Misra, Pranabendu; Pilipczuk, Michał; Saurabh, Saket; Zehavi, Meirav An exponential time parameterized algorithm for planar disjoint paths. (English) Zbl 07298329 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1307-1316 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1307--1316 (2020; Zbl 07298329) Full Text: DOI
Nederlof, Jesper Detecting and counting small patterns in planar graphs in subexponential parameterized time. (English) Zbl 07298328 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1293-1306 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Nederlof}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1293--1306 (2020; Zbl 07298328) Full Text: DOI
Walteros, Jose L.; Buchanan, Austin Why is maximum clique often easy in practice? (English) Zbl 07298155 Oper. Res. 68, No. 6, 1866-1895 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. L. Walteros} and \textit{A. Buchanan}, Oper. Res. 68, No. 6, 1866--1895 (2020; Zbl 07298155) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 07294226 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). MSC: 05C85 05C10 68R10 05C83 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 07294226) Full Text: DOI
Pilipczuk, Marcin; Sorge, Manuel A double exponential lower bound for the distinct vectors problem. (English) Zbl 07290424 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 9, 4 p. (2020). MSC: 68P10 PDF BibTeX XML Cite \textit{M. Pilipczuk} and \textit{M. Sorge}, Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 9, 4 p. (2020; Zbl 07290424) Full Text: Link
Kolman, Petr; Koutecký, Martin; Tiwary, Hans Raj Extension complexity, MSO logic, and treewidth. (English) Zbl 07290423 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 8, 25 p. (2020). MSC: 68U05 03B70 68Q27 68R10 PDF BibTeX XML Cite \textit{P. Kolman} et al., Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 8, 25 p. (2020; Zbl 07290423) Full Text: Link
Cao, Yixin (ed); Pilipczuk, Marcin (ed.) 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. (English) Zbl 1451.68020 LIPIcs – Leibniz International Proceedings in Informatics 180. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-172-6). xviii, 37 articles, not consecutively paged, electronic only, open access (2020). MSC: 68-06 68Q25 68Q27 68Wxx 00B25 PDF BibTeX XML Cite \textit{Y. Cao} and \textit{M. Pilipczuk} (ed.), 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 (2020; Zbl 1451.68020) Full Text: DOI Link
Kratsch, Stefan; Wahlström, Magnus Representative sets and irrelevant vertices: new tools for kernelization. (English) Zbl 07273087 J. ACM 67, No. 3, Article No. 16, 50 p. (2020). MSC: 68 PDF BibTeX XML Cite \textit{S. Kratsch} and \textit{M. Wahlström}, J. ACM 67, No. 3, Article No. 16, 50 p. (2020; Zbl 07273087) Full Text: DOI
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. Subgraph isomorphism on graph classes that exclude a substructure. (English) Zbl 07272773 Algorithmica 82, No. 12, 3566-3587 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Algorithmica 82, No. 12, 3566--3587 (2020; Zbl 07272773) Full Text: DOI
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf The power of linear-time data reduction for maximum matching. (English) Zbl 07272772 Algorithmica 82, No. 12, 3521-3565 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{G. B. Mertzios} et al., Algorithmica 82, No. 12, 3521--3565 (2020; Zbl 07272772) Full Text: DOI
Chini, Peter; Meyer, Roland; Saivasan, Prakash Fine-grained complexity of safety verification. (English) Zbl 07268909 J. Autom. Reasoning 64, No. 7, 1419-1444 (2020). MSC: 68V15 PDF BibTeX XML Cite \textit{P. Chini} et al., J. Autom. Reasoning 64, No. 7, 1419--1444 (2020; Zbl 07268909) Full Text: DOI
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. I: General upper bounds. (English) Zbl 1450.05084 SIAM J. Discrete Math. 34, No. 3, 1623-1648 (2020). MSC: 05C83 05C85 68Q25 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., SIAM J. Discrete Math. 34, No. 3, 1623--1648 (2020; Zbl 1450.05084) Full Text: DOI
Bulteau, Laurent; Froese, Vincent; Niedermeier, Rolf Tight hardness results for consensus problems on circular strings and time series. (English) Zbl 07267538 SIAM J. Discrete Math. 34, No. 3, 1854-1883 (2020). MSC: 68Q17 68T10 92D20 PDF BibTeX XML Cite \textit{L. Bulteau} et al., SIAM J. Discrete Math. 34, No. 3, 1854--1883 (2020; Zbl 07267538) Full Text: DOI
Singh, Ranveer Parameterized complexity of determinant and permanent. (English) Zbl 07264845 Theor. Comput. Sci. 845, 50-58 (2020). MSC: 68Q27 05C20 05C50 05C85 15A15 PDF BibTeX XML Cite \textit{R. Singh}, Theor. Comput. Sci. 845, 50--58 (2020; Zbl 07264845) Full Text: DOI
Choudhary, Pratibha; Jain, Pallavi; Krithika, R.; Sahlot, Vibha Vertex deletion on split graphs: beyond 4-hitting set. (English) Zbl 07264843 Theor. Comput. Sci. 845, 21-37 (2020). MSC: 68R10 68Q27 68W25 PDF BibTeX XML Cite \textit{P. Choudhary} et al., Theor. Comput. Sci. 845, 21--37 (2020; Zbl 07264843) Full Text: DOI
Meeks, Kitty; Rastegari, Baharak Solving hard stable matching problems involving groups of similar agents. (English) Zbl 07263642 Theor. Comput. Sci. 844, 171-194 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{K. Meeks} and \textit{B. Rastegari}, Theor. Comput. Sci. 844, 171--194 (2020; Zbl 07263642) Full Text: DOI
Andersen, J. B.; Bang-Jensen, J.; Yeo, A. On the parameterized complexity of 2-partitions. (English) Zbl 07263637 Theor. Comput. Sci. 844, 97-105 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{J. B. Andersen} et al., Theor. Comput. Sci. 844, 97--105 (2020; Zbl 07263637) Full Text: DOI
Bonnet, Édouard; Cabello, Sergio; Mohar, Bojan; Pérez-Rosés, Hebert The inverse Voronoi problem in graphs. I: Hardness. (English) Zbl 07259202 Algorithmica 82, No. 10, 3018-3040 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{É. Bonnet} et al., Algorithmica 82, No. 10, 3018--3040 (2020; Zbl 07259202) Full Text: DOI
Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket On the approximate compressibility of connected vertex cover. (English) Zbl 07259198 Algorithmica 82, No. 10, 2902-2926 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{D. Majumdar} et al., Algorithmica 82, No. 10, 2902--2926 (2020; Zbl 07259198) Full Text: DOI
van Bevern, René; Smirnov, Pavel V. Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space. (English) Zbl 07256105 Inf. Process. Lett. 163, Article ID 105998, 8 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{R. van Bevern} and \textit{P. V. Smirnov}, Inf. Process. Lett. 163, Article ID 105998, 8 p. (2020; Zbl 07256105) Full Text: DOI
Tsur, Dekel An FPT algorithm for orthogonal buttons and scissors. (English) Zbl 07256104 Inf. Process. Lett. 163, Article ID 105997, 5 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{D. Tsur}, Inf. Process. Lett. 163, Article ID 105997, 5 p. (2020; Zbl 07256104) Full Text: DOI
Miao, Dongjing; Li, Jianzhong; Cai, Zhipeng The parameterized complexity and kernelization of resilience for database queries. (English) Zbl 07248843 Theor. Comput. Sci. 840, 199-211 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{D. Miao} et al., Theor. Comput. Sci. 840, 199--211 (2020; Zbl 07248843) Full Text: DOI
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf Diminishable parameterized problems and strict polynomial kernelization. (English) Zbl 07244820 Computability 9, No. 1, 1-24 (2020). MSC: 03D PDF BibTeX XML Cite \textit{H. Fernau} et al., Computability 9, No. 1, 1--24 (2020; Zbl 07244820) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 90C35 PDF BibTeX XML Cite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Hermelin, Danny; Manoussakis, George; Pinedo, Michael; Shabtay, Dvir; Yedidsion, Liron Parameterized multi-scenario single-machine scheduling problems. (English) Zbl 1453.68095 Algorithmica 82, No. 9, 2644-2667 (2020). MSC: 68Q27 90B35 PDF BibTeX XML Cite \textit{D. Hermelin} et al., Algorithmica 82, No. 9, 2644--2667 (2020; Zbl 1453.68095) Full Text: DOI
An, Zhao; Feng, Qilong; Kanj, Iyad; Xia, Ge The complexity of tree partitioning. (English) Zbl 1453.68120 Algorithmica 82, No. 9, 2606-2643 (2020). MSC: 68R10 05C05 05C70 05C85 68Q27 68W40 PDF BibTeX XML Cite \textit{Z. An} et al., Algorithmica 82, No. 9, 2606--2643 (2020; Zbl 1453.68120) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Independent set reconfiguration parameterized by modular-width. (English) Zbl 1453.68124 Algorithmica 82, No. 9, 2586-2605 (2020). MSC: 68R10 05C69 68Q27 PDF BibTeX XML Cite \textit{R. Belmonte} et al., Algorithmica 82, No. 9, 2586--2605 (2020; Zbl 1453.68124) Full Text: DOI
Gao, Xiangyu; Li, Jianzhong; Miao, Dongjing; Liu, Xianmin Recognizing the tractability in big data computing. (English) Zbl 1453.68167 Theor. Comput. Sci. 838, 195-207 (2020). MSC: 68T09 68Q25 68Q27 PDF BibTeX XML Cite \textit{X. Gao} et al., Theor. Comput. Sci. 838, 195--207 (2020; Zbl 1453.68167) Full Text: DOI
Bliznets, Ivan; Sagunov, Danil Lower bounds for the happy coloring problems. (English) Zbl 1453.68126 Theor. Comput. Sci. 838, 94-110 (2020). MSC: 68R10 05C15 68Q17 68Q27 68W20 PDF BibTeX XML Cite \textit{I. Bliznets} and \textit{D. Sagunov}, Theor. Comput. Sci. 838, 94--110 (2020; Zbl 1453.68126) Full Text: DOI
Corò, Federico; D’Angelo, Gianlorenzo; Mkrtchyan, Vahan On the fixed-parameter tractability of the maximum connectivity improvement problem. (English) Zbl 1453.68130 Theory Comput. Syst. 64, No. 6, 1094-1109 (2020). MSC: 68R10 05C40 68Q17 68Q27 PDF BibTeX XML Cite \textit{F. Corò} et al., Theory Comput. Syst. 64, No. 6, 1094--1109 (2020; Zbl 1453.68130) Full Text: DOI
Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu Conflict free version of covering problems on graphs: classical and parameterized. (English) Zbl 1453.68136 Theory Comput. Syst. 64, No. 6, 1067-1093 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{P. Jain} et al., Theory Comput. Syst. 64, No. 6, 1067--1093 (2020; Zbl 1453.68136) Full Text: DOI
Chalermsook, Parinya; Cygan, Marek; Kortsarz, Guy; Laekhanukit, Bundit; Manurangsi, Pasin; Nanongkai, Danupon; Trevisan, Luca From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more. (English) Zbl 1452.68083 SIAM J. Comput. 49, No. 4, 772-810 (2020). MSC: 68Q17 05C69 68Q27 68R10 68W25 68W40 PDF BibTeX XML Cite \textit{P. Chalermsook} et al., SIAM J. Comput. 49, No. 4, 772--810 (2020; Zbl 1452.68083) Full Text: DOI
Agrawal, Akanksha; Aravind, N. R.; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami; Lauri, Juho; Misra, Neeldhara; Reddy, I. Vinod Parameterized complexity of happy coloring problems. (English) Zbl 07235789 Theor. Comput. Sci. 835, 58-81 (2020). MSC: 68Q27 05C15 68Q25 PDF BibTeX XML Cite \textit{A. Agrawal} et al., Theor. Comput. Sci. 835, 58--81 (2020; Zbl 07235789) Full Text: DOI
Bonnet, Édouard; Bousquet, Nicolas; Charbit, Pierre; Thomassé, Stéphan; Watrigant, Rémi Parameterized complexity of independent set in H-free graphs. (English) Zbl 1452.68090 Algorithmica 82, No. 8, 2360-2394 (2020). MSC: 68Q27 05C69 05C85 68Q17 68R10 PDF BibTeX XML Cite \textit{É. Bonnet} et al., Algorithmica 82, No. 8, 2360--2394 (2020; Zbl 1452.68090) Full Text: DOI
Eppstein, David; Havvaei, Elham Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1452.68135 Algorithmica 82, No. 8, 2337-2359 (2020). MSC: 68R10 03B70 05C05 05C76 05C85 68Q27 92D15 PDF BibTeX XML Cite \textit{D. Eppstein} and \textit{E. Havvaei}, Algorithmica 82, No. 8, 2337--2359 (2020; Zbl 1452.68135) Full Text: DOI
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; dos Santos, Vinícius Fernandes; Sau, Ignasi; Silva, Ana Dual parameterization of weighted coloring. (English) Zbl 1452.68129 Algorithmica 82, No. 8, 2316-2336 (2020). MSC: 68R10 05C15 68Q27 68W40 PDF BibTeX XML Cite \textit{J. Araújo} et al., Algorithmica 82, No. 8, 2316--2336 (2020; Zbl 1452.68129) Full Text: DOI
Roth, Marc; Schmitt, Johannes Counting induced subgraphs: a topological approach to #W[1]-hardness. (English) Zbl 1452.68086 Algorithmica 82, No. 8, 2267-2291 (2020). MSC: 68Q17 05C30 05C60 05E45 68Q27 PDF BibTeX XML Cite \textit{M. Roth} and \textit{J. Schmitt}, Algorithmica 82, No. 8, 2267--2291 (2020; Zbl 1452.68086) Full Text: DOI
Barbero, Florian; Isenmann, Lucas; Thiebaut, Jocelyn On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs. (English) Zbl 1452.68131 Algorithmica 82, No. 8, 2243-2266 (2020). MSC: 68R10 05C12 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{F. Barbero} et al., Algorithmica 82, No. 8, 2243--2266 (2020; Zbl 1452.68131) Full Text: DOI
Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid Best-case and worst-case sparsifiability of Boolean CSPs. (English) Zbl 1452.68176 Algorithmica 82, No. 8, 2200-2242 (2020). MSC: 68T20 68Q17 68Q27 68R07 PDF BibTeX XML Cite \textit{H. Chen} et al., Algorithmica 82, No. 8, 2200--2242 (2020; Zbl 1452.68176) Full Text: DOI
Meeks, Kitty; Skerman, Fiona The parameterised complexity of computing the maximum modularity of a graph. (English) Zbl 1452.68091 Algorithmica 82, No. 8, 2174-2199 (2020). MSC: 68Q27 68R10 68W25 PDF BibTeX XML Cite \textit{K. Meeks} and \textit{F. Skerman}, Algorithmica 82, No. 8, 2174--2199 (2020; Zbl 1452.68091) Full Text: DOI
Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus Multi-budgeted directed cuts. (English) Zbl 07233371 Algorithmica 82, No. 8, 2135-2155 (2020). MSC: 68R10 68Q27 68W05 PDF BibTeX XML Cite \textit{S. Kratsch} et al., Algorithmica 82, No. 8, 2135--2155 (2020; Zbl 07233371) Full Text: DOI
Paul, Christophe (ed.); Pilipczuk, Michał (ed.) Special issue dedicated to the 13th international symposium on parameterized and exact computation. (English) Zbl 1452.68012 Algorithmica 82, No. 8, 2133-2134 (2020). MSC: 68-06 68Q25 68Q27 68Wxx 00B25 PDF BibTeX XML Cite \textit{C. Paul} (ed.) and \textit{M. Pilipczuk} (ed.), Algorithmica 82, No. 8, 2133--2134 (2020; Zbl 1452.68012) Full Text: DOI
Dvořák, Wolfgang; Woltran, Stefan Complexity of abstract argumentation under a claim-centric view. (English) Zbl 1451.68261 Artif. Intell. 285, Article ID 103290, 21 p. (2020). MSC: 68T27 68Q25 68Q27 PDF BibTeX XML Cite \textit{W. Dvořák} and \textit{S. Woltran}, Artif. Intell. 285, Article ID 103290, 21 p. (2020; Zbl 1451.68261) Full Text: DOI
Agrawal, Akanksha; Gupta, Sushmita; Jain, Pallavi; Krithika, R. Quadratic vertex kernel for split vertex deletion. (English) Zbl 1451.68196 Theor. Comput. Sci. 833, 164-172 (2020). MSC: 68R10 05C70 68Q17 68Q27 PDF BibTeX XML Cite \textit{A. Agrawal} et al., Theor. Comput. Sci. 833, 164--172 (2020; Zbl 1451.68196) Full Text: DOI
Chandrasekaran, Karthekeyan; Mnich, Matthias; Mozaffari, Sahand Odd multiway cut in directed acyclic graphs. (English) Zbl 1443.68123 SIAM J. Discrete Math. 34, No. 2, 1385-1408 (2020). MSC: 68R10 68Q27 68W25 PDF BibTeX XML Cite \textit{K. Chandrasekaran} et al., SIAM J. Discrete Math. 34, No. 2, 1385--1408 (2020; Zbl 1443.68123) Full Text: DOI
Arvind, Vikraman; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg On the Weisfeiler-Leman dimension of fractional packing. (English) Zbl 1437.68134 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 357-368 (2020). MSC: 68R10 05C60 05C70 05C72 68Q25 68Q27 PDF BibTeX XML Cite \textit{V. Arvind} et al., Lect. Notes Comput. Sci. 12038, 357--368 (2020; Zbl 1437.68134) Full Text: DOI
Dondi, Riccardo; Mauri, Giancarlo; Zoppis, Italo Complexity issues of string to graph approximate matching. (English) Zbl 1437.68208 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 248-259 (2020). MSC: 68W32 68Q17 68Q27 68R10 PDF BibTeX XML Cite \textit{R. Dondi} et al., Lect. Notes Comput. Sci. 12038, 248--259 (2020; Zbl 1437.68208) Full Text: DOI
Ashok, Pradeesha; Bhargava, Rathin; Gupta, Naman; Khalid, Mohammad; Yadav, Dolly Minimum conflict free colouring parameterized by treewidth. (English) Zbl 1453.68094 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 439-450 (2020). MSC: 68Q27 05C15 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{P. Ashok} et al., Lect. Notes Comput. Sci. 12016, 439--450 (2020; Zbl 1453.68094) Full Text: DOI
Kaur, Chamanvir; Misra, Neeldhara On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 427-438 (2020). MSC: 68Q27 05C05 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{C. Kaur} and \textit{N. Misra}, Lect. Notes Comput. Sci. 12016, 427--438 (2020; Zbl 1453.68096) Full Text: DOI
Steiner, Raphael; Wiederrecht, Sebastian Parameterized algorithms for directed modular width. (English) Zbl 1453.68097 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 415-426 (2020). MSC: 68Q27 05C85 68R10 68W25 PDF BibTeX XML Cite \textit{R. Steiner} and \textit{S. Wiederrecht}, Lect. Notes Comput. Sci. 12016, 415--426 (2020; Zbl 1453.68097) Full Text: DOI
Tauer, Bjoern; Fischer, Dennis; Fuchs, Janosch; Koch, Laura Vargas; Zieger, Stephan Waiting for trains: complexity results. (English) Zbl 1453.68093 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 282-303 (2020). MSC: 68Q25 68Q17 68Q27 90B20 90B35 90C27 PDF BibTeX XML Cite \textit{B. Tauer} et al., Lect. Notes Comput. Sci. 12016, 282--303 (2020; Zbl 1453.68093) Full Text: DOI
Morawietz, Nils; Grüttemeier, Niels; Komusiewicz, Christian; Sommer, Frank Refined parameterizations for computing colored cuts in edge-colored graphs. (English) Zbl 1440.68140 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 248-259 (2020). MSC: 68Q27 05C15 05C40 68R10 PDF BibTeX XML Cite \textit{N. Morawietz} et al., Lect. Notes Comput. Sci. 12011, 248--259 (2020; Zbl 1440.68140) Full Text: DOI
Abu-Khzam, Faisal N.; Bazgan, Cristina; Fernau, Henning Parameterized dynamic variants of red-blue dominating set. (English) Zbl 1440.68134 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 236-247 (2020). MSC: 68Q27 05C69 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 12011, 236--247 (2020; Zbl 1440.68134) Full Text: DOI
Tredup, Ronny Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems. (English) Zbl 1440.68179 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 223-235 (2020). MSC: 68Q85 68Q27 PDF BibTeX XML Cite \textit{R. Tredup}, Lect. Notes Comput. Sci. 12011, 223--235 (2020; Zbl 1440.68179) Full Text: DOI
Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (English) Zbl 1445.68171 J. Comput. Syst. Sci. 113, 150-162 (2020). MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{N. Misra} et al., J. Comput. Syst. Sci. 113, 150--162 (2020; Zbl 1445.68171) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Lima, Paloma T.; Montealegre, Pedro Finding connected secluded subgraphs. (English) Zbl 1443.68130 J. Comput. Syst. Sci. 113, 101-124 (2020). MSC: 68R10 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 113, 101--124 (2020; Zbl 1443.68130) Full Text: DOI
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens Maximum cuts in edge-colored graphs. (English) Zbl 1440.05085 Discrete Appl. Math. 281, 229-234 (2020). MSC: 05C15 05C35 05C10 68Q17 PDF BibTeX XML Cite \textit{L. Faria} et al., Discrete Appl. Math. 281, 229--234 (2020; Zbl 1440.05085) Full Text: DOI
Fox, Jacob; Roughgarden, Tim; Seshadhri, C.; Wei, Fan; Wein, Nicole Finding cliques in social networks: a new distribution-free model. (English) Zbl 1443.68128 SIAM J. Comput. 49, No. 2, 448-464 (2020). MSC: 68R10 05C69 05C85 68Q27 68W40 91D30 PDF BibTeX XML Cite \textit{J. Fox} et al., SIAM J. Comput. 49, No. 2, 448--464 (2020; Zbl 1443.68128) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis Parameterized aspects of strong subgraph closure. (English) Zbl 1442.68168 Algorithmica 82, No. 7, 2006-2038 (2020). MSC: 68R10 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Algorithmica 82, No. 7, 2006--2038 (2020; Zbl 1442.68168) Full Text: DOI
Feldmann, Andreas Emil; Marx, Dániel The parameterized hardness of the \(k\)-center problem in transportation networks. (English) Zbl 1439.90059 Algorithmica 82, No. 7, 1989-2005 (2020). MSC: 90C27 90C35 90B06 PDF BibTeX XML Cite \textit{A. E. Feldmann} and \textit{D. Marx}, Algorithmica 82, No. 7, 1989--2005 (2020; Zbl 1439.90059) Full Text: DOI
Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Saurabh, Saket Parameterized complexity of conflict-free matchings and paths. (English) Zbl 1442.68072 Algorithmica 82, No. 7, 1939-1965 (2020). MSC: 68Q27 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{A. Agrawal} et al., Algorithmica 82, No. 7, 1939--1965 (2020; Zbl 1442.68072) Full Text: DOI
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian Parameterized orientable deletion. (English) Zbl 1441.68186 Algorithmica 82, No. 7, 1909-1938 (2020). MSC: 68R10 05C20 68Q17 68Q27 68W25 68W40 PDF BibTeX XML Cite \textit{T. Hanaka} et al., Algorithmica 82, No. 7, 1909--1938 (2020; Zbl 1441.68186) Full Text: DOI
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning Domination chain: characterisation, classical complexity, parameterised complexity and approximability. (English) Zbl 1439.05174 Discrete Appl. Math. 280, 23-42 (2020). MSC: 05C69 05C10 05C85 68Q17 68Q27 PDF BibTeX XML Cite \textit{C. Bazgan} et al., Discrete Appl. Math. 280, 23--42 (2020; Zbl 1439.05174) Full Text: DOI
Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. Color spanning objects: algorithms and hardness results. (English) Zbl 1437.68181 Discrete Appl. Math. 280, 14-22 (2020). MSC: 68U05 68Q17 68Q27 68W05 PDF BibTeX XML Cite \textit{S. Banerjee} et al., Discrete Appl. Math. 280, 14--22 (2020; Zbl 1437.68181) Full Text: DOI
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Parameterized (approximate) defective coloring. (English) Zbl 1433.68178 SIAM J. Discrete Math. 34, No. 2, 1084-1106 (2020). MSC: 68Q27 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 34, No. 2, 1084--1106 (2020; Zbl 1433.68178) Full Text: DOI
Arora, Pranav; Banik, Aritra; Paliwal, Vijay Kumar; Raman, Venkatesh List-coloring – parameterizing from triviality. (English) Zbl 1437.68069 Theor. Comput. Sci. 821, 102-110 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68Q27 05C15 PDF BibTeX XML Cite \textit{P. Arora} et al., Theor. Comput. Sci. 821, 102--110 (2020; Zbl 1437.68069) Full Text: DOI
Bessy, Stephane; Bougeret, Marin; Chaplick, Steven; Gonçalves, Daniel; Paul, Christophe On independent set in \(B_1\)-EPG graphs. (English) Zbl 1437.05178 Discrete Appl. Math. 278, 62-72 (2020). MSC: 05C69 05C85 68R10 68Q17 PDF BibTeX XML Cite \textit{S. Bessy} et al., Discrete Appl. Math. 278, 62--72 (2020; Zbl 1437.05178) Full Text: DOI
Masařík, Tomáš; Toufar, Tomáš Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227 Discrete Appl. Math. 278, 51-61 (2020). MSC: 05C99 68Q27 PDF BibTeX XML Cite \textit{T. Masařík} and \textit{T. Toufar}, Discrete Appl. Math. 278, 51--61 (2020; Zbl 1437.05227) Full Text: DOI
Bannach, Max; Tantau, Till Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits. (English) Zbl 1433.68177 Theory Comput. Syst. 64, No. 3, 374-399 (2020). MSC: 68Q27 05C65 68Q06 68W10 68W40 90C27 PDF BibTeX XML Cite \textit{M. Bannach} and \textit{T. Tantau}, Theory Comput. Syst. 64, No. 3, 374--399 (2020; Zbl 1433.68177) Full Text: DOI
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1433.68164 Algorithmica 82, No. 6, 1616-1639 (2020). MSC: 68Q25 05C20 05C38 05C70 05C85 68Q17 68Q27 68R10 PDF BibTeX XML Cite \textit{J. Araújo} et al., Algorithmica 82, No. 6, 1616--1639 (2020; Zbl 1433.68164) Full Text: DOI
Biedl, Therese; Chimani, Markus; Derka, Martin; Mutzel, Petra Crossing number for graphs with bounded pathwidth. (English) Zbl 1433.68280 Algorithmica 82, No. 2, 355-384 (2020). MSC: 68R10 68Q17 68Q27 68W25 PDF BibTeX XML Cite \textit{T. Biedl} et al., Algorithmica 82, No. 2, 355--384 (2020; Zbl 1433.68280) Full Text: DOI
Misra, Pranabendu; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket Linear representation of transversal matroids and gammoids parameterized by rank. (English) Zbl 1433.68181 Theor. Comput. Sci. 818, 51-59 (2020). MSC: 68Q27 05B35 68W40 PDF BibTeX XML Cite \textit{P. Misra} et al., Theor. Comput. Sci. 818, 51--59 (2020; Zbl 1433.68181) Full Text: DOI
Feng, Qilong; Zhu, Senmin; Wang, Jianxin An improved kernel for max-bisection above tight lower bound. (English) Zbl 1440.68136 Theor. Comput. Sci. 818, 12-21 (2020). Reviewer: K. Subramani (Morgantown) MSC: 68Q27 05C70 68R10 PDF BibTeX XML Cite \textit{Q. Feng} et al., Theor. Comput. Sci. 818, 12--21 (2020; Zbl 1440.68136) Full Text: DOI
Jaffke, Lars; Lima, Paloma T. A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs. (English) Zbl 1436.68138 Theor. Comput. Sci. 815, 182-196 (2020). Reviewer: Xueliang Li (Tianjin) MSC: 68Q25 05C15 68Q27 68R10 PDF BibTeX XML Cite \textit{L. Jaffke} and \textit{P. T. Lima}, Theor. Comput. Sci. 815, 182--196 (2020; Zbl 1436.68138) Full Text: DOI
Xiao, Mingyu; Sheng, Zimo Improved parameterized algorithms and kernels for mixed domination. (English) Zbl 1433.68182 Theor. Comput. Sci. 815, 109-120 (2020). MSC: 68Q27 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{M. Xiao} and \textit{Z. Sheng}, Theor. Comput. Sci. 815, 109--120 (2020; Zbl 1433.68182) Full Text: DOI
Tsur, Dekel Faster algorithms for cograph edge modification problems. (English) Zbl 1432.68371 Inf. Process. Lett. 158, Article ID 105946, 6 p. (2020). MSC: 68R10 05C85 68Q27 PDF BibTeX XML Cite \textit{D. Tsur}, Inf. Process. Lett. 158, Article ID 105946, 6 p. (2020; Zbl 1432.68371) Full Text: DOI
Cardinal, Jean; Nummenpalo, Jerri; Welzl, Emo Solving and sampling with many solutions. (English) Zbl 1432.68174 Algorithmica 82, No. 5, 1474-1489 (2020). MSC: 68Q25 68Q27 68R07 68W20 68W40 PDF BibTeX XML Cite \textit{J. Cardinal} et al., Algorithmica 82, No. 5, 1474--1489 (2020; Zbl 1432.68174) Full Text: DOI
Bulteau, Laurent; Schmid, Markus L. Consensus strings with small maximum distance and small distance sum. (English) Zbl 1432.68190 Algorithmica 82, No. 5, 1378-1409 (2020). MSC: 68Q27 68W32 PDF BibTeX XML Cite \textit{L. Bulteau} and \textit{M. L. Schmid}, Algorithmica 82, No. 5, 1378--1409 (2020; Zbl 1432.68190) Full Text: DOI
Damaschke, Peter Dividing splittable goods evenly and with limited fragmentation. (English) Zbl 1436.05028 Algorithmica 82, No. 5, 1298-1328 (2020). MSC: 05C05 05C22 05C85 68P10 68Q27 68W25 68W40 91B32 PDF BibTeX XML Cite \textit{P. Damaschke}, Algorithmica 82, No. 5, 1298--1328 (2020; Zbl 1436.05028) Full Text: DOI
Mnich, Matthias; Schlotter, Ildikó Stable matchings with covering constraints: a complete computational trichotomy. (English) Zbl 1433.91098 Algorithmica 82, No. 5, 1136-1188 (2020). MSC: 91B68 68Q17 68Q27 68W40 PDF BibTeX XML Cite \textit{M. Mnich} and \textit{I. Schlotter}, Algorithmica 82, No. 5, 1136--1188 (2020; Zbl 1433.91098) Full Text: DOI
Barto, Libor; Pinsker, Michael Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). (English) Zbl 1432.68169 SIAM J. Comput. 49, No. 2, 365-393 (2020). MSC: 68Q25 03C05 03C35 08A70 68Q17 68Q27 68R07 PDF BibTeX XML Cite \textit{L. Barto} and \textit{M. Pinsker}, SIAM J. Comput. 49, No. 2, 365--393 (2020; Zbl 1432.68169) Full Text: DOI
Melo, Alexsander A.; Figueiredo, Celina M. H.; Souza, Uéverton S. A multivariate analysis of the strict terminal connection problem. (English) Zbl 1435.90040 J. Comput. Syst. Sci. 111, 22-41 (2020). MSC: 90B10 90B18 05C82 PDF BibTeX XML Cite \textit{A. A. Melo} et al., J. Comput. Syst. Sci. 111, 22--41 (2020; Zbl 1435.90040) Full Text: DOI
Rosenke, Christian; Tredup, Ronny The complexity of synthesizing elementary net systems relative to natural parameters. (English) Zbl 1435.68214 J. Comput. Syst. Sci. 110, 37-54 (2020). MSC: 68Q85 68Q17 68Q27 PDF BibTeX XML Cite \textit{C. Rosenke} and \textit{R. Tredup}, J. Comput. Syst. Sci. 110, 37--54 (2020; Zbl 1435.68214) 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 PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 110, 1--21 (2020; Zbl 1435.68123) Full Text: DOI
Waniek, Marcin; Elbassioni, Khaled; Pinheiro, Flávio L.; Hidalgo, César A.; Alshamsi, Aamena Computational aspects of optimal strategic network diffusion. (English) Zbl 1435.68245 Theor. Comput. Sci. 814, 153-168 (2020). MSC: 68R10 05C82 68Q17 68Q27 68W25 90C35 91D30 PDF BibTeX XML Cite \textit{M. Waniek} et al., Theor. Comput. Sci. 814, 153--168 (2020; Zbl 1435.68245) Full Text: DOI
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. (English) Zbl 1435.68122 Theor. Comput. Sci. 814, 135-152 (2020). MSC: 68Q27 05C83 05C85 68Q17 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., Theor. Comput. Sci. 814, 135--152 (2020; Zbl 1435.68122) Full Text: DOI
Bredereck, Robert; Faliszewski, Piotr; Niedermeier, Rolf; Skowron, Piotr; Talmon, Nimrod Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting. (English) Zbl 1435.90087 Theor. Comput. Sci. 814, 86-105 (2020). MSC: 90C11 68Q27 90C30 91B12 PDF BibTeX XML Cite \textit{R. Bredereck} et al., Theor. Comput. Sci. 814, 86--105 (2020; Zbl 1435.90087) Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Quadratic vertex kernel for rainbow matching. (English) Zbl 1435.68236 Algorithmica 82, No. 4, 881-897 (2020). MSC: 68R10 05C15 05C70 05C85 68Q27 PDF BibTeX XML Cite \textit{S. Gupta} et al., Algorithmica 82, No. 4, 881--897 (2020; Zbl 1435.68236) Full Text: DOI
Grüttemeier, Niels; Komusiewicz, Christian On the relation of strong triadic closure and cluster deletion. (English) Zbl 1435.68235 Algorithmica 82, No. 4, 853-880 (2020). MSC: 68R10 05C85 68Q25 68Q27 68W40 91D30 PDF BibTeX XML Cite \textit{N. Grüttemeier} and \textit{C. Komusiewicz}, Algorithmica 82, No. 4, 853--880 (2020; Zbl 1435.68235) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. On the parameterized complexity of graph modification to first-order logic properties. (English) Zbl 1434.68208 Theory Comput. Syst. 64, No. 2, 251-271 (2020). MSC: 68Q27 68Q19 68R10 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Theory Comput. Syst. 64, No. 2, 251--271 (2020; Zbl 1434.68208) Full Text: DOI
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. (English) Zbl 1434.68748 Theory Comput. Syst. 64, No. 1, 62-100 (2020). MSC: 68W40 05C85 68Q27 68R10 PDF BibTeX XML Cite \textit{J. Madathil} et al., Theory Comput. Syst. 64, No. 1, 62--100 (2020; Zbl 1434.68748) Full Text: DOI
Bulteau, Laurent; Hermelin, Danny; Knop, Dušan; Labarre, Anthony; Vialette, Stéphane The clever shopper problem. (English) Zbl 1434.68192 Theory Comput. Syst. 64, No. 1, 17-34 (2020). MSC: 68Q25 68Q17 68Q27 68W05 68W25 90C27 PDF BibTeX XML Cite \textit{L. Bulteau} et al., Theory Comput. Syst. 64, No. 1, 17--34 (2020; Zbl 1434.68192) Full Text: DOI
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. III. Lower bounds. (English) Zbl 1435.68121 J. Comput. Syst. Sci. 109, 56-77 (2020). MSC: 68Q27 05C83 05C85 68Q17 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., J. Comput. Syst. Sci. 109, 56--77 (2020; Zbl 1435.68121) Full Text: DOI
R, Rani M.; R, Subashini; Jagalmohanan, Mohith Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results. (English) Zbl 1435.68222 Theor. Comput. Sci. 812, 13-38 (2020). MSC: 68R05 05B20 68Q17 68Q27 PDF BibTeX XML Cite \textit{R. M. R} et al., Theor. Comput. Sci. 812, 13--38 (2020; Zbl 1435.68222) Full Text: DOI