Schnider, Patrick The complexity of sharing a pizza. (English) Zbl 07788586 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 13, 15 p. (2021). MSC: 68Q25 68Q17 68U05 91B32 PDFBibTeX XMLCite \textit{P. Schnider}, LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 13, 15 p. (2021; Zbl 07788586) Full Text: DOI
Marciano, Carlos E.; Arantes, Gladstone M. jun.; Lucena, Abilio; Simonetti, Luidi G.; Faria, Luerbio; França, Felipe M. G. Optimizing concurrency under scheduling by edge reversal. (English) Zbl 07775307 Networks 77, No. 4, 520-537 (2021). MSC: 68R10 68Q17 68Q85 68W25 PDFBibTeX XMLCite \textit{C. E. Marciano} et al., Networks 77, No. 4, 520--537 (2021; Zbl 07775307) Full Text: DOI
Garg, Sumegha; Kothari, Pravesh K.; Liu, Pengda; Raz, Ran Memory-sample lower bounds for learning parity with noise. (English) Zbl 07768405 Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 60, 19 p. (2021). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{S. Garg} et al., LIPIcs -- Leibniz Int. Proc. Inform. 207, Article 60, 19 p. (2021; Zbl 07768405) Full Text: DOI arXiv
Konrad, Christian; Naidu, Kheeran K. On two-pass streaming algorithms for maximum bipartite matching. (English) Zbl 07768364 Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 19, 18 p. (2021). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{C. Konrad} and \textit{K. K. Naidu}, LIPIcs -- Leibniz Int. Proc. Inform. 207, Article 19, 18 p. (2021; Zbl 07768364) Full Text: DOI arXiv
Daneshpajouh, Hamid Reza; Meunier, Frédéric; Mizrahi, Guilhem Colorings of complements of line graphs. (English) Zbl 1522.05106 J. Graph Theory 98, No. 2, 216-233 (2021). MSC: 05C15 05C76 68Q17 PDFBibTeX XMLCite \textit{H. R. Daneshpajouh} et al., J. Graph Theory 98, No. 2, 216--233 (2021; Zbl 1522.05106) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena Decomposing subcubic graphs into claws, paths or triangles. (English) Zbl 1522.05365 J. Graph Theory 98, No. 4, 557-588 (2021). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Graph Theory 98, No. 4, 557--588 (2021; Zbl 1522.05365) Full Text: DOI
Condon, Anne; Hajiaghayi, Monir; Thachuk, Chris Predicting minimum free energy structures of multi-stranded nucleic acid complexes is APX-hard. (English) Zbl 07741400 Lakin, Matthew R. (ed.) et al., 27th international conference on DNA computing and molecular programming. DNA 27, Oxford, UK (virtual conference), September 13–16, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 205, Article 9, 21 p. (2021). MSC: 68Q07 68Q17 92D20 PDFBibTeX XMLCite \textit{A. Condon} et al., LIPIcs -- Leibniz Int. Proc. Inform. 205, Article 9, 21 p. (2021; Zbl 07741400) Full Text: DOI
Hamoudi, Yassine Quantum sub-Gaussian mean estimator. (English) Zbl 07740905 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 50, 17 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{Y. Hamoudi}, LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 50, 17 p. (2021; Zbl 07740905) Full Text: DOI arXiv
Sharma, Amit; Venkata Subba Reddy, P. Algorithmic aspects of outer-independent total Roman domination in graphs. (English) Zbl 1522.68424 Int. J. Found. Comput. Sci. 32, No. 3, 331-339 (2021). MSC: 68R10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Sharma} and \textit{P. Venkata Subba Reddy}, Int. J. Found. Comput. Sci. 32, No. 3, 331--339 (2021; Zbl 1522.68424) Full Text: DOI
Arnon, Gal; Rothblum, Guy N. On prover-efficient public-coin emulation of interactive proofs. (English) Zbl 1517.94056 Tessaro, Stefano (ed.), 2nd conference on information-theoretic cryptography. ITC 2021, July 23–26, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 199, Article 3, 15 p. (2021). MSC: 94A60 68Q17 PDFBibTeX XMLCite \textit{G. Arnon} and \textit{G. N. Rothblum}, LIPIcs -- Leibniz Int. Proc. Inform. 199, Article 3, 15 p. (2021; Zbl 1517.94056) Full Text: DOI
Liu, Yupan StoqMA meets distribution testing. (English) Zbl 07701524 Hsieh, Min-Hsiu (ed.), 16th conference on the theory of quantum computation, communication and cryptography, virtual conference, TQC 2021, July 5–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 197, Article 4, 22 p. (2021). MSC: 81P68 68Q17 PDFBibTeX XMLCite \textit{Y. Liu}, LIPIcs -- Leibniz Int. Proc. Inform. 197, Article 4, 22 p. (2021; Zbl 07701524) Full Text: DOI arXiv
Banik, Subhadeep; Barooti, Khashayar; Vaudenay, Serge; Yan, Hailun New attacks on LowMC instances with a single plaintext/ciphertext pair. (English) Zbl 1514.94036 Tibouchi, Mehdi (ed.) et al., Advances in cryptology – ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6–10, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13090, 303-331 (2021). MSC: 94A60 68P25 68Q17 PDFBibTeX XMLCite \textit{S. Banik} et al., Lect. Notes Comput. Sci. 13090, 303--331 (2021; Zbl 1514.94036) Full Text: DOI
Rich, Patricia; Blokpoel, Mark; de Haan, Ronald; Otworowska, Maria; Sweers, Marieke; Wareham, Todd; van Rooij, Iris Naturalism, tractability and the adaptive toolbox. (English) Zbl 1507.03064 Synthese 198, No. 6, 5749-5784 (2021). MSC: 03A10 68Q01 68Q17 PDFBibTeX XMLCite \textit{P. Rich} et al., Synthese 198, No. 6, 5749--5784 (2021; Zbl 1507.03064) Full Text: DOI
Han, Lu; Wu, Chenchen; Xu, Yicheng Approximate the lower-bounded connected facility location problem. (English) Zbl 07670487 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 487-498 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{L. Han} et al., Lect. Notes Comput. Sci. 13025, 487--498 (2021; Zbl 07670487) Full Text: DOI
Gupta, Neelima; Grover, Sapna; Dabas, Rajni Respecting lower bounds in uniform lower and upper bounded facility location problem. (English) Zbl 07670485 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 463-475 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{N. Gupta} et al., Lect. Notes Comput. Sci. 13025, 463--475 (2021; Zbl 07670485) Full Text: DOI
Dyer, Martin; Heinrich, Marc; Jerrum, Mark; Müller, Haiko Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. (English) Zbl 1511.68343 Comb. Probab. Comput. 30, No. 6, 905-921 (2021). MSC: 68W25 05C76 68Q17 68W20 68W40 82B20 PDFBibTeX XMLCite \textit{M. Dyer} et al., Comb. Probab. Comput. 30, No. 6, 905--921 (2021; Zbl 1511.68343) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Disjointness graphs of segments in the space. (English) Zbl 1510.05083 Comb. Probab. Comput. 30, No. 4, 498-512 (2021). MSC: 05C15 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Pach} et al., Comb. Probab. Comput. 30, No. 4, 498--512 (2021; Zbl 1510.05083) Full Text: DOI
Bürgisser, Peter (ed.); Dinur, Irit (ed.); Vadhan, Salil (ed.) Complexity theory. Abstracts from the workshop held November 14–20, 2021 (hybrid meeting). (English) Zbl 1506.00050 Oberwolfach Rep. 18, No. 4, 2955-3005 (2021). MSC: 00B05 00B25 68-06 68Q01 68Q17 68Q15 PDFBibTeX XMLCite \textit{P. Bürgisser} (ed.) et al., Oberwolfach Rep. 18, No. 4, 2955--3005 (2021; Zbl 1506.00050) Full Text: DOI
Shakiba, Ali Distributed decision making with S-approximation spaces. (English) Zbl 1504.68229 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 29, No. 2, 281-311 (2021). MSC: 68T37 68Q17 68T35 91B06 PDFBibTeX XMLCite \textit{A. Shakiba}, Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 29, No. 2, 281--311 (2021; Zbl 1504.68229) Full Text: DOI
Gnatenko, A. R.; Zakharov, V. A. On the satisfiability and model checking for one parameterized extension of linear-time temporal logic. (Russian. English summary) Zbl 1517.68237 Model. Anal. Inf. Sist. 28, No. 4, 356-371 (2021). MSC: 68Q60 03B44 68Q17 68Q25 68Q45 PDFBibTeX XMLCite \textit{A. R. Gnatenko} and \textit{V. A. Zakharov}, Model. Anal. Inf. Sist. 28, No. 4, 356--371 (2021; Zbl 1517.68237) Full Text: DOI MNR
Smirnov, A. V. NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity \(k \geqslant 3\). (Russian. English summary) Zbl 1504.68077 Model. Anal. Inf. Sist. 28, No. 1, 22-37 (2021). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{A. V. Smirnov}, Model. Anal. Inf. Sist. 28, No. 1, 22--37 (2021; Zbl 1504.68077) Full Text: DOI MNR
Függer, Matthias; Nowak, Thomas; Schwarz, Manfred Tight bounds for asymptotic and approximate consensus. (English) Zbl 1499.68034 J. ACM 68, No. 6, Paper No. 46, 35 p. (2021). MSC: 68M14 68M10 68M15 68Q17 68W15 PDFBibTeX XMLCite \textit{M. Függer} et al., J. ACM 68, No. 6, Paper No. 46, 35 p. (2021; Zbl 1499.68034) Full Text: DOI
Balliu, Alkida; Brandt, Sebastian; Hirvonen, Juho; Olivetti, Dennis; Rabie, Mikaël; Suomela, Jukka Lower bounds for maximal matchings and maximal independent sets. (English) Zbl 1499.68248 J. ACM 68, No. 5, Paper No. 39, 30 p. (2021). MSC: 68R10 05C69 05C70 68Q17 68W15 PDFBibTeX XMLCite \textit{A. Balliu} et al., J. ACM 68, No. 5, Paper No. 39, 30 p. (2021; Zbl 1499.68248) Full Text: DOI arXiv
Gottlob, Georg; Lanzinger, Matthias; Pichler, Reinhard; Razgon, Igor Complexity analysis of generalized and fractional hypertree decompositions. (English) Zbl 1499.68272 J. ACM 68, No. 5, Paper No. 38, 50 p. (2021). MSC: 68R10 05C65 68Q17 PDFBibTeX XMLCite \textit{G. Gottlob} et al., J. ACM 68, No. 5, Paper No. 38, 50 p. (2021; Zbl 1499.68272) Full Text: DOI arXiv
Blondin, Michael; Englert, Matthias; Finkel, Alain; Göller, Stefan; Haase, Christoph; Lazić, Ranko; Mckenzie, Pierre; Totzke, Patrick The reachability problem for two-dimensional vector addition systems with states. (English) Zbl 1499.68219 J. ACM 68, No. 5, Paper No. 34, 43 p. (2021). MSC: 68Q85 68Q17 PDFBibTeX XMLCite \textit{M. Blondin} et al., J. ACM 68, No. 5, Paper No. 34, 43 p. (2021; Zbl 1499.68219) Full Text: DOI
Cohen-Addad, Vincent; de Verdière, Éric Colin; Marx, Dániel; de Mesmay, Arnaud Almost tight lower bounds for hard cutting problems in embedded graphs. (English) Zbl 1499.68264 J. ACM 68, No. 4, Paper No. 30, 26 p. (2021). MSC: 68R10 05C10 68Q17 68Q27 PDFBibTeX XMLCite \textit{V. Cohen-Addad} et al., J. ACM 68, No. 4, Paper No. 30, 26 p. (2021; Zbl 1499.68264) Full Text: DOI
Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub Algebraic approach to promise constraint satisfaction. (English) Zbl 1499.68140 J. ACM 68, No. 4, Paper No. 28, 66 p. (2021). MSC: 68Q25 05C15 08A70 68Q17 PDFBibTeX XMLCite \textit{L. Barto} et al., J. ACM 68, No. 4, Paper No. 28, 66 p. (2021; Zbl 1499.68140) Full Text: DOI
Atserias, Albert; Bonacina, Ilario; De Rezende, Susanna F.; Lauria, Massimo; Nordström, Jakob; Razborov, Alexander Clique is hard on average for regular resolution. (English) Zbl 1499.68129 J. ACM 68, No. 4, Paper No. 23, 26 p. (2021). MSC: 68Q17 03F20 05C69 05C80 68W40 PDFBibTeX XMLCite \textit{A. Atserias} et al., J. ACM 68, No. 4, Paper No. 23, 26 p. (2021; Zbl 1499.68129) Full Text: DOI
Hertling, Peter; Krommes, Gisela EXPSPACE-completeness of the logics \(K4 \times S5\) and \(S4 \times S5\) and the logic of subset spaces. (English) Zbl 1505.03053 ACM Trans. Comput. Log. 22, No. 4, Article No. 24, 71 p. (2021). MSC: 03B45 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Hertling} and \textit{G. Krommes}, ACM Trans. Comput. Log. 22, No. 4, Article No. 24, 71 p. (2021; Zbl 1505.03053) Full Text: DOI
Arenas, Marcelo; Barceló, Pablo; Monet, Mikaël The complexity of counting problems over incomplete databases. (English) Zbl 1508.68083 ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021). MSC: 68P15 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Arenas} et al., ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021; Zbl 1508.68083) Full Text: DOI arXiv
Lin, Fucai; Sun, Qianqian; Lin, Yujin; Li, Jinjin Some topological properties of topological rough groups. (English) Zbl 1498.54033 Soft Comput. 25, No. 5, 3441-3453 (2021). MSC: 54H11 22A05 20N25 PDFBibTeX XMLCite \textit{F. Lin} et al., Soft Comput. 25, No. 5, 3441--3453 (2021; Zbl 1498.54033) Full Text: DOI arXiv
Ficara, Annamaria; Saitta, Rebecca; Fiumara, Giacomo; De Meo, Pasquale; Liotta, Antonio Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks. (English) Zbl 1504.91213 Teixeira, Andreia Sofia (ed.) et al., Complex networks XII. Proceedings of the 12th conference on complex networks CompleNet 2021, May 24–26, 2021. Cham: Springer. Springer Proc. Complex., 12-23 (2021). MSC: 91D30 68Q17 PDFBibTeX XMLCite \textit{A. Ficara} et al., in: Complex networks XII. Proceedings of the 12th conference on complex networks CompleNet 2021, May 24--26, 2021. Cham: Springer. 12--23 (2021; Zbl 1504.91213) Full Text: DOI
Caminata, Alessio; Gorla, Elisa The complexity of MinRank. (English) Zbl 1504.94111 Cojocaru, Alina Carmen (ed.) et al., Women in numbers Europe III. Research directions in number theory. Selected papers based on the presentations at the 3rd conference, WINE 3, La Hublais, Center in Cesson-Sévigné, Bretagne, France, August 26–30, 2019. Cham: Springer. Assoc. Women Math. Ser. 24, 163-169 (2021). MSC: 94A60 13P10 13P15 14G50 13P25 68Q17 PDFBibTeX XMLCite \textit{A. Caminata} and \textit{E. Gorla}, Assoc. Women Math. Ser. 24, 163--169 (2021; Zbl 1504.94111) Full Text: DOI arXiv
Raghavan, Divya; Sukavanam, N. Extremal mild solutions of Hilfer fractional impulsive systems. (English) Zbl 1507.34067 Chadli, Ouayl (ed.) et al., Mathematical analysis and applications, MAA 2020. Selected papers based on the presentations at the conference, Jamshedpur, India, November 2–4, 2020. Singapore: Springer. Springer Proc. Math. Stat. 381, 67-80 (2021). Reviewer: Snezhana Hristova (Plovdiv) MSC: 34G20 34A08 34A37 34A45 PDFBibTeX XMLCite \textit{D. Raghavan} and \textit{N. Sukavanam}, Springer Proc. Math. Stat. 381, 67--80 (2021; Zbl 1507.34067) Full Text: DOI arXiv
Berman, Abraham; Borer, Franziska; Hungerbühler, Norbert Lights Out on graphs. (English) Zbl 1502.05162 Math. Semesterber. 68, No. 2, 237-255 (2021). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C57 15A99 15B33 68Q17 91A43 PDFBibTeX XMLCite \textit{A. Berman} et al., Math. Semesterber. 68, No. 2, 237--255 (2021; Zbl 1502.05162) Full Text: DOI arXiv
Suzuki, Kenta; Takayanagi, Tadashi JT gravity limit of Liouville CFT and matrix model. (English) Zbl 1521.81270 J. High Energy Phys. 2021, No. 11, Paper No. 137, 29 p. (2021). MSC: 81T35 83C80 83C45 83C25 83D05 83C57 81T40 PDFBibTeX XMLCite \textit{K. Suzuki} and \textit{T. Takayanagi}, J. High Energy Phys. 2021, No. 11, Paper No. 137, 29 p. (2021; Zbl 1521.81270) Full Text: DOI arXiv
Song, Xi; Chen, Qin Semitotal bondage numbers of graphs. (Chinese. English summary) Zbl 1513.05298 Adv. Math., Beijing 50, No. 6, 877-886 (2021). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{X. Song} and \textit{Q. Chen}, Adv. Math., Beijing 50, No. 6, 877--886 (2021; Zbl 1513.05298) Full Text: DOI
Grüttemeier, Niels; Komusiewicz, Christian; Schestag, Jannik; Sommer, Frank Destroying bicolored \(P_3\)s by deleting few edges. (English) Zbl 1498.05097 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 14, 25 p. (2021). MSC: 05C15 05C75 05C85 68Q17 PDFBibTeX XMLCite \textit{N. Grüttemeier} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 14, 25 p. (2021; Zbl 1498.05097) Full Text: DOI Link
Hellmuth, Marc; Seemann, Carsten R.; Stadler, Peter F. Generalized Fitch graphs. III: Symmetrized Fitch maps and sets of symmetric binary relations that are explained by unrooted edge-labeled trees. (English) Zbl 1498.05058 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021). MSC: 05C05 05C78 05C85 68Q17 92D10 PDFBibTeX XMLCite \textit{M. Hellmuth} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021; Zbl 1498.05058) Full Text: DOI arXiv Link
Houlari, Tahereh; Dehghan, Mohammad; Biazar, Jafar; Nouri, Alireza Theory and numerical approaches of high order fractional Sturm-Liouville problems. (English) Zbl 07578305 Turk. J. Math. 45, No. 4, 1564-1579 (2021). MSC: 34B24 34A08 34L15 34L16 PDFBibTeX XMLCite \textit{T. Houlari} et al., Turk. J. Math. 45, No. 4, 1564--1579 (2021; Zbl 07578305) Full Text: DOI
Wei, Mei; Li, Yongxiang; Li, Gang Lower and upper solutions method to the fully elastic cantilever beam equation with support. (English) Zbl 1494.34096 Adv. Difference Equ. 2021, Paper No. 301, 13 p. (2021). MSC: 34B15 74K10 34B18 34A45 47N20 PDFBibTeX XMLCite \textit{M. Wei} et al., Adv. Difference Equ. 2021, Paper No. 301, 13 p. (2021; Zbl 1494.34096) Full Text: DOI
Song, Bosheng; Zeng, Xiangxiang Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division. (English) Zbl 1490.68102 J. Membr. Comput. 3, No. 4, 296-302 (2021). MSC: 68Q07 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Song} and \textit{X. Zeng}, J. Membr. Comput. 3, No. 4, 296--302 (2021; Zbl 1490.68102) Full Text: DOI
Gazdag, Zsolt; Hajagos, Károly; Iván, Szabolcs On the power of P systems with active membranes using weak non-elementary membrane division. (English) Zbl 1490.68098 J. Membr. Comput. 3, No. 4, 258-269 (2021). MSC: 68Q07 68Q17 68Q25 PDFBibTeX XMLCite \textit{Z. Gazdag} et al., J. Membr. Comput. 3, No. 4, 258--269 (2021; Zbl 1490.68098) Full Text: DOI
Silva, Janio Carlos Nascimento; Souza, Uéverton S.; Ochi, Luiz Satoru Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case. (English) Zbl 1498.68107 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 380-391 (2021). MSC: 68Q06 68Q17 68Q27 PDFBibTeX XMLCite \textit{J. C. N. Silva} et al., Lect. Notes Comput. Sci. 13153, 380--391 (2021; Zbl 1498.68107) Full Text: DOI
Hong, Yi; Luo, Chuanwen; Chen, Zhibo; Wang, Xiyun; Li, Xiao Maximizing energy efficiency for charger scheduling of WRSNs. (English) Zbl 1498.68039 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 111-122 (2021). MSC: 68M18 68M20 68Q17 68R10 68W05 90C27 PDFBibTeX XMLCite \textit{Y. Hong} et al., Lect. Notes Comput. Sci. 13153, 111--122 (2021; Zbl 1498.68039) Full Text: DOI
Lu, Lingfa; Zhang, Liqi; Ou, Jinwen Single machine scheduling with rejection to minimize the weighted makespan. (English) Zbl 1498.90092 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 96-110 (2021). MSC: 90B35 68Q17 68W25 90C39 PDFBibTeX XMLCite \textit{L. Lu} et al., Lect. Notes Comput. Sci. 13153, 96--110 (2021; Zbl 1498.90092) Full Text: DOI
Harutyunyan, Hovhannes A.; Li, Zhiyuan The complexity of finding a broadcast center. (English) Zbl 1498.68204 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 57-70 (2021). MSC: 68R10 68Q17 90B18 90C35 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Lect. Notes Comput. Sci. 13153, 57--70 (2021; Zbl 1498.68204) Full Text: DOI
Evans, William; Gethner, Ellen; Spalding-Jamieson, Jack; Wolff, Alexander Angle covers: algorithms and complexity. (English) Zbl 1489.05144 J. Graph Algorithms Appl. 25, No. 2, 643-661 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{W. Evans} et al., J. Graph Algorithms Appl. 25, No. 2, 643--661 (2021; Zbl 1489.05144) Full Text: DOI
Angelini, Patrizio; Rutter, Ignaz; Sandhya, T. P. Extending partial orthogonal drawings. (English) Zbl 1489.05135 J. Graph Algorithms Appl. 25, No. 1, 581-602 (2021). MSC: 05C85 05C10 68Q17 PDFBibTeX XMLCite \textit{P. Angelini} et al., J. Graph Algorithms Appl. 25, No. 1, 581--602 (2021; Zbl 1489.05135) Full Text: DOI
Figiel, Aleksander; Himmel, Anne-Sophie; Nichterlein, André; Niedermeier, Rolf On 2-clubs in graph-based data clustering: theory and algorithm engineering. (English) Zbl 1489.05145 J. Graph Algorithms Appl. 25, No. 1, 521-547 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Figiel} et al., J. Graph Algorithms Appl. 25, No. 1, 521--547 (2021; Zbl 1489.05145) Full Text: DOI arXiv
Hertz, Alain Decycling bipartite graphs. (English) Zbl 1489.05147 J. Graph Algorithms Appl. 25, No. 1, 461-480 (2021). MSC: 05C85 05C38 68Q17 PDFBibTeX XMLCite \textit{A. Hertz}, J. Graph Algorithms Appl. 25, No. 1, 461--480 (2021; Zbl 1489.05147) Full Text: DOI
Bentert, Matthias; Weller, Mathias Tree containment with soft polytomies. (English) Zbl 1489.05136 J. Graph Algorithms Appl. 25, No. 1, 417-436 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Bentert} and \textit{M. Weller}, J. Graph Algorithms Appl. 25, No. 1, 417--436 (2021; Zbl 1489.05136) Full Text: DOI
Juedes, David W.; Jones, Jeffrey S. A generic framework for approximation analysis of greedy algorithms for star bicoloring. (English) Zbl 1490.68300 Optim. Methods Softw. 36, No. 4, 869-890 (2021). MSC: 68W25 05C15 68Q17 68R10 68W40 PDFBibTeX XMLCite \textit{D. W. Juedes} and \textit{J. S. Jones}, Optim. Methods Softw. 36, No. 4, 869--890 (2021; Zbl 1490.68300) Full Text: DOI
Könemann, Jochen; Toth, Justin; Zhou, Felix On the complexity of nucleolus computation for bipartite \(b\)-matching games. (English) Zbl 1492.91032 Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 171-185 (2021). MSC: 91A12 91A43 91A68 68Q17 PDFBibTeX XMLCite \textit{J. Könemann} et al., Lect. Notes Comput. Sci. 12885, 171--185 (2021; Zbl 1492.91032) Full Text: DOI arXiv
Gupta, Sushmita; Jain, Pallavi; Panolan, Fahad; Roy, Sanjukta; Saurabh, Saket Gerrymandering on graphs: computational complexity and parameterized algorithms. (English) Zbl 1491.91101 Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 140-155 (2021). MSC: 91F10 91B12 91A68 68Q17 PDFBibTeX XMLCite \textit{S. Gupta} et al., Lect. Notes Comput. Sci. 12885, 140--155 (2021; Zbl 1491.91101) Full Text: DOI arXiv
Massah, Maralani Elnaz; Dastmalchi, Saei Farhad; Akbarfam, Ali Asghar Jodayree; Ghanbari, Kazem Eigenvalues of fractional Sturm-Liouville problems by successive method. (English) Zbl 1513.34029 Comput. Methods Differ. Equ. 9, No. 4, 1163-1175 (2021). MSC: 34A08 34B24 34L15 34A45 33E12 PDFBibTeX XMLCite \textit{M. E. Massah} et al., Comput. Methods Differ. Equ. 9, No. 4, 1163--1175 (2021; Zbl 1513.34029) Full Text: DOI
Satirad, Akarachai; Chinram, Ronnason; Iampan, Aiyared Pythagorean fuzzy sets in UP-algebras and approximations. (English) Zbl 1484.03134 AIMS Math. 6, No. 6, 6002-6032 (2021). MSC: 03G25 06F35 PDFBibTeX XMLCite \textit{A. Satirad} et al., AIMS Math. 6, No. 6, 6002--6032 (2021; Zbl 1484.03134) Full Text: DOI
Zhu, Ling Sharp refined quadratic estimations of Shafer’s inequalities. (English) Zbl 1485.26018 AIMS Math. 6, No. 5, 5020-5027 (2021). MSC: 26D05 26D15 42A10 PDFBibTeX XMLCite \textit{L. Zhu}, AIMS Math. 6, No. 5, 5020--5027 (2021; Zbl 1485.26018) Full Text: DOI
Maji, Hemanta K.; Wang, Mingyuan Computational hardness of optimal fair computation: beyond Minicrypt. (English) Zbl 1486.94128 Malkin, Tal (ed.) et al., Advances in cryptology – CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16–20, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12826, 33-63 (2021). MSC: 94A60 68Q17 68P25 PDFBibTeX XMLCite \textit{H. K. Maji} and \textit{M. Wang}, Lect. Notes Comput. Sci. 12826, 33--63 (2021; Zbl 1486.94128) Full Text: DOI
Li, Zihan; Shu, Xiao-Bao; Miao, Tengyuan The existence of solutions for Sturm-Liouville differential equation with random impulses and boundary value problems. (English) Zbl 1496.34053 Bound. Value Probl. 2021, Paper No. 97, 23 p. (2021). MSC: 34B24 34A37 34F05 34B27 47N20 34B15 34A45 PDFBibTeX XMLCite \textit{Z. Li} et al., Bound. Value Probl. 2021, Paper No. 97, 23 p. (2021; Zbl 1496.34053) Full Text: DOI
Fogarasi, Kinga; Nagy, Benedek Notes of the NP-completeness of the membership problem of ET0L languages. (English) Zbl 1499.68161 C. R. Acad. Bulg. Sci. 74, No. 7, 964-971 (2021). Reviewer: Angela Slavova (Sofia) MSC: 68Q42 68Q10 68Q15 68Q17 68Q45 PDFBibTeX XMLCite \textit{K. Fogarasi} and \textit{B. Nagy}, C. R. Acad. Bulg. Sci. 74, No. 7, 964--971 (2021; Zbl 1499.68161) Full Text: DOI
Biswas, Aniruddha; Sarkar, Palash Separation results for Boolean function classes. (English) Zbl 1493.94070 Cryptogr. Commun. 13, No. 3, 451-458 (2021). Reviewer: Guillermo Morales Luna (Ciudad de México) MSC: 94D10 94A60 68Q17 91B14 91B12 PDFBibTeX XMLCite \textit{A. Biswas} and \textit{P. Sarkar}, Cryptogr. Commun. 13, No. 3, 451--458 (2021; Zbl 1493.94070) Full Text: DOI arXiv
Gorbachev, Vladimir Ivanovich Problems on eigenvalues for ordinary differential equations of the second order with variable coefficients. (Russian. English summary) Zbl 1494.34085 Chebyshevskiĭ Sb. 22, No. 3(79), 353-367 (2021). MSC: 34B09 34A05 34L15 34A25 34A45 PDFBibTeX XMLCite \textit{V. I. Gorbachev}, Chebyshevskiĭ Sb. 22, No. 3(79), 353--367 (2021; Zbl 1494.34085) Full Text: MNR
Brandts, Alex; Wrochna, Marcin; Živný, Stanislav The complexity of promise SAT on non-Boolean domains. (English) Zbl 1495.68157 ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021). MSC: 68R07 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Brandts} et al., ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021; Zbl 1495.68157) Full Text: DOI arXiv
Cabrera Martinez, Abel Starred Italian domination in graphs. (English) Zbl 1483.05114 Contrib. Discrete Math. 16, No. 3, 139-152 (2021). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{A. Cabrera Martinez}, Contrib. Discrete Math. 16, No. 3, 139--152 (2021; Zbl 1483.05114) Full Text: Link
Maralani, E. M.; Saei, F. D.; Akbarfam, A. A. J.; Ghanbari, K. Computation of eigenvalues of fractional Sturm-Liouville problems. (English) Zbl 07498475 Iran. J. Numer. Anal. Optim. 11, No. 1, 117-133 (2021). Reviewer: Jeffrey Neugebauer (Richmond) MSC: 34B24 34A08 34L15 34A45 PDFBibTeX XMLCite \textit{E. M. Maralani} et al., Iran. J. Numer. Anal. Optim. 11, No. 1, 117--133 (2021; Zbl 07498475) Full Text: DOI
Burke, Kyle; Ferland, Matthew; Teng, Shang-Hua Transverse wave: an impartial color-propagation game inspired by social influence and quantum NIM. (English) Zbl 1492.91064 Integers 21B, Paper A3, 30 p. (2021). Reviewer: Manjil Pratim Saikia (Cardiff) MSC: 91A46 68Q17 91A81 81P40 PDFBibTeX XMLCite \textit{K. Burke} et al., Integers 21B, Paper A3, 30 p. (2021; Zbl 1492.91064) Full Text: Link
Burke, Kyle; Ferland, Matthew; Fisher, Michael; Gledel, Valentin; Tennenhouse, Craig The game of blocking pebbles. (English) Zbl 1492.91063 Integers 21B, Paper A2, 23 p. (2021). Reviewer: Manjil Pratim Saikia (Cardiff) MSC: 91A46 05A15 68Q17 PDFBibTeX XMLCite \textit{K. Burke} et al., Integers 21B, Paper A2, 23 p. (2021; Zbl 1492.91063) Full Text: Link
Murphy, Sean; Paterson, Maura; Swart, Christine Boolean ring cryptographic equation solving. (English) Zbl 1485.94110 Dunkelman, Orr (ed.) et al., Selected areas in cryptography. 27th international conference, Halifax, NS, Canada (virtual event), October 21–23, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12804, 252-272 (2021). MSC: 94A60 16P70 13P10 68Q17 PDFBibTeX XMLCite \textit{S. Murphy} et al., Lect. Notes Comput. Sci. 12804, 252--272 (2021; Zbl 1485.94110) Full Text: DOI
Equi, Massimo; Mäkinen, Veli; Tomescu, Alexandru I. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. (English) Zbl 1490.68151 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 608-622 (2021). MSC: 68R10 68P05 68P15 68Q17 68Q25 68W32 PDFBibTeX XMLCite \textit{M. Equi} et al., Lect. Notes Comput. Sci. 12607, 608--622 (2021; Zbl 1490.68151) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Jean, Géraldine; Komusiewicz, Christian Sorting by multi-cut rearrangements. (English) Zbl 1490.68303 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 593-607 (2021). MSC: 68W32 68P10 68Q17 68Q25 68Q27 68W25 92D10 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 12607, 593--607 (2021; Zbl 1490.68303) Full Text: DOI HAL
Wagner, Dorothea; Wolf, Matthias The complexity of flow expansion and electrical flow expansion. (English) Zbl 1490.90084 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 431-441 (2021). MSC: 90B10 05C21 05C85 68Q17 68W40 90C35 94C15 PDFBibTeX XMLCite \textit{D. Wagner} and \textit{M. Wolf}, Lect. Notes Comput. Sci. 12607, 431--441 (2021; Zbl 1490.90084) Full Text: DOI Link
Misra, Neeldhara; Sethia, Aditi Fair division is hard even for amicable agents. (English) Zbl 1492.91160 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 421-430 (2021). MSC: 91B32 68Q17 PDFBibTeX XMLCite \textit{N. Misra} and \textit{A. Sethia}, Lect. Notes Comput. Sci. 12607, 421--430 (2021; Zbl 1492.91160) Full Text: DOI
Pérez-Escalona, Pedro; Rapaport, Ivan; Soto, José; Vidal, Ian The multiple traveling salesman problem on spiders. (English) Zbl 1490.90253 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 337-348 (2021). MSC: 90C27 68Q17 68W25 90C59 PDFBibTeX XMLCite \textit{P. Pérez-Escalona} et al., Lect. Notes Comput. Sci. 12607, 337--348 (2021; Zbl 1490.90253) Full Text: DOI
de Melo, Alexsander A.; de Figueiredo, Celina M. H.; Souza, Uéverton S. On the terminal connection problem. (English) Zbl 1490.68150 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 278-292 (2021). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. A. de Melo} et al., Lect. Notes Comput. Sci. 12607, 278--292 (2021; Zbl 1490.68150) Full Text: DOI
Bridoux, Florian; Gaze-Maillot, Caroline; Perrot, Kévin; Sené, Sylvain Complexity of limit-cycle problems in Boolean networks. (English) Zbl 1490.68117 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 135-146 (2021). MSC: 68Q25 37E25 37N25 68Q17 68R10 PDFBibTeX XMLCite \textit{F. Bridoux} et al., Lect. Notes Comput. Sci. 12607, 135--146 (2021; Zbl 1490.68117) Full Text: DOI arXiv
Bhore, Sujoy; Haunert, Jan-Henrik; Klute, Fabian; Li, Guangping; Nöllenburg, Martin Balanced independent and dominating sets on colored interval graphs. (English) Zbl 1490.68147 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 89-103 (2021). MSC: 68R10 05C69 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 12607, 89--103 (2021; Zbl 1490.68147) Full Text: DOI arXiv
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Štefankovič, Daniel The complexity of approximating the matching polynomial in the complex plane. (English) Zbl 1495.68163 ACM Trans. Comput. Theory 13, No. 2, Article No. 13, 37 p. (2021). MSC: 68R10 05C31 05C70 68Q17 PDFBibTeX XMLCite \textit{I. Bezáková} et al., ACM Trans. Comput. Theory 13, No. 2, Article No. 13, 37 p. (2021; Zbl 1495.68163) Full Text: DOI arXiv Link
Fomin, Fedor V.; Lokshtanov, Daniel; Mihajlin, Ivan; Saurabh, Saket; Zehavi, Meirav Computation of Hadwiger number and related contraction problems. Tight lower bounds. (English) Zbl 1495.68169 ACM Trans. Comput. Theory 13, No. 2, Article No. 10, 25 p. (2021). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Comput. Theory 13, No. 2, Article No. 10, 25 p. (2021; Zbl 1495.68169) Full Text: DOI arXiv
Gupta, Sushmita; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav Popular matching in roommates setting is NP-hard. (English) Zbl 1495.68093 ACM Trans. Comput. Theory 13, No. 2, Article No. 9, 20 p. (2021). MSC: 68Q17 05C70 91B68 PDFBibTeX XMLCite \textit{S. Gupta} et al., ACM Trans. Comput. Theory 13, No. 2, Article No. 9, 20 p. (2021; Zbl 1495.68093) Full Text: DOI arXiv
Goles, Eric; Montealegre, Pedro; Ríos Wilson, Martín; Theyssier, Guillaume On the impact of treewidth in the computational complexity of freezing dynamics. (English) Zbl 07495174 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 260-272 (2021). MSC: 68Q45 37B10 68Q06 68Q17 68Q25 68W10 PDFBibTeX XMLCite \textit{E. Goles} et al., Lect. Notes Comput. Sci. 12813, 260--272 (2021; Zbl 07495174) Full Text: DOI arXiv
Halldórsson, Magnús M.; Kortsarz, Guy; Cygan, Marek Tight bounds on subexponential time approximation of set cover and related problems. (English) Zbl 07495125 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 18th international workshop, WAOA 2020, virtual event, September 9–10, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12806, 159-173 (2021). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Lect. Notes Comput. Sci. 12806, 159--173 (2021; Zbl 07495125) Full Text: DOI arXiv
Tredup, Ronny Synthesis of Petri nets with restricted place-environments: classical and parameterized. (English) Zbl 1489.68169 Buchs, Didier (ed.) et al., Application and theory of Petri nets and concurrency. 42nd international conference, PETRI NETS 2021, virtual event, June 23–25, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12734, 292-311 (2021). MSC: 68Q85 68Q17 PDFBibTeX XMLCite \textit{R. Tredup}, Lect. Notes Comput. Sci. 12734, 292--311 (2021; Zbl 1489.68169) Full Text: DOI
Tredup, Ronny Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable. (English) Zbl 1489.68168 Buchs, Didier (ed.) et al., Application and theory of Petri nets and concurrency. 42nd international conference, PETRI NETS 2021, virtual event, June 23–25, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12734, 253-273 (2021). MSC: 68Q85 68Q17 PDFBibTeX XMLCite \textit{R. Tredup}, Lect. Notes Comput. Sci. 12734, 253--273 (2021; Zbl 1489.68168) Full Text: DOI
Paiva, Thales Bandiera; Terada, Routo Cryptanalysis of the binary permuted kernel problem. (English) Zbl 1497.94110 Sako, Kazue (ed.) et al., Applied cryptography and network security. 19th international conference, ACNS 2021, Kamakura, Japan, June 21–24, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12727, 396-423 (2021). MSC: 94A60 81P94 11Y16 68P25 68Q17 PDFBibTeX XMLCite \textit{T. B. Paiva} and \textit{R. Terada}, Lect. Notes Comput. Sci. 12727, 396--423 (2021; Zbl 1497.94110) Full Text: DOI
Ambainis, Andris; Kokainis, Martins; Prūsis, Krišjānis; Vihrovs, Jevgēnijs; Zajakins, Aleksejs All classical adversary methods are equivalent for total functions. (English) Zbl 1487.68118 ACM Trans. Comput. Theory 13, No. 1, Article No. 7, 20 p. (2021). MSC: 68Q17 68Q11 68Q30 PDFBibTeX XMLCite \textit{A. Ambainis} et al., ACM Trans. Comput. Theory 13, No. 1, Article No. 7, 20 p. (2021; Zbl 1487.68118) Full Text: DOI Link
Itsykson, Dmitry; Okhotin, Alexander; Oparin, Vsevolod Computational and proof complexity of partial string avoidability. (English) Zbl 1495.68094 ACM Trans. Comput. Theory 13, No. 1, Article No. 6, 25 p. (2021). MSC: 68Q17 03F20 68Q25 68R15 PDFBibTeX XMLCite \textit{D. Itsykson} et al., ACM Trans. Comput. Theory 13, No. 1, Article No. 6, 25 p. (2021; Zbl 1495.68094) Full Text: DOI Link
Kretschmer, William Lower bounding the AND-OR tree via symmetrization. (English) Zbl 1495.68095 ACM Trans. Comput. Theory 13, No. 1, Article No. 3, 11 p. (2021). MSC: 68Q17 68Q12 PDFBibTeX XMLCite \textit{W. Kretschmer}, ACM Trans. Comput. Theory 13, No. 1, Article No. 3, 11 p. (2021; Zbl 1495.68095) Full Text: DOI arXiv
Jonsson, Peter; Lagerkvist, Victor; Roy, Biman Fine-grained time complexity of constraint satisfaction problems. (English) Zbl 1495.68101 ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021). MSC: 68Q25 08A70 68Q15 68Q17 68Q27 68T20 PDFBibTeX XMLCite \textit{P. Jonsson} et al., ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021; Zbl 1495.68101) Full Text: DOI Link
Wein, Alexander S. Optimal low-degree hardness of maximum independent set. (English) Zbl 07488304 Math. Stat. Learn. 4, No. 3-4, 221-251 (2021). MSC: 68R10 05C69 05C80 05C85 68Q17 PDFBibTeX XMLCite \textit{A. S. Wein}, Math. Stat. Learn. 4, No. 3--4, 221--251 (2021; Zbl 07488304) Full Text: DOI arXiv
Martinovic, J.; Selch, M. Mathematical models and approximate solution approaches for the stochastic bin packing problem. (English) Zbl 1511.90355 Comput. Oper. Res. 135, Article ID 105439, 19 p. (2021). MSC: 90C27 90C15 90C59 PDFBibTeX XMLCite \textit{J. Martinovic} and \textit{M. Selch}, Comput. Oper. Res. 135, Article ID 105439, 19 p. (2021; Zbl 1511.90355) Full Text: DOI
Adamson, Duncan; Deligkas, Argyrios; Gusev, Vladimir; Potapov, Igor On the hardness of energy minimisation for crystal structure prediction. (English) Zbl 1515.82140 Fundam. Inform. 184, No. 3, 181-203 (2021). MSC: 82D25 05C10 05C22 05C90 68Q17 92E10 PDFBibTeX XMLCite \textit{D. Adamson} et al., Fundam. Inform. 184, No. 3, 181--203 (2021; Zbl 1515.82140) Full Text: DOI
Areces, Carlos; van Ditmarsch, Hans; Fervari, Raul; Maubert, Bastien; Schwarzentruber, François Copy and remove as dynamic operators. (English) Zbl 1515.03086 J. Appl. Non-Class. Log. 31, No. 3-4, 181-220 (2021). MSC: 03B45 03B42 03D15 68Q17 PDFBibTeX XMLCite \textit{C. Areces} et al., J. Appl. Non-Class. Log. 31, No. 3--4, 181--220 (2021; Zbl 1515.03086) Full Text: DOI
Kordestani, Javidan Kazemi; Mirsaleh, Mehdi Razapoor; Rezvanian, Alireza; Meybodi, Mohammad Reza The applications of object migration automaton (OMA)-memetic algorithm for solving NP-hard problems. (English) Zbl 1485.68221 Kordestani, Javidan Kazemi (ed.) et al., Advances in learning automata and intelligent optimization. Cham: Springer. Intell. Syst. Ref. Libr. 208, 195-252 (2021). MSC: 68T05 68Q17 68Q45 68R10 68T20 68W50 PDFBibTeX XMLCite \textit{J. K. Kordestani} et al., Intell. Syst. Ref. Libr. 208, 195--252 (2021; Zbl 1485.68221) Full Text: DOI
Kordestani, Javidan Kazemi; Mirsaleh, Mehdi Razapoor; Rezvanian, Alireza; Meybodi, Mohammad Reza A memetic model based on fixed structure learning automata for solving NP-hard problems. (English) Zbl 1485.68220 Kordestani, Javidan Kazemi (ed.) et al., Advances in learning automata and intelligent optimization. Cham: Springer. Intell. Syst. Ref. Libr. 208, 159-193 (2021). MSC: 68T05 68Q17 68Q45 68T20 68W50 PDFBibTeX XMLCite \textit{J. K. Kordestani} et al., Intell. Syst. Ref. Libr. 208, 159--193 (2021; Zbl 1485.68220) Full Text: DOI
Ajeena, Ruma Kareem K. The soft graphic integer sub-decomposition method for elliptic scalar multiplication. (English) Zbl 1483.94029 J. Discrete Math. Sci. Cryptography 24, No. 6, 1751-1765 (2021). MSC: 94A60 14H52 05C99 68Q17 PDFBibTeX XMLCite \textit{R. K. K. Ajeena}, J. Discrete Math. Sci. Cryptography 24, No. 6, 1751--1765 (2021; Zbl 1483.94029) Full Text: DOI
Dhaigude, D. B.; Gore, V. S.; Kanade, S. N. Existence result for system of fractional differential equations with nonlinear boundary conditions. (English) Zbl 1516.34012 Dyn. Contin. Discrete Impuls. Syst., Ser. B, Appl. Algorithms 28, No. 4, 231-243 (2021). Reviewer: Fatima Zohra Berrabah (Sidi Bel Abbès) MSC: 34A08 34B15 34A45 PDFBibTeX XMLCite \textit{D. B. Dhaigude} et al., Dyn. Contin. Discrete Impuls. Syst., Ser. B, Appl. Algorithms 28, No. 4, 231--243 (2021; Zbl 1516.34012) Full Text: Link
Brakensiek, Joshua; Guruswami, Venkatesan The quest for strong inapproximability results with perfect completeness. (English) Zbl 07475107 ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021). MSC: 68Q17 05C15 05C65 68R07 68W25 PDFBibTeX XMLCite \textit{J. Brakensiek} and \textit{V. Guruswami}, ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021; Zbl 07475107) Full Text: DOI Link
Bringmann, Karl; Künnemann, Marvin; Nusser, André Discrete Fréchet distance under translation. Conditional hardness and an improved algorithm. (English) Zbl 07475105 ACM Trans. Algorithms 17, No. 3, Article No. 25, 42 p. (2021). MSC: 68U05 68Q17 68R10 PDFBibTeX XMLCite \textit{K. Bringmann} et al., ACM Trans. Algorithms 17, No. 3, Article No. 25, 42 p. (2021; Zbl 07475105) Full Text: DOI arXiv
Oliveira, Igor C.; Pich, Ján; Santhanam, Rahul Hardness magnification near state-of-the-art lower bounds. (English) Zbl 1496.68156 Theory Comput. 17, Paper No. 11, 38 p. (2021). MSC: 68Q17 68Q06 68Q30 PDFBibTeX XMLCite \textit{I. C. Oliveira} et al., Theory Comput. 17, Paper No. 11, 38 p. (2021; Zbl 1496.68156) Full Text: DOI