Chen, Jianer; Chu, Zirui; Guo, Ying; Yang, Wei Space limited linear-time graph algorithms on big data. (English) Zbl 07819261 Theor. Comput. Sci. 993, Article ID 114468, 18 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Chen} et al., Theor. Comput. Sci. 993, Article ID 114468, 18 p. (2024; Zbl 07819261) Full Text: DOI
Bliznets, Ivan; Bukov, Anton; Sagunov, Danil Fair division with minimal withheld information in social networks. (English) Zbl 07811884 Theor. Comput. Sci. 991, Article ID 114446, 16 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{I. Bliznets} et al., Theor. Comput. Sci. 991, Article ID 114446, 16 p. (2024; Zbl 07811884) Full Text: DOI
Gourvès, Laurent; Harutyunyan, Ararat; Lampis, Michael; Melissinos, Nikolaos Filling crosswords is very hard. (English) Zbl 07809113 Theor. Comput. Sci. 982, Article ID 114275, 20 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Gourvès} et al., Theor. Comput. Sci. 982, Article ID 114275, 20 p. (2024; Zbl 07809113) Full Text: DOI
Jain, Rahul; Tewari, Raghunath Space efficient algorithm for solving reachability using tree decomposition and separators. (English) Zbl 07809102 Theor. Comput. Sci. 982, Article ID 114251, 10 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Jain} and \textit{R. Tewari}, Theor. Comput. Sci. 982, Article ID 114251, 10 p. (2024; Zbl 07809102) Full Text: DOI
Baste, Julien; Watel, Dimitri An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. (English) Zbl 07807473 Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Baste} and \textit{D. Watel}, Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024; Zbl 07807473) Full Text: DOI
Acharyya, Ankush; Keikha, Vahideh; Majumdar, Diptapriyo; Pandit, Supantha Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms. (English) Zbl 07807470 Theor. Comput. Sci. 990, Article ID 114402, 16 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Acharyya} et al., Theor. Comput. Sci. 990, Article ID 114402, 16 p. (2024; Zbl 07807470) Full Text: DOI
Gaikwad, Ajinkya; Maity, Soumen Offensive alliances in graphs. (English) Zbl 07807466 Theor. Comput. Sci. 989, Article ID 114401, 23 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Gaikwad} and \textit{S. Maity}, Theor. Comput. Sci. 989, Article ID 114401, 23 p. (2024; Zbl 07807466) Full Text: DOI arXiv
Oostveen, Jelle J.; van Leeuwen, Erik Jan Streaming deletion problems Parameterized by vertex cover. (English) Zbl 07755509 Theor. Comput. Sci. 979, Article ID 114178, 25 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. J. Oostveen} and \textit{E. J. van Leeuwen}, Theor. Comput. Sci. 979, Article ID 114178, 25 p. (2023; Zbl 07755509) Full Text: DOI
Karia, Neel; Mallick, Faraaz; Dey, Palash How hard is safe bribery? (English) Zbl 07755508 Theor. Comput. Sci. 979, Article ID 114156, 23 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Karia} et al., Theor. Comput. Sci. 979, Article ID 114156, 23 p. (2023; Zbl 07755508) Full Text: DOI arXiv
Abidha, V. P.; Ashok, Pradeesha; Tomar, Avi; Yadav, Dolly Colouring a dominating set without conflicts: \(q\)-subset square colouring. (English) Zbl 07751504 Theor. Comput. Sci. 976, Article ID 114160, 24 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{V. P. Abidha} et al., Theor. Comput. Sci. 976, Article ID 114160, 24 p. (2023; Zbl 07751504) Full Text: DOI arXiv
Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar Parameterized complexity of multicut in weighted trees. (English) Zbl 07748733 Theor. Comput. Sci. 978, Article ID 114174, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Galby} et al., Theor. Comput. Sci. 978, Article ID 114174, 17 p. (2023; Zbl 07748733) Full Text: DOI
Bai, Tian; Xiao, Mingyu A parameterized algorithm for subset feedback vertex set in tournaments. (English) Zbl 07741115 Theor. Comput. Sci. 975, Article ID 114139, 12 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Bai} and \textit{M. Xiao}, Theor. Comput. Sci. 975, Article ID 114139, 12 p. (2023; Zbl 07741115) Full Text: DOI
Chakraborty, Dibyayan; Gajjar, Kshitij Finding geometric representations of apex graphs is NP-hard. (English) Zbl 07729840 Theor. Comput. Sci. 971, Article ID 114064, 14 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Chakraborty} and \textit{K. Gajjar}, Theor. Comput. Sci. 971, Article ID 114064, 14 p. (2023; Zbl 07729840) Full Text: DOI
Hatanaka, Tatsuhiko; Hommelsheim, Felix; Ito, Takehiro; Kobayashi, Yusuke; Mühlenthaler, Moritz; Suzuki, Akira Fixed-parameter algorithms for graph constraint logic. (English) Zbl 07685356 Theor. Comput. Sci. 959, Article ID 113863, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Hatanaka} et al., Theor. Comput. Sci. 959, Article ID 113863, 17 p. (2023; Zbl 07685356) Full Text: DOI arXiv
Hajebi, Sahab; Javadi, Ramin On the parameterized complexity of the acyclic matching problem. (English) Zbl 07681300 Theor. Comput. Sci. 958, Article ID 113862, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Hajebi} and \textit{R. Javadi}, Theor. Comput. Sci. 958, Article ID 113862, 17 p. (2023; Zbl 07681300) Full Text: DOI arXiv
Agrawal, Akanksha; Bhattacharjee, Sutanay; Jana, Satyabrata; Sahu, Abhishek Parameterized complexity of perfectly matched sets. (English) Zbl 07681299 Theor. Comput. Sci. 958, Article ID 113861, 10 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theor. Comput. Sci. 958, Article ID 113861, 10 p. (2023; Zbl 07681299) Full Text: DOI
Gomes, Guilherme C. M.; Masquio, Bruno P.; Pinto, Paulo E. D.; dos Santos, Vinicius F.; Szwarcfiter, Jayme L. Disconnected matchings. (English) Zbl 07679027 Theor. Comput. Sci. 956, Article ID 113821, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. C. M. Gomes} et al., Theor. Comput. Sci. 956, Article ID 113821, 17 p. (2023; Zbl 07679027) Full Text: DOI
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
Bandopadhyay, Susobhan; Banerjee, Suman; Banik, Aritra; Raman, Venkatesh Structural parameterizations of budgeted graph coloring. (English) Zbl 07676482 Theor. Comput. Sci. 940, 209-221 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Bandopadhyay} et al., Theor. Comput. Sci. 940, 209--221 (2023; Zbl 07676482) Full Text: DOI
Goyal, Dishant; Jaiswal, Ragesh Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier. (English) Zbl 07676480 Theor. Comput. Sci. 940, 190-208 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Goyal} and \textit{R. Jaiswal}, Theor. Comput. Sci. 940, 190--208 (2023; Zbl 07676480) Full Text: DOI arXiv
Philip, Geevarghese; Rani, M. R.; Subashini, R. On computing the Hamiltonian index of graphs. (English) Zbl 07676476 Theor. Comput. Sci. 940, 149-179 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. Philip} et al., Theor. Comput. Sci. 940, 149--179 (2023; Zbl 07676476) Full Text: DOI
Krithika, R.; Misra, Pranabendu; Tale, Prafullkumar A single exponential-time FPT algorithm for cactus contraction. (English) Zbl 07673772 Theor. Comput. Sci. 954, Article ID 113803, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Krithika} et al., Theor. Comput. Sci. 954, Article ID 113803, 17 p. (2023; Zbl 07673772) Full Text: DOI
Aravind, N. R.; Saxena, Roopam Perfectly matched sets in graphs: parameterized and exact computation. (English) Zbl 07673769 Theor. Comput. Sci. 954, Article ID 113797, 18 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. R. Aravind} and \textit{R. Saxena}, Theor. Comput. Sci. 954, Article ID 113797, 18 p. (2023; Zbl 07673769) Full Text: DOI arXiv
Sheng, Bin; Gutin, Gregory Fixed parameterized algorithms for generalized feedback vertex set problems. (English) Zbl 07667528 Theor. Comput. Sci. 953, Article ID 113798, 15 p. (2023). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{B. Sheng} and \textit{G. Gutin}, Theor. Comput. Sci. 953, Article ID 113798, 15 p. (2023; Zbl 07667528) Full Text: DOI
Lanzinger, Matthias Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT. (English) Zbl 07636005 Theor. Comput. Sci. 942, 276-296 (2023). MSC: 68Q25 05C65 68P15 PDFBibTeX XMLCite \textit{M. Lanzinger}, Theor. Comput. Sci. 942, 276--296 (2023; Zbl 07636005) Full Text: DOI arXiv
Ohsaka, Naoto On reconfigurability of target sets. (English) Zbl 07636004 Theor. Comput. Sci. 942, 253-275 (2023). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{N. Ohsaka}, Theor. Comput. Sci. 942, 253--275 (2023; Zbl 07636004) Full Text: DOI arXiv
Abhinav, Ankit; Bandopadhyay, Susobhan; Banik, Aritra; Saurabh, Saket Parameterized algorithms for finding highly connected solution. (English) Zbl 07635993 Theor. Comput. Sci. 942, 47-56 (2023). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Abhinav} et al., Theor. Comput. Sci. 942, 47--56 (2023; Zbl 07635993) Full Text: DOI
Gascon, Mathieu; Dondi, Riccardo; El-Mabrouk, Nadia MUL-tree pruning for consistency and optimal reconciliation – complexity and algorithms. (English) Zbl 07605942 Theor. Comput. Sci. 937, 22-38 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Gascon} et al., Theor. Comput. Sci. 937, 22--38 (2022; Zbl 07605942) Full Text: DOI
Morawietz, Nils; Grüttemeier, Niels; Komusiewicz, Christian; Sommer, Frank Colored cut games. (English) Zbl 07604599 Theor. Comput. Sci. 936, 13-32 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Morawietz} et al., Theor. Comput. Sci. 936, 13--32 (2022; Zbl 07604599) Full Text: DOI
Gaikwad, Ajinkya; Maity, Soumen Defensive alliances in graphs. (English) Zbl 07597582 Theor. Comput. Sci. 928, 136-150 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Gaikwad} and \textit{S. Maity}, Theor. Comput. Sci. 928, 136--150 (2022; Zbl 07597582) Full Text: DOI arXiv
Choudhary, Pratibha; Raman, Venkatesh Structural parameterizations of Tracking Paths problem. (English) Zbl 07597113 Theor. Comput. Sci. 934, 91-102 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} and \textit{V. Raman}, Theor. Comput. Sci. 934, 91--102 (2022; Zbl 07597113) Full Text: DOI arXiv
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket On the complexity of singly connected vertex deletion. (English) Zbl 07597110 Theor. Comput. Sci. 934, 47-64 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Das} et al., Theor. Comput. Sci. 934, 47--64 (2022; Zbl 07597110) Full Text: DOI
Gaikwad, Ajinkya; Maity, Soumen Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem. (English) Zbl 07593357 Theor. Comput. Sci. 933, 125-137 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Gaikwad} and \textit{S. Maity}, Theor. Comput. Sci. 933, 125--137 (2022; Zbl 07593357) Full Text: DOI
Silva, Janio Carlos Nascimento; Souza, Uéverton S. Computing the best-case energy complexity of satisfying assignments in monotone circuits. (English) Zbl 07584638 Theor. Comput. Sci. 932, 41-55 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. C. N. Silva} and \textit{U. S. Souza}, Theor. Comput. Sci. 932, 41--55 (2022; Zbl 07584638) Full Text: DOI arXiv
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th. Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. (English) Zbl 07540243 Theor. Comput. Sci. 923, 271-291 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Dublois} et al., Theor. Comput. Sci. 923, 271--291 (2022; Zbl 07540243) Full Text: DOI arXiv
Hasan, Md. Manzurul; Mondal, Debajyoti; Rahman, Md. Saidur Positive planar satisfiability problems under 3-connectivity constraints. (English) Zbl 07533879 Theor. Comput. Sci. 917, 81-93 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Md. M. Hasan} et al., Theor. Comput. Sci. 917, 81--93 (2022; Zbl 07533879) Full Text: DOI arXiv
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Resolute control: forbidding candidates from winning an election is hard. (English) Zbl 07533865 Theor. Comput. Sci. 915, 74-89 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Gupta} et al., Theor. Comput. Sci. 915, 74--89 (2022; Zbl 07533865) Full Text: DOI
Velasquez, Alvaro; Subramani, K.; Wojciechowski, Piotr On the complexity of and solutions to the minimum stopping and trapping set problems. (English) Zbl 07533862 Theor. Comput. Sci. 915, 26-44 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Velasquez} et al., Theor. Comput. Sci. 915, 26--44 (2022; Zbl 07533862) Full Text: DOI
Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Otachi, Yota Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07524431 Theor. Comput. Sci. 918, 60-76 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Gima} et al., Theor. Comput. Sci. 918, 60--76 (2022; Zbl 07524431) Full Text: DOI arXiv
Carneiro, Alan Diêgo Aurélio; Protti, Fábio; Souza, Uéverton dos Santos On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem. (English) Zbl 07482358 Theor. Comput. Sci. 909, 97-109 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. D. A. Carneiro} et al., Theor. Comput. Sci. 909, 97--109 (2022; Zbl 07482358) Full Text: DOI
Zhou, Yangyang; Zhao, Dongyang; Ma, Mingyuan; Xu, Jin Total coloring of recursive maximal planar graphs. (English) Zbl 07482351 Theor. Comput. Sci. 909, 12-18 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Y. Zhou} et al., Theor. Comput. Sci. 909, 12--18 (2022; Zbl 07482351) Full Text: DOI
Gaikwad, Ajinkya; Maity, Soumen; Tripathi, Shuvam Kant Parameterized complexity of satisfactory partition problem. (English) Zbl 07477127 Theor. Comput. Sci. 907, 113-127 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Gaikwad} et al., Theor. Comput. Sci. 907, 113--127 (2022; Zbl 07477127) Full Text: DOI
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
Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris Extension and its price for the connected vertex cover problem. (English) Zbl 07467464 Theor. Comput. Sci. 904, 66-80 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Khosravian Ghadikolaei} et al., Theor. Comput. Sci. 904, 66--80 (2022; Zbl 07467464) Full Text: DOI HAL
Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian On the complexity of solution extension of optimization problems. (English) Zbl 07467463 Theor. Comput. Sci. 904, 48-65 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{K. Casel} et al., Theor. Comput. Sci. 904, 48--65 (2022; Zbl 07467463) Full Text: DOI arXiv
Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The complexity of dependency detection and discovery in relational databases. (English) Zbl 1515.68107 Theor. Comput. Sci. 900, 79-96 (2022). MSC: 68P15 68P20 68Q27 PDFBibTeX XMLCite \textit{T. Bläsius} et al., Theor. Comput. Sci. 900, 79--96 (2022; Zbl 1515.68107) Full Text: DOI arXiv
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka Upper and lower degree-constrained graph orientation with minimum penalty. (English) Zbl 1515.68222 Theor. Comput. Sci. 900, 53-78 (2022). MSC: 68R10 05C20 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 900, 53--78 (2022; Zbl 1515.68222) Full Text: DOI
Lopes, Raul; Sau, Ignasi A relaxation of the directed disjoint paths problem: a global congestion metric helps. (English) Zbl 07437226 Theor. Comput. Sci. 898, 75-91 (2022). MSC: 68R10 05C20 05C38 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Lopes} and \textit{I. Sau}, Theor. Comput. Sci. 898, 75--91 (2022; Zbl 07437226) Full Text: DOI arXiv Link
Tale, Prafullkumar Sparsification lower bound for linear spanners in directed graphs. (English) Zbl 1478.68264 Theor. Comput. Sci. 898, 69-74 (2022). MSC: 68R10 05C12 05C20 68Q25 PDFBibTeX XMLCite \textit{P. Tale}, Theor. Comput. Sci. 898, 69--74 (2022; Zbl 1478.68264) Full Text: DOI arXiv
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai On the maximum cardinality cut problem in proper interval graphs and related graph classes. (English) Zbl 07437220 Theor. Comput. Sci. 898, 20-29 (2022). MSC: 68Q27 05C62 05C70 PDFBibTeX XMLCite \textit{A. Boyacı} et al., Theor. Comput. Sci. 898, 20--29 (2022; Zbl 07437220) Full Text: DOI arXiv Link
Di Giacomo, Emilio; Lenhart, William J.; Liotta, Giuseppe; Randolph, Timothy W.; Tappini, Alessandra \((k,p)\)-planarity: a relaxation of hybrid planarity. (English) Zbl 1514.68211 Theor. Comput. Sci. 896, 19-30 (2021). MSC: 68R10 05C10 05C75 68Q17 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Theor. Comput. Sci. 896, 19--30 (2021; Zbl 1514.68211) Full Text: DOI arXiv
Misra, Neeldhara; Mittal, Harshil Imbalance parameterized by twin cover revisited. (English) Zbl 1514.68226 Theor. Comput. Sci. 895, 1-15 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{N. Misra} and \textit{H. Mittal}, Theor. Comput. Sci. 895, 1--15 (2021; Zbl 1514.68226) Full Text: DOI arXiv
Shi, Feng; Neumann, Frank; Wang, Jianxin Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem. (English) Zbl 1514.68334 Theor. Comput. Sci. 893, 159-175 (2021). MSC: 68W50 68R10 68W40 PDFBibTeX XMLCite \textit{F. Shi} et al., Theor. Comput. Sci. 893, 159--175 (2021; Zbl 1514.68334) Full Text: DOI arXiv
Tredup, Ronny; Erofeev, Evgeny On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. (English) Zbl 1514.68185 Theor. Comput. Sci. 890, 36-69 (2021). MSC: 68Q85 68Q27 PDFBibTeX XMLCite \textit{R. Tredup} and \textit{E. Erofeev}, Theor. Comput. Sci. 890, 36--69 (2021; Zbl 1514.68185) Full Text: DOI
Alves, Mateus Rodrigues; de Oliveira Oliveira, Mateus; Nascimento Silva, Janio Carlos; dos Santos Souza, Uéverton Succinct certification of monotone circuits. (English) Zbl 1514.68075 Theor. Comput. Sci. 889, 1-13 (2021). MSC: 68Q06 68Q27 94C11 PDFBibTeX XMLCite \textit{M. R. Alves} et al., Theor. Comput. Sci. 889, 1--13 (2021; Zbl 1514.68075) Full Text: DOI
Agrawal, Garima; Maity, Soumen The small set vertex expansion problem. (English) Zbl 1514.68195 Theor. Comput. Sci. 886, 84-93 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{G. Agrawal} and \textit{S. Maity}, Theor. Comput. Sci. 886, 84--93 (2021; Zbl 1514.68195) Full Text: DOI
Shi, Feng; You, Jie; Zhang, Zhen; Liu, Jingyi; Wang, Jianxin Fixed-parameter tractability for the tree assembly problem. (English) Zbl 1514.68331 Theor. Comput. Sci. 886, 3-12 (2021). MSC: 68W32 68Q27 PDFBibTeX XMLCite \textit{F. Shi} et al., Theor. Comput. Sci. 886, 3--12 (2021; Zbl 1514.68331) Full Text: DOI
Araujo, J.; Cezar, A.; Lima, C. V. G. C.; dos Santos, V. F.; Silva, A. On the proper orientation number of chordal graphs. (English) Zbl 1517.05063 Theor. Comput. Sci. 888, 117-132 (2021). MSC: 05C20 68Q17 68Q27 PDFBibTeX XMLCite \textit{J. Araujo} et al., Theor. Comput. Sci. 888, 117--132 (2021; Zbl 1517.05063) Full Text: DOI arXiv
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Balanced stable marriage: how close is close enough? (English) Zbl 1517.68144 Theor. Comput. Sci. 883, 19-43 (2021). MSC: 68Q27 91B68 PDFBibTeX XMLCite \textit{S. Gupta} et al., Theor. Comput. Sci. 883, 19--43 (2021; Zbl 1517.68144) Full Text: DOI arXiv
Subramani, K.; Wojciechowski, P. On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. (English) Zbl 1517.68147 Theor. Comput. Sci. 883, 1-18 (2021). MSC: 68Q27 PDFBibTeX XMLCite \textit{K. Subramani} and \textit{P. Wojciechowski}, Theor. Comput. Sci. 883, 1--18 (2021; Zbl 1517.68147) Full Text: DOI
Alfandari, Laurent; Toulouse, Sophie Approximation of the double traveling salesman problem with multiple stacks. (English) Zbl 1517.90119 Theor. Comput. Sci. 877, 74-89 (2021). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{L. Alfandari} and \textit{S. Toulouse}, Theor. Comput. Sci. 877, 74--89 (2021; Zbl 1517.90119) Full Text: DOI arXiv
Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima A parameterized perspective on protecting elections. (English) Zbl 1504.68082 Theor. Comput. Sci. 874, 15-31 (2021). MSC: 68Q27 91B12 PDFBibTeX XMLCite \textit{P. Dey} et al., Theor. Comput. Sci. 874, 15--31 (2021; Zbl 1504.68082) Full Text: DOI arXiv
Li, Wenjun; Ding, Yang; Yang, Yongjie; Rong, Guozhen A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem. (English) Zbl 1497.68391 Theor. Comput. Sci. 868, 6-11 (2021). MSC: 68R10 05C15 68Q27 PDFBibTeX XMLCite \textit{W. Li} et al., Theor. Comput. Sci. 868, 6--11 (2021; Zbl 1497.68391) Full Text: DOI
Kanesh, Lawqueen; Maity, Soumen; Muluk, Komal; Saurabh, Saket Parameterized complexity of fair feedback vertex set problem. (English) Zbl 1474.68227 Theor. Comput. Sci. 867, 1-12 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{L. Kanesh} et al., Theor. Comput. Sci. 867, 1--12 (2021; Zbl 1474.68227) Full Text: DOI
Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Yagita, Tsuyoshi Finding a maximum minimal separator: graph classes and fixed-parameter tractability. (English) Zbl 1497.68379 Theor. Comput. Sci. 865, 131-140 (2021). MSC: 68R10 68Q17 68Q27 PDFBibTeX XMLCite \textit{T. Hanaka} et al., Theor. Comput. Sci. 865, 131--140 (2021; Zbl 1497.68379) Full Text: DOI arXiv
Agrawal, Akanksha; Kanesh, Lawqueen; Saurabh, Saket; Tale, Prafullkumar Paths to trees and cacti. (English) Zbl 1486.68121 Theor. Comput. Sci. 860, 98-116 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theor. Comput. Sci. 860, 98--116 (2021; Zbl 1486.68121) Full Text: DOI
Fertin, Guillaume; Fradin, Julien; Jean, Géraldine The Maximum Colorful Arborescence problem: how (computationally) hard can it be? (English) Zbl 1477.68224 Theor. Comput. Sci. 852, 104-120 (2021). MSC: 68R10 68Q17 68Q27 68W05 68W25 PDFBibTeX XMLCite \textit{G. Fertin} et al., Theor. Comput. Sci. 852, 104--120 (2021; Zbl 1477.68224) Full Text: DOI
Komusiewicz, Christian; de Oliveira Oliveira, Mateus; Zehavi, Meirav Revisiting the parameterized complexity of maximum-duo preservation string mapping. (English) Zbl 1464.68445 Theor. Comput. Sci. 847, 27-38 (2020). MSC: 68W32 68Q27 68W20 68W40 92D10 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., Theor. Comput. Sci. 847, 27--38 (2020; Zbl 1464.68445) Full Text: DOI Link
Banik, Aritra; Choudhary, Pratibha; Raman, Venkatesh; Saurabh, Saket Fixed-parameter tractable algorithms for tracking shortest paths. (English) Zbl 1464.68274 Theor. Comput. Sci. 846, 1-13 (2020). MSC: 68R10 05C38 68Q27 PDFBibTeX XMLCite \textit{A. Banik} et al., Theor. Comput. Sci. 846, 1--13 (2020; Zbl 1464.68274) Full Text: DOI arXiv
Choudhary, Pratibha; Jain, Pallavi; Krithika, R.; Sahlot, Vibha Vertex deletion on split graphs: beyond 4-hitting set. (English) Zbl 1462.68137 Theor. Comput. Sci. 845, 21-37 (2020). Reviewer: K. Subramani (Morgantown) with P. Wojciechowski MSC: 68R10 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{P. Choudhary} et al., Theor. Comput. Sci. 845, 21--37 (2020; Zbl 1462.68137) Full Text: DOI
Meeks, Kitty; Rastegari, Baharak Solving hard stable matching problems involving groups of similar agents. (English) Zbl 1464.68131 Theor. Comput. Sci. 844, 171-194 (2020). MSC: 68Q27 91B68 PDFBibTeX XMLCite \textit{K. Meeks} and \textit{B. Rastegari}, Theor. Comput. Sci. 844, 171--194 (2020; Zbl 1464.68131) Full Text: DOI arXiv
Jansen, Bart M. P.; Pieterse, Astrid Polynomial kernels for hitting forbidden minors under structural parameterizations. (English) Zbl 1455.68143 Theor. Comput. Sci. 841, 124-166 (2020). MSC: 68R10 05C40 05C83 68Q27 PDFBibTeX XMLCite \textit{B. M. P. Jansen} and \textit{A. Pieterse}, Theor. Comput. Sci. 841, 124--166 (2020; Zbl 1455.68143) Full Text: DOI arXiv Link
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 PDFBibTeX XMLCite \textit{I. Bliznets} and \textit{D. Sagunov}, Theor. Comput. Sci. 838, 94--110 (2020; Zbl 1453.68126) Full Text: DOI arXiv
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 1460.68046 Theor. Comput. Sci. 835, 58-81 (2020). MSC: 68Q27 05C15 68Q25 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theor. Comput. Sci. 835, 58--81 (2020; Zbl 1460.68046) 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 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theor. Comput. Sci. 833, 164--172 (2020; Zbl 1451.68196) Full Text: DOI
Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket Fully dynamic arboricity maintenance. (English) Zbl 1452.68130 Theor. Comput. Sci. 822, 1-14 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Theor. Comput. Sci. 822, 1--14 (2020; Zbl 1452.68130) 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 PDFBibTeX XMLCite \textit{P. Arora} et al., Theor. Comput. Sci. 821, 102--110 (2020; Zbl 1437.68069) Full Text: DOI
Koivisto, Mikko; Laakkonen, Petteri; Lauri, Juho NP-completeness results for partitioning a graph into total dominating sets. (English) Zbl 1433.68159 Theor. Comput. Sci. 818, 22-31 (2020). MSC: 68Q17 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{M. Koivisto} et al., Theor. Comput. Sci. 818, 22--31 (2020; Zbl 1433.68159) Full Text: DOI Link
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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{L. Jaffke} and \textit{P. T. Lima}, Theor. Comput. Sci. 815, 182--196 (2020; Zbl 1436.68138) Full Text: DOI arXiv
Papadopoulos, Charis; Tzimas, Spyridon Subset feedback vertex set on graphs of bounded independent set size. (English) Zbl 1435.68244 Theor. Comput. Sci. 814, 177-188 (2020). MSC: 68R10 05C69 05C85 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{C. Papadopoulos} and \textit{S. Tzimas}, Theor. Comput. Sci. 814, 177--188 (2020; Zbl 1435.68244) Full Text: DOI Link
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 PDFBibTeX XMLCite \textit{J. Baste} et al., Theor. Comput. Sci. 814, 135--152 (2020; Zbl 1435.68122) Full Text: DOI arXiv Link
Bang-Jensen, J.; Bellitto, T.; Lochet, W.; Yeo, A. The directed 2-linkage problem with length constraints. (English) Zbl 1445.68146 Theor. Comput. Sci. 814, 69-73 (2020). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C20 05C38 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 814, 69--73 (2020; Zbl 1445.68146) Full Text: DOI arXiv Link
Tan, Guanlan; Feng, Qilong; Zhuo, Beilin; Huang, Neng; Wang, Jianxin New kernels for several problems on planar graphs. (English) Zbl 1436.68263 Theor. Comput. Sci. 806, 587-594 (2020). MSC: 68R10 05C10 05C70 68Q27 PDFBibTeX XMLCite \textit{G. Tan} et al., Theor. Comput. Sci. 806, 587--594 (2020; Zbl 1436.68263) Full Text: DOI
Wu, Guangwei; Chen, Jianer; Wang, Jianxin Improved approximation algorithms for two-stage flowshops scheduling problem. (English) Zbl 1436.68400 Theor. Comput. Sci. 806, 509-515 (2020). MSC: 68W25 68M20 90B35 PDFBibTeX XMLCite \textit{G. Wu} et al., Theor. Comput. Sci. 806, 509--515 (2020; Zbl 1436.68400) Full Text: DOI
Fluschnik, Till; Molter, Hendrik; Niedermeier, Rolf; Renken, Malte; Zschoche, Philipp Temporal graph classes: a view through temporal separators. (English) Zbl 1436.68234 Theor. Comput. Sci. 806, 197-218 (2020). MSC: 68R10 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., Theor. Comput. Sci. 806, 197--218 (2020; Zbl 1436.68234) 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
Meybodi, Mohsen Alambardar; Fomin, Fedor V.; Mouawad, Amer E.; Panolan, Fahad On the parameterized complexity of \([1,j]\)-domination problems. (English) Zbl 1436.68147 Theor. Comput. Sci. 804, 207-218 (2020). MSC: 68Q27 05C69 68Q17 68R10 PDFBibTeX XMLCite \textit{M. A. Meybodi} et al., Theor. Comput. Sci. 804, 207--218 (2020; Zbl 1436.68147) Full Text: DOI
Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka On the maximum weight minimal separator. (English) Zbl 1435.68239 Theor. Comput. Sci. 796, 294-308 (2019). MSC: 68R10 05C85 68Q17 68W20 68W40 PDFBibTeX XMLCite \textit{T. Hanaka} et al., Theor. Comput. Sci. 796, 294--308 (2019; Zbl 1435.68239) Full Text: DOI
Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Vaishali, S. Tractability of König edge deletion problems. (English) Zbl 1435.68125 Theor. Comput. Sci. 796, 207-215 (2019). MSC: 68Q27 05C70 68Q17 PDFBibTeX XMLCite \textit{D. Majumdar} et al., Theor. Comput. Sci. 796, 207--215 (2019; Zbl 1435.68125) Full Text: DOI arXiv
Jansen, Bart M. P.; Nederlof, Jesper Computing the chromatic number using graph decompositions via matrix rank. (English) Zbl 1431.68053 Theor. Comput. Sci. 795, 520-539 (2019). MSC: 68Q27 05C15 05C50 05C85 68R10 68W20 68W40 PDFBibTeX XMLCite \textit{B. M. P. Jansen} and \textit{J. Nederlof}, Theor. Comput. Sci. 795, 520--539 (2019; Zbl 1431.68053) Full Text: DOI Link
Crampton, Jason; Gutin, Gregory; Koutecký, Martin; Watrigant, Rémi Parameterized resiliency problems. (English) Zbl 1434.68206 Theor. Comput. Sci. 795, 478-491 (2019). MSC: 68Q27 90C10 90C31 91B14 PDFBibTeX XMLCite \textit{J. Crampton} et al., Theor. Comput. Sci. 795, 478--491 (2019; Zbl 1434.68206) Full Text: DOI
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav The parameterized complexity landscape of finding 2-partitions of digraphs. (English) Zbl 1434.68205 Theor. Comput. Sci. 795, 108-114 (2019). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 795, 108--114 (2019; Zbl 1434.68205) Full Text: DOI
Kononov, A. V.; Kovalyov, M. Y.; Lin, B. M. T. Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\). (English) Zbl 1430.68451 Theor. Comput. Sci. 793, 70-78 (2019). MSC: 68W25 68Q25 90B35 PDFBibTeX XMLCite \textit{A. V. Kononov} et al., Theor. Comput. Sci. 793, 70--78 (2019; Zbl 1430.68451) Full Text: DOI
Chen, Jianer; Fernau, Henning; Shaw, Peter; Wang, Jianxin; Yang, Zhibiao Kernels for packing and covering problems. (English) Zbl 1430.68127 Theor. Comput. Sci. 790, 152-166 (2019). MSC: 68Q27 05C70 68R10 PDFBibTeX XMLCite \textit{J. Chen} et al., Theor. Comput. Sci. 790, 152--166 (2019; Zbl 1430.68127) Full Text: DOI
Li, Wenjun; Liu, Haiyan; Wang, Jianxin; Xiang, Lingyun; Yang, Yongjie An improved linear kernel for complementary maximal strip recovery: simpler and smaller. (English) Zbl 1429.68340 Theor. Comput. Sci. 786, 55-66 (2019). MSC: 68W32 68Q27 PDFBibTeX XMLCite \textit{W. Li} et al., Theor. Comput. Sci. 786, 55--66 (2019; Zbl 1429.68340) Full Text: DOI
Dey, Palash; Misra, Neeldhara; Narahari, Y. Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. (English) Zbl 1427.91119 Theor. Comput. Sci. 783, 53-70 (2019). MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{P. Dey} et al., Theor. Comput. Sci. 783, 53--70 (2019; Zbl 1427.91119) Full Text: DOI arXiv
Vakhania, Nodari Fast solution of single-machine scheduling problem with embedded jobs. (English) Zbl 1425.90050 Theor. Comput. Sci. 782, 91-106 (2019). MSC: 90B35 68W40 PDFBibTeX XMLCite \textit{N. Vakhania}, Theor. Comput. Sci. 782, 91--106 (2019; Zbl 1425.90050) Full Text: DOI
Araújo, Júlio; Sales, Cláudia Linhares; Sau, Ignasi; Silva, Ana Weighted proper orientations of trees and graphs of bounded treewidth. (English) Zbl 1421.68104 Theor. Comput. Sci. 771, 39-48 (2019). MSC: 68R10 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Araújo} et al., Theor. Comput. Sci. 771, 39--48 (2019; Zbl 1421.68104) Full Text: DOI arXiv
de Berg, Mark; Kisfaludi-Bak, Sándor; Woeginger, Gerhard The complexity of dominating set in geometric intersection graphs. (English) Zbl 1421.68071 Theor. Comput. Sci. 769, 18-31 (2019). MSC: 68Q25 05C62 05C69 68Q17 PDFBibTeX XMLCite \textit{M. de Berg} et al., Theor. Comput. Sci. 769, 18--31 (2019; Zbl 1421.68071) Full Text: DOI