Shitov, Yaroslav Column subset selection is NP-complete. (English) Zbl 07311301 Linear Algebra Appl. 610, 52-58 (2021). MSC: 68Q17 05C50 PDF BibTeX XML Cite \textit{Y. Shitov}, Linear Algebra Appl. 610, 52--58 (2021; Zbl 07311301) Full Text: DOI
Barbero, Fausto Complexity of syntactical tree fragments of independence-friendly logic. (English) Zbl 07260106 Ann. Pure Appl. Logic 172, No. 1, Article ID 102859, 43 p. (2021). MSC: 03C80 03C85 03B60 68Q19 PDF BibTeX XML Cite \textit{F. Barbero}, Ann. Pure Appl. Logic 172, No. 1, Article ID 102859, 43 p. (2021; Zbl 07260106) Full Text: DOI
Demaine, Erik D.; Korman, Matias; Ku, Jason S.; Mitchell, Joseph S. B.; Otachi, Yota; van Renssen, André; Roeloffzen, Marcel; Uehara, Ryuhei; Uno, Yushi Symmetric assembly puzzles are hard, beyond a few pieces. (English) Zbl 1450.05009 Comput. Geom. 90, Article ID 101648, 10 p. (2020). MSC: 05B40 05B50 68Q17 52C15 PDF BibTeX XML Cite \textit{E. D. Demaine} et al., Comput. Geom. 90, Article ID 101648, 10 p. (2020; Zbl 1450.05009) Full Text: DOI
Couto, Fernanda; Cunha, Luís Felipe I. Hardness and efficiency on minimizing maximum distances in spanning trees. (English) Zbl 1453.68131 Theor. Comput. Sci. 838, 168-179 (2020). MSC: 68R10 05C12 68Q17 68Q25 PDF BibTeX XML Cite \textit{F. Couto} and \textit{L. F. I. Cunha}, Theor. Comput. Sci. 838, 168--179 (2020; Zbl 1453.68131) Full Text: DOI
Mishra, Pawan K.; Jena, Sangram K.; Das, Gautam K.; Rao, S. V. Capacitated discrete unit disk cover. (English) Zbl 1447.05173 Discrete Appl. Math. 285, 242-251 (2020). MSC: 05C70 68Q17 PDF BibTeX XML Cite \textit{P. K. Mishra} et al., Discrete Appl. Math. 285, 242--251 (2020; Zbl 1447.05173) Full Text: DOI
de Mesmay, Arnaud; Schaefer, Marcus; Sedgwick, Eric Link crossing number is NP-hard. (English) Zbl 07240993 J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020). Reviewer: Mehdi Yazdi (Oxford) MSC: 57K10 57M15 68Q17 68R10 PDF BibTeX XML Cite \textit{A. de Mesmay} et al., J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020; Zbl 07240993) Full Text: DOI
Dobrev, Stefan; Kranakis, Evangelos; Krizanc, Danny; Lafond, Manuel; Maňuch, Ján; Narayanan, Lata; Opatrny, Jaroslav; Stacho, Ladislav Weak coverage of a rectangular barrier. (English) Zbl 1435.68342 Algorithmica 82, No. 4, 721-746 (2020). MSC: 68U05 68M18 68Q17 68W40 90B80 PDF BibTeX XML Cite \textit{S. Dobrev} et al., Algorithmica 82, No. 4, 721--746 (2020; Zbl 1435.68342) Full Text: DOI
Henning, Michael A.; Pradhan, D. Algorithmic aspects of upper paired-domination in graphs. (English) Zbl 1436.68242 Theor. Comput. Sci. 804, 98-114 (2020). MSC: 68R10 05C69 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{D. Pradhan}, Theor. Comput. Sci. 804, 98--114 (2020; Zbl 1436.68242) Full Text: DOI
Hayat, Sakander; Wang, Shaohui On the anti-Kekulé number of \(k\)-polyomino system. (English) Zbl 1452.05033 Util. Math. 112, 235-248 (2019). MSC: 05C09 05C92 05C70 05C12 05C90 05B50 68Q17 PDF BibTeX XML Cite \textit{S. Hayat} and \textit{S. Wang}, Util. Math. 112, 235--248 (2019; Zbl 1452.05033)
Fenner, Stephen; Padé, Daniel Complexity of regex crosswords. (English) Zbl 1425.68196 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 215-230 (2019). MSC: 68Q45 68Q17 68R05 PDF BibTeX XML Cite \textit{S. Fenner} and \textit{D. Padé}, Lect. Notes Comput. Sci. 11417, 215--230 (2019; Zbl 1425.68196) Full Text: DOI
Siddiqui, Hafiz Muhammad Afzal; Hayat, Sakander; Khan, Asad; Imran, Muhammad; Razzaq, Ayesha; Liu, Jia-Bao Resolvability and fault-tolerant resolvability structures of convex polytopes. (English) Zbl 1433.05104 Theor. Comput. Sci. 796, 114-128 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 52B12 68Q17 PDF BibTeX XML Cite \textit{H. M. A. Siddiqui} et al., Theor. Comput. Sci. 796, 114--128 (2019; Zbl 1433.05104) Full Text: DOI
Miao, Dongjing; Cai, Zhipeng; Yu, Jiguo; Li, Yingshu Triangle edge deletion on planar glasses-free RGB-digraphs. (English) Zbl 1425.68319 Theor. Comput. Sci. 788, 2-11 (2019). MSC: 68R10 68Q17 PDF BibTeX XML Cite \textit{D. Miao} et al., Theor. Comput. Sci. 788, 2--11 (2019; Zbl 1425.68319) Full Text: DOI
Henning, Michael A.; Pandey, Arti Algorithmic aspects of semitotal domination in graphs. (English) Zbl 1418.68169 Theor. Comput. Sci. 766, 46-57 (2019). MSC: 68R10 05C69 68Q17 68W25 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{A. Pandey}, Theor. Comput. Sci. 766, 46--57 (2019; Zbl 1418.68169) Full Text: DOI
Zhu, Enqiang; Liu, Chanjuan On the semitotal domination number of line graphs. (English) Zbl 1404.05161 Discrete Appl. Math. 254, 295-298 (2019). MSC: 05C69 05C76 68Q17 PDF BibTeX XML Cite \textit{E. Zhu} and \textit{C. Liu}, Discrete Appl. Math. 254, 295--298 (2019; Zbl 1404.05161) Full Text: DOI
Lajou, Dimitri On the achromatic number of signed graphs. (English) Zbl 1405.05063 Theor. Comput. Sci. 759, 50-60 (2019). MSC: 05C15 05C22 68Q17 PDF BibTeX XML Cite \textit{D. Lajou}, Theor. Comput. Sci. 759, 50--60 (2019; Zbl 1405.05063) Full Text: DOI
Huang, Jingui; Wang, Shengchun \(O(1.890^n)\) exact algorithm for a class of separable SAT problems. (Chinese. English summary) Zbl 1424.68150 J. Softw. 29, No. 12, 3595-3603 (2018). MSC: 68T20 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. Huang} and \textit{S. Wang}, J. Softw. 29, No. 12, 3595--3603 (2018; Zbl 1424.68150) Full Text: DOI
Sohn, Moo Young; Chen, Xue-gang; Hu, Fu-Tao On efficiently total dominatable digraphs. (English) Zbl 1404.05159 Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 1749-1758 (2018). MSC: 05C69 05C20 05B05 68Q17 PDF BibTeX XML Cite \textit{M. Y. Sohn} et al., Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 1749--1758 (2018; Zbl 1404.05159) Full Text: DOI
Romero-Jiménez, Álvaro; Orellana-Martín, David Design patterns for efficient solutions to \(\mathrm{NP}\)-complete problems in membrane computing. (English) Zbl 07002236 Graciani, Carmen (ed.) et al., Enjoying natural computing. Essays dedicated to Mario de Jesús Pérez-Jiménez on the occasion of his 70th birthday. Cham: Springer (ISBN 978-3-030-00264-0/pbk; 978-3-030-00265-7/ebook). Lecture Notes in Computer Science 11270, 237-255 (2018). MSC: 68Q05 68Q10 PDF BibTeX XML Cite \textit{Á. Romero-Jiménez} and \textit{D. Orellana-Martín}, Lect. Notes Comput. Sci. 11270, 237--255 (2018; Zbl 07002236) Full Text: DOI
Nahhas, Ahmad; Corley, H. W. The computational complexity of finding a mixed Berge equilibrium for a \(k\)-person noncooperative game in normal form. (English) Zbl 1418.91032 Int. Game Theory Rev. 20, No. 4, Article ID 1850010, 13 p. (2018). MSC: 91A10 91A06 68Q17 PDF BibTeX XML Cite \textit{A. Nahhas} and \textit{H. W. Corley}, Int. Game Theory Rev. 20, No. 4, Article ID 1850010, 13 p. (2018; Zbl 1418.91032) Full Text: DOI
Reddy, I. Vinod Parameterized algorithms for conflict-free colorings of graphs. (English) Zbl 1401.68126 Theor. Comput. Sci. 745, 53-62 (2018). MSC: 68Q25 05C15 05C85 68Q17 PDF BibTeX XML Cite \textit{I. V. Reddy}, Theor. Comput. Sci. 745, 53--62 (2018; Zbl 1401.68126) Full Text: DOI
Weiss, Eyal; Margaliot, Michael; Even, Guy Minimal controllability of conjunctive Boolean networks is NP-complete. (English) Zbl 1388.93022 Automatica 92, 56-62 (2018). MSC: 93B05 93C30 94C10 68Q17 PDF BibTeX XML Cite \textit{E. Weiss} et al., Automatica 92, 56--62 (2018; Zbl 1388.93022) Full Text: DOI arXiv
Bannai, Hideo; Gagie, Travis; Inenaga, Shunsuke; Kärkkäinen, Juha; Kempa, Dominik; Piątkowski, Marcin; Sugimoto, Shiho Diverse palindromic factorization is NP-complete. (English) Zbl 1387.68119 Int. J. Found. Comput. Sci. 29, No. 2, 143-163 (2018). MSC: 68Q17 68R15 PDF BibTeX XML Cite \textit{H. Bannai} et al., Int. J. Found. Comput. Sci. 29, No. 2, 143--163 (2018; Zbl 1387.68119) Full Text: DOI
Li, Zepeng; Zhu, Enqiang; Shao, Zehui; Xu, Jin NP-completeness of local colorings of graphs. (English) Zbl 1419.68055 Inf. Process. Lett. 130, 25-29 (2018). MSC: 68Q17 05C15 PDF BibTeX XML Cite \textit{Z. Li} et al., Inf. Process. Lett. 130, 25--29 (2018; Zbl 1419.68055) Full Text: DOI
Simonaitis, Pijus; Swenson, Krister M. Finding local genome rearrangements. (English) Zbl 1443.92124 Schwartz, Russell (ed.) et al., 17th international workshop on algorithms in bioinformatics, WABI 2017, Boston, MA, USA, August 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 88, Article 24, 13 p. (2017). MSC: 92D10 92-08 PDF BibTeX XML Cite \textit{P. Simonaitis} and \textit{K. M. Swenson}, LIPIcs -- Leibniz Int. Proc. Inform. 88, Article 24, 13 p. (2017; Zbl 1443.92124) Full Text: DOI
Li, Wenjing; Li, Xueliang; Wu, Di Hardness result for the total rainbow \(k\)-connection of graphs. (English) Zbl 1411.05093 Appl. Math. Comput. 305, 27-31 (2017). MSC: 05C15 05C40 68Q17 68Q25 PDF BibTeX XML Cite \textit{W. Li} et al., Appl. Math. Comput. 305, 27--31 (2017; Zbl 1411.05093) Full Text: DOI arXiv
Yero, Ismael G.; Estrada-Moreno, Alejandro; Rodríguez-Velázquez, Juan A. Computing the \(k\)-metric dimension of graphs. (English) Zbl 1411.05077 Appl. Math. Comput. 300, 60-69 (2017). MSC: 05C12 05C85 68Q17 05C05 90C35 90C60 PDF BibTeX XML Cite \textit{I. G. Yero} et al., Appl. Math. Comput. 300, 60--69 (2017; Zbl 1411.05077) Full Text: DOI
Steindl, Markus The subpower membership problem for bands. (English) Zbl 06813395 J. Algebra 489, 529-551 (2017). MSC: 20M99 68Q17 68Q25 68R05 PDF BibTeX XML Cite \textit{M. Steindl}, J. Algebra 489, 529--551 (2017; Zbl 06813395) Full Text: DOI arXiv
Asaeedi, Saeed; Didehvar, Farzad; Mohades, Ali \(\alpha\)-concave hull, a generalization of convex hull. (English) Zbl 1380.68376 Theor. Comput. Sci. 702, 48-59 (2017). MSC: 68U05 68Q17 68W25 PDF BibTeX XML Cite \textit{S. Asaeedi} et al., Theor. Comput. Sci. 702, 48--59 (2017; Zbl 1380.68376) Full Text: DOI
Horiyama, Takashi; Ito, Takehiro; Nakatsuka, Keita; Suzuki, Akira; Uehara, Ryuhei Complexity of tiling a polygon with trominoes or bars. (English) Zbl 1377.52023 Discrete Comput. Geom. 58, No. 3, 686-704 (2017). MSC: 52C45 52C15 68Q17 05B45 52C20 PDF BibTeX XML Cite \textit{T. Horiyama} et al., Discrete Comput. Geom. 58, No. 3, 686--704 (2017; Zbl 1377.52023) Full Text: DOI
Dragan, Feodor F.; Leitert, Arne On the minimum eccentricity shortest path problem. (English) Zbl 1373.68266 Theor. Comput. Sci. 694, 66-78 (2017). MSC: 68Q25 05C12 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{A. Leitert}, Theor. Comput. Sci. 694, 66--78 (2017; Zbl 1373.68266) Full Text: DOI
Li, Xueliang; Wu, Di The (vertex-)monochromatic index of a graph. (English) Zbl 1379.05038 J. Comb. Optim. 33, No. 4, 1443-1453 (2017). Reviewer: Iztok Peterin (Maribor) MSC: 05C15 05C40 05C05 68Q17 PDF BibTeX XML Cite \textit{X. Li} and \textit{D. Wu}, J. Comb. Optim. 33, No. 4, 1443--1453 (2017; Zbl 1379.05038) Full Text: DOI arXiv
Brand, Michael Small polyomino packing. (English) Zbl 1407.68208 Inf. Process. Lett. 126, 30-34 (2017). MSC: 68Q25 05B40 05B50 68Q17 68U05 PDF BibTeX XML Cite \textit{M. Brand}, Inf. Process. Lett. 126, 30--34 (2017; Zbl 1407.68208) Full Text: DOI
Borobia, Alberto; Canogar, Roberto The real nonnegative inverse eigenvalue problem is NP-hard. (English) Zbl 1361.65022 Linear Algebra Appl. 522, 127-139 (2017). MSC: 65F18 15A18 15A29 65Y20 15B48 PDF BibTeX XML Cite \textit{A. Borobia} and \textit{R. Canogar}, Linear Algebra Appl. 522, 127--139 (2017; Zbl 1361.65022) Full Text: DOI arXiv
Panda, B. S.; Pandey, Arti Algorithmic aspects of open neighborhood location-domination in graphs. (English) Zbl 1350.05124 Discrete Appl. Math. 216, Part 1, 290-306 (2017). MSC: 05C69 05C85 05C07 68W25 68Q17 68Q25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{A. Pandey}, Discrete Appl. Math. 216, Part 1, 290--306 (2017; Zbl 1350.05124) Full Text: DOI
Durnev, V. G.; Zetkina, O. V.; Zetkina, A. I.; Murin, D. M. About the conp-complete “injective knapsack” problem. (Russian. English summary) Zbl 07310350 Prikl. Diskretn. Mat. 2016, No. 3(33), 85-92 (2016). MSC: 03 90 PDF BibTeX XML Cite \textit{V. G. Durnev} et al., Prikl. Diskretn. Mat. 2016, No. 3(33), 85--92 (2016; Zbl 07310350) Full Text: DOI MNR
Essa, Hanaa A. E.; El-Latif, Yasser M. Abd; Ali, Salwa M.; Khamis, Soheir M. A new approximation algorithm for \(k\)-set cover problem. (English) Zbl 1393.68188 Arab. J. Sci. Eng. 41, No. 3, 935-940 (2016). MSC: 68W25 68Q17 90C27 PDF BibTeX XML Cite \textit{H. A. E. Essa} et al., Arab. J. Sci. Eng. 41, No. 3, 935--940 (2016; Zbl 1393.68188) Full Text: DOI
Dobrev, S.; Eftekhari, M.; MacQuarrie, F.; Maňuch, J.; Morales Ponce, O.; Narayanan, L.; Opatrny, J.; Stacho, L. Connectivity with directional antennas in the symmetric communication model. (English) Zbl 1380.68019 Comput. Geom. 55, 1-25 (2016). MSC: 68M10 68Q17 68U05 68W25 PDF BibTeX XML Cite \textit{S. Dobrev} et al., Comput. Geom. 55, 1--25 (2016; Zbl 1380.68019) Full Text: DOI
Gerasimov, Alexander S. Free-variable semantic tableaux for the logic of fuzzy inequalities. (English. Russian original) Zbl 1386.03025 Algebra Logic 55, No. 2, 103-127 (2016); translation from Algebra Logika 55, No. 2, 156-191 (2016); erratum ibid. 55, No. 3, 256 (2016). MSC: 03B52 03F03 68Q17 PDF BibTeX XML Cite \textit{A. S. Gerasimov}, Algebra Logic 55, No. 2, 103--127 (2016; Zbl 1386.03025); translation from Algebra Logika 55, No. 2, 156--191 (2016); erratum ibid. 55, No. 3, 256 (2016) Full Text: DOI
Misra, Neeldhara Two Dots is NP-complete. (English) Zbl 1369.68218 Demaine, Erik D. (ed.) et al., 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). LIPIcs – Leibniz International Proceedings in Informatics 49, Article 24, 12 p. (2016). MSC: 68Q17 91A46 PDF BibTeX XML Cite \textit{N. Misra}, LIPIcs -- Leibniz Int. Proc. Inform. 49, Article 24, 12~p. (2016; Zbl 1369.68218) Full Text: DOI
Cayrel, P-L.; Diagne, M. K.; Gueye, C. T. NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem. (English) Zbl 1393.94927 Gulf J. Math. 4, No. 4, 206-216 (2016). MSC: 94B05 68Q17 94B35 PDF BibTeX XML Cite \textit{P-L. Cayrel} et al., Gulf J. Math. 4, No. 4, 206--216 (2016; Zbl 1393.94927) Full Text: Link
Danilovic, Milos; Ilic, Oliver A generalized constructive algorithm using insertion-based heuristics. (English) Zbl 1349.90335 Comput. Oper. Res. 66, 29-43 (2016). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{M. Danilovic} and \textit{O. Ilic}, Comput. Oper. Res. 66, 29--43 (2016; Zbl 1349.90335) Full Text: DOI
Munaro, Andrea The VC-dimension of graphs with respect to \(k\)-connected subgraphs. (English) Zbl 1348.05115 Discrete Appl. Math. 211, 163-174 (2016). MSC: 05C40 68Q17 PDF BibTeX XML Cite \textit{A. Munaro}, Discrete Appl. Math. 211, 163--174 (2016; Zbl 1348.05115) Full Text: DOI arXiv
Moore, Cristopher The phase transition in random regular exact cover. (English) Zbl 1353.68210 Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 3, No. 3, 349-362 (2016). MSC: 68Q87 05C80 68Q17 68Q25 PDF BibTeX XML Cite \textit{C. Moore}, Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 3, No. 3, 349--362 (2016; Zbl 1353.68210) Full Text: DOI arXiv
Wu, Lidong On strongly planar 3SAT. (English) Zbl 1354.90117 J. Comb. Optim. 32, No. 1, 293-298 (2016). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{L. Wu}, J. Comb. Optim. 32, No. 1, 293--298 (2016; Zbl 1354.90117) Full Text: DOI
Raggi, Miguel Forbidden configurations: finding the number predicted by the Anstee-Sali conjecture is NP-hard. (English) Zbl 1337.05107 Ars Math. Contemp. 10, No. 1, 1-8 (2016). MSC: 05D05 05C65 68Q17 68R10 PDF BibTeX XML Cite \textit{M. Raggi}, Ars Math. Contemp. 10, No. 1, 1--8 (2016; Zbl 1337.05107) Full Text: DOI arXiv
Trofymchuk, O. M.; Vasyanin, V. A.; Kuzmenko, V. N. Complexity of one packing optimization problem. (English. Russian original) Zbl 1338.90484 Cybern. Syst. Anal. 52, No. 1, 76-84 (2016); translation from Kibern. Sist. Anal. 2016, No. 1, 83-92 (2016). MSC: 90C60 90C27 PDF BibTeX XML Cite \textit{O. M. Trofymchuk} et al., Cybern. Syst. Anal. 52, No. 1, 76--84 (2016; Zbl 1338.90484); translation from Kibern. Sist. Anal. 2016, No. 1, 83--92 (2016) Full Text: DOI
Dourado, Mitre Costa Computing role assignments of split graphs. (English) Zbl 1339.05384 Theor. Comput. Sci. 635, 74-84 (2016). MSC: 05C85 05C82 68Q17 91D30 PDF BibTeX XML Cite \textit{M. C. Dourado}, Theor. Comput. Sci. 635, 74--84 (2016; Zbl 1339.05384) Full Text: DOI
Peretz, Y. On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields. (English) Zbl 1339.94058 Finite Fields Appl. 39, 1-35 (2016). MSC: 94A60 12E20 68Q17 PDF BibTeX XML Cite \textit{Y. Peretz}, Finite Fields Appl. 39, 1--35 (2016; Zbl 1339.94058) Full Text: DOI
Mertzios, George B.; Spirakis, Paul G. Algorithms and almost tight results for 3-colorability of small diameter graphs. (English) Zbl 1336.68142 Algorithmica 74, No. 1, 385-414 (2016). MSC: 68Q25 05C15 05C85 68Q17 PDF BibTeX XML Cite \textit{G. B. Mertzios} and \textit{P. G. Spirakis}, Algorithmica 74, No. 1, 385--414 (2016; Zbl 1336.68142) Full Text: DOI
Pandey, Arti; Panda, B. S. B-disjunctive total domination in graphs: algorithm and hardness results. (English) Zbl 1437.68139 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 277-288 (2016). MSC: 68R10 05C69 68Q17 68W25 PDF BibTeX XML Cite \textit{A. Pandey} and \textit{B. S. Panda}, Lect. Notes Comput. Sci. 9602, 277--288 (2016; Zbl 1437.68139) Full Text: DOI
Pradhan, D. On the complexity of the minimum outer-connected dominating set problem in graphs. (English) Zbl 1360.90227 J. Comb. Optim. 31, No. 1, 1-12 (2016). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{D. Pradhan}, J. Comb. Optim. 31, No. 1, 1--12 (2016; Zbl 1360.90227) Full Text: DOI
Panda, B. S.; Pandey, Arti Complexity of total outer-connected domination problem in graphs. (English) Zbl 1326.05110 Discrete Appl. Math. 199, 110-122 (2016). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{A. Pandey}, Discrete Appl. Math. 199, 110--122 (2016; Zbl 1326.05110) Full Text: DOI
Coelho, H.; Faria, L.; Gravier, S.; Klein, S. Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. (English) Zbl 1327.05103 Discrete Appl. Math. 198, 109-117 (2016). MSC: 05C15 05C35 05C07 05C10 68Q17 PDF BibTeX XML Cite \textit{H. Coelho} et al., Discrete Appl. Math. 198, 109--117 (2016; Zbl 1327.05103) Full Text: DOI
Dehghani, Sina; Fazli, Mohammad Amin; Habibi, Jafar; Yazdanbod, Sadra Using shortcut edges to maximize the number of triangles in graphs. (English) Zbl 1408.90295 Oper. Res. Lett. 43, No. 6, 586-591 (2015). MSC: 90C35 05C38 05C85 68Q17 68Q25 68R10 90C60 PDF BibTeX XML Cite \textit{S. Dehghani} et al., Oper. Res. Lett. 43, No. 6, 586--591 (2015; Zbl 1408.90295) Full Text: DOI
Gastineau, Nicolas Dichotomies properties on computational complexity of \(S\)-packing coloring problems. (English) Zbl 1371.05080 Discrete Math. 338, No. 6, 1029-1041 (2015). MSC: 05C15 05C70 68Q17 PDF BibTeX XML Cite \textit{N. Gastineau}, Discrete Math. 338, No. 6, 1029--1041 (2015; Zbl 1371.05080) Full Text: DOI arXiv
Lafond, Manuel; El-Mabrouk, Nadia Orthology relation and gene tree correction: complexity results. (English) Zbl 1367.92086 Pop, Mihai (ed.) et al., Algorithms in bioinformatics. 15th international workshop, WABI 2015, Atlanta, GA, USA, September 10–12, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48220-9/pbk; 978-3-662-48221-6/ebook). Lecture Notes in Computer Science 9289. Lecture Notes in Bioinformatics, 66-79 (2015). MSC: 92D15 92D10 92-08 68Q17 68Q25 PDF BibTeX XML Cite \textit{M. Lafond} and \textit{N. El-Mabrouk}, Lect. Notes Comput. Sci. 9289, 66--79 (2015; Zbl 1367.92086) Full Text: DOI
Fernau, Henning; Manea, Florin; Mercas, Robert; Schmid, Markus L. Pattern matching with variables: fast algorithms and new hardness results. (English) Zbl 1355.68300 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 302-315 (2015). MSC: 68W32 68Q17 68R15 PDF BibTeX XML Cite \textit{H. Fernau} et al., LIPIcs -- Leibniz Int. Proc. Inform. 30, 302--315 (2015; Zbl 1355.68300) Full Text: DOI
Diwan, Ajit A.; Dion, Justine E.; Mendell, David J.; Plantholt, Michael J.; Tipnis, Shailesh K. The complexity of \(P_{4}\)-decomposition of regular graphs and multigraphs. (English) Zbl 1327.05270 Discrete Math. Theor. Comput. Sci. 17, No. 2, 63-76 (2015). MSC: 05C70 68Q17 PDF BibTeX XML Cite \textit{A. A. Diwan} et al., Discrete Math. Theor. Comput. Sci. 17, No. 2, 63--76 (2015; Zbl 1327.05270) Full Text: Link
O’Neil, Thomas E. Complement, complexity, and symmetric representation. (English) Zbl 1330.68119 Int. J. Found. Comput. Sci. 26, No. 5, 557-581 (2015). MSC: 68Q25 68P05 68Q17 PDF BibTeX XML Cite \textit{T. E. O'Neil}, Int. J. Found. Comput. Sci. 26, No. 5, 557--581 (2015; Zbl 1330.68119) Full Text: DOI
Bang-Jensen, Jørgen; Yeo, A. Balanced branchings in digraphs. (English) Zbl 1328.68082 Theor. Comput. Sci. 595, 107-119 (2015). MSC: 68Q25 05C85 68Q17 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{A. Yeo}, Theor. Comput. Sci. 595, 107--119 (2015; Zbl 1328.68082) Full Text: DOI
Bang-Jensen, Jørgen; Casselgren, Carl Johan Restricted cycle factors and arc-decompositions of digraphs. (English) Zbl 1317.05068 Discrete Appl. Math. 193, 80-93 (2015). MSC: 05C20 05C70 05B15 05C38 68Q17 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{C. J. Casselgren}, Discrete Appl. Math. 193, 80--93 (2015; Zbl 1317.05068) Full Text: DOI
Peng, Chao; Zhou, Jie; Zhu, Binhai; Zhu, Hong Complexity analysis and algorithms for the program download problem. (English) Zbl 1328.90130 J. Comb. Optim. 29, No. 1, 216-227 (2015). MSC: 90C27 90C90 90C60 PDF BibTeX XML Cite \textit{C. Peng} et al., J. Comb. Optim. 29, No. 1, 216--227 (2015; Zbl 1328.90130) Full Text: DOI
Grigoriev, Dima; Podolskii, Vladimir V. Complexity of tropical and MIN-plus linear prevarieties. (English) Zbl 1326.15039 Comput. Complexity 24, No. 1, 31-64 (2015). Reviewer: Frank Uhlig (Auburn) MSC: 15A80 68Q17 91A43 PDF BibTeX XML Cite \textit{D. Grigoriev} and \textit{V. V. Podolskii}, Comput. Complexity 24, No. 1, 31--64 (2015; Zbl 1326.15039) Full Text: DOI arXiv
Panda, B. S.; Pradhan, D. A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. (English) Zbl 1326.05111 Discrete Math. Algorithms Appl. 7, No. 2, Article ID 1550020, 21 p. (2015). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{D. Pradhan}, Discrete Math. Algorithms Appl. 7, No. 2, Article ID 1550020, 21 p. (2015; Zbl 1326.05111) Full Text: DOI
Shobaki, Ghassan; Jamal, Jafar An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers. (English) Zbl 1325.90078 Comput. Optim. Appl. 61, No. 2, 343-372 (2015). MSC: 90C27 90C57 90C90 PDF BibTeX XML Cite \textit{G. Shobaki} and \textit{J. Jamal}, Comput. Optim. Appl. 61, No. 2, 343--372 (2015; Zbl 1325.90078) Full Text: DOI
Zhu, Enqiang; Li, Zepeng; Shao, Zehui; Xu, Jin; Liu, Chanjuan Tree-core and tree-coritivity of graphs. (English) Zbl 1329.05068 Inf. Process. Lett. 115, No. 10, 754-759 (2015). MSC: 05C05 05C40 68Q17 PDF BibTeX XML Cite \textit{E. Zhu} et al., Inf. Process. Lett. 115, No. 10, 754--759 (2015; Zbl 1329.05068) Full Text: DOI
Montgomery, Richard Almost all friendly matrices have many obstructions. (English) Zbl 1311.05165 SIAM J. Discrete Math. 29, No. 1, 421-430 (2015). MSC: 05C70 05C15 68R10 68Q17 PDF BibTeX XML Cite \textit{R. Montgomery}, SIAM J. Discrete Math. 29, No. 1, 421--430 (2015; Zbl 1311.05165) Full Text: DOI arXiv
Liu, Ching-Hao; Poon, Sheung-Hung; Lin, Jin-Yong Independent dominating set problem revisited. (English) Zbl 1303.68073 Theor. Comput. Sci. 562, 1-22 (2015). MSC: 68Q25 05C69 68Q17 68W25 PDF BibTeX XML Cite \textit{C.-H. Liu} et al., Theor. Comput. Sci. 562, 1--22 (2015; Zbl 1303.68073) Full Text: DOI
Wang, Zhaocai; Tan, Jian; Huang, Dongmei; Ren, Yingchao; Ji, Zuwen A biological algorithm to solve the assignment problem based on DNA molecules computation. (English) Zbl 1335.90053 Appl. Math. Comput. 244, 183-190 (2014). MSC: 90B80 90C59 92-08 PDF BibTeX XML Cite \textit{Z. Wang} et al., Appl. Math. Comput. 244, 183--190 (2014; Zbl 1335.90053) Full Text: DOI
Wang, Jianxin; Li, Wenjun; Li, Shaohua; Chen, Jianer On the parameterized vertex cover problem for graphs with perfect matching. (English) Zbl 1343.68122 Sci. China, Inf. Sci. 57, No. 7, Article ID 072107, 12 p. (2014). MSC: 68Q25 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{J. Wang} et al., Sci. China, Inf. Sci. 57, No. 7, Article ID 072107, 12 p. (2014; Zbl 1343.68122) Full Text: DOI
Kosheleva, Olga; Zakharevich, M.; Kreinovich, Vladik If many physicists are right and no physical theory is perfect, then by using physical observations, we can feasibly solve almost all instances of each NP-complete problem. (English) Zbl 1340.68041 Mat. Strukt. Model. 31, 4-17 (2014). MSC: 68Q17 68Q05 PDF BibTeX XML Cite \textit{O. Kosheleva} et al., Mat. Strukt. Model. 31, 4--17 (2014; Zbl 1340.68041) Full Text: Link
Szabó, Sándor; Zavalnij, Bogdán Coloring the edges of a directed graph. (English) Zbl 1320.05053 Indian J. Pure Appl. Math. 45, No. 2, 239-260 (2014). Reviewer: Marcin Anholcer (Poznan) MSC: 05C20 05C15 05C69 PDF BibTeX XML Cite \textit{S. Szabó} and \textit{B. Zavalnij}, Indian J. Pure Appl. Math. 45, No. 2, 239--260 (2014; Zbl 1320.05053) Full Text: DOI
Pinker, Edieal; Szmerekovsky, Joseph; Tilson, Vera On the complexity of project scheduling to minimize exposed time. (English) Zbl 1304.90101 Eur. J. Oper. Res. 237, No. 2, 448-453 (2014). MSC: 90B35 90C60 PDF BibTeX XML Cite \textit{E. Pinker} et al., Eur. J. Oper. Res. 237, No. 2, 448--453 (2014; Zbl 1304.90101) Full Text: DOI
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen Stable marriage with general preferences. Extended abstract. (English) Zbl 1403.91258 Lavi, Ron (ed.), Algorithmic game theory. 7th international symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44802-1/pbk). Lecture Notes in Computer Science 8768, 25-36 (2014). MSC: 91B68 91B08 90C05 68Q25 91-04 PDF BibTeX XML Cite \textit{L. Farczadi} et al., Lect. Notes Comput. Sci. 8768, 25--36 (2014; Zbl 1403.91258) Full Text: DOI
Lau, Gee-Choon; Lee, Sin-Min; Schaffer, Karl; Tong, Siu-Ming; Lui, Samantha On \(k\)-step Hamiltonian graphs. (English) Zbl 1305.05123 J. Comb. Math. Comb. Comput. 90, 145-158 (2014). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C78 05C25 05D15 68Q17 PDF BibTeX XML Cite \textit{G.-C. Lau} et al., J. Comb. Math. Comb. Comput. 90, 145--158 (2014; Zbl 1305.05123)
Donets, G. A.; Sergienko, I. V. A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems. (English. Russian original) Zbl 1298.90083 Cybern. Syst. Anal. 50, No. 1, 1-7 (2014); translation from Kibern. Sist. Anal. 2014, No. 1, 3-10 (2014). MSC: 90C27 68Q17 PDF BibTeX XML Cite \textit{G. A. Donets} and \textit{I. V. Sergienko}, Cybern. Syst. Anal. 50, No. 1, 1--7 (2014; Zbl 1298.90083); translation from Kibern. Sist. Anal. 2014, No. 1, 3--10 (2014) Full Text: DOI
Wang, Chaoyi; Chen, Hao; Lei, Zihan; Tang, Ziyang; Liu, Tian; Xu, Ke Tree convex bipartite graphs: NP-complete domination, Hamiltonicity and treewidth. (English) Zbl 1407.68198 Chen, Jianer (ed.) et al., Frontiers in algorithmics. 8th international workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8497, 252-263 (2014). MSC: 68Q17 05C45 05C69 68Q25 PDF BibTeX XML Cite \textit{C. Wang} et al., Lect. Notes Comput. Sci. 8497, 252--263 (2014; Zbl 1407.68198) Full Text: DOI
Lan, James K.; Chang, Gerard Jennhwa On the algorithmic complexity of \(k\)-tuple total domination. (English) Zbl 1298.05254 Discrete Appl. Math. 174, 81-91 (2014). MSC: 05C69 05C85 05C35 68Q17 PDF BibTeX XML Cite \textit{J. K. Lan} and \textit{G. J. Chang}, Discrete Appl. Math. 174, 81--91 (2014; Zbl 1298.05254) Full Text: DOI
Milanič, Martin; Rizzi, Romeo; Tomescu, Alexandru I. Set graphs. II. Complexity of set graph recognition and similar problems. (English) Zbl 1298.05146 Theor. Comput. Sci. 547, 70-81 (2014). MSC: 05C20 05C62 05C69 68Q17 68Q25 PDF BibTeX XML Cite \textit{M. Milanič} et al., Theor. Comput. Sci. 547, 70--81 (2014; Zbl 1298.05146) Full Text: DOI
Havet, Frédéric; King, Andrew D.; Liedloff, Mathieu; Todinca, Ioan (Circular) backbone colouring: forest backbones in planar graphs. (English) Zbl 1288.05059 Discrete Appl. Math. 169, 119-134 (2014). MSC: 05C10 05C15 05C35 68Q17 PDF BibTeX XML Cite \textit{F. Havet} et al., Discrete Appl. Math. 169, 119--134 (2014; Zbl 1288.05059) Full Text: DOI
Song, Tao; Macías-Ramos, Luis F.; Pan, Linqiang; Pérez-Jiménez, Mario J. Time-free solution to SAT problem using P systems with active membranes. (English) Zbl 1358.68103 Theor. Comput. Sci. 529, 61-68 (2014). MSC: 68Q05 68Q10 68Q17 68Q25 PDF BibTeX XML Cite \textit{T. Song} et al., Theor. Comput. Sci. 529, 61--68 (2014; Zbl 1358.68103) Full Text: DOI
Badekha, I. A. Edge clique coverings of graphs. (Russian. English summary) Zbl 07310192 Prikl. Diskretn. Mat. 2013, No. 1(19), 69-83 (2013). MSC: 05 68 PDF BibTeX XML Cite \textit{I. A. Badekha}, Prikl. Diskretn. Mat. 2013, No. 1(19), 69--83 (2013; Zbl 07310192) Full Text: MNR
Al Badawi, Ahmad; Shatnawi, Ali Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization. (English) Zbl 1348.68022 Comput. Oper. Res. 40, No. 10, 2322-2328 (2013). MSC: 68M20 90B35 90C27 90C59 PDF BibTeX XML Cite \textit{A. Al Badawi} and \textit{A. Shatnawi}, Comput. Oper. Res. 40, No. 10, 2322--2328 (2013; Zbl 1348.68022) Full Text: DOI
Abdullah, Herish O.; Eftekhari, Mohammad Cryptanalysis and improvements on some graph-based authentication schemes. (English) Zbl 1348.94027 J. Discrete Math. Sci. Cryptography 16, No. 4-5, 297-306 (2013). MSC: 94A60 PDF BibTeX XML Cite \textit{H. O. Abdullah} and \textit{M. Eftekhari}, J. Discrete Math. Sci. Cryptography 16, No. 4--5, 297--306 (2013; Zbl 1348.94027) Full Text: DOI
Khachai, M. Yu.; Poberii, M. I. The computational complexity and approximability of a series of geometric covering problems. (English. Russian original) Zbl 1317.68075 Proc. Steklov Inst. Math. 283, Suppl. 1, S64-S77 (2013); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 18, No. 3, 247-260 (2012). MSC: 68Q25 68Q17 68U05 PDF BibTeX XML Cite \textit{M. Yu. Khachai} and \textit{M. I. Poberii}, Proc. Steklov Inst. Math. 283, S64--S77 (2013; Zbl 1317.68075); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 18, No. 3, 247--260 (2012) Full Text: DOI
Mertzios, George B.; Spirakis, Paul G. Algorithms and almost tight results for 3-colorability of small diameter graphs. (English) Zbl 1303.68074 van Emde Boas, Peter (ed.) et al., SOFSEM 2013: theory and practice of computer science. 39th international conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 26–31, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-35842-5/pbk). Lecture Notes in Computer Science 7741, 332-343 (2013). MSC: 68Q25 05C15 05C85 68Q17 PDF BibTeX XML Cite \textit{G. B. Mertzios} and \textit{P. G. Spirakis}, Lect. Notes Comput. Sci. 7741, 332--343 (2013; Zbl 1303.68074) Full Text: DOI arXiv
Lan, James K.; Chang, Gerard Jennhwa Algorithmic aspects of the \(k\)-domination problem in graphs. (English) Zbl 1287.05103 Discrete Appl. Math. 161, No. 10-11, 1513-1520 (2013). MSC: 05C69 05C05 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. K. Lan} and \textit{G. J. Chang}, Discrete Appl. Math. 161, No. 10--11, 1513--1520 (2013; Zbl 1287.05103) Full Text: DOI
Jennhwa Chang, Gerard; Chang, Chan-Wei; Kuo, David; Poon, Sheung-Hung Algorithmic aspect of stratified domination in graphs. (English) Zbl 1284.68282 Inf. Process. Lett. 113, No. 22-24, 861-865 (2013). MSC: 68Q17 05C69 05C85 05C15 05C10 PDF BibTeX XML Cite \textit{G. Jennhwa Chang} et al., Inf. Process. Lett. 113, No. 22--24, 861--865 (2013; Zbl 1284.68282) Full Text: DOI
Schmid, Markus L. A note on the complexity of matching patterns with variables. (English) Zbl 1284.68284 Inf. Process. Lett. 113, No. 19-21, 729-733 (2013). MSC: 68Q17 68Q45 68R15 PDF BibTeX XML Cite \textit{M. L. Schmid}, Inf. Process. Lett. 113, No. 19--21, 729--733 (2013; Zbl 1284.68284) Full Text: DOI
Ren, Jianfeng; Du, Donglei; Xu, Dachuan The complexity of two supply chain scheduling problems. (English) Zbl 1285.90009 Inf. Process. Lett. 113, No. 17, 609-612 (2013). MSC: 90B35 68Q17 90C60 90B06 PDF BibTeX XML Cite \textit{J. Ren} et al., Inf. Process. Lett. 113, No. 17, 609--612 (2013; Zbl 1285.90009) Full Text: DOI
Keil, J. Mark; Pradhan, D. Computing a minimum outer-connected dominating set for the class of chordal graphs. (English) Zbl 1296.05188 Inf. Process. Lett. 113, No. 14-16, 552-561 (2013). MSC: 05C85 05C69 68Q17 68R10 PDF BibTeX XML Cite \textit{J. M. Keil} and \textit{D. Pradhan}, Inf. Process. Lett. 113, No. 14--16, 552--561 (2013; Zbl 1296.05188) Full Text: DOI
Szabó, Sándor Monotonic matrices and clique search in graphs. (English) Zbl 1289.94086 Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 41, 307-322 (2013). MSC: 94B60 90C27 05D99 PDF BibTeX XML Cite \textit{S. Szabó}, Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 41, 307--322 (2013; Zbl 1289.94086) Full Text: Link
de la Higuera, Colin; Janodet, Jean-Christophe; Samuel, Émilie; Damiand, Guillaume; Solnon, Christine Polynomial algorithms for open plane graph and subgraph isomorphisms. (English) Zbl 1301.05344 Theor. Comput. Sci. 498, 76-99 (2013). MSC: 05C85 05C10 68Q17 68Q25 PDF BibTeX XML Cite \textit{C. de la Higuera} et al., Theor. Comput. Sci. 498, 76--99 (2013; Zbl 1301.05344) Full Text: DOI
Chen, Lily; Li, Xueliang; Lian, Huishu Further hardness results on the rainbow vertex-connection number of graphs. (English) Zbl 1291.68174 Theor. Comput. Sci. 481, 18-23 (2013). MSC: 68Q17 05C15 05C40 PDF BibTeX XML Cite \textit{L. Chen} et al., Theor. Comput. Sci. 481, 18--23 (2013; Zbl 1291.68174) Full Text: DOI arXiv
Brimkov, Valentin E. Approximability issues of guarding a set of segments. (English) Zbl 1279.90141 Int. J. Comput. Math. 90, No. 8, 1653-1667 (2013). MSC: 90C27 68U05 05C35 05C85 05C62 PDF BibTeX XML Cite \textit{V. E. Brimkov}, Int. J. Comput. Math. 90, No. 8, 1653--1667 (2013; Zbl 1279.90141) Full Text: DOI
Ju, Wenqi; Fan, Chenglin; Luo, Jun; Zhu, Binhai; Daescu, Ovidiu On some geometric problems of color-spanning sets. (English) Zbl 1275.90080 J. Comb. Optim. 26, No. 2, 266-283 (2013). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{W. Ju} et al., J. Comb. Optim. 26, No. 2, 266--283 (2013; Zbl 1275.90080) Full Text: DOI
Peng, Chao; Zhou, Jie; Zhu, Binhai; Zhu, Hong The program download problem: complexity and algorithms. (English) Zbl 1382.68121 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 688-696 (2013). MSC: 68Q25 68Q17 68W25 PDF BibTeX XML Cite \textit{C. Peng} et al., Lect. Notes Comput. Sci. 7936, 688--696 (2013; Zbl 1382.68121) Full Text: DOI
Lan, James K.; Chang, Gerard Jennhwa On the mixed domination problem in graphs. (English) Zbl 1261.05079 Theor. Comput. Sci. 476, 84-93 (2013). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{J. K. Lan} and \textit{G. J. Chang}, Theor. Comput. Sci. 476, 84--93 (2013; Zbl 1261.05079) Full Text: DOI
Du, Ye On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix. (English) Zbl 1257.68072 Theor. Comput. Sci. 472, 104-109 (2013). MSC: 68Q17 91A05 PDF BibTeX XML Cite \textit{Y. Du}, Theor. Comput. Sci. 472, 104--109 (2013; Zbl 1257.68072) Full Text: DOI
Szabó, Sándor The complexity of an exotic edge coloring of graphs. (English) Zbl 1301.05140 Acta Univ. Sapientiae, Inform. 4, No. 2, 201-214 (2012). MSC: 05C15 68Q17 PDF BibTeX XML Cite \textit{S. Szabó}, Acta Univ. Sapientiae, Inform. 4, No. 2, 201--214 (2012; Zbl 1301.05140)