Bhangale, Amey; Khot, Subhash UG-hardness to NP-hardness by losing half. (English) Zbl 07528581 Theory Comput. 18, Paper No. 5, 28 p. (2022). MSC: 68Q17 68Qxx PDF BibTeX XML Cite \textit{A. Bhangale} and \textit{S. Khot}, Theory Comput. 18, Paper No. 5, 28 p. (2022; Zbl 07528581) Full Text: DOI OpenURL
Madireddy, Raghunath Reddy; Mudgal, Apurva Weighted geometric set cover with rectangles of bounded integer side lengths. (English) Zbl 07516295 Discrete Appl. Math. 315, 36-55 (2022). MSC: 68Qxx 68Uxx PDF BibTeX XML Cite \textit{R. R. Madireddy} and \textit{A. Mudgal}, Discrete Appl. Math. 315, 36--55 (2022; Zbl 07516295) Full Text: DOI OpenURL
Demange, Marc; Di Fonso, Alessia; Di Stefano, Gabriele; Vittorini, Pierpaolo A graph theoretical approach to the firebreak locating problem. (English) Zbl 07509397 Theor. Comput. Sci. 914, 47-72 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Demange} et al., Theor. Comput. Sci. 914, 47--72 (2022; Zbl 07509397) Full Text: DOI OpenURL
Horiyama, Takashi; Klute, Fabian; Korman, Matias; Parada, Irene; Uehara, Ryuhei; Yamanaka, Katsuhisa Efficient segment folding is hard. (English) Zbl 07505567 Comput. Geom. 104, Article ID 101860, 13 p. (2022). MSC: 68-XX 51-XX 52-XX PDF BibTeX XML Cite \textit{T. Horiyama} et al., Comput. Geom. 104, Article ID 101860, 13 p. (2022; Zbl 07505567) Full Text: DOI OpenURL
Altschuler, Jason M.; Boix-Adserà, Enric Wasserstein barycenters are NP-hard to compute. (English) Zbl 07493842 SIAM J. Math. Data Sci. 4, No. 1, 179-203 (2022). MSC: 68Q17 90C08 PDF BibTeX XML Cite \textit{J. M. Altschuler} and \textit{E. Boix-Adserà}, SIAM J. Math. Data Sci. 4, No. 1, 179--203 (2022; Zbl 07493842) Full Text: DOI arXiv OpenURL
Klages-Mundt, Ariah; Minca, Andreea Optimal intervention in economic networks using influence maximization methods. (English) Zbl 07493237 Eur. J. Oper. Res. 300, No. 3, 1136-1148 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Klages-Mundt} and \textit{A. Minca}, Eur. J. Oper. Res. 300, No. 3, 1136--1148 (2022; Zbl 07493237) Full Text: DOI arXiv OpenURL
Agnetis, Alessandro; Benini, Mario; Detti, Paolo; Hermans, Ben; Pranzo, Marco Replication and sequencing of unreliable jobs on parallel machines. (English) Zbl 07486444 Comput. Oper. Res. 139, Article ID 105634, 9 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Agnetis} et al., Comput. Oper. Res. 139, Article ID 105634, 9 p. (2022; Zbl 07486444) Full Text: DOI OpenURL
Jiang, Zhongyi; Chen, Fangfang; Zhang, Xiandong Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect. (English) Zbl 07473266 J. Comb. Optim. 43, No. 1, 116-139 (2022). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{Z. Jiang} et al., J. Comb. Optim. 43, No. 1, 116--139 (2022; Zbl 07473266) Full Text: DOI OpenURL
Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian On the complexity of solution extension of optimization problems. (English) Zbl 07467463 Theor. Comput. Sci. 904, 48-65 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Casel} et al., Theor. Comput. Sci. 904, 48--65 (2022; Zbl 07467463) Full Text: DOI arXiv OpenURL
Evans, William S.; Fleszar, Krzysztof; Kindermann, Philipp; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander Minimum rectilinear polygons for given angle sequences. (English) Zbl 07445255 Comput. Geom. 100, Article ID 101820, 39 p. (2022). MSC: 68Uxx 05Cxx 68Qxx PDF BibTeX XML Cite \textit{W. S. Evans} et al., Comput. Geom. 100, Article ID 101820, 39 p. (2022; Zbl 07445255) Full Text: DOI OpenURL
Maack, Nicolas; Molter, Hendrik; Niedermeier, Rolf; Renken, Malte On finding separators in temporal split and permutation graphs. (English) Zbl 07530247 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 385-398 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Maack} et al., Lect. Notes Comput. Sci. 12867, 385--398 (2021; Zbl 07530247) Full Text: DOI OpenURL
Antoniadis, Antonios; Capretto, Margarita; Chalermsook, Parinya; Damerius, Christoph; Kling, Peter; Nölke, Lukas; Acosta, Nidia Obscura; Spoerhase, Joachim On minimum generalized Manhattan connections. (English) Zbl 07498670 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, 85-100 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{A. Antoniadis} et al., Lect. Notes Comput. Sci. 12808, 85--100 (2021; Zbl 07498670) Full Text: DOI OpenURL
Akitaya, Hugo A.; Biniaz, Ahmad; Bose, Prosenjit; De Carufel, Jean-Lou; Maheshwari, Anil; da Silveira, Luís Fernando Schultz Xavier; Smid, Michiel The minimum moving spanning tree problem. (English) Zbl 07498665 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, 15-28 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{H. A. Akitaya} et al., Lect. Notes Comput. Sci. 12808, 15--28 (2021; Zbl 07498665) Full Text: DOI OpenURL
Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka Balanced connected graph partition. (English) Zbl 07497554 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, 487-499 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{S. Jana} et al., Lect. Notes Comput. Sci. 12601, 487--499 (2021; Zbl 07497554) Full Text: DOI OpenURL
Kononov, Alexander; Kovalenko, Yulia Minimizing total completion time in multiprocessor job systems with energy constraint. (English) Zbl 07495085 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 267-279 (2021). MSC: 90B35 68M20 68W25 PDF BibTeX XML Cite \textit{A. Kononov} and \textit{Y. Kovalenko}, Lect. Notes Comput. Sci. 12755, 267--279 (2021; Zbl 07495085) Full Text: DOI OpenURL
Chakraborty, Dibyayan; Chandran, L. Sunil; Padinhatteeri, Sajith; Pillai, Raji R. Algorithms and complexity of \(s\)-club cluster vertex deletion. (English) Zbl 07495020 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, 152-164 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{D. Chakraborty} et al., Lect. Notes Comput. Sci. 12757, 152--164 (2021; Zbl 07495020) Full Text: DOI OpenURL
Shenmaier, Vladimir Approximation and complexity of the capacitated geometric median problem. (English) Zbl 07493546 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 422-434 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{V. Shenmaier}, Lect. Notes Comput. Sci. 12730, 422--434 (2021; Zbl 07493546) Full Text: DOI OpenURL
Yang, Xianyan; Liu, Zhixue; Li, Feng; Xu, Zhou Integrated production and transportation scheduling with order-dependent inventory holding costs. (English) Zbl 07486266 Comput. Oper. Res. 136, Article ID 105477, 15 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{X. Yang} et al., Comput. Oper. Res. 136, Article ID 105477, 15 p. (2021; Zbl 07486266) Full Text: DOI OpenURL
Altschuler, Jason M.; Boix-Adserà, Enric Hardness results for multimarginal optimal transport problems. (English) Zbl 07458653 Discrete Optim. 42, Article ID 100669, 21 p. (2021). MSC: 90C05 90C08 68Q17 90Cxx PDF BibTeX XML Cite \textit{J. M. Altschuler} and \textit{E. Boix-Adserà}, Discrete Optim. 42, Article ID 100669, 21 p. (2021; Zbl 07458653) Full Text: DOI arXiv OpenURL
Zhang, Yuan; Yuan, Jinjiang A note on the complexity of two supply chain scheduling problems. (English) Zbl 1479.90108 J. Sched. 24, No. 4, 447-454 (2021). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{Y. Zhang} and \textit{J. Yuan}, J. Sched. 24, No. 4, 447--454 (2021; Zbl 1479.90108) Full Text: DOI OpenURL
Hladík, Milan Stability of the linear complementarity problem properties under interval uncertainty. (English) Zbl 07432783 CEJOR, Cent. Eur. J. Oper. Res. 29, No. 3, 875-889 (2021). MSC: 90Bxx 90C31 90C33 65G40 PDF BibTeX XML Cite \textit{M. Hladík}, CEJOR, Cent. Eur. J. Oper. Res. 29, No. 3, 875--889 (2021; Zbl 07432783) Full Text: DOI arXiv OpenURL
Aliabadi, Mohsen; Friedland, Shmuel On the complexity of finding tensor ranks. (English) Zbl 1476.13037 Commun. Appl. Math. Comput. 3, No. 2, 281-289 (2021). MSC: 13P15 15A03 15A69 65H10 68Q25 PDF BibTeX XML Cite \textit{M. Aliabadi} and \textit{S. Friedland}, Commun. Appl. Math. Comput. 3, No. 2, 281--289 (2021; Zbl 1476.13037) Full Text: DOI arXiv OpenURL
Chen, Lin; Sunny, Ahmed Imtiaz; Xu, Lei; Xu, Shouhuai; Gao, Zhimin; Lu, Yang; Shi, Weidong; Shah, Nolan Computational complexity characterization of protecting elections from bribery. (English) Zbl 07412749 Theor. Comput. Sci. 891, 189-209 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Chen} et al., Theor. Comput. Sci. 891, 189--209 (2021; Zbl 07412749) Full Text: DOI OpenURL
Abu-Affash, A. Karim; Carmi, Paz; Katz, Matthew J. Minimizing total interference in asymmetric sensor networks. (English) Zbl 07407477 Theor. Comput. Sci. 889, 171-181 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. K. Abu-Affash} et al., Theor. Comput. Sci. 889, 171--181 (2021; Zbl 07407477) Full Text: DOI OpenURL
He, Xiaozhou; Lai, Wenfeng; Zhu, Binhai; Zou, Peng Dispersing and grouping points on planar segments. (English) Zbl 07407465 Theor. Comput. Sci. 886, 169-177 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{X. He} et al., Theor. Comput. Sci. 886, 169--177 (2021; Zbl 07407465) Full Text: DOI OpenURL
Hladík, Milan; Hartman, David; Zamani, Moslem Maximization of a PSD quadratic form and factorization. (English) Zbl 1477.90071 Optim. Lett. 15, No. 7, 2515-2528 (2021). MSC: 90C26 PDF BibTeX XML Cite \textit{M. Hladík} et al., Optim. Lett. 15, No. 7, 2515--2528 (2021; Zbl 1477.90071) Full Text: DOI OpenURL
Chugg, Ben; Evans, William S.; Wong, Kelvin Simultaneous visibility representations of undirected pairs of graphs. (English) Zbl 07396873 Comput. Geom. 98, Article ID 101788, 13 p. (2021). MSC: 68Qxx 68Uxx 68Rxx 05Cxx PDF BibTeX XML Cite \textit{B. Chugg} et al., Comput. Geom. 98, Article ID 101788, 13 p. (2021; Zbl 07396873) Full Text: DOI arXiv OpenURL
Kuperberg, Greg; Samperton, Eric Coloring invariants of knots and links are often intractable. (English) Zbl 07394053 Algebr. Geom. Topol. 21, No. 3, 1479-1510 (2021). MSC: 20F10 57K10 68Q17 PDF BibTeX XML Cite \textit{G. Kuperberg} and \textit{E. Samperton}, Algebr. Geom. Topol. 21, No. 3, 1479--1510 (2021; Zbl 07394053) Full Text: DOI arXiv OpenURL
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I. Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability. (English. Russian original) Zbl 07377486 Proc. Steklov Inst. Math. 313, Suppl. 1, S117-S124 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69-78 (2019). MSC: 68W25 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Proc. Steklov Inst. Math. 313, S117--S124 (2021; Zbl 07377486); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69--78 (2019) Full Text: DOI OpenURL
Mertzios, George B.; Molter, Hendrik; Zamaraev, Viktor Sliding window temporal graph coloring. (English) Zbl 1473.68123 J. Comput. Syst. Sci. 120, 97-115 (2021). MSC: 68R10 05C15 68Q17 68Q27 68W05 68W25 PDF BibTeX XML Cite \textit{G. B. Mertzios} et al., J. Comput. Syst. Sci. 120, 97--115 (2021; Zbl 1473.68123) Full Text: DOI arXiv OpenURL
Bazgan, Cristina; Cazals, Pierre; Chlebíková, Janka Degree-anonymization using edge rotations. (English) Zbl 07361595 Theor. Comput. Sci. 873, 1-15 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{C. Bazgan} et al., Theor. Comput. Sci. 873, 1--15 (2021; Zbl 07361595) Full Text: DOI OpenURL
Yang, Zishen; Wang, Wei; Shi, Majun Algorithms and complexity for a class of combinatorial optimization problems with labelling. (English) Zbl 1469.90126 J. Optim. Theory Appl. 188, No. 3, 673-695 (2021). MSC: 90C27 90C59 05C85 PDF BibTeX XML Cite \textit{Z. Yang} et al., J. Optim. Theory Appl. 188, No. 3, 673--695 (2021; Zbl 1469.90126) Full Text: DOI OpenURL
Kawase, Yasushi; Kimura, Kei; Makino, Kazuhisa; Sumita, Hanna Optimal matroid partitioning problems. (English) Zbl 07357814 Algorithmica 83, No. 6, 1653-1676 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{Y. Kawase} et al., Algorithmica 83, No. 6, 1653--1676 (2021; Zbl 07357814) Full Text: DOI OpenURL
Heeger, Klaus; Himmel, Anne-Sophie; Kammer, Frank; Niedermeier, Rolf; Renken, Malte; Sajenko, Andrej Multistage graph problems on a global budget. (English) Zbl 07346934 Theor. Comput. Sci. 868, 46-64 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Heeger} et al., Theor. Comput. Sci. 868, 46--64 (2021; Zbl 07346934) Full Text: DOI arXiv OpenURL
Lu, Lingfa; Zhang, Liqi; Ou, Jinwen In-house production and outsourcing under different discount schemes on the total outsourcing cost. (English) Zbl 07344551 Ann. Oper. Res. 298, No. 1-2, 361-374 (2021). MSC: 68Qxx 68Mxx PDF BibTeX XML Cite \textit{L. Lu} et al., Ann. Oper. Res. 298, No. 1--2, 361--374 (2021; Zbl 07344551) Full Text: DOI OpenURL
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen Travelling on graphs with small highway dimension. (English) Zbl 07335025 Algorithmica 83, No. 5, 1352-1370 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{Y. Disser} et al., Algorithmica 83, No. 5, 1352--1370 (2021; Zbl 07335025) Full Text: DOI arXiv OpenURL
Zeng, Chao; Jiang, Tai-Xiang; Ng, Michael K. An approximation method of CP rank for third-order tensor completion. (English) Zbl 1462.15030 Numer. Math. 147, No. 3, 727-757 (2021). MSC: 15A69 15A83 90C25 90C30 65K10 PDF BibTeX XML Cite \textit{C. Zeng} et al., Numer. Math. 147, No. 3, 727--757 (2021; Zbl 1462.15030) Full Text: DOI OpenURL
Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Yagita, Tsuyoshi Finding a maximum minimal separator: graph classes and fixed-parameter tractability. (English) Zbl 07331476 Theor. Comput. Sci. 865, 131-140 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. Hanaka} et al., Theor. Comput. Sci. 865, 131--140 (2021; Zbl 07331476) Full Text: DOI arXiv OpenURL
Schaller, David; Stadler, Peter F.; Hellmuth, Marc Complexity of modification problems for best match graphs. (English) Zbl 07331472 Theor. Comput. Sci. 865, 63-84 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Schaller} et al., Theor. Comput. Sci. 865, 63--84 (2021; Zbl 07331472) Full Text: DOI arXiv OpenURL
Wang, Xing; Chen, Guangting; Chen, Yong; Lin, Guohui; Wang, Yonghao; Zhang, An Improved hardness and approximation results for single allocation hub location problems. (English) Zbl 1482.68186 Theor. Comput. Sci. 864, 10-19 (2021). MSC: 68R10 05C69 68Q17 68W25 90B80 90C35 PDF BibTeX XML Cite \textit{X. Wang} et al., Theor. Comput. Sci. 864, 10--19 (2021; Zbl 1482.68186) Full Text: DOI OpenURL
Afanasev, Vsevolod A.; van Bevern, René; Tsidulko, Oxana Yu. The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable. (English) Zbl 07331265 Oper. Res. Lett. 49, No. 2, 270-277 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{V. A. Afanasev} et al., Oper. Res. Lett. 49, No. 2, 270--277 (2021; Zbl 07331265) Full Text: DOI arXiv OpenURL
Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar Parameterized and exact algorithms for class domination coloring. (English) Zbl 07327719 Discrete Appl. Math. 291, 286-299 (2021). MSC: 68Wxx 68Rxx PDF BibTeX XML Cite \textit{R. Krithika} et al., Discrete Appl. Math. 291, 286--299 (2021; Zbl 07327719) Full Text: DOI OpenURL
Alpert, Hannah; Roldán, Érika Art gallery problem with rook and queen vision. (English) Zbl 07324342 Graphs Comb. 37, No. 2, 621-642 (2021). MSC: 03D15 05B40 05B50 00A08 PDF BibTeX XML Cite \textit{H. Alpert} and \textit{É. Roldán}, Graphs Comb. 37, No. 2, 621--642 (2021; Zbl 07324342) Full Text: DOI arXiv OpenURL
Lu, Hongliang; Wang, Wei; Jiang, Yaolin On the complexity of all \(( g , f )\)-factors problem. (English) Zbl 1453.05103 Discrete Math. 344, No. 2, Article ID 112193, 3 p. (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{H. Lu} et al., Discrete Math. 344, No. 2, Article ID 112193, 3 p. (2021; Zbl 1453.05103) Full Text: DOI OpenURL
Asahiro, Yuichi; Furukawa, Tetsuya; Ikegami, Keiichi; Miyano, Eiji; Yagita, Tsuyoshi How to pack directed acyclic graphs into small blocks. (English) Zbl 1451.05188 Discrete Appl. Math. 288, 91-113 (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Discrete Appl. Math. 288, 91--113 (2021; Zbl 1451.05188) Full Text: DOI OpenURL
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos On the fast delivery problem with one or two packages. (English) Zbl 1464.68278 J. Comput. Syst. Sci. 115, 246-263 (2021). MSC: 68R10 68Q25 68T40 90B06 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., J. Comput. Syst. Sci. 115, 246--263 (2021; Zbl 1464.68278) Full Text: DOI OpenURL
Ramana B, Venkata; Chatterjee, Subhashis; Vishwakarma, Gajendra K. Estimation of network reliability using optimal ROBDD approach. (English) Zbl 07442417 Ars Comb. 150, 3-20 (2020). MSC: 05C82 05C85 90B15 68Q17 PDF BibTeX XML Cite \textit{V. Ramana B} et al., Ars Comb. 150, 3--20 (2020; Zbl 07442417) OpenURL
Diao, Zhuo; Tang, Zhongzheng Approximation algorithms for balancing signed graphs. (English) Zbl 1482.68172 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 399-410 (2020). MSC: 68R10 05C22 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{Z. Diao} and \textit{Z. Tang}, Lect. Notes Comput. Sci. 12290, 399--410 (2020; Zbl 1482.68172) Full Text: DOI OpenURL
Fischer, Nick; Ikenmeyer, Christian The computational complexity of plethysm coefficients. (English) Zbl 07350836 Comput. Complexity 29, No. 2, Paper No. 8, 43 p. (2020). MSC: 68Q17 05E10 PDF BibTeX XML Cite \textit{N. Fischer} and \textit{C. Ikenmeyer}, Comput. Complexity 29, No. 2, Paper No. 8, 43 p. (2020; Zbl 07350836) Full Text: DOI arXiv OpenURL
Pan, Zhuo; Li, Xianyue; Xu, Shou-Jun Complexity and characterization aspects of edge-related domination for graphs. (English) Zbl 1472.05121 J. Comb. Optim. 40, No. 3, 757-773 (2020). Reviewer: Seyed Mahmood Sheikholeslami (Tabriz) MSC: 05C69 05C35 68Q25 05C05 PDF BibTeX XML Cite \textit{Z. Pan} et al., J. Comb. Optim. 40, No. 3, 757--773 (2020; Zbl 1472.05121) Full Text: DOI OpenURL
Consoli, Sergio; Korst, Jan; Pauws, Steffen; Geleijnse, Gijs Improved metaheuristics for the quartet method of hierarchical clustering. (English) Zbl 1465.90085 J. Glob. Optim. 78, No. 2, 241-270 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{S. Consoli} et al., J. Glob. Optim. 78, No. 2, 241--270 (2020; Zbl 1465.90085) Full Text: DOI OpenURL
Caucchiolo, Andrea; Cicalese, Ferdinando On the complexity of directed intersection representation of DAGs. (English) Zbl 07336134 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, 554-565 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{A. Caucchiolo} and \textit{F. Cicalese}, Lect. Notes Comput. Sci. 12273, 554--565 (2020; Zbl 07336134) Full Text: DOI OpenURL
Chen, Lin; Sunny, Ahmed; Xu, Lei; Xu, Shouhuai; Gao, Zhimin; Lu, Yang; Shi, Weidong; Shah, Nolan Computational complexity characterization of protecting elections from bribery. (English) Zbl 07336096 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, 85-97 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{L. Chen} et al., Lect. Notes Comput. Sci. 12273, 85--97 (2020; Zbl 07336096) Full Text: DOI arXiv OpenURL
Akutsu, Tatsuya; Melkman, Avraham A.; Tamura, Takeyuki Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree. (English) Zbl 1458.68137 Int. J. Found. Comput. Sci. 31, No. 2, 253-273 (2020). MSC: 68R10 05C60 68Q17 PDF BibTeX XML Cite \textit{T. Akutsu} et al., Int. J. Found. Comput. Sci. 31, No. 2, 253--273 (2020; Zbl 1458.68137) Full Text: DOI OpenURL
Hartarsky, Ivailo; Mezei, Tamás Róbert Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness. (English) Zbl 1462.68070 SIAM J. Discrete Math. 34, No. 2, 1444-1459 (2020). MSC: 68Q17 60C05 60K35 68Q80 PDF BibTeX XML Cite \textit{I. Hartarsky} and \textit{T. R. Mezei}, SIAM J. Discrete Math. 34, No. 2, 1444--1459 (2020; Zbl 1462.68070) Full Text: DOI arXiv OpenURL
Pyatkin, Artem V. Easy NP-hardness proofs of some subset choice problems. (English) Zbl 1460.90156 Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 70-79 (2020). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{A. V. Pyatkin}, Commun. Comput. Inf. Sci. 1275, 70--79 (2020; Zbl 1460.90156) Full Text: DOI OpenURL
Schewe, Lars; Schmidt, Martin; Thürauf, Johannes Computing technical capacities in the European entry-exit gas market is NP-hard. (English) Zbl 1451.90032 Ann. Oper. Res. 295, No. 1, 337-362 (2020). MSC: 90B10 90C35 90C60 90C90 PDF BibTeX XML Cite \textit{L. Schewe} et al., Ann. Oper. Res. 295, No. 1, 337--362 (2020; Zbl 1451.90032) Full Text: DOI OpenURL
Bjerkevik, Håvard Bakke; Botnan, Magnus Bakke; Kerber, Michael Computing the interleaving distance is NP-hard. (English) Zbl 1460.55006 Found. Comput. Math. 20, No. 5, 1237-1271 (2020). Reviewer: Yuichi Ike (Kawasaki) MSC: 55N31 15A83 68Q17 PDF BibTeX XML Cite \textit{H. B. Bjerkevik} et al., Found. Comput. Math. 20, No. 5, 1237--1271 (2020; Zbl 1460.55006) Full Text: DOI arXiv OpenURL
Hartman, David; Hladík, Milan Complexity of computing interval matrix powers for special classes of matrices. (English) Zbl 07285950 Appl. Math., Praha 65, No. 5, 645-663 (2020). MSC: 65G40 15Bxx PDF BibTeX XML Cite \textit{D. Hartman} and \textit{M. Hladík}, Appl. Math., Praha 65, No. 5, 645--663 (2020; Zbl 07285950) Full Text: DOI OpenURL
Jiang, Haitao; Liu, Hong; Chauve, Cedric; Zhu, Binhai Breakpoint distance and PQ-trees. (English) Zbl 07285752 Inf. Comput. 275, Article ID 104584, 12 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{H. Jiang} et al., Inf. Comput. 275, Article ID 104584, 12 p. (2020; Zbl 07285752) Full Text: DOI Link OpenURL
Shafransky, Yakov; Shinkarevich, Viktor On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty. (English) Zbl 1456.90079 J. Sched. 23, No. 6, 745-749 (2020). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{Y. Shafransky} and \textit{V. Shinkarevich}, J. Sched. 23, No. 6, 745--749 (2020; Zbl 1456.90079) Full Text: DOI OpenURL
Manyà, Felip; Negrete, Santiago; Roig, Carme; Soler, Joan Ramon Solving the team composition problem in a classroom. (English) Zbl 1471.68254 Fundam. Inform. 174, No. 1, 83-101 (2020). MSC: 68T20 68Q17 68T42 PDF BibTeX XML Cite \textit{F. Manyà} et al., Fundam. Inform. 174, No. 1, 83--101 (2020; Zbl 1471.68254) Full Text: DOI OpenURL
Atserias, Albert; Müller, Moritz Automating resolution is NP-hard. (English) Zbl 07273098 J. ACM 67, No. 5, Article No. 31, 17 p. (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{A. Atserias} and \textit{M. Müller}, J. ACM 67, No. 5, Article No. 31, 17 p. (2020; Zbl 07273098) Full Text: DOI arXiv Link OpenURL
de Mesmay, Arnaud; Rieck, Yo’av; Sedgwick, Eric; Tancer, Martin Embeddability in \(R^3\) is NP-hard. (English) Zbl 07273091 J. ACM 67, No. 4, Article No. 20, 29 p. (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{A. de Mesmay} et al., J. ACM 67, No. 4, Article No. 20, 29 p. (2020; Zbl 07273091) Full Text: DOI OpenURL
Sahai, Tuhin Dynamical systems theory and algorithms for NP-hard problems. (English) Zbl 07271598 Junge, Oliver (ed.) et al., Advances in dynamics, optimization and computation. A volume dedicated to Michael Dellnitz on the occasion of his 60th birthday. Cham: Springer. Stud. Syst. Decis. Control 304, 183-206 (2020). MSC: 68Qxx 68Q17 68Q25 65Y20 90C60 37N30 PDF BibTeX XML Cite \textit{T. Sahai}, Stud. Syst. Decis. Control 304, 183--206 (2020; Zbl 07271598) Full Text: DOI arXiv OpenURL
Buzatu, Radu On the computational complexity of optimization convex covering problems of graphs. (English) Zbl 1445.68107 Comput. Sci. J. Mold. 28, No. 2, 187-200 (2020). MSC: 68Q25 05C70 68Q17 68R10 PDF BibTeX XML Cite \textit{R. Buzatu}, Comput. Sci. J. Mold. 28, No. 2(83), 187--200 (2020; Zbl 1445.68107) Full Text: Link OpenURL
Feng, Han; Lavaei, Javad Connectivity properties of the set of stabilizing static decentralized controllers. (English) Zbl 1452.49013 SIAM J. Control Optim. 58, No. 5, 2790-2820 (2020). MSC: 49K21 93A14 93B25 93B27 93B60 93C05 93C41 93D05 93D15 68U99 PDF BibTeX XML Cite \textit{H. Feng} and \textit{J. Lavaei}, SIAM J. Control Optim. 58, No. 5, 2790--2820 (2020; Zbl 1452.49013) Full Text: DOI OpenURL
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Tracking routes in communication networks. (English) Zbl 1467.68135 Theor. Comput. Sci. 844, 1-15 (2020). MSC: 68R10 68Q17 68W25 90B18 90C35 PDF BibTeX XML Cite \textit{D. Bilò} et al., Theor. Comput. Sci. 844, 1--15 (2020; Zbl 1467.68135) Full Text: DOI OpenURL
Malmberg, Filip; Ciesielski, Krzysztof Chris Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions. (English) Zbl 1482.68180 J. Math. Imaging Vis. 62, No. 5, 737-750 (2020). MSC: 68R10 05C78 68W40 PDF BibTeX XML Cite \textit{F. Malmberg} and \textit{K. C. Ciesielski}, J. Math. Imaging Vis. 62, No. 5, 737--750 (2020; Zbl 1482.68180) Full Text: DOI OpenURL
Huang, Zhong; Li, Xueliang Hardness results for three kinds of colored connections of graphs. (English) Zbl 1455.68140 Theor. Comput. Sci. 841, 27-38 (2020). MSC: 68R10 05C15 05C40 68Q17 PDF BibTeX XML Cite \textit{Z. Huang} and \textit{X. Li}, Theor. Comput. Sci. 841, 27--38 (2020; Zbl 1455.68140) Full Text: DOI arXiv OpenURL
Jana, Satyabrata; Pandit, Supantha Covering and packing of rectilinear subdivision. (English) Zbl 1455.68231 Theor. Comput. Sci. 840, 166-176 (2020). MSC: 68U05 68Q17 68W25 PDF BibTeX XML Cite \textit{S. Jana} and \textit{S. Pandit}, Theor. Comput. Sci. 840, 166--176 (2020; Zbl 1455.68231) Full Text: DOI arXiv OpenURL
Asahiro, Yuichi; Jansson, Jesper; Lin, Guohui; Miyano, Eiji; Ono, Hirotaka; Utashima, Tadatoshi Exact algorithms for the repetition-bounded longest common subsequence problem. (English) Zbl 1453.68226 Theor. Comput. Sci. 838, 238-249 (2020). MSC: 68W32 68Q17 68W40 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 838, 238--249 (2020; Zbl 1453.68226) Full Text: DOI OpenURL
Cabello, Sergio; de Verdière, Éric Colin Hardness of minimum barrier shrinkage and minimum installation path. (English) Zbl 1452.68082 Theor. Comput. Sci. 835, 120-133 (2020). MSC: 68Q17 68R10 68U05 PDF BibTeX XML Cite \textit{S. Cabello} and \textit{É. C. de Verdière}, Theor. Comput. Sci. 835, 120--133 (2020; Zbl 1452.68082) Full Text: DOI arXiv OpenURL
Lubiw, Anna; Mondal, Debajyoti On compatible triangulations with a minimum number of Steiner points. (English) Zbl 1467.68199 Theor. Comput. Sci. 835, 97-107 (2020). Reviewer: Agnieszka Lisowska (Sosnowiec) MSC: 68U05 68Q17 PDF BibTeX XML Cite \textit{A. Lubiw} and \textit{D. Mondal}, Theor. Comput. Sci. 835, 97--107 (2020; Zbl 1467.68199) Full Text: DOI arXiv OpenURL
Fulek, Radoslav; Tóth, Csaba D. Crossing minimization in perturbed drawings. (English) Zbl 1447.90070 J. Comb. Optim. 40, No. 2, 279-302 (2020). MSC: 90C35 05C10 05C38 68R10 PDF BibTeX XML Cite \textit{R. Fulek} and \textit{C. D. Tóth}, J. Comb. Optim. 40, No. 2, 279--302 (2020; Zbl 1447.90070) Full Text: DOI OpenURL
Jana, Satyabrata; Maheshwari, Anil; Mehrabi, Saeed; Roy, Sasanka Maximum bipartite subgraph of geometric intersection graphs. (English) Zbl 07224281 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 158-169 (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{S. Jana} et al., Lect. Notes Comput. Sci. 12049, 158--169 (2020; Zbl 07224281) Full Text: DOI arXiv OpenURL
Heilman, Steven A periodic isoperimetric problem related to the unique games conjecture. (English) Zbl 1455.60029 Random Struct. Algorithms 56, No. 1, 154-168 (2020). MSC: 60D05 68Q17 49Q20 52B60 PDF BibTeX XML Cite \textit{S. Heilman}, Random Struct. Algorithms 56, No. 1, 154--168 (2020; Zbl 1455.60029) Full Text: DOI arXiv OpenURL
Chan, Huang-Ting; Chiu, Hsuan-Tsung; Yang, Chang-Biau; Peng, Yung-Hsing The generalized definitions of the two-dimensional largest common substructure problems. (English) Zbl 1442.68155 Algorithmica 82, No. 7, 2039-2062 (2020). MSC: 68R05 68Q17 68R07 68W32 PDF BibTeX XML Cite \textit{H.-T. Chan} et al., Algorithmica 82, No. 7, 2039--2062 (2020; Zbl 1442.68155) Full Text: DOI OpenURL
Gemsa, Andreas; Niedermann, Benjamin; Nöllenburg, Martin Placing labels in road maps: algorithms and complexity. (English) Zbl 1441.68182 Algorithmica 82, No. 7, 1881-1908 (2020). MSC: 68R10 68Q17 68U05 68W40 PDF BibTeX XML Cite \textit{A. Gemsa} et al., Algorithmica 82, No. 7, 1881--1908 (2020; Zbl 1441.68182) Full Text: DOI OpenURL
Akhoondian Amiri, Saeed; Foerster, Klaus-Tycho; Schmid, Stefan Walking through waypoints. (English) Zbl 1436.68218 Algorithmica 82, No. 7, 1784-1812 (2020). MSC: 68R10 68Q25 90C27 PDF BibTeX XML Cite \textit{S. Akhoondian Amiri} et al., Algorithmica 82, No. 7, 1784--1812 (2020; Zbl 1436.68218) Full Text: DOI OpenURL
Zhang, Yong; Chin, Francis Y. L.; Poon, Sheung-Hung; Ting, Hing-Fung; Xu, Dachuan; Yu, Dongxiao Offline and online algorithms for single-minded selling problem. (English) Zbl 1437.91229 Theor. Comput. Sci. 821, 15-22 (2020). MSC: 91B26 68Q17 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Theor. Comput. Sci. 821, 15--22 (2020; Zbl 1437.91229) Full Text: DOI OpenURL
Davari, Morteza; Goossens, Dries; Beliën, Jeroen; Lambers, Roel; Spieksma, Frits C. R. The multi-league sports scheduling problem, or how to schedule thousands of matches. (English) Zbl 07186961 Oper. Res. Lett. 48, No. 2, 180-187 (2020). MSC: 90-XX PDF BibTeX XML Cite \textit{M. Davari} et al., Oper. Res. Lett. 48, No. 2, 180--187 (2020; Zbl 07186961) Full Text: DOI OpenURL
Demaine, Erik D.; Ito, Hiro; Langerman, Stefan; Lynch, Jayson; Rudoy, Mikhail; Xiao, Kai Cookie clicker. (English) Zbl 1436.91015 Graphs Comb. 36, No. 2, 269-302 (2020). MSC: 91A40 91A68 68W25 90C39 PDF BibTeX XML Cite \textit{E. D. Demaine} et al., Graphs Comb. 36, No. 2, 269--302 (2020; Zbl 1436.91015) Full Text: DOI arXiv Link OpenURL
Akitaya, Hugo A.; Avery, Cordelia; Bergeron, Joseph; Demaine, Erik D.; Kopinsky, Justin; Ku, Jason S. Infinite all-layers simple foldability. (English) Zbl 1433.68477 Graphs Comb. 36, No. 2, 231-244 (2020). MSC: 68U05 51M15 68Q17 PDF BibTeX XML Cite \textit{H. A. Akitaya} et al., Graphs Comb. 36, No. 2, 231--244 (2020; Zbl 1433.68477) Full Text: DOI arXiv OpenURL
Zhao, Qiulan; Yuan, Jinjiang Bicriteria scheduling of equal length jobs on uniform parallel machines. (English) Zbl 1442.90090 J. Comb. Optim. 39, No. 3, 637-661 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{Q. Zhao} and \textit{J. Yuan}, J. Comb. Optim. 39, No. 3, 637--661 (2020; Zbl 1442.90090) Full Text: DOI OpenURL
Agrawal, Akash; Li, Yuan; Xue, Jie; Janardan, Ravi The most-likely skyline problem for stochastic points. (English) Zbl 1433.68475 Comput. Geom. 88, Article ID 101609, 10 p. (2020). MSC: 68U05 68P05 68Q17 68W40 PDF BibTeX XML Cite \textit{A. Agrawal} et al., Comput. Geom. 88, Article ID 101609, 10 p. (2020; Zbl 1433.68475) Full Text: DOI OpenURL
Juma, Nahid; Dietl, Werner; Tripunitara, Mahesh A computational complexity analysis of tunable type inference for Generic Universe Types. (English) Zbl 1435.68059 Theor. Comput. Sci. 814, 189-209 (2020). MSC: 68N15 68N19 68Q17 68Q25 68R07 PDF BibTeX XML Cite \textit{N. Juma} et al., Theor. Comput. Sci. 814, 189--209 (2020; Zbl 1435.68059) Full Text: DOI OpenURL
Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars Complexity and inapproximability results for parallel task scheduling and strip packing. (English) Zbl 1477.68119 Theory Comput. Syst. 64, No. 1, 120-140 (2020). Reviewer: Roberto Solis-Oba (London) MSC: 68Q17 68W25 90B35 90C27 PDF BibTeX XML Cite \textit{S. Henning} et al., Theory Comput. Syst. 64, No. 1, 120--140 (2020; Zbl 1477.68119) Full Text: DOI arXiv OpenURL
Miotk, Mateusz; Topp, Jerzy; Żyliński, Paweł Disjoint dominating and 2-dominating sets in graphs. (English) Zbl 07172792 Discrete Optim. 35, Article ID 100553, 12 p. (2020). MSC: 90Cxx 05C69 05C85 PDF BibTeX XML Cite \textit{M. Miotk} et al., Discrete Optim. 35, Article ID 100553, 12 p. (2020; Zbl 07172792) Full Text: DOI arXiv OpenURL
Lozin, Vadim; Malyshev, Dmitriy; Mosca, Raffaele; Zamaraev, Viktor Independent domination versus weighted independent domination. (English) Zbl 1478.68250 Inf. Process. Lett. 156, Article ID 105914, 5 p. (2020). MSC: 68R10 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{V. Lozin} et al., Inf. Process. Lett. 156, Article ID 105914, 5 p. (2020; Zbl 1478.68250) Full Text: DOI OpenURL
Hellmuth, Marc; Geiß, Manuela; Stadler, Peter F. Complexity of modification problems for reciprocal best match graphs. (English) Zbl 1443.92120 Theor. Comput. Sci. 809, 384-393 (2020). MSC: 92D10 92-08 05C90 68Q17 PDF BibTeX XML Cite \textit{M. Hellmuth} et al., Theor. Comput. Sci. 809, 384--393 (2020; Zbl 1443.92120) Full Text: DOI arXiv OpenURL
Mavronicolas, Marios; Monien, Burkhard Conditional value-at-risk: structure and complexity of equilibria. (English) Zbl 1443.91344 Theor. Comput. Sci. 807, 266-283 (2020). MSC: 91G70 91A80 91A68 PDF BibTeX XML Cite \textit{M. Mavronicolas} and \textit{B. Monien}, Theor. Comput. Sci. 807, 266--283 (2020; Zbl 1443.91344) Full Text: DOI OpenURL
Bulteau, Laurent; Vialette, Stéphane Recognizing binary shuffle squares is NP-hard. (English) Zbl 1436.68269 Theor. Comput. Sci. 806, 116-132 (2020). MSC: 68R15 68Q17 PDF BibTeX XML Cite \textit{L. Bulteau} and \textit{S. Vialette}, Theor. Comput. Sci. 806, 116--132 (2020; Zbl 1436.68269) Full Text: DOI OpenURL
Acharyya, Ankush; De, Minati; Nandy, Subhas C.; Roy, Bodhayan Range assignment of base-stations maximizing coverage area without interference. (English) Zbl 1436.68375 Theor. Comput. Sci. 804, 81-97 (2020). MSC: 68U05 68Q17 68Q25 68W25 90C20 PDF BibTeX XML Cite \textit{A. Acharyya} et al., Theor. Comput. Sci. 804, 81--97 (2020; Zbl 1436.68375) Full Text: DOI arXiv OpenURL
do Carmo Viana, Luiz Alberto; Campêlo, Manoel The generalized dependency constrained spanning tree problem. (English) Zbl 07515224 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 711-723 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{L. A. do Carmo Viana} and \textit{M. Campêlo}, Electron. Notes Theor. Comput. Sci. 346, 711--723 (2019; Zbl 07515224) Full Text: DOI OpenURL
Ramana B., Venkata; Chatterjee, Subhashis; Vishwakarma, Gajendra K. Estimation of network reliability using optimal ROBDD approach. (English) Zbl 07397960 Ars Comb. 147, 237-253 (2019). MSC: 05C82 05C85 90B15 PDF BibTeX XML Cite \textit{V. Ramana B.} et al., Ars Comb. 147, 237--253 (2019; Zbl 07397960) OpenURL
Bazgan, Cristina; Fernau, Henning; Tuza, Zsolt Aspects of upper defensive alliances. (English) Zbl 1476.05149 Discrete Appl. Math. 266, 111-120 (2019). MSC: 05C69 05C07 68Q17 68Q25 PDF BibTeX XML Cite \textit{C. Bazgan} et al., Discrete Appl. Math. 266, 111--120 (2019; Zbl 1476.05149) Full Text: DOI Link OpenURL
Kel’manov, Alexander; Khandeev, Vladimir; Pyatkin, Artem NP-hardness of some max-min clustering problems. (English) Zbl 1468.90110 Evtushenko, Yury (ed.) et al., Optimization and applications. 9th international conference, OPTIMA 2018, Petrovac, Montenegro, October 1–5, 2018. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 974, 144-154 (2019). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{A. Kel'manov} et al., Commun. Comput. Inf. Sci. 974, 144--154 (2019; Zbl 1468.90110) Full Text: DOI OpenURL
Rybalov, A. N. On complexity of the existential and universal theories of finite fields. (Russian. English summary) Zbl 1461.03029 Prikl. Diskretn. Mat. 2019, No. 45, 85-89 (2019). MSC: 03D15 68Q25 12E20 PDF BibTeX XML Cite \textit{A. N. Rybalov}, Prikl. Diskretn. Mat. 2019, No. 45, 85--89 (2019; Zbl 1461.03029) Full Text: DOI MNR OpenURL
Grzegorowski, Marek; Ślęzak, Dominik On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts. (English) Zbl 1451.68224 Inf. Sci. 499, 25-44 (2019). MSC: 68T05 62H30 68Q17 68T20 PDF BibTeX XML Cite \textit{M. Grzegorowski} and \textit{D. Ślęzak}, Inf. Sci. 499, 25--44 (2019; Zbl 1451.68224) Full Text: DOI OpenURL