Rybalov, A. N. On generic NP-completeness of the problem of Boolean circuits satisfiability. (Russian. English summary) Zbl 07312008 Prikl. Diskretn. Mat. 2020, No. 47, 101-107 (2020). MSC: 68 03 PDF BibTeX XML Cite \textit{A. N. Rybalov}, Prikl. Diskretn. Mat. 2020, No. 47, 101--107 (2020; Zbl 07312008) Full Text: DOI MNR
Bornstein, Claudson F.; Golumbic, Martin Charles; Santos, Tanilson D.; Souza, Uéverton S.; Szwarcfiter, Jayme L. The complexity of Helly-\(B_1\) EPG graph recognition. (English) Zbl 07290411 Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 19, 24 p. (2020). MSC: 05C38 PDF BibTeX XML Cite \textit{C. F. Bornstein} et al., Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 19, 24 p. (2020; Zbl 07290411) Full Text: DOI
Cantone, Domenico; Maugeri, Pietro; Omodeo, Eugenio G. Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership. (English) Zbl 07285587 Theor. Comput. Sci. 848, 28-46 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{D. Cantone} et al., Theor. Comput. Sci. 848, 28--46 (2020; Zbl 07285587) Full Text: DOI
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I. Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters. (English. Russian original) Zbl 1451.62074 Comput. Math. Math. Phys. 60, No. 1, 163-170 (2020); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 1, 151-158 (2020). MSC: 62H30 68Q15 52C35 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Comput. Math. Math. Phys. 60, No. 1, 163--170 (2020; Zbl 1451.62074); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 1, 151--158 (2020) Full Text: DOI
Arul, Sharmila Mary; Umamageswari, R. M. On the achromatic number of certain distance graphs. (English) Zbl 1444.05052 Int. J. Math. Comput. Sci. 15, No. 4, 1187-1192 (2020). MSC: 05C15 05C85 68Q25 PDF BibTeX XML Cite \textit{S. M. Arul} and \textit{R. M. Umamageswari}, Int. J. Math. Comput. Sci. 15, No. 4, 1187--1192 (2020; Zbl 1444.05052) Full Text: Link
Verma, Shaily; Panda, B. S. Grundy coloring in some subclasses of bipartite graphs and their complements. (English) Zbl 07256106 Inf. Process. Lett. 163, Article ID 105999, 6 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{S. Verma} and \textit{B. S. Panda}, Inf. Process. Lett. 163, Article ID 105999, 6 p. (2020; Zbl 07256106) Full Text: DOI
Cameron, Rosalind A.; Horsley, Daniel Decompositions of complete multigraphs into stars of varying sizes. (English) Zbl 1448.05160 J. Comb. Theory, Ser. B 145, 32-64 (2020). Reviewer: William G. Brown (Montréal) MSC: 05C70 05C20 05C85 68Q17 PDF BibTeX XML Cite \textit{R. A. Cameron} and \textit{D. Horsley}, J. Comb. Theory, Ser. B 145, 32--64 (2020; Zbl 1448.05160) Full Text: DOI
Goles, Eric; Montealegre, Pedro The complexity of the asynchronous prediction of the majority automata. (English) Zbl 07248656 Inf. Comput. 274, Article ID 104537, 15 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{E. Goles} and \textit{P. Montealegre}, Inf. Comput. 274, Article ID 104537, 15 p. (2020; Zbl 07248656) Full Text: DOI
Ehounou, Wilfried; Barth, Dominique; de Moissac, Arnaud; Watel, Dimitri; Weisser, Marc-Antoine Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. (English) Zbl 1447.05069 J. Graph Algorithms Appl. 24, No. 3, 133-153 (2020). MSC: 05C12 05C35 05C82 05C85 05C90 05C20 PDF BibTeX XML Cite \textit{W. Ehounou} et al., J. Graph Algorithms Appl. 24, No. 3, 133--153 (2020; Zbl 1447.05069) Full Text: DOI
Zhang, Xiao; Poon, Sheung-Hung; Liu, Shengxin; Li, Minming; Lee, Victor C. S. Consistent dynamic map labeling with fairness and importance. (English) Zbl 07242733 Comput. Aided Geom. Des. 81, Article ID 101892, 17 p. (2020). MSC: 65D PDF BibTeX XML Cite \textit{X. Zhang} et al., Comput. Aided Geom. Des. 81, Article ID 101892, 17 p. (2020; Zbl 07242733) Full Text: DOI
Gritzmann, Peter; Langfeld, Barbara On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity. (English) Zbl 07242477 Discrete Comput. Geom. 64, No. 2, 290-303 (2020). MSC: 68R05 05C70 15B33 68Q17 68Q25 PDF BibTeX XML Cite \textit{P. Gritzmann} and \textit{B. Langfeld}, Discrete Comput. Geom. 64, No. 2, 290--303 (2020; Zbl 07242477) Full Text: DOI
Konstantinidis, Athanasios L.; Papadopoulos, Charis Maximizing the strong triadic closure in split graphs and proper interval graphs. (English) Zbl 1446.05080 Discrete Appl. Math. 285, 79-95 (2020). MSC: 05C78 05C75 05C85 68Q17 91D30 PDF BibTeX XML Cite \textit{A. L. Konstantinidis} and \textit{C. Papadopoulos}, Discrete Appl. Math. 285, 79--95 (2020; Zbl 1446.05080) Full Text: DOI
Klein, Rolf; Kübel, David; Langetepe, Elmar; Sack, Jörg-Rüdiger; Schwarzwald, Barbara A new model in firefighting theory. (English) Zbl 07223710 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39218-5/pbk; 978-3-030-39219-2/ebook). Lecture Notes in Computer Science 12016, 371-383 (2020). MSC: 68U05 05C85 68Q17 68Q25 68Q80 68R10 PDF BibTeX XML Cite \textit{R. Klein} et al., Lect. Notes Comput. Sci. 12016, 371--383 (2020; Zbl 07223710) Full Text: DOI
Pandey, Arti; Sharma, Gopika; Jain, Nivedit Maximum weighted edge biclique problem on bipartite graphs. (English) Zbl 07223690 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39218-5/pbk; 978-3-030-39219-2/ebook). Lecture Notes in Computer Science 12016, 116-128 (2020). MSC: 68R10 05C22 05C35 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Pandey} et al., Lect. Notes Comput. Sci. 12016, 116--128 (2020; Zbl 07223690) Full Text: DOI
Jiménez, Andrea; Schmidt, Tina Janne Deciding whether a grid is a topological subgraph of a planar graph is NP-complete. (English) Zbl 1443.05130 Discrete Math. 343, No. 9, Article ID 111952, 13 p. (2020). MSC: 05C60 05C10 68Q17 PDF BibTeX XML Cite \textit{A. Jiménez} and \textit{T. J. Schmidt}, Discrete Math. 343, No. 9, Article ID 111952, 13 p. (2020; Zbl 1443.05130) Full Text: DOI
Shyamalkumar, Nariankadu D.; Tao, Siyang On tail dependence matrices. The realization problem for parametric families. (English) Zbl 1445.62127 Extremes 23, No. 2, 245-285 (2020). Reviewer: Denis Sidorov (Irkutsk) MSC: 62H20 62H05 60G70 68Q17 62-08 PDF BibTeX XML Cite \textit{N. D. Shyamalkumar} and \textit{S. Tao}, Extremes 23, No. 2, 245--285 (2020; Zbl 1445.62127) Full Text: DOI
Feder, Tomás; Hell, Pavol Complexity of correspondence \(H\)-colourings. (English) Zbl 1440.05150 Discrete Appl. Math. 281, 235-245 (2020). MSC: 05C60 05C15 68Q17 PDF BibTeX XML Cite \textit{T. Feder} and \textit{P. Hell}, Discrete Appl. Math. 281, 235--245 (2020; Zbl 1440.05150) Full Text: DOI
Ducoffe, Guillaume; Marinescu-Ghemeci, Ruxandra; Popa, Alexandru On the (di)graphs with (directed) proper connection number two. (English) Zbl 1440.05104 Discrete Appl. Math. 281, 203-215 (2020). MSC: 05C20 05C15 05C40 68Q17 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., Discrete Appl. Math. 281, 203--215 (2020; Zbl 1440.05104) Full Text: DOI
Couto, Fernanda; Faria, Luerbio; Gravier, Sylvain; Klein, Sulamita; dos Santos, Vinicius F. Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs. (English) Zbl 1440.05149 Discrete Appl. Math. 281, 118-133 (2020). MSC: 05C60 68Q17 PDF BibTeX XML Cite \textit{F. Couto} et al., Discrete Appl. Math. 281, 118--133 (2020; Zbl 1440.05149) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1440.05158 Discrete Appl. Math. 281, 81-95 (2020). MSC: 05C69 68Q17 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 281, 81--95 (2020; Zbl 1440.05158) Full Text: DOI
Giaro, Krzysztof; Kubale, Marek A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\). (English) Zbl 1439.05086 Discuss. Math., Graph Theory 40, No. 3, 885-891 (2020). MSC: 05C15 05C85 PDF BibTeX XML Cite \textit{K. Giaro} and \textit{M. Kubale}, Discuss. Math., Graph Theory 40, No. 3, 885--891 (2020; Zbl 1439.05086) Full Text: DOI
Faragó, András; Xu, Rupei A new algorithm design technique for hard problems. (English) Zbl 1448.68464 Theor. Comput. Sci. 821, 45-56 (2020). Reviewer: Efstratios Rappos (Aubonne) MSC: 68W01 68Q17 68T20 68W40 PDF BibTeX XML Cite \textit{A. Faragó} and \textit{R. Xu}, Theor. Comput. Sci. 821, 45--56 (2020; Zbl 1448.68464) Full Text: DOI
Ducoffe, Guillaume; Legay, Sylvain; Nisse, Nicolas On the complexity of computing treebreadth. (English) Zbl 1433.68168 Algorithmica 82, No. 6, 1574-1600 (2020). MSC: 68Q25 05C70 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., Algorithmica 82, No. 6, 1574--1600 (2020; Zbl 1433.68168) Full Text: DOI
Akagi, Javier T.; Gaona, Carlos F.; Mendoza, Fabricio; Saikia, Manjil P.; Villagra, Marcos Hard and easy instances of L-tromino tilings. (English) Zbl 1433.68476 Theor. Comput. Sci. 815, 197-212 (2020). MSC: 68U05 05B50 52C20 68Q17 PDF BibTeX XML Cite \textit{J. T. Akagi} et al., Theor. Comput. Sci. 815, 197--212 (2020; Zbl 1433.68476) Full Text: DOI
Takenaga, Yasuhiko; Mishiba, Shohei; Sugiyama, Haruka Matchstick puzzles on a grid. (English) Zbl 1432.68184 Graphs Comb. 36, No. 2, 347-357 (2020). MSC: 68Q25 68Q17 68R05 PDF BibTeX XML Cite \textit{Y. Takenaga} et al., Graphs Comb. 36, No. 2, 347--357 (2020; Zbl 1432.68184) Full Text: DOI
de Castro, Natalia; Garrido-Vizuete, María A.; Robles, Rafael; Villar-Liñán, María Trinidad Contrast in greyscales of graphs. (English) Zbl 1437.05071 J. Comb. Optim. 39, No. 3, 874-898 (2020). MSC: 05C15 05C85 68Q17 90C47 PDF BibTeX XML Cite \textit{N. de Castro} et al., J. Comb. Optim. 39, No. 3, 874--898 (2020; Zbl 1437.05071) Full Text: DOI
Rosenke, Christian; Tredup, Ronny The complexity of synthesizing elementary net systems relative to natural parameters. (English) Zbl 1435.68214 J. Comput. Syst. Sci. 110, 37-54 (2020). MSC: 68Q85 68Q17 68Q27 PDF BibTeX XML Cite \textit{C. Rosenke} and \textit{R. Tredup}, J. Comput. Syst. Sci. 110, 37--54 (2020; Zbl 1435.68214) Full Text: DOI
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 PDF BibTeX XML Cite \textit{C. Papadopoulos} and \textit{S. Tzimas}, Theor. Comput. Sci. 814, 177--188 (2020; Zbl 1435.68244) Full Text: DOI
Kozachinskiy, Alexander Recognizing read-once functions from depth-three formulas. (English) Zbl 1434.68201 Theory Comput. Syst. 64, No. 1, 3-16 (2020). MSC: 68Q25 06E30 68Q17 PDF BibTeX XML Cite \textit{A. Kozachinskiy}, Theory Comput. Syst. 64, No. 1, 3--16 (2020; Zbl 1434.68201) Full Text: DOI
Narayanan, Lata; Wu, Kangkang How to choose friends strategically. (English) Zbl 1444.91177 Theor. Comput. Sci. 811, 99-111 (2020). MSC: 91D30 68Q25 PDF BibTeX XML Cite \textit{L. Narayanan} and \textit{K. Wu}, Theor. Comput. Sci. 811, 99--111 (2020; Zbl 1444.91177) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Lafond, Manuel; Narayanan, Lata; Rescigno, Adele A.; Vaccaro, Ugo; Wu, Kangkang Whom to befriend to influence people. (English) Zbl 1444.91174 Theor. Comput. Sci. 810, 26-42 (2020). MSC: 91D30 68Q17 68W40 PDF BibTeX XML Cite \textit{G. Cordasco} et al., Theor. Comput. Sci. 810, 26--42 (2020; Zbl 1444.91174) Full Text: DOI
Banerjee, Sumanta; Henning, Michael A.; Pradhan, D. Algorithmic results on double Roman domination in graphs. (English) Zbl 1434.05105 J. Comb. Optim. 39, No. 1, 90-114 (2020). MSC: 05C69 90C35 05C35 68Q17 PDF BibTeX XML Cite \textit{S. Banerjee} et al., J. Comb. Optim. 39, No. 1, 90--114 (2020; Zbl 1434.05105) Full Text: DOI
Ensign, Danielle; Neville, Scott; Paul, Arnab; Venkatasubramanian, Suresh The complexity of explaining neural networks through (group) invariants. (English) Zbl 1436.68320 Theor. Comput. Sci. 808, 74-85 (2020). MSC: 68T07 68Q17 PDF BibTeX XML Cite \textit{D. Ensign} et al., Theor. Comput. Sci. 808, 74--85 (2020; Zbl 1436.68320) Full Text: DOI
Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar Detecting a most closeness-central clique in complex networks. (English) Zbl 1431.90165 Eur. J. Oper. Res. 283, No. 2, 461-475 (2020). MSC: 90C35 90C11 90C57 PDF BibTeX XML Cite \textit{F. Nasirian} et al., Eur. J. Oper. Res. 283, No. 2, 461--475 (2020; Zbl 1431.90165) 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 PDF BibTeX XML Cite \textit{T. Fluschnik} et al., Theor. Comput. Sci. 806, 197--218 (2020; Zbl 1436.68234) Full Text: DOI
Durand de Gevigney, Olivier On Frank’s conjecture on \(k\)-connected orientations. (English) Zbl 1430.05065 J. Comb. Theory, Ser. B 141, 105-114 (2020). MSC: 05C40 68Q17 PDF BibTeX XML Cite \textit{O. Durand de Gevigney}, J. Comb. Theory, Ser. B 141, 105--114 (2020; Zbl 1430.05065) Full Text: DOI arXiv
Abu-Khzam, Faisal N.; Feghali, Carl; Heggernes, Pinar Partitioning a graph into degenerate subgraphs. (English) Zbl 1428.05241 Eur. J. Comb. 83, Article ID 103015, 12 p. (2020). MSC: 05C70 68Q25 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Eur. J. Comb. 83, Article ID 103015, 12 p. (2020; Zbl 1428.05241) Full Text: DOI arXiv
Pilz, Alexander; Seara, Carlos Convex quadrangulations of bichromatic point sets. (English) Zbl 07309472 Int. J. Comput. Geom. Appl. 29, No. 4, 289-299 (2019). MSC: 68U05 PDF BibTeX XML Cite \textit{A. Pilz} and \textit{C. Seara}, Int. J. Comput. Geom. Appl. 29, No. 4, 289--299 (2019; Zbl 07309472) Full Text: DOI
Cabarle, Francis George C.; de la Cruz, Ren Tristan A.; Cailipan, Dionne Peter P.; Zhang, Defu; Liu, Xiangrong; Zeng, Xiangxiang On solutions and representations of spiking neural P systems with rules on synapses. (English) Zbl 07306009 Inf. Sci. 501, 30-49 (2019). MSC: 68Q07 68Q17 PDF BibTeX XML Cite \textit{F. G. C. Cabarle} et al., Inf. Sci. 501, 30--49 (2019; Zbl 07306009) Full Text: DOI
Gavalec, Martin; Ponce, Daniela; Zimmermann, Karel Steady states in the scheduling of discrete-time systems. (English) Zbl 1443.90179 Inf. Sci. 481, 219-228 (2019). MSC: 90B35 PDF BibTeX XML Cite \textit{M. Gavalec} et al., Inf. Sci. 481, 219--228 (2019; Zbl 1443.90179) Full Text: DOI
Lin, Hao; Lin, Lan A combinatorial optimization approach for the competence set expansion problem. (English) Zbl 1449.90304 Chin. J. Eng. Math. 36, No. 5, 578-594 (2019). MSC: 90C27 90C57 90C59 PDF BibTeX XML Cite \textit{H. Lin} and \textit{L. Lin}, Chin. J. Eng. Math. 36, No. 5, 578--594 (2019; Zbl 1449.90304) Full Text: DOI
Paul, Subhabrata; Ranjan, Keshav On vertex-edge and independent vertex-edge domination. (English) Zbl 1441.05174 Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 437-448 (2019). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Paul} and \textit{K. Ranjan}, Lect. Notes Comput. Sci. 11949, 437--448 (2019; Zbl 1441.05174) Full Text: DOI
Pálvölgyi, Dömötör Complexity of domination in triangulated plane graphs. (English) Zbl 1439.05064 Acta Univ. Sapientiae, Inform. 11, No. 2, 174-183 (2019). MSC: 05C10 05C69 68Q17 PDF BibTeX XML Cite \textit{D. Pálvölgyi}, Acta Univ. Sapientiae, Inform. 11, No. 2, 174--183 (2019; Zbl 1439.05064) Full Text: DOI
Fujiyoshi, Akio; Průša, Daniel A simple extension to finite tree automata for defining sets of labeled, connected graphs. (English) Zbl 1434.68246 Hospodár, Michal (ed.) et al., Implementation and application of automata. 24th international conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11601, 121-132 (2019). MSC: 68Q45 68R10 92E10 PDF BibTeX XML Cite \textit{A. Fujiyoshi} and \textit{D. Průša}, Lect. Notes Comput. Sci. 11601, 121--132 (2019; Zbl 1434.68246) Full Text: DOI
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I. NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters. (English. Russian original) Zbl 1437.62232 Dokl. Math. 100, No. 2, 416-419 (2019); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 488, No. 1, 16-20 (2019). MSC: 62H30 68Q17 62R20 52C35 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Dokl. Math. 100, No. 2, 416--419 (2019; Zbl 1437.62232); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 488, No. 1, 16--20 (2019) Full Text: DOI
Khosravian Ghadikoalei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris Extension and its price for the Connected Vertex Cover problem. (English) Zbl 07173541 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 315-326 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{M. Khosravian Ghadikoalei} et al., Lect. Notes Comput. Sci. 11638, 315--326 (2019; Zbl 07173541) Full Text: DOI
Monniaux, David; Touzeau, Valentin On the complexity of cache analysis for different replacement policies. (English) Zbl 07165893 J. ACM 66, No. 6, Article No. 41, 22 p. (2019). MSC: 68 PDF BibTeX XML Cite \textit{D. Monniaux} and \textit{V. Touzeau}, J. ACM 66, No. 6, Article No. 41, 22 p. (2019; Zbl 07165893) Full Text: DOI
Malajovich, Gregorio; Shub, Mike A theory of NP-completeness and ill-conditioning for approximate real computations. (English) Zbl 07165879 J. ACM 66, No. 4, Article No. 27, 38 p. (2019). MSC: 68 PDF BibTeX XML Cite \textit{G. Malajovich} and \textit{M. Shub}, J. ACM 66, No. 4, Article No. 27, 38 p. (2019; Zbl 07165879) Full Text: DOI
Goaoc, Xavier; Paták, Pavel; Patáková, Zuzana; Tancer, Martin; Wagner, Uli Shellability is NP-complete. (English) Zbl 07165873 J. ACM 66, No. 3, Article No. 21, 18 p. (2019). MSC: 68 PDF BibTeX XML Cite \textit{X. Goaoc} et al., J. ACM 66, No. 3, Article No. 21, 18 p. (2019; Zbl 07165873) Full Text: DOI
Bienstock, Daniel; Verma, Abhinav Strong NP-hardness of AC power flows feasibility. (English) Zbl 07165832 Oper. Res. Lett. 47, No. 6, 494-501 (2019). MSC: 90 PDF BibTeX XML Cite \textit{D. Bienstock} and \textit{A. Verma}, Oper. Res. Lett. 47, No. 6, 494--501 (2019; Zbl 07165832) Full Text: DOI
Casel, Katrin; Fernau, Henning; Ghadikoalei, Mehdi Khosravian; Monnot, Jérôme; Sikora, Florian Extension of Vertex Cover and Independent Set in some classes of graphs. (English) Zbl 07163781 Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-17401-9/pbk; 978-3-030-17402-6/ebook). Lecture Notes in Computer Science 11485, 124-136 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{K. Casel} et al., Lect. Notes Comput. Sci. 11485, 124--136 (2019; Zbl 07163781) Full Text: DOI
Lam, Chi-Kit; Plaxton, C. Gregory On the existence of three-dimensional stable matchings with cyclic preferences. (English) Zbl 1431.91259 Fotakis, Dimitris (ed.) et al., Algorithmic game theory. 12th International symposium, SAGT 2019, Athens, Greece, September 30 – October 3, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11801, 329-342 (2019). MSC: 91B68 68Q25 PDF BibTeX XML Cite \textit{C.-K. Lam} and \textit{C. G. Plaxton}, Lect. Notes Comput. Sci. 11801, 329--342 (2019; Zbl 1431.91259) Full Text: DOI Link
Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian Extension of some edge graph problems: standard and parameterized complexity. (English) Zbl 1441.68170 Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 185-200 (2019). MSC: 68R10 68Q17 68Q27 PDF BibTeX XML Cite \textit{K. Casel} et al., Lect. Notes Comput. Sci. 11651, 185--200 (2019; Zbl 1441.68170) Full Text: DOI
Pal, Saikat; Pradhan, D. The strong domination problem in block graphs and proper interval graphs. (English) Zbl 1427.05167 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950063, 21 p. (2019). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Pal} and \textit{D. Pradhan}, Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950063, 21 p. (2019; Zbl 1427.05167) Full Text: DOI
Panda, B. S.; Verma, Shaily On partial Grundy coloring of bipartite graphs and chordal graphs. (English) Zbl 1428.05114 Discrete Appl. Math. 271, 171-183 (2019). MSC: 05C15 68Q25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{S. Verma}, Discrete Appl. Math. 271, 171--183 (2019; Zbl 1428.05114) Full Text: DOI
Brezovnik, Simon; Kraner Šumenjak, Tadeja Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs. (English) Zbl 1428.05293 Appl. Math. Comput. 349, 214-220 (2019). MSC: 05C85 05C69 05C35 PDF BibTeX XML Cite \textit{S. Brezovnik} and \textit{T. Kraner Šumenjak}, Appl. Math. Comput. 349, 214--220 (2019; Zbl 1428.05293) Full Text: DOI
Banerjee, S.; Mark Keil, J.; Pradhan, D. Perfect Roman domination in graphs. (English) Zbl 1435.05154 Theor. Comput. Sci. 796, 1-21 (2019). MSC: 05C69 05C85 68Q17 68W40 PDF BibTeX XML Cite \textit{S. Banerjee} et al., Theor. Comput. Sci. 796, 1--21 (2019; Zbl 1435.05154) Full Text: DOI
Ibarra, Oscar H.; McQuillan, Ian State grammars with stores. (English) Zbl 1435.68133 Theor. Comput. Sci. 798, 23-39 (2019). MSC: 68Q42 68Q25 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Theor. Comput. Sci. 798, 23--39 (2019; Zbl 1435.68133) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free bipartite graphs. (English) Zbl 1426.05125 Discrete Appl. Math. 270, 58-67 (2019). MSC: 05C69 68Q17 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 270, 58--67 (2019; Zbl 1426.05125) Full Text: DOI
Omer, Jérémy; Poss, Michael Time-dependent shortest paths with discounted waits. (English) Zbl 1423.90021 Networks 74, No. 3, 287-301 (2019). MSC: 90B06 90C39 PDF BibTeX XML Cite \textit{J. Omer} and \textit{M. Poss}, Networks 74, No. 3, 287--301 (2019; Zbl 1423.90021) Full Text: DOI
Allender, Eric; Ilango, Rahul; Vafa, Neekon The non-hardness of approximating circuit size. (English) Zbl 07121052 van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-19954-8/pbk; 978-3-030-19955-5/ebook). Lecture Notes in Computer Science 11532, 13-24 (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Allender} et al., Lect. Notes Comput. Sci. 11532, 13--24 (2019; Zbl 07121052) Full Text: DOI
González Hermosillo de la Maza, Sebastián; Hernández-Cruz, César On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs. (English) Zbl 1431.68094 Theor. Comput. Sci. 795, 9-19 (2019). MSC: 68R10 68Q17 PDF BibTeX XML Cite \textit{S. González Hermosillo de la Maza} and \textit{C. Hernández-Cruz}, Theor. Comput. Sci. 795, 9--19 (2019; Zbl 1431.68094) Full Text: DOI
Akagi, Javier T.; Gaona, Carlos F.; Mendoza, Fabricio; Saikia, Manjil P.; Villagra, Marcos Hard and easy instances of L-tromino tilings. (English) Zbl 1434.68593 Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 82-95 (2019). MSC: 68U05 05B45 05B50 52C20 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. T. Akagi} et al., Lect. Notes Comput. Sci. 11355, 82--95 (2019; Zbl 1434.68593) Full Text: DOI arXiv
Bradshaw, Peter A. Triangle packing on tripartite graphs is hard. (English) Zbl 1422.05084 Undergrad. Math J. 20, No. 1, Article 7, 20 p. (2019). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{P. A. Bradshaw}, Undergrad. Math J. 20, No. 1, Article 7, 20 p. (2019; Zbl 1422.05084) Full Text: Link
Panda, B. S.; Chaudhary, Juhi Dominating induced matching in some subclasses of bipartite graphs. (English) Zbl 07115811 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-11508-1/pbk; 978-3-030-11509-8/ebook). Lecture Notes in Computer Science 11394, 138-149 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Lect. Notes Comput. Sci. 11394, 138--149 (2019; Zbl 07115811) Full Text: DOI
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P. The induced star partition of graphs. (English) Zbl 07115801 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-11508-1/pbk; 978-3-030-11509-8/ebook). Lecture Notes in Computer Science 11394, 16-28 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{M. A. Shalu} et al., Lect. Notes Comput. Sci. 11394, 16--28 (2019; Zbl 07115801) Full Text: DOI
Bereg, Sergey; Ma, Feifei; Wang, Wencheng; Zhang, Jian; Zhu, Binhai On some matching problems under the color-spanning model. (English) Zbl 1429.68318 Theor. Comput. Sci. 786, 26-31 (2019). MSC: 68U05 68Q17 68Q27 68R10 PDF BibTeX XML Cite \textit{S. Bereg} et al., Theor. Comput. Sci. 786, 26--31 (2019; Zbl 1429.68318) Full Text: DOI
Miyazaki, Shuichi; Okamoto, Kazuya Jointly stable matchings. (English) Zbl 1425.90099 J. Comb. Optim. 38, No. 2, 646-665 (2019). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{S. Miyazaki} and \textit{K. Okamoto}, J. Comb. Optim. 38, No. 2, 646--665 (2019; Zbl 1425.90099) Full Text: DOI
Donovan, Zola; Gutin, Gregory; Mkrtchyan, Vahan; Subramani, K. Clustering without replication in combinatorial circuits. (English) Zbl 1426.90214 J. Comb. Optim. 38, No. 2, 481-501 (2019). MSC: 90C27 90C90 PDF BibTeX XML Cite \textit{Z. Donovan} et al., J. Comb. Optim. 38, No. 2, 481--501 (2019; Zbl 1426.90214) Full Text: DOI
Brimkov, Boris; Mikesell, Derek; Smith, Logan Connected power domination in graphs. (English) Zbl 1420.05127 J. Comb. Optim. 38, No. 1, 292-315 (2019). MSC: 05C69 05C57 94C15 05C82 PDF BibTeX XML Cite \textit{B. Brimkov} et al., J. Comb. Optim. 38, No. 1, 292--315 (2019; Zbl 1420.05127) Full Text: DOI arXiv
Li, Shasha; Shi, Yongtang; Tu, Jianhua; Zhao, Yan On the complexity of \(k\)-rainbow cycle colouring problems. (English) Zbl 1414.05121 Discrete Appl. Math. 264, 125-133 (2019). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{S. Li} et al., Discrete Appl. Math. 264, 125--133 (2019; Zbl 1414.05121) Full Text: DOI arXiv
Shao, Zehui; Li, Zepeng; Peperko, Aljoša; Wan, Jiafu; Žerovnik, Janez Independent rainbow domination of graphs. (English) Zbl 1414.05232 Bull. Malays. Math. Sci. Soc. (2) 42, No. 2, 417-435 (2019). MSC: 05C69 05C15 05C76 05C85 68Q17 PDF BibTeX XML Cite \textit{Z. Shao} et al., Bull. Malays. Math. Sci. Soc. (2) 42, No. 2, 417--435 (2019; Zbl 1414.05232) Full Text: DOI
Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya On structural parameterizations of firefighting. (English) Zbl 1423.68207 Theor. Comput. Sci. 782, 79-90 (2019). MSC: 68Q25 68Q17 68R10 PDF BibTeX XML Cite \textit{B. Das} et al., Theor. Comput. Sci. 782, 79--90 (2019; Zbl 1423.68207) Full Text: DOI
Bentz, Cédric Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees. (English) Zbl 1423.68201 Theor. Comput. Sci. 782, 11-29 (2019). MSC: 68Q25 05C15 68Q17 PDF BibTeX XML Cite \textit{C. Bentz}, Theor. Comput. Sci. 782, 11--29 (2019; Zbl 1423.68201) Full Text: DOI
Bang-Jensen, Jørgen; Bessy, Stéphane Degree-constrained 2-partitions of graphs. (English) Zbl 1427.68226 Theor. Comput. Sci. 776, 64-74 (2019). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C70 68Q25 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{S. Bessy}, Theor. Comput. Sci. 776, 64--74 (2019; Zbl 1427.68226) Full Text: DOI
Genc, Begum; Siala, Mohamed; Simonin, Gilles; O’Sullivan, Barry Complexity study for the robust stable marriage problem. (English) Zbl 1425.91344 Theor. Comput. Sci. 775, 76-92 (2019). MSC: 91B68 68Q17 68Q25 PDF BibTeX XML Cite \textit{B. Genc} et al., Theor. Comput. Sci. 775, 76--92 (2019; Zbl 1425.91344) Full Text: DOI
Cseh, Ágnes; Matuschke, Jannik New and simple algorithms for stable flow problems. (English) Zbl 1426.91172 Algorithmica 81, No. 6, 2557-2591 (2019). MSC: 91B68 05C90 68Q17 PDF BibTeX XML Cite \textit{Á. Cseh} and \textit{J. Matuschke}, Algorithmica 81, No. 6, 2557--2591 (2019; Zbl 1426.91172) Full Text: DOI
Rusu, Irena Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT. (English) Zbl 1421.68088 Theor. Comput. Sci. 771, 23-38 (2019). MSC: 68Q25 68Q17 68R10 PDF BibTeX XML Cite \textit{I. Rusu}, Theor. Comput. Sci. 771, 23--38 (2019; Zbl 1421.68088) Full Text: DOI
van Aardt, Susan A.; Burger, Alewyn P.; Frick, Marietjie; Thomassen, Carsten; de Wet, Johan P. Hamilton cycles in sparse locally connected graphs. (English) Zbl 1406.05060 Discrete Appl. Math. 257, 276-288 (2019). MSC: 05C45 05C42 05C40 PDF BibTeX XML Cite \textit{S. A. van Aardt} et al., Discrete Appl. Math. 257, 276--288 (2019; Zbl 1406.05060) Full Text: DOI
Davoodi, Mansoor \(k\)-balanced center location problem: a new multi-objective facility location problem. (English) Zbl 07024940 Comput. Oper. Res. 105, 68-84 (2019). MSC: 90B PDF BibTeX XML Cite \textit{M. Davoodi}, Comput. Oper. Res. 105, 68--84 (2019; Zbl 07024940) Full Text: DOI
Pandey, Arti; Panda, B. S. Domination in some subclasses of bipartite graphs. (English) Zbl 1401.05222 Discrete Appl. Math. 252, 51-66 (2019). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{A. Pandey} and \textit{B. S. Panda}, Discrete Appl. Math. 252, 51--66 (2019; Zbl 1401.05222) Full Text: DOI
Lawson, Mark Verus A first course in logic. (English) Zbl 06921774 Boca Raton, FL: CRC Press (ISBN 978-0-8153-8665-0/pbk; 978-0-8153-8664-3/hbk; 978-1-351-17537-1/pbk). xv, 233 p. (2019). Reviewer: Éric Martin (Sydney) MSC: 03-01 03B05 03B10 03G05 PDF BibTeX XML Cite \textit{M. V. Lawson}, A first course in logic. Boca Raton, FL: CRC Press (2019; Zbl 06921774) Full Text: Link
Nikitin, A. Y.; Rybalov, A. N. On complexity of the satisfiability problem of systems over finite posets. (Russian. English summary) Zbl 07311610 Prikl. Diskretn. Mat. 2018, No. 39, 94-98 (2018). MSC: 68 65 PDF BibTeX XML Cite \textit{A. Y. Nikitin} and \textit{A. N. Rybalov}, Prikl. Diskretn. Mat. 2018, No. 39, 94--98 (2018; Zbl 07311610) Full Text: DOI MNR
Sholomov, L. A. On an invariant for the problem of underdetermined data decomposing. (Russian. English summary) Zbl 07311604 Prikl. Diskretn. Mat. 2018, No. 39, 13-32 (2018). MSC: 94 68 PDF BibTeX XML Cite \textit{L. A. Sholomov}, Prikl. Diskretn. Mat. 2018, No. 39, 13--32 (2018; Zbl 07311604) Full Text: DOI MNR
Tayyebi, Javad; Aman, Massoud Inverse eccentric vertex problem on trees. (English) Zbl 07305743 Pac. J. Optim. 14, No. 2, 245-260 (2018). MSC: 90C27 05C85 90C60 PDF BibTeX XML Cite \textit{J. Tayyebi} and \textit{M. Aman}, Pac. J. Optim. 14, No. 2, 245--260 (2018; Zbl 07305743) Full Text: Link
Hladik, Milan The worst case finite optimal value in interval linear programming. (English) Zbl 07298416 Croat. Oper. Res. Rev. (CRORR) 9, No. 2, 245-254 (2018). MSC: 90C05 90C31 PDF BibTeX XML Cite \textit{M. Hladik}, Croat. Oper. Res. Rev. (CRORR) 9, No. 2, 245--254 (2018; Zbl 07298416) Full Text: DOI Link
Agrawal, Kunal; Baruah, Sanjoy Intractability issues in mixed-criticality scheduling. (English) Zbl 07286768 Altmeyer, Sebastian (ed.), 30th Euromicro conference on real-time systems, ECRTS 2018, July 3rd–6th, 2018, Barcelona, Spain. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-075-0). LIPIcs – Leibniz International Proceedings in Informatics 106, Article 11, 21 p. (2018). MSC: 68M20 PDF BibTeX XML Cite \textit{K. Agrawal} and \textit{S. Baruah}, LIPIcs -- Leibniz Int. Proc. Inform. 106, Article 11, 21 p. (2018; Zbl 07286768) Full Text: DOI
Çağirici, Onur; Hliněný, Petr; Roy, Bodhayan On colourability of polygon visibility graphs. (English) Zbl 07278093 Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-055-2). LIPIcs – Leibniz International Proceedings in Informatics 93, Article 21, 14 p. (2018). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{O. Çağirici} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 21, 14 p. (2018; Zbl 07278093) Full Text: DOI
Goaoc, Xavier; Paták, Pavel; Patáková, Zuzana; Tancer, Martin; Wagner, Uli Shellability is NP-complete. (English) Zbl 07236445 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 41, 15 p. (2018). MSC: 68U05 PDF BibTeX XML Cite \textit{X. Goaoc} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 41, 15 p. (2018; Zbl 07236445) Full Text: DOI
Hitchcock, John M.; Shafei, Hadi Nonuniform reductions and NP-completeness. (English) Zbl 07228431 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 40, 13 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. M. Hitchcock} and \textit{H. Shafei}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 40, 13 p. (2018; Zbl 07228431) Full Text: DOI
Punitha M., Joice; Rajakumari, S. Skew chromatic index of 2-rooted sibling trees and cyclic snake graphs. (English) Zbl 1428.05115 South East Asian J. Math. Math. Sci. 14, No. 3, 89-98 (2018). MSC: 05C15 05C05 05C85 PDF BibTeX XML Cite \textit{J. Punitha M.} and \textit{S. Rajakumari}, South East Asian J. Math. Math. Sci. 14, No. 3, 89--98 (2018; Zbl 1428.05115)
Sakalauskas, Eligijus; Mihalkovich, Aleksejus MPF problem over modified medial semigroup is NP-complete. (English) Zbl 1423.94099 Symmetry 10, No. 11, Paper No. 571, 13 p. (2018). MSC: 94A60 68Q15 PDF BibTeX XML Cite \textit{E. Sakalauskas} and \textit{A. Mihalkovich}, Symmetry 10, No. 11, Paper No. 571, 13 p. (2018; Zbl 1423.94099) Full Text: DOI
Bapat, Ravindra B.; Fujita, Shinya; Legay, Sylvain; Manoussakis, Yannis; Matsui, Yasuko; Sakuma, Tadashi; Tuza, Zsolt Safe sets, network majority on weighted trees. (English) Zbl 1418.90051 Networks 71, No. 1, 81-92 (2018). MSC: 90B10 90C35 90C39 PDF BibTeX XML Cite \textit{R. B. Bapat} et al., Networks 71, No. 1, 81--92 (2018; Zbl 1418.90051) Full Text: DOI
Nouri-Baygi, Mostafa The computational complexity of and approximation algorithms for variants of the component selection problem. (English) Zbl 1415.68112 Int. J. Found. Comput. Sci. 29, No. 7, 1231-1245 (2018). MSC: 68Q25 68W25 PDF BibTeX XML Cite \textit{M. Nouri-Baygi}, Int. J. Found. Comput. Sci. 29, No. 7, 1231--1245 (2018; Zbl 1415.68112) Full Text: DOI
Filar, Jerzy A.; Haythorpe, Michael; Taylor, Richard Linearly-growing reductions of Karp’s 21 NP-complete problems. (English) Zbl 1416.68078 Numer. Algebra Control Optim. 8, No. 1, 1-16 (2018). Reviewer: Gregory Loren McColm (Tampa) MSC: 68Q17 68Q15 90C10 PDF BibTeX XML Cite \textit{J. A. Filar} et al., Numer. Algebra Control Optim. 8, No. 1, 1--16 (2018; Zbl 1416.68078) Full Text: DOI arXiv
Cohen, Nathann; Havet, Frédéric; Mazauric, Dorian; Sau, Ignasi; Watrigant, Rémi Complexity dichotomies for the Minimum \(\mathcal{F}\)-Overlay problem. (English) Zbl 1410.68161 J. Discrete Algorithms 52-53, 133-142 (2018). MSC: 68Q25 05C60 05C65 68Q17 68R10 PDF BibTeX XML Cite \textit{N. Cohen} et al., J. Discrete Algorithms 52--53, 133--142 (2018; Zbl 1410.68161) Full Text: DOI
Kelarev, Andrei; Ryan, Joe; Rylands, Leanne; Seberry, Jennifer; Yi, Xun Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller. (English) Zbl 1410.68110 J. Discrete Algorithms 52-53, 112-121 (2018). MSC: 68P15 68Q17 68Q25 68W05 PDF BibTeX XML Cite \textit{A. Kelarev} et al., J. Discrete Algorithms 52--53, 112--121 (2018; Zbl 1410.68110) Full Text: DOI
van Iersel, Leo; Kelk, Steven; Stamoulis, Georgios; Stougie, Leen; Boes, Olivier On unrooted and root-uncertain variants of several well-known phylogenetic network problems. (English) Zbl 1410.68178 Algorithmica 80, No. 11, 2993-3022 (2018). MSC: 68Q25 68Q17 92D15 PDF BibTeX XML Cite \textit{L. van Iersel} et al., Algorithmica 80, No. 11, 2993--3022 (2018; Zbl 1410.68178) Full Text: DOI
Pálvölgyi, Dömötör Weak embeddings of posets to the Boolean lattice. (English) Zbl 1401.05292 Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 7, 10 p. (2018). MSC: 05D05 06A07 68Q17 PDF BibTeX XML Cite \textit{D. Pálvölgyi}, Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 7, 10 p. (2018; Zbl 1401.05292) Full Text: Link arXiv
Schuh, Bernd R. Exact satisfiability of linear CNF formulas. (English) Zbl 1403.68084 Discrete Appl. Math. 251, 1-4 (2018). MSC: 68Q25 68Q17 PDF BibTeX XML Cite \textit{B. R. Schuh}, Discrete Appl. Math. 251, 1--4 (2018; Zbl 1403.68084) Full Text: DOI