Casel, Katrin; Fernau, Henning; Grigoriev, Alexander; Schmid, Markus L.; Whitesides, Sue Combinatorial properties and recognition of unit square visibility graphs. (English) Zbl 07685731 Discrete Comput. Geom. 69, No. 4, 937-980 (2023). MSC: 68R10 05C10 05C62 PDF BibTeX XML Cite \textit{K. Casel} et al., Discrete Comput. Geom. 69, No. 4, 937--980 (2023; Zbl 07685731) Full Text: DOI OpenURL
Çağırıcı, Onur On embeddability of unit disk graphs onto straight lines. (English) Zbl 07681308 Theory Comput. Syst. 67, No. 2, 264-289 (2023). MSC: 05C60 68Q25 68R10 PDF BibTeX XML Cite \textit{O. Çağırıcı}, Theory Comput. Syst. 67, No. 2, 264--289 (2023; Zbl 07681308) Full Text: DOI OpenURL
Naumann, Uwe; Burela, Shubhaditya Hessian chain bracketing. (English) Zbl 07676350 J. Comb. 14, No. 4, 539-558 (2023). MSC: 65D25 90C39 90C60 PDF BibTeX XML Cite \textit{U. Naumann} and \textit{S. Burela}, J. Comb. 14, No. 4, 539--558 (2023; Zbl 07676350) Full Text: DOI arXiv OpenURL
Cantone, Domenico; Maugeri, Pietro; Omodeo, Eugenio G. Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. (English) Zbl 07673768 Theor. Comput. Sci. 954, Article ID 113786, 21 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Cantone} et al., Theor. Comput. Sci. 954, Article ID 113786, 21 p. (2023; Zbl 07673768) Full Text: DOI OpenURL
Di Marco, Niccoló; Frosini, Andrea; Kocay, William Lawrence; Pergola, Elisa; Tarsissi, Lama Structure and complexity of 2-intersection graphs of 3-hypergraphs. (English) Zbl 07661311 Algorithmica 85, No. 3, 745-761 (2023). MSC: 05C65 05C22 05C85 05C76 05C78 68Q17 PDF BibTeX XML Cite \textit{N. Di Marco} et al., Algorithmica 85, No. 3, 745--761 (2023; Zbl 07661311) Full Text: DOI OpenURL
Bang-Jensen, J.; Yeo, A. The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. (English) Zbl 1508.68128 Theor. Comput. Sci. 949, Article ID 113758, 15 p. (2023). MSC: 68Q25 05C15 05C85 68Q17 68R10 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{A. Yeo}, Theor. Comput. Sci. 949, Article ID 113758, 15 p. (2023; Zbl 1508.68128) Full Text: DOI OpenURL
Caucchiolo, Andrea; Cicalese, Ferdinando Hardness and approximation of multiple sequence alignment with column score. (English) Zbl 07648683 Theor. Comput. Sci. 946, Article ID 113683, 11 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Caucchiolo} and \textit{F. Cicalese}, Theor. Comput. Sci. 946, Article ID 113683, 11 p. (2023; Zbl 07648683) Full Text: DOI OpenURL
Mihelčić, Matej; Kurdija, Adrian Satja On the complexity of redescription mining. (English) Zbl 07646896 Theor. Comput. Sci. 944, Article ID 113673, 12 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Mihelčić} and \textit{A. S. Kurdija}, Theor. Comput. Sci. 944, Article ID 113673, 12 p. (2023; Zbl 07646896) Full Text: DOI OpenURL
Demaine, Erik D.; Löffler, Maarten; Schmidt, Christiane Rectangular spiral galaxies are still hard. (English) Zbl 1506.05139 Comput. Geom. 110, Article ID 101949, 16 p. (2023). MSC: 05C57 05B50 05C70 68Q17 91A43 PDF BibTeX XML Cite \textit{E. D. Demaine} et al., Comput. Geom. 110, Article ID 101949, 16 p. (2023; Zbl 1506.05139) Full Text: DOI arXiv OpenURL
Panda, B. S.; Chaudhary, Juhi Acyclic matching in some subclasses of graphs. (English) Zbl 07638584 Theor. Comput. Sci. 943, 36-49 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Theor. Comput. Sci. 943, 36--49 (2023; Zbl 07638584) Full Text: DOI OpenURL
Lindeberg, Anna; Hellmuth, Marc Construction of \(k\)-matchings in graph products. (English) Zbl 1502.05214 Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023). MSC: 05C76 05C70 68Q17 90C27 PDF BibTeX XML Cite \textit{A. Lindeberg} and \textit{M. Hellmuth}, Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023; Zbl 1502.05214) Full Text: DOI arXiv OpenURL
Paul, Subhabrata; Santra, Kamal Transitivity on subclasses of bipartite graphs. (English) Zbl 1508.90107 J. Comb. Optim. 45, No. 1, Paper No. 27, 16 p. (2023). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{S. Paul} and \textit{K. Santra}, J. Comb. Optim. 45, No. 1, Paper No. 27, 16 p. (2023; Zbl 1508.90107) Full Text: DOI arXiv OpenURL
Minamisawa, Ko; Uehara, Ryuhei; Hara, Masao Mathematical characterizations and computational complexity of anti-slide puzzles. (English) Zbl 1498.68359 Theor. Comput. Sci. 939, 216-226 (2023). MSC: 68U05 05B50 52B55 68Q25 PDF BibTeX XML Cite \textit{K. Minamisawa} et al., Theor. Comput. Sci. 939, 216--226 (2023; Zbl 1498.68359) Full Text: DOI OpenURL
Tripathi, Vikash; Kloks, Ton; Pandey, Arti; Paul, Kaustav; Wang, Hung-Lung Complexity of paired domination in at-free and planar graphs. (English) Zbl 07683163 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 65-77 (2022). MSC: 68Wxx PDF BibTeX XML Cite \textit{V. Tripathi} et al., Lect. Notes Comput. Sci. 13179, 65--77 (2022; Zbl 07683163) Full Text: DOI OpenURL
Singhwal, Nitisha; Reddy, Palagiri Venkata Subba Total vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1502.05195 Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250031, 10 p. (2022). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{N. Singhwal} and \textit{P. V. S. Reddy}, Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250031, 10 p. (2022; Zbl 1502.05195) Full Text: DOI OpenURL
Groshaus, M.; Guedes, A. L. P.; Puppo, J. P. Biclique graphs of split graphs. (English) Zbl 1502.05106 Discrete Appl. Math. 323, 252-267 (2022). MSC: 05C38 05C45 68Q25 PDF BibTeX XML Cite \textit{M. Groshaus} et al., Discrete Appl. Math. 323, 252--267 (2022; Zbl 1502.05106) Full Text: DOI OpenURL
de Figueiredo, Celina M. H.; de Melo, Alexsander A.; Sasaki, Diana; Silva, Ana Revising Johnson’s table for the 21st century. (English) Zbl 1502.05184 Discrete Appl. Math. 323, 184-200 (2022). MSC: 05C69 05C05 68Q25 68Q27 PDF BibTeX XML Cite \textit{C. M. H. de Figueiredo} et al., Discrete Appl. Math. 323, 184--200 (2022; Zbl 1502.05184) Full Text: DOI arXiv OpenURL
Sharma, Gopika; Pandey, Arti; Wigal, Michael C. Algorithms for maximum internal spanning tree problem for some graph classes. (English) Zbl 1505.90111 J. Comb. Optim. 44, No. 5, 3419-3445 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{G. Sharma} et al., J. Comb. Optim. 44, No. 5, 3419--3445 (2022; Zbl 1505.90111) Full Text: DOI arXiv OpenURL
Brinkmann, Gunnar A practical algorithm for the computation of the genus. (English) Zbl 1504.05274 Ars Math. Contemp. 22, No. 4, Paper No. 1, 14 p. (2022). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{G. Brinkmann}, Ars Math. Contemp. 22, No. 4, Paper No. 1, 14 p. (2022; Zbl 1504.05274) Full Text: DOI arXiv OpenURL
Lima, Carlos V. G. C.; Rautenbach, Dieter; Souza, Uéverton S.; Szwarcfiter, Jayme L. On the computational complexity of the bipartizing matching problem. (English) Zbl 1497.05093 Ann. Oper. Res. 316, No. 2, 1235-1256 (2022). MSC: 05C15 05C10 68Q25 68Q17 05C75 05C70 90C39 PDF BibTeX XML Cite \textit{C. V. G. C. Lima} et al., Ann. Oper. Res. 316, No. 2, 1235--1256 (2022; Zbl 1497.05093) Full Text: DOI arXiv OpenURL
Finbow, Arthur S.; Hartnell, Bert L.; Plummer, Michael D. A characterization of well-indumatchable graphs having girth greater than seven. (English) Zbl 1497.05216 Discrete Appl. Math. 321, 261-271 (2022). MSC: 05C70 05C12 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. S. Finbow} et al., Discrete Appl. Math. 321, 261--271 (2022; Zbl 1497.05216) Full Text: DOI OpenURL
Chakradhar, Padamutham; Reddy, Palagiri Venkata Subba Algorithmic aspects of Roman \(\{3\}\)-domination in graphs. (English) Zbl 1502.05181 RAIRO, Oper. Res. 56, No. 4, 2277-2291 (2022). Reviewer: Doost Ali Mojdeh (Babolsar) MSC: 05C69 68Q25 90C05 90C10 PDF BibTeX XML Cite \textit{P. Chakradhar} and \textit{P. V. S. Reddy}, RAIRO, Oper. Res. 56, No. 4, 2277--2291 (2022; Zbl 1502.05181) Full Text: DOI OpenURL
Paul, Subhabrata; Ranjan, Keshav Results on vertex-edge and independent vertex-edge domination. (English) Zbl 1498.90241 J. Comb. Optim. 44, No. 1, 303-330 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{S. Paul} and \textit{K. Ranjan}, J. Comb. Optim. 44, No. 1, 303--330 (2022; Zbl 1498.90241) Full Text: DOI OpenURL
Tripathi, Vikash; Kloks, Ton; Pandey, Arti; Paul, Kaustav; Wang, Hung-Lung Complexity of paired domination in AT-free and planar graphs. (English) Zbl 07575096 Theor. Comput. Sci. 930, 53-62 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{V. Tripathi} et al., Theor. Comput. Sci. 930, 53--62 (2022; Zbl 07575096) Full Text: DOI arXiv OpenURL
Panda, B. S.; Goyal, Pooja Hardness results of global total \(k\)-domination problem in graphs. (English) Zbl 1494.05089 Discrete Appl. Math. 319, 223-238 (2022). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{P. Goyal}, Discrete Appl. Math. 319, 223--238 (2022; Zbl 1494.05089) Full Text: DOI OpenURL
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P.; Mondal, Joyashree Induced star partition of graphs. (English) Zbl 1494.05093 Discrete Appl. Math. 319, 81-91 (2022). MSC: 05C70 05C69 05C15 68Q17 68Q25 68W25 PDF BibTeX XML Cite \textit{M. A. Shalu} et al., Discrete Appl. Math. 319, 81--91 (2022; Zbl 1494.05093) Full Text: DOI OpenURL
Hitchcock, John M.; Shafei, Hadi Nonuniform reductions and NP-completeness. (English) Zbl 07562750 Theory Comput. Syst. 66, No. 4, 743-757 (2022). MSC: 68Qxx 03Dxx 68Wxx PDF BibTeX XML Cite \textit{J. M. Hitchcock} and \textit{H. Shafei}, Theory Comput. Syst. 66, No. 4, 743--757 (2022; Zbl 07562750) Full Text: DOI OpenURL
Lam, Chi-Kit; Plaxton, C. Gregory On the existence of three-dimensional stable matchings with cyclic preferences. (English) Zbl 1493.91093 Theory Comput. Syst. 66, No. 3, 679-695 (2022). MSC: 91B68 68Q25 PDF BibTeX XML Cite \textit{C.-K. Lam} and \textit{C. G. Plaxton}, Theory Comput. Syst. 66, No. 3, 679--695 (2022; Zbl 1493.91093) Full Text: DOI arXiv OpenURL
Fenner, Stephen; Padé, Daniel; Thierauf, Thomas The complexity of regex crosswords. (English) Zbl 1487.68126 Inf. Comput. 286, Article ID 104777, 18 p. (2022). MSC: 68Q25 68Q17 68Q45 PDF BibTeX XML Cite \textit{S. Fenner} et al., Inf. Comput. 286, Article ID 104777, 18 p. (2022; Zbl 1487.68126) Full Text: DOI OpenURL
Chakradhar, Padamutham; Venkata Subba Reddy, Palagiri; Himanshu, Khandelwal Algorithmic complexity of weakly connected Roman domination in graphs. (English) Zbl 1487.05193 Discrete Math. Algorithms Appl. 14, No. 3, Article ID 2150125, 14 p. (2022). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{P. Chakradhar} et al., Discrete Math. Algorithms Appl. 14, No. 3, Article ID 2150125, 14 p. (2022; Zbl 1487.05193) Full Text: DOI OpenURL
Bergren, Dan; Eiben, Eduard; Ganian, Robert; Kanj, Iyad On covering segments with unit intervals. (English) Zbl 07537554 SIAM J. Discrete Math. 36, No. 2, 1200-1230 (2022). MSC: 68Q27 68Q25 PDF BibTeX XML Cite \textit{D. Bergren} et al., SIAM J. Discrete Math. 36, No. 2, 1200--1230 (2022; Zbl 07537554) Full Text: DOI OpenURL
Fluschnik, Till; Niedermeier, Rolf; Rohm, Valentin; Zschoche, Philipp Multistage vertex cover. (English) Zbl 07523542 Theory Comput. Syst. 66, No. 2, 454-483 (2022). MSC: 68Qxx 05Cxx 68Wxx PDF BibTeX XML Cite \textit{T. Fluschnik} et al., Theory Comput. Syst. 66, No. 2, 454--483 (2022; Zbl 07523542) Full Text: DOI arXiv OpenURL
Dourado, Mitre C.; de Figueiredo, Celina M. H.; de Melo, Alexsander A.; de Oliveira Oliveira, Mateus; Souza, Uéverton S. Computing the zig-zag number of directed graphs. (English) Zbl 1485.05072 Discrete Appl. Math. 312, 86-105 (2022). MSC: 05C20 68R10 05C85 68Q25 05C05 PDF BibTeX XML Cite \textit{M. C. Dourado} et al., Discrete Appl. Math. 312, 86--105 (2022; Zbl 1485.05072) Full Text: DOI OpenURL
Gavril, Fanica; Shalom, Mordechai; Zaks, Shmuel Approximation algorithms for maximum weight \(k\)-coverings of graphs by packings. (English) Zbl 1491.68269 Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022). Reviewer: K. Subramani (Morgantown) MSC: 68W25 05C70 05C85 68R10 68W40 PDF BibTeX XML Cite \textit{F. Gavril} et al., Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022; Zbl 1491.68269) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{M. Khosravian Ghadikolaei} et al., Theor. Comput. Sci. 904, 66--80 (2022; Zbl 07467464) Full Text: DOI HAL OpenURL
Laforest, Christian; Martinod, Timothée On the complexity of independent dominating set with obligations in graphs. (English) Zbl 07467460 Theor. Comput. Sci. 904, 1-14 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{C. Laforest} and \textit{T. Martinod}, Theor. Comput. Sci. 904, 1--14 (2022; Zbl 07467460) Full Text: DOI HAL OpenURL
Henning, Michael A.; Pal, Saikat; Pradhan, D. The semitotal domination problem in block graphs. (English) Zbl 1484.05155 Discuss. Math., Graph Theory 42, No. 1, 231-248 (2022). Reviewer: Thanin Sitthiwirattham (Bangkok) MSC: 05C69 05B05 05C51 PDF BibTeX XML Cite \textit{M. A. Henning} et al., Discuss. Math., Graph Theory 42, No. 1, 231--248 (2022; Zbl 1484.05155) Full Text: DOI OpenURL
Stinson, Douglas R. Techniques for designing and analyzing algorithms. (English) Zbl 1486.68003 Chapman & Hall/CRC Cryptography and Network Security. Boca Raton, FL: CRC Press (ISBN 978-0-367-22889-7/hbk; 978-1-032-02410-3/pbk; 978-0-429-27741-2/ebook). xiv, 430 p. (2022). Reviewer: Roberto Solis-Oba (London) MSC: 68-01 68P05 68P10 68Wxx PDF BibTeX XML Cite \textit{D. R. Stinson}, Techniques for designing and analyzing algorithms. Boca Raton, FL: CRC Press (2022; Zbl 1486.68003) Full Text: DOI OpenURL
Smirnov, A. V. NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity \(k \geqslant 3\). (Russian. English summary) Zbl 1504.68077 Model. Anal. Inf. Sist. 28, No. 1, 22-37 (2021). MSC: 68Q17 68R10 PDF BibTeX XML Cite \textit{A. V. Smirnov}, Model. Anal. Inf. Sist. 28, No. 1, 22--37 (2021; Zbl 1504.68077) Full Text: DOI MNR OpenURL
Henning, Michael A.; Pandey, Arti; Tripathi, Vikash Semipaired domination in some subclasses of chordal graphs. (English) Zbl 1498.05207 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 19, 21 p. (2021). MSC: 05C69 05C85 05B05 PDF BibTeX XML Cite \textit{M. A. Henning} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 19, 21 p. (2021; Zbl 1498.05207) Full Text: DOI arXiv Link OpenURL
Hellmuth, Marc; Seemann, Carsten R.; Stadler, Peter F. Generalized Fitch graphs. III: Symmetrized Fitch maps and sets of symmetric binary relations that are explained by unrooted edge-labeled trees. (English) Zbl 1498.05058 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021). MSC: 05C05 05C78 05C85 68Q17 92D10 PDF BibTeX XML Cite \textit{M. Hellmuth} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021; Zbl 1498.05058) Full Text: DOI arXiv Link OpenURL
Henning, Michael A.; Pandey, Arti; Tripathi, Vikash Approximation algorithm and hardness results for defensive domination in graphs. (English) Zbl 07550529 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 247-261 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{M. A. Henning} et al., Lect. Notes Comput. Sci. 13135, 247--261 (2021; Zbl 07550529) Full Text: DOI OpenURL
Fogarasi, Kinga; Nagy, Benedek Notes of the NP-completeness of the membership problem of ET0L languages. (English) Zbl 1499.68161 C. R. Acad. Bulg. Sci. 74, No. 7, 964-971 (2021). Reviewer: Angela Slavova (Sofia) MSC: 68Q42 68Q10 68Q15 68Q17 68Q45 PDF BibTeX XML Cite \textit{K. Fogarasi} and \textit{B. Nagy}, C. R. Acad. Bulg. Sci. 74, No. 7, 964--971 (2021; Zbl 1499.68161) Full Text: DOI OpenURL
van Kreveld, Marc; Speckmann, Bettina; Urhausen, Jérôme Diverse partitions of colored points. (English) Zbl 07498709 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 641-654 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{M. van Kreveld} et al., Lect. Notes Comput. Sci. 12808, 641--654 (2021; Zbl 07498709) Full Text: DOI OpenURL
Misra, Neeldhara; Sethia, Aditi Fair division is hard even for amicable agents. (English) Zbl 1492.91160 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 421-430 (2021). MSC: 91B32 68Q17 PDF BibTeX XML Cite \textit{N. Misra} and \textit{A. Sethia}, Lect. Notes Comput. Sci. 12607, 421--430 (2021; Zbl 1492.91160) Full Text: DOI OpenURL
Kloks, Ton; Pandey, Arti Semitotal domination on AT-free graphs and circle graphs. (English) Zbl 07497521 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 55-65 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Kloks} and \textit{A. Pandey}, Lect. Notes Comput. Sci. 12601, 55--65 (2021; Zbl 07497521) Full Text: DOI OpenURL
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI OpenURL
Chakradhar, Padamutham; Venkata Subba Reddy, Palagiri Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs. (English) Zbl 1478.05102 Discrete Math. Algorithms Appl. 13, No. 5, Article ID 2150063, 14 p. (2021). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{P. Chakradhar} and \textit{P. Venkata Subba Reddy}, Discrete Math. Algorithms Appl. 13, No. 5, Article ID 2150063, 14 p. (2021; Zbl 1478.05102) Full Text: DOI OpenURL
Bonnet, Édouard; Cabello, Sergio The complexity of mixed-connectivity. (English) Zbl 07462443 Ann. Oper. Res. 307, No. 1-2, 25-35 (2021). MSC: 68Q25 05C85 68Q17 68R10 05C40 PDF BibTeX XML Cite \textit{É. Bonnet} and \textit{S. Cabello}, Ann. Oper. Res. 307, No. 1--2, 25--35 (2021; Zbl 07462443) Full Text: DOI arXiv OpenURL
Couto, Fernanda; Cunha, Luís; Posner, Daniel Edge tree spanners. (English) Zbl 1479.05052 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 195-207 (2021). MSC: 05C05 05C12 05C85 68Q17 05C75 PDF BibTeX XML Cite \textit{F. Couto} et al., AIRO Springer Ser. 5, 195--207 (2021; Zbl 1479.05052) Full Text: DOI OpenURL
Li, Shasha; Qin, Zhongmei; Tu, Jianhua; Yue, Jun On tree-connectivity and path-connectivity of graphs. (English) Zbl 1479.05177 Graphs Comb. 37, No. 6, 2521-2533 (2021). MSC: 05C40 05C38 68Q25 PDF BibTeX XML Cite \textit{S. Li} et al., Graphs Comb. 37, No. 6, 2521--2533 (2021; Zbl 1479.05177) Full Text: DOI OpenURL
Leontiev, V. K.; Gordeev, E. N. On the number of solutions to a system of Boolean equations. (English. Russian original) Zbl 1485.15006 Autom. Remote Control 82, No. 9, 1581-1596 (2021); translation from Avtom. Telemekh. 2021, No. 9, 150-168 (2021). MSC: 15A06 15B34 PDF BibTeX XML Cite \textit{V. K. Leontiev} and \textit{E. N. Gordeev}, Autom. Remote Control 82, No. 9, 1581--1596 (2021; Zbl 1485.15006); translation from Avtom. Telemekh. 2021, No. 9, 150--168 (2021) Full Text: DOI OpenURL
Cantone, Domenico; De Domenico, Andrea; Maugeri, Pietro; Omodeo, Eugenio G. Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case. (English) Zbl 1498.03112 Fundam. Inform. 181, No. 1, 37-69 (2021). MSC: 03E30 03B25 03B35 68Q17 68Q25 PDF BibTeX XML Cite \textit{D. Cantone} et al., Fundam. Inform. 181, No. 1, 37--69 (2021; Zbl 1498.03112) Full Text: DOI OpenURL
Bhyravarapu, Sriram; Joshi, Saurabh; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami On the tractability of \(( k , i )\)-coloring. (English) Zbl 1476.05048 Discrete Appl. Math. 305, 329-339 (2021). MSC: 05C15 68Q17 PDF BibTeX XML Cite \textit{S. Bhyravarapu} et al., Discrete Appl. Math. 305, 329--339 (2021; Zbl 1476.05048) Full Text: DOI Link OpenURL
Deng, Yunyun; Guo, Longkun; Liao, Kewen; Chen, Yi On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms. (English) Zbl 07407464 Theor. Comput. Sci. 886, 157-168 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Deng} et al., Theor. Comput. Sci. 886, 157--168 (2021; Zbl 07407464) Full Text: DOI OpenURL
Minamisawa, Ko; Uehara, Ryuhei; Hara, Masao Mathematical characterizations and computational complexity of anti-slide puzzles. (English) Zbl 1498.68358 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 321-332 (2021). MSC: 68U05 05B50 52B55 68Q25 PDF BibTeX XML Cite \textit{K. Minamisawa} et al., Lect. Notes Comput. Sci. 12635, 321--332 (2021; Zbl 1498.68358) Full Text: DOI OpenURL
Arseneva, Elena; Cano, Pilar; Kleist, Linda; Mchedlidze, Tamara; Mehrabi, Saeed; Parada, Irene; Valtr, Pavel Upward point set embeddings of paths and trees. (English) Zbl 07405965 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{E. Arseneva} et al., Lect. Notes Comput. Sci. 12635, 234--246 (2021; Zbl 07405965) Full Text: DOI arXiv OpenURL
Asano, Tetsuo A new transportation problem on a graph with sending and bringing-back operations. (English) Zbl 07405948 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 13-24 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Asano}, Lect. Notes Comput. Sci. 12635, 13--24 (2021; Zbl 07405948) Full Text: DOI OpenURL
Frosini, Andrea; Kocay, William L.; Palma, Giulia; Tarsissi, Lama On null 3-hypergraphs. (English) Zbl 1472.05129 Discrete Appl. Math. 303, 76-85 (2021). MSC: 05C78 05C65 57M15 68Q25 PDF BibTeX XML Cite \textit{A. Frosini} et al., Discrete Appl. Math. 303, 76--85 (2021; Zbl 1472.05129) Full Text: DOI HAL OpenURL
Panda, B. S.; Chaudhary, Juhi Dominating induced matching in some subclasses of bipartite graphs. (English) Zbl 07391551 Theor. Comput. Sci. 885, 104-115 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Theor. Comput. Sci. 885, 104--115 (2021; Zbl 07391551) Full Text: DOI OpenURL
Hamada, Koki; Miyazaki, Shuichi; Okamoto, Kazuya Strongly stable and maximum weakly stable noncrossing matchings. (English) Zbl 07390198 Algorithmica 83, No. 9, 2678-2696 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Hamada} et al., Algorithmica 83, No. 9, 2678--2696 (2021; Zbl 07390198) Full Text: DOI arXiv OpenURL
Santamaría-Galvis, Andrés; Woodroofe, Russ Shellings from relative shellings, with an application to NP-completeness. (English) Zbl 1470.05173 Discrete Comput. Geom. 66, No. 2, 792-807 (2021). MSC: 05E45 57Q05 68Q17 PDF BibTeX XML Cite \textit{A. Santamaría-Galvis} and \textit{R. Woodroofe}, Discrete Comput. Geom. 66, No. 2, 792--807 (2021; Zbl 1470.05173) Full Text: DOI arXiv OpenURL
He, Dan; Lin, Wensong On \(t\)-relaxed 2-distant circular coloring of graphs. (English) Zbl 1470.05057 Bull. Malays. Math. Sci. Soc. (2) 44, No. 4, 1941-1960 (2021). MSC: 05C15 05C10 90C35 68Q17 PDF BibTeX XML Cite \textit{D. He} and \textit{W. Lin}, Bull. Malays. Math. Sci. Soc. (2) 44, No. 4, 1941--1960 (2021; Zbl 1470.05057) Full Text: DOI arXiv OpenURL
Chaudhary, Juhi; Panda, B. S. On the complexity of minimum maximal uniquely restricted matching. (English) Zbl 07380857 Theor. Comput. Sci. 882, 15-28 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Chaudhary} and \textit{B. S. Panda}, Theor. Comput. Sci. 882, 15--28 (2021; Zbl 07380857) Full Text: DOI OpenURL
Allender, Eric; Ilango, Rahul; Vafa, Neekon The non-hardness of approximating circuit size. (English) Zbl 07377743 Theory Comput. Syst. 65, No. 3, 559-578 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Allender} et al., Theory Comput. Syst. 65, No. 3, 559--578 (2021; Zbl 07377743) Full Text: DOI Link OpenURL
Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L. On the complexity of the smallest grammar problem over fixed alphabets. (English) Zbl 1464.68100 Theory Comput. Syst. 65, No. 2, 344-409 (2021). MSC: 68P30 68Q25 68Q42 PDF BibTeX XML Cite \textit{K. Casel} et al., Theory Comput. Syst. 65, No. 2, 344--409 (2021; Zbl 1464.68100) Full Text: DOI OpenURL
Monnot, Jérôme; Fernau, Henning; Manlove, David Algorithmic aspects of upper edge domination. (English) Zbl 07362197 Theor. Comput. Sci. 877, 46-57 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Monnot} et al., Theor. Comput. Sci. 877, 46--57 (2021; Zbl 07362197) Full Text: DOI OpenURL
Wan, Long; Mei, Jiajie; Du, Jiangze Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs. (English) Zbl 1487.90332 Eur. J. Oper. Res. 290, No. 1, 26-35 (2021). MSC: 90B35 PDF BibTeX XML Cite \textit{L. Wan} et al., Eur. J. Oper. Res. 290, No. 1, 26--35 (2021; Zbl 1487.90332) Full Text: DOI OpenURL
Lysenok, Igor; Ushakov, Alexander Orientable quadratic equations in free metabelian groups. (English) Zbl 07354446 J. Algebra 581, 303-326 (2021). MSC: 20F16 20F10 68W30 PDF BibTeX XML Cite \textit{I. Lysenok} and \textit{A. Ushakov}, J. Algebra 581, 303--326 (2021; Zbl 07354446) Full Text: DOI arXiv OpenURL
Tabatabai, Paul; Gruber, Dieter P. Knights and liars on graphs. (English) Zbl 1464.05157 J. Integer Seq. 24, No. 5, Article 21.5.8, 27 p. (2021). MSC: 05C15 00A08 90C10 68Q25 PDF BibTeX XML Cite \textit{P. Tabatabai} and \textit{D. P. Gruber}, J. Integer Seq. 24, No. 5, Article 21.5.8, 27 p. (2021; Zbl 1464.05157) Full Text: Link OpenURL
Dippel, Matthew; Sundaram, Ravi; Varma, Akshar Realization problems on reachability sequences. (English) Zbl 1477.68218 Theor. Comput. Sci. 866, 1-13 (2021). MSC: 68R10 68Q17 68Q25 68W20 68W25 PDF BibTeX XML Cite \textit{M. Dippel} et al., Theor. Comput. Sci. 866, 1--13 (2021; Zbl 1477.68218) Full Text: DOI OpenURL
Çiftçi, Canan Complexity and bounds for disjunctive total bondage. (English) Zbl 1502.05183 Theor. Comput. Sci. 865, 44-51 (2021). MSC: 05C69 68Q17 PDF BibTeX XML Cite \textit{C. Çiftçi}, Theor. Comput. Sci. 865, 44--51 (2021; Zbl 1502.05183) Full Text: DOI OpenURL
Panda, B. S.; Priyamvada Injective coloring of some subclasses of bipartite graphs and chordal graphs. (English) Zbl 1460.05066 Discrete Appl. Math. 291, 68-87 (2021). MSC: 05C15 05C85 05C40 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{Priyamvada}, Discrete Appl. Math. 291, 68--87 (2021; Zbl 1460.05066) Full Text: DOI OpenURL
Klavík, Pavel; Knop, Dušan; Zeman, Peter Graph isomorphism restricted by lists. (English) Zbl 1497.68385 Theor. Comput. Sci. 860, 51-71 (2021). MSC: 68R10 05C60 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{P. Klavík} et al., Theor. Comput. Sci. 860, 51--71 (2021; Zbl 1497.68385) Full Text: DOI arXiv OpenURL
Shitov, Yaroslav Column subset selection is NP-complete. (English) Zbl 1456.68056 Linear Algebra Appl. 610, 52-58 (2021). MSC: 68Q17 05C50 65F99 PDF BibTeX XML Cite \textit{Y. Shitov}, Linear Algebra Appl. 610, 52--58 (2021; Zbl 1456.68056) Full Text: DOI arXiv OpenURL
Ras, C. J.; Brazil, M.; Thomas, D. A. Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane. (English) Zbl 1464.68296 Theor. Comput. Sci. 850, 168-184 (2021). MSC: 68R10 68Q17 68U05 PDF BibTeX XML Cite \textit{C. J. Ras} et al., Theor. Comput. Sci. 850, 168--184 (2021; Zbl 1464.68296) Full Text: DOI OpenURL
Panda, B. S.; Goyal, Pooja Global total \(k\)-domination: approximation and hardness results. (English) Zbl 1464.68294 Theor. Comput. Sci. 850, 1-19 (2021). MSC: 68R10 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{P. Goyal}, Theor. Comput. Sci. 850, 1--19 (2021; Zbl 1464.68294) Full Text: DOI OpenURL
Chaudhary, Juhi; Panda, B. S. On the complexity of minimum maximal uniquely restricted matching. (English) Zbl 07666361 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 14th international conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12577, 364-376 (2020). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{J. Chaudhary} and \textit{B. S. Panda}, Lect. Notes Comput. Sci. 12577, 364--376 (2020; Zbl 07666361) Full Text: DOI OpenURL
Alzamel, Mai; Conte, Alessio; Denzumi, Shuhei; Grossi, Roberto; Iliopoulos, Costas S.; Kurita, Kazuhiro; Wasa, Kunihiro Finding the anticover of a string. (English) Zbl 07651093 Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 2, 11 p. (2020). MSC: 68W32 68Q17 68W40 PDF BibTeX XML Cite \textit{M. Alzamel} et al., LIPIcs -- Leibniz Int. Proc. Inform. 161, Article 2, 11 p. (2020; Zbl 07651093) Full Text: DOI OpenURL
Akshay, S.; Balaji, Nikhil; Murhekar, Aniket; Varma, Rohith; Vyas, Nikhil Near-optimal complexity bounds for fragments of the Skolem problem. (English) Zbl 07650922 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 37, 18 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Akshay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 37, 18 p. (2020; Zbl 07650922) Full Text: DOI OpenURL
Bergren, Dan; Eiben, Eduard; Ganian, Robert; Kanj, Iyad On covering segments with unit intervals. (English) Zbl 07650898 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 13, 17 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Bergren} et al., LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 13, 17 p. (2020; Zbl 07650898) Full Text: DOI OpenURL
Ilango, Rahul Approaching MCSP from above and below: hardness for a conditional variant and AC\(^0[p]\). (English) Zbl 07650382 Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 34, 26 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{R. Ilango}, LIPIcs -- Leibniz Int. Proc. Inform. 151, Article 34, 26 p. (2020; Zbl 07650382) Full Text: DOI OpenURL
Guo, Zhenyu; Xiao, Mingyu; Zhou, Yi The complexity of the partition coloring problem. (English) Zbl 07636451 Chen, Jianer (ed.) et al., Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18–20, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12337, 390-401 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{Z. Guo} et al., Lect. Notes Comput. Sci. 12337, 390--401 (2020; Zbl 07636451) Full Text: DOI arXiv OpenURL
Klavík, Pavel; Knop, Dušan; Zeman, Peter Graph isomorphism restricted by lists. (English) Zbl 07636199 Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 106-118 (2020). MSC: 68R10 PDF BibTeX XML Cite \textit{P. Klavík} et al., Lect. Notes Comput. Sci. 12301, 106--118 (2020; Zbl 07636199) Full Text: DOI OpenURL
Panda, B. S.; Chaudhary, Juhi Acyclic matching in some subclasses of graphs. (English) Zbl 07601024 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 409-421 (2020). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Lect. Notes Comput. Sci. 12126, 409--421 (2020; Zbl 07601024) Full Text: DOI OpenURL
Hamada, Koki; Miyazaki, Shuichi; Okamoto, Kazuya Strongly stable and maximum weakly stable noncrossing matchings. (English) Zbl 07601016 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 304-315 (2020). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{K. Hamada} et al., Lect. Notes Comput. Sci. 12126, 304--315 (2020; Zbl 07601016) Full Text: DOI OpenURL
Khoa, Phan Dang; Demetrovics, János; Thi, Vu Duc; Anh, Pham Viet Some NP-complete problems for attribute reduction in consistent decision tables. (English) Zbl 1507.68123 Serdica J. Comput. 14, No. 1-2, 27-41 (2020). MSC: 68Q17 68Q25 68T30 68T37 PDF BibTeX XML Cite \textit{P. D. Khoa} et al., Serdica J. Comput. 14, No. 1--2, 27--41 (2020; Zbl 1507.68123) Full Text: DOI OpenURL
Gharibyan, A. H.; Petrosyan, P. A. On locally-balanced 2-partitions of bipartite graphs. (English) Zbl 1493.05245 Proc. Yerevan State Univ., Phys. Math. Sci. 54, No. 3, 137-145 (2020). MSC: 05C70 68Q25 PDF BibTeX XML Cite \textit{A. H. Gharibyan} and \textit{P. A. Petrosyan}, Proc. Yerevan State Univ., Phys. Math. Sci. 54, No. 3, 137--145 (2020; Zbl 1493.05245) Full Text: DOI MNR OpenURL
Loverov, Yaroslav Anatol’evich; Orlovich, Yuriĭ Leonidovich NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs. (Russian. English summary) Zbl 1491.68080 Diskretn. Anal. Issled. Oper. 27, No. 2, 65-89 (2020). MSC: 68Q17 05C69 PDF BibTeX XML Cite \textit{Y. A. Loverov} and \textit{Y. L. Orlovich}, Diskretn. Anal. Issled. Oper. 27, No. 2, 65--89 (2020; Zbl 1491.68080) Full Text: DOI MNR OpenURL
Alexandersson, Per; Restadh, Petter LaserTank is NP-complete. (English) Zbl 07441080 Slamanig, Daniel (ed.) et al., Mathematical aspects of computer and information sciences. 8th international conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11989, 333-338 (2020). MSC: 68-XX 65-XX PDF BibTeX XML Cite \textit{P. Alexandersson} and \textit{P. Restadh}, Lect. Notes Comput. Sci. 11989, 333--338 (2020; Zbl 07441080) Full Text: DOI arXiv OpenURL
Padamutham, Chakradhar; Palagiri, Venkata Subba Reddy Algorithmic aspects of Roman domination in graphs. (English) Zbl 1475.05137 J. Appl. Math. Comput. 64, No. 1-2, 89-102 (2020). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{C. Padamutham} and \textit{V. S. R. Palagiri}, J. Appl. Math. Comput. 64, No. 1--2, 89--102 (2020; Zbl 1475.05137) Full Text: DOI OpenURL
Kel’Manov, Alexander; Khandeev, Vladimir; Pyatkin, Artem On the complexity of some quadratic Euclidean partition problems into balanced clusters. (English) Zbl 1477.90085 Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 127-136 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Kel'Manov} et al., Commun. Comput. Inf. Sci. 1145, 127--136 (2020; Zbl 1477.90085) Full Text: DOI OpenURL
Sharifani, P.; Hooshmandasl, M. R.; Meybodi, M. Alambardar An explicit construction of optimal dominating and \([1, 2]\)-dominating sets in grid. (English) Zbl 1471.05086 AKCE Int. J. Graphs Comb. 17, No. 3, 870-876 (2020). MSC: 05C69 90C39 68Q17 PDF BibTeX XML Cite \textit{P. Sharifani} et al., AKCE Int. J. Graphs Comb. 17, No. 3, 870--876 (2020; Zbl 1471.05086) Full Text: DOI arXiv OpenURL
Pavan Kumar, J.; Reddy, P. Venkata Subba Algorithmic aspects of some variants of domination in graphs. (English) Zbl 1488.05391 An. Științ. Univ. “Ovidius” Constanța, Ser. Mat. 28, No. 3, 153-170 (2020). MSC: 05C69 68Q17 05C85 PDF BibTeX XML Cite \textit{J. Pavan Kumar} and \textit{P. V. S. Reddy}, An. Științ. Univ. ``Ovidius'' Constanța, Ser. Mat. 28, No. 3, 153--170 (2020; Zbl 1488.05391) Full Text: DOI arXiv OpenURL
Zhao, Yancai; Shan, Erfang On signed mixed domination in graphs. (Chinese. English summary) Zbl 1474.05317 Acta Math. Appl. Sin. 43, No. 6, 915-922 (2020). MSC: 05C69 05C22 05C10 68Q17 PDF BibTeX XML Cite \textit{Y. Zhao} and \textit{E. Shan}, Acta Math. Appl. Sin. 43, No. 6, 915--922 (2020; Zbl 1474.05317) OpenURL
Finbow, Arthur S.; Hartnell, Bert L.; Young, Jenna R. The complexity of monitoring a network with both watchers and listeners. (English) Zbl 1504.68027 J. Comb. Math. Comb. Comput. 116, 233-244 (2020). MSC: 68M25 05C69 68R10 PDF BibTeX XML Cite \textit{A. S. Finbow} et al., J. Comb. Math. Comb. Comput. 116, 233--244 (2020; Zbl 1504.68027) OpenURL
Henning, Michael A.; Pandey, Arti; Tripathi, Vikash Complexity and algorithms for semipaired domination in graphs. (English) Zbl 1503.68223 Theory Comput. Syst. 64, No. 7, 1225-1241 (2020). MSC: 68R10 05C62 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{M. A. Henning} et al., Theory Comput. Syst. 64, No. 7, 1225--1241 (2020; Zbl 1503.68223) Full Text: DOI arXiv OpenURL
Pan, Zhuo; Yang, Yu; Li, Xianyue; Xu, Shou-Jun The complexity of total edge domination and some related results on trees. (English) Zbl 1466.05170 J. Comb. Optim. 40, No. 3, 571-589 (2020). MSC: 05C69 68Q17 05C05 PDF BibTeX XML Cite \textit{Z. Pan} et al., J. Comb. Optim. 40, No. 3, 571--589 (2020; Zbl 1466.05170) Full Text: DOI arXiv OpenURL
Dippel, Matthew; Sundaram, Ravi; Varma, Akshar Realization problems on reachability sequences. (English) Zbl 1477.68219 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 274-286 (2020). MSC: 68R10 68Q17 68Q25 68W20 68W25 PDF BibTeX XML Cite \textit{M. Dippel} et al., Lect. Notes Comput. Sci. 12273, 274--286 (2020; Zbl 1477.68219) Full Text: DOI OpenURL
Nagy, Benedek On the membership problem of permutation grammars – a direct proof of NP-completeness. (English) Zbl 1458.68109 Int. J. Found. Comput. Sci. 31, No. 4, 515-525 (2020). MSC: 68Q45 68Q17 68Q42 PDF BibTeX XML Cite \textit{B. Nagy}, Int. J. Found. Comput. Sci. 31, No. 4, 515--525 (2020; Zbl 1458.68109) Full Text: DOI OpenURL