Deme, Chérif Bachir; Diaw, Mame Abdou; Fall, Oumar; Ba, Alhousseynou; Diankha, Oumar Some methods to design interleaved sequences over \(\mathbb{F}_2\). (English) Zbl 07523014 JP J. Algebra Number Theory Appl. 53, No. 1, 85-108 (2022). MSC: 11B50 11B85 11Y16 PDF BibTeX XML Cite \textit{C. B. Deme} et al., JP J. Algebra Number Theory Appl. 53, No. 1, 85--108 (2022; Zbl 07523014) Full Text: DOI OpenURL
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip Faster minimization of tardy processing time on a single machine. (English) Zbl 07517138 Algorithmica 84, No. 5, 1341-1356 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 84, No. 5, 1341--1356 (2022; Zbl 07517138) Full Text: DOI OpenURL
Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasi-polynomial time. (English) Zbl 07516621 SIAM J. Comput. 51, No. 2, STOC17-152-STOC17-188 (2022). MSC: 68Q25 68Q70 PDF BibTeX XML Cite \textit{C. S. Calude} et al., SIAM J. Comput. 51, No. 2, STOC17--152-STOC17--188 (2022; Zbl 07516621) Full Text: DOI OpenURL
Tu, Jianhua; Zhang, Lei; Du, Junfeng; Lang, Rongling Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree. (English) Zbl 07512915 AIMS Math. 7, No. 1, 569-578 (2022). MSC: 05C85 05C05 05C69 PDF BibTeX XML Cite \textit{J. Tu} et al., AIMS Math. 7, No. 1, 569--578 (2022; Zbl 07512915) Full Text: DOI OpenURL
Li, Xu; Kateb, Faris; Wu, Shaofei Adoption of fractional differential equations under improved variational iterative algorithm combined with DNA coding algorithm in image encryption. (English) Zbl 07507546 Fractals 30, No. 2, Article ID 2240062, 11 p. (2022). MSC: 35-XX 65Mxx PDF BibTeX XML Cite \textit{X. Li} et al., Fractals 30, No. 2, Article ID 2240062, 11 p. (2022; Zbl 07507546) Full Text: DOI OpenURL
Yuan, Yuan; Lan, Yan; Ding, Ning; Han, Xin A PTAS for non-resumable open shop scheduling with an availability constraint. (English) Zbl 07507002 J. Comb. Optim. 43, No. 2, 350-362 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{Y. Yuan} et al., J. Comb. Optim. 43, No. 2, 350--362 (2022; Zbl 07507002) Full Text: DOI OpenURL
Chen, Yu-Ao; Gao, Xiao-Shan Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems. (English) Zbl 1483.68137 J. Syst. Sci. Complex. 35, No. 1, 373-412 (2022). MSC: 68Q12 81P94 94A60 PDF BibTeX XML Cite \textit{Y.-A. Chen} and \textit{X.-S. Gao}, J. Syst. Sci. Complex. 35, No. 1, 373--412 (2022; Zbl 1483.68137) Full Text: DOI OpenURL
Harvey, David; van der Hoeven, Joris Polynomial multiplication over finite fields in time \(O(n\log n)\). (English) Zbl 07500718 J. ACM 69, No. 2, Article No. 12, 40 p. (2022). MSC: 68-XX PDF BibTeX XML Cite \textit{D. Harvey} and \textit{J. van der Hoeven}, J. ACM 69, No. 2, Article No. 12, 40 p. (2022; Zbl 07500718) Full Text: DOI OpenURL
Abbaas, Omar; Ventura, Jose A. A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network. (English) Zbl 07500341 Optim. Lett. 16, No. 3, 953-982 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{O. Abbaas} and \textit{J. A. Ventura}, Optim. Lett. 16, No. 3, 953--982 (2022; Zbl 07500341) Full Text: DOI OpenURL
Kobayashi, Yusuke Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles. (English) Zbl 07495435 Math. Program. 192, No. 1-2 (B), 675-702 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{Y. Kobayashi}, Math. Program. 192, No. 1--2 (B), 675--702 (2022; Zbl 07495435) Full Text: DOI OpenURL
Del Pia, Alberto; Michini, Carla Short simplex paths in lattice polytopes. (English) Zbl 07493733 Discrete Comput. Geom. 67, No. 2, 503-524 (2022). MSC: 90C05 52B20 52B05 PDF BibTeX XML Cite \textit{A. Del Pia} and \textit{C. Michini}, Discrete Comput. Geom. 67, No. 2, 503--524 (2022; Zbl 07493733) Full Text: DOI arXiv OpenURL
Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 07487823 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 07487823) Full Text: DOI OpenURL
Darvay, Zsolt; Illés, Tibor; Rigó, Petra Renáta Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique. (English) Zbl 07478879 Eur. J. Oper. Res. 298, No. 1, 25-35 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{Z. Darvay} et al., Eur. J. Oper. Res. 298, No. 1, 25--35 (2022; Zbl 07478879) Full Text: DOI OpenURL
Mustafa, Nabil H. Sampling in combinatorial and geometric set systems. (English) Zbl 07478425 Mathematical Surveys and Monographs 265. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-6156-0/pbk; 978-1-4704-6873-6/ebook). xv, 251 p. (2022). MSC: 68-02 05-02 52-02 62-02 60-02 68Q87 52C45 05D40 03D32 11K38 PDF BibTeX XML Cite \textit{N. H. Mustafa}, Sampling in combinatorial and geometric set systems. Providence, RI: American Mathematical Society (AMS) (2022; Zbl 07478425) Full Text: DOI OpenURL
Mook, Ethan; Peikert, Chris Lattice (list) decoding near Minkowski’s inequality. (English) Zbl 07475729 IEEE Trans. Inf. Theory 68, No. 2, 863-870 (2022). MSC: 94B35 11H06 94B75 11H71 PDF BibTeX XML Cite \textit{E. Mook} and \textit{C. Peikert}, IEEE Trans. Inf. Theory 68, No. 2, 863--870 (2022; Zbl 07475729) Full Text: DOI arXiv OpenURL
Nip, Kameng; Shi, Tianning; Wang, Zhenbo Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 07473269 J. Comb. Optim. 43, No. 1, 200-225 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{K. Nip} et al., J. Comb. Optim. 43, No. 1, 200--225 (2022; Zbl 07473269) Full Text: DOI OpenURL
Kim, Eun Jung; Milanič, Martin; Monnot, Jérôme; Picouleau, Christophe Complexity and algorithms for constant diameter augmentation problems. (English) Zbl 07467461 Theor. Comput. Sci. 904, 15-26 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. J. Kim} et al., Theor. Comput. Sci. 904, 15--26 (2022; Zbl 07467461) Full Text: DOI arXiv OpenURL
Nattino, Giovanni; Song, Chi; Lu, Bo Polymatching algorithm in observational studies with multiple treatment groups. (English) Zbl 07464462 Comput. Stat. Data Anal. 167, Article ID 107364, 14 p. (2022). MSC: 62-XX PDF BibTeX XML Cite \textit{G. Nattino} et al., Comput. Stat. Data Anal. 167, Article ID 107364, 14 p. (2022; Zbl 07464462) Full Text: DOI OpenURL
Slaoui, Yousri Moderate deviation principles for nonparametric recursive distribution estimators using Bernstein polynomials. (English) Zbl 07464329 Rev. Mat. Complut. 35, No. 1, 147-158 (2022). MSC: 62G07 62L20 60F10 PDF BibTeX XML Cite \textit{Y. Slaoui}, Rev. Mat. Complut. 35, No. 1, 147--158 (2022; Zbl 07464329) Full Text: DOI OpenURL
Elbassioni, Khaled Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs. (English) Zbl 07458785 Theor. Comput. Sci. 902, 64-75 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Elbassioni}, Theor. Comput. Sci. 902, 64--75 (2022; Zbl 07458785) Full Text: DOI arXiv OpenURL
Besner, Manfred Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations. (English) Zbl 1480.91018 Discrete Appl. Math. 309, 85-109 (2022). MSC: 91A12 91A68 PDF BibTeX XML Cite \textit{M. Besner}, Discrete Appl. Math. 309, 85--109 (2022; Zbl 1480.91018) Full Text: DOI OpenURL
Barbero, Stefano; Bellini, Emanuele; Sanna, Carlo; Verbel, Javier Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. (English) Zbl 07456377 Discrete Appl. Math. 309, 13-31 (2022). MSC: 68Wxx 11T06 11Y16 94D10 68Q25 PDF BibTeX XML Cite \textit{S. Barbero} et al., Discrete Appl. Math. 309, 13--31 (2022; Zbl 07456377) Full Text: DOI OpenURL
Manlove, David; Milne, Duncan; Olaosebikan, Sofiat Student-project allocation with preferences over projects: algorithmic and experimental results. (English) Zbl 1483.90140 Discrete Appl. Math. 308, 220-234 (2022). MSC: 90C27 91B32 PDF BibTeX XML Cite \textit{D. Manlove} et al., Discrete Appl. Math. 308, 220--234 (2022; Zbl 1483.90140) Full Text: DOI OpenURL
Mao, Yanwen; Mitra, Aritra; Sundaram, Shreyas; Tabuada, Paulo On the computational complexity of the secure state-reconstruction problem. (English) Zbl 1480.93045 Automatica 136, Article ID 110083, 11 p. (2022). MSC: 93B07 93B70 93C83 93C55 93C05 68Q17 PDF BibTeX XML Cite \textit{Y. Mao} et al., Automatica 136, Article ID 110083, 11 p. (2022; Zbl 1480.93045) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI OpenURL
Shabtay, Dvir Single-machine scheduling with machine unavailability periods and resource dependent processing times. (English) Zbl 07422936 Eur. J. Oper. Res. 296, No. 2, 423-439 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Shabtay}, Eur. J. Oper. Res. 296, No. 2, 423--439 (2022; Zbl 07422936) Full Text: DOI OpenURL
Harrison, Gavin; Johnson, Jeremy; Saunders, B. David Probabilistic analysis of block Wiedemann for leading invariant factors. (English) Zbl 1478.15050 J. Symb. Comput. 108, 98-116 (2022). Reviewer: Viktor Ohanyan (Erevan) MSC: 15B52 15B33 15A20 15A15 60D05 PDF BibTeX XML Cite \textit{G. Harrison} et al., J. Symb. Comput. 108, 98--116 (2022; Zbl 1478.15050) Full Text: DOI OpenURL
Evtushenko, Yuri; Szkatuła, Krzysztof; Tretyakov, Alexey A locally polynomial method for solving a system of linear inequalities. (English) Zbl 07504934 Control Cybern. 50, No. 2, 301-314 (2021). MSC: 90C05 PDF BibTeX XML Cite \textit{Y. Evtushenko} et al., Control Cybern. 50, No. 2, 301--314 (2021; Zbl 07504934) OpenURL
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI OpenURL
Alecu, Bogdan; Atminas, Aistis; Lozin, Vadim; Malyshev, Dmitriy Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07495013 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, 49-62 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{B. Alecu} et al., Lect. Notes Comput. Sci. 12757, 49--62 (2021; Zbl 07495013) Full Text: DOI arXiv OpenURL
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: 68Q87 PDF BibTeX XML Cite \textit{A. S. Wein}, Math. Stat. Learn. 4, No. 3--4, 221--251 (2021; Zbl 07488304) Full Text: DOI arXiv OpenURL
Averbakh, Igor The pairwise flowtime network construction problem. (English) Zbl 07487751 Oper. Res. Lett. 49, No. 6, 902-907 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{I. Averbakh}, Oper. Res. Lett. 49, No. 6, 902--907 (2021; Zbl 07487751) Full Text: DOI arXiv OpenURL
Malekian, Yaser; Mirmohammadi, S. Hamid; Bijari, Mehdi Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. (English) Zbl 07486214 Comput. Oper. Res. 134, Article ID 105373, 14 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Malekian} et al., Comput. Oper. Res. 134, Article ID 105373, 14 p. (2021; Zbl 07486214) Full Text: DOI OpenURL
Fajardo, William Right Buchberger algorithm over bijective skew PBW extensions. (English) Zbl 07485821 Fundam. Inform. 184, No. 2, 83-105 (2021). MSC: 16Z05 16S36 PDF BibTeX XML Cite \textit{W. Fajardo}, Fundam. Inform. 184, No. 2, 83--105 (2021; Zbl 07485821) Full Text: DOI arXiv OpenURL
Badri, Hossein; Bahreini, Tayebeh; Grosu, Daniel A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times. (English) Zbl 07485260 Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{H. Badri} et al., Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021; Zbl 07485260) Full Text: DOI OpenURL
Czabarka, Éva; Székely, László; Toroczkai, Zoltán; Walker, Shanise An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem. (English) Zbl 1479.05350 Algebr. Stat. 12, No. 2, 115-124 (2021). MSC: 05D15 05C82 05D40 68W20 PDF BibTeX XML Cite \textit{É. Czabarka} et al., Algebr. Stat. 12, No. 2, 115--124 (2021; Zbl 1479.05350) Full Text: DOI arXiv OpenURL
Timofte, Vlad; Timofte, Aida On algorithms testing positivity of real symmetric polynomials. (English) Zbl 07465113 J. Inequal. Appl. 2021, Paper No. 135, 22 p. (2021). MSC: 03C10 14Q15 68W30 PDF BibTeX XML Cite \textit{V. Timofte} and \textit{A. Timofte}, J. Inequal. Appl. 2021, Paper No. 135, 22 p. (2021; Zbl 07465113) Full Text: DOI OpenURL
Selezneva, Svetlana N. Multiaffine polynomials over a finite field. (English. Russian original) Zbl 07452435 Discrete Math. Appl. 31, No. 6, 421-430 (2021); translation from Diskretn. Mat. 32, No. 3, 85-97 (2020). MSC: 68Q25 06E30 11T06 PDF BibTeX XML Cite \textit{S. N. Selezneva}, Discrete Math. Appl. 31, No. 6, 421--430 (2021; Zbl 07452435); translation from Diskretn. Mat. 32, No. 3, 85--97 (2020) Full Text: DOI OpenURL
Schaller, David; Geiß, Manuela; Hellmuth, Marc; Stadler, Peter F. Best match graphs with binary trees. (English) Zbl 1480.92153 Martín-Vide, Carlos (ed.) et al., Algorithms for computational biology. 8th international conference, AlCoB 2021, Missoula, MT, USA, June 7–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12715, 82-93 (2021). MSC: 92D15 05C90 PDF BibTeX XML Cite \textit{D. Schaller} et al., Lect. Notes Comput. Sci. 12715, 82--93 (2021; Zbl 1480.92153) Full Text: DOI arXiv OpenURL
Yang, Ya-Guang An interior-point algorithm for linear programming with optimal selection of centering parameter and step size. (English) Zbl 07443750 J. Oper. Res. Soc. China 9, No. 3, 659-671 (2021). MSC: 90C05 90C51 PDF BibTeX XML Cite \textit{Y.-G. Yang}, J. Oper. Res. Soc. China 9, No. 3, 659--671 (2021; Zbl 07443750) Full Text: DOI arXiv OpenURL
Khalife, Sammy Sequence graphs: characterization and counting of admissible elements. (English) Zbl 1479.05231 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 209-221 (2021). MSC: 05C62 05C75 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Khalife}, AIRO Springer Ser. 5, 209--221 (2021; Zbl 1479.05231) Full Text: DOI OpenURL
Lee, Joon-Woo; Lee, Eunsang; Lee, Yongwoo; Kim, Young-Sik; No, Jong-Seon High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. (English) Zbl 1479.94208 Canteaut, Anne (ed.) et al., Advances in cryptology – EUROCRYPT 2021. 40th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, October 17–21, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12696, 618-647 (2021). MSC: 94A60 PDF BibTeX XML Cite \textit{J.-W. Lee} et al., Lect. Notes Comput. Sci. 12696, 618--647 (2021; Zbl 1479.94208) Full Text: DOI OpenURL
Pradhan, D.; Pal, Saikat An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph. (English) Zbl 1475.05139 J. Appl. Math. Comput. 66, No. 1-2, 733-747 (2021). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{S. Pal}, J. Appl. Math. Comput. 66, No. 1--2, 733--747 (2021; Zbl 1475.05139) Full Text: DOI OpenURL
Naresh Kumar, H.; Pradhan, D.; Venkatakrishnan, Y. B. Double vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1475.05134 J. Appl. Math. Comput. 66, No. 1-2, 245-262 (2021). MSC: 05C69 68Q25 68Q17 PDF BibTeX XML Cite \textit{H. Naresh Kumar} et al., J. Appl. Math. Comput. 66, No. 1--2, 245--262 (2021; Zbl 1475.05134) Full Text: DOI OpenURL
Drucker, Nir; Gueron, Shay; Kostic, Dusan Fast polynomial inversion for post quantum QC-MDPC cryptography. (English) Zbl 07433319 Inf. Comput. 281, Article ID 104799, 21 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Drucker} et al., Inf. Comput. 281, Article ID 104799, 21 p. (2021; Zbl 07433319) Full Text: DOI OpenURL
Dang, Rongqi; Chen, Yiming Fractional modelling and numerical simulations of variable-Section viscoelastic arches. (English) Zbl 07425005 Appl. Math. Comput. 409, Article ID 126376, 15 p. (2021). MSC: 26Axx 65Lxx 34Axx 65Mxx 35Rxx PDF BibTeX XML Cite \textit{R. Dang} and \textit{Y. Chen}, Appl. Math. Comput. 409, Article ID 126376, 15 p. (2021; Zbl 07425005) Full Text: DOI OpenURL
Liu, Long-Cheng; Gao, Han; Li, Chao Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance. (English) Zbl 07421476 J. Oper. Res. Soc. China 9, No. 2, 465-474 (2021). MSC: 05C21 68Q25 90B10 90C27 PDF BibTeX XML Cite \textit{L.-C. Liu} et al., J. Oper. Res. Soc. China 9, No. 2, 465--474 (2021; Zbl 07421476) Full Text: DOI OpenURL
Wang, Cailu; Tao, Yuegang Matrix representation of formal polynomials over max-plus algebra. (English) Zbl 1481.15029 J. Algebra Appl. 20, No. 11, Article ID 2150216, 27 p. (2021). Reviewer: P. Shakila Banu (Erode) MSC: 15A80 15A23 15A21 12D05 PDF BibTeX XML Cite \textit{C. Wang} and \textit{Y. Tao}, J. Algebra Appl. 20, No. 11, Article ID 2150216, 27 p. (2021; Zbl 1481.15029) Full Text: DOI OpenURL
van der Hoeven, Joris; Lecerf, Grégoire Fast amortized multi-point evaluation. (English) Zbl 07418851 J. Complexity 67, Article ID 101574, 15 p. (2021). MSC: 68Wxx 68Qxx 13Pxx PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, J. Complexity 67, Article ID 101574, 15 p. (2021; Zbl 07418851) Full Text: DOI OpenURL
Garg, Jugal; Taki, Setareh An improved approximation algorithm for maximin shares. (English) Zbl 07418691 Artif. Intell. 300, Article ID 103547, 24 p. (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{J. Garg} and \textit{S. Taki}, Artif. Intell. 300, Article ID 103547, 24 p. (2021; Zbl 07418691) Full Text: DOI arXiv OpenURL
Pérez, Claudia; Rivera, Daniel Polynomial-time classification of skew-symmetrizable matrices with a positive definite quasi-Cartan companion. (English) Zbl 07413823 Fundam. Inform. 181, No. 4, 313-337 (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{C. Pérez} and \textit{D. Rivera}, Fundam. Inform. 181, No. 4, 313--337 (2021; Zbl 07413823) Full Text: DOI OpenURL
Cameron, Kathie A parity theorem about trees with specified degrees. (English) Zbl 1475.05100 Discrete Appl. Math. 305, 48-55 (2021). MSC: 05C45 05C05 05C30 68R10 PDF BibTeX XML Cite \textit{K. Cameron}, Discrete Appl. Math. 305, 48--55 (2021; Zbl 1475.05100) Full Text: DOI OpenURL
Hashemi, Amir; Javanbakht, Masoumeh On the construction of staggered linear bases. (English) Zbl 1479.13033 J. Algebra Appl. 20, No. 8, Article ID 2150132, 20 p. (2021). Reviewer: Michela Ceria (Bari) MSC: 13P10 68W30 PDF BibTeX XML Cite \textit{A. Hashemi} and \textit{M. Javanbakht}, J. Algebra Appl. 20, No. 8, Article ID 2150132, 20 p. (2021; Zbl 1479.13033) Full Text: DOI OpenURL
Brustenga i Moncusí, Laura; Masuti, Shreedevi K. The Waring rank of binary binomial forms. (English) Zbl 07411001 Pac. J. Math. 313, No. 2, 327-342 (2021). MSC: 14N07 13F20 11P05 PDF BibTeX XML Cite \textit{L. Brustenga i Moncusí} and \textit{S. K. Masuti}, Pac. J. Math. 313, No. 2, 327--342 (2021; Zbl 07411001) Full Text: DOI arXiv OpenURL
Gravel, Claude; Panario, Daniel; Rigault, Bastien Finding linearly generated subsequences. (English) Zbl 07405941 Bajard, Jean Claude (ed.) et al., Arithmetic of finite fields. 8th international workshop, WAIFI 2020, Rennes, France, July 6–8, 2020. Revised selected and invited papers. Cham: Springer. Lect. Notes Comput. Sci. 12542, 174-192 (2021). MSC: 65F40 15B05 15A15 15B33 94A55 PDF BibTeX XML Cite \textit{C. Gravel} et al., Lect. Notes Comput. Sci. 12542, 174--192 (2021; Zbl 07405941) Full Text: DOI arXiv OpenURL
Xiong, Wei; Song, Sulin; Lai, Hong-Jian Polynomially determine if a graph is \((s,3)\)-supereulerian. (English) Zbl 1473.05158 Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021). MSC: 05C45 05C85 PDF BibTeX XML Cite \textit{W. Xiong} et al., Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021; Zbl 1473.05158) Full Text: DOI OpenURL
Gong, Xiaoyu; Ding, Xuefeng; Wang, Xianjia A new method for \({P_*}(\kappa)\) horizontal linear complementarity problem based on full Newton step. (Chinese. English summary) Zbl 07404430 Math. Pract. Theory 51, No. 7, 206-212 (2021). MSC: 90C33 90C51 PDF BibTeX XML Cite \textit{X. Gong} et al., Math. Pract. Theory 51, No. 7, 206--212 (2021; Zbl 07404430) OpenURL
Lei, Lin; Li, Xiaoli; He, Chengyuan Properties for \(r\)-H-circulant matrices and polynomial algorithm of their inverse. (Chinese. English summary) Zbl 07404132 J. Shandong Univ., Nat. Sci. 56, No. 4, 102-110 (2021). MSC: 15A09 65F99 PDF BibTeX XML Cite \textit{L. Lei} et al., J. Shandong Univ., Nat. Sci. 56, No. 4, 102--110 (2021; Zbl 07404132) Full Text: DOI OpenURL
Tao, Yujie; Li, Yanhong; Sun, Gang Genetic algorithm based on Bernstein polynomial for constructing forward neural network. (Chinese. English summary) Zbl 07403991 J. Jilin Univ., Sci. 59, No. 2, 233-240 (2021). MSC: 68T20 68T07 68W50 PDF BibTeX XML Cite \textit{Y. Tao} et al., J. Jilin Univ., Sci. 59, No. 2, 233--240 (2021; Zbl 07403991) Full Text: DOI OpenURL
Brüdern, J.; Soundararajan, K. Common divisors of totients of polynomial sequences. (English) Zbl 1482.11127 Math. Z. 299, No. 1-2, 527-542 (2021). Reviewer: Florian Luca (Johannesburg) MSC: 11N32 11N35 11A05 PDF BibTeX XML Cite \textit{J. Brüdern} and \textit{K. Soundararajan}, Math. Z. 299, No. 1--2, 527--542 (2021; Zbl 1482.11127) Full Text: DOI arXiv OpenURL
Aliakbari, Mina; Geunes, Joseph; Sullivan, Kelly M. The single train shortest route problem in a railyard. (English) Zbl 1477.90115 Optim. Lett. 15, No. 8, 2577-2595 (2021). MSC: 90C35 90B06 PDF BibTeX XML Cite \textit{M. Aliakbari} et al., Optim. Lett. 15, No. 8, 2577--2595 (2021; Zbl 1477.90115) Full Text: DOI OpenURL
Kurita, Kazuhiro; Wasa, Kunihiro; Arimura, Hiroki; Uno, Takeaki Efficient enumeration of dominating sets for sparse graphs. (English) Zbl 1472.05073 Discrete Appl. Math. 303, 283-295 (2021). MSC: 05C30 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{K. Kurita} et al., Discrete Appl. Math. 303, 283--295 (2021; Zbl 1472.05073) Full Text: DOI arXiv OpenURL
Komusiewicz, Christian; Sommer, Frank Enumerating connected induced subgraphs: improved delay and experimental comparison. (English) Zbl 1478.05075 Discrete Appl. Math. 303, 262-282 (2021). Reviewer: Andrea Svob (Rijeka) MSC: 05C30 05C60 05C85 PDF BibTeX XML Cite \textit{C. Komusiewicz} and \textit{F. Sommer}, Discrete Appl. Math. 303, 262--282 (2021; Zbl 1478.05075) Full Text: DOI OpenURL
Ophelders, Tim; Lambers, Roel; Spieksma, Frits C. R.; Vredeveld, Tjark A note on equitable Hamiltonian cycles. (English) Zbl 1472.05090 Discrete Appl. Math. 303, 127-136 (2021). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{T. Ophelders} et al., Discrete Appl. Math. 303, 127--136 (2021; Zbl 1472.05090) Full Text: DOI OpenURL
Li, Ruonan Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result. (English) Zbl 1472.05055 Discrete Math. 344, No. 11, Article ID 112573, 10 p. (2021). MSC: 05C15 05C38 05C85 PDF BibTeX XML Cite \textit{R. Li}, Discrete Math. 344, No. 11, Article ID 112573, 10 p. (2021; Zbl 1472.05055) Full Text: DOI OpenURL
Granger, Robert; Kleinjung, Thorsten; Lenstra, Arjen K.; Wesolowski, Benjamin; Zumbrägel, Jens Computation of a 30750-bit binary field discrete logarithm. (English) Zbl 1472.11319 Math. Comput. 90, No. 332, 2997-3022 (2021). MSC: 11Y16 11T71 94A60 PDF BibTeX XML Cite \textit{R. Granger} et al., Math. Comput. 90, No. 332, 2997--3022 (2021; Zbl 1472.11319) Full Text: DOI arXiv OpenURL
Bucić, Matija; Long, Eoin; Shapira, Asaf; Sudakov, Benny Tournament quasirandomness from local counting. (English) Zbl 07377578 Combinatorica 41, No. 2, 175-208 (2021). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C20 05C80 05D40 68Q87 PDF BibTeX XML Cite \textit{M. Bucić} et al., Combinatorica 41, No. 2, 175--208 (2021; Zbl 07377578) Full Text: DOI OpenURL
Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI OpenURL
Bravyi, Sergey; Maslov, Dmitri Hadamard-free circuits expose the structure of the Clifford group. (English) Zbl 1475.68132 IEEE Trans. Inf. Theory 67, No. 7, 4546-4563 (2021). MSC: 68Q12 81P68 81R05 PDF BibTeX XML Cite \textit{S. Bravyi} and \textit{D. Maslov}, IEEE Trans. Inf. Theory 67, No. 7, 4546--4563 (2021; Zbl 1475.68132) Full Text: DOI arXiv OpenURL
Dereniowski, Dariusz; Jurkiewicz, Marcin On the characteristic graph of a discrete symmetric channel. (English) Zbl 1475.94065 IEEE Trans. Inf. Theory 67, No. 6, Part 2, 3818-3823 (2021). MSC: 94A40 94A24 PDF BibTeX XML Cite \textit{D. Dereniowski} and \textit{M. Jurkiewicz}, IEEE Trans. Inf. Theory 67, No. 6, Part 2, 3818--3823 (2021; Zbl 1475.94065) Full Text: DOI OpenURL
Brandstädt, Andreas; Mosca, Raffaele Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time. (English) Zbl 07373863 Theor. Comput. Sci. 878-879, 11-25 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Theor. Comput. Sci. 878--879, 11--25 (2021; Zbl 07373863) Full Text: DOI arXiv OpenURL
Yengui, Ihsen Computational algebra. Course and exercises with solutions. (English) Zbl 1475.13001 Hackensack, NJ: World Scientific (ISBN 978-981-12-3824-6/hbk; 978-981-12-3930-4/pbk; 978-981-12-3826-0/ebook). ix, 272 p. (2021). Reviewer: Amir Hashemi (Isfahan) MSC: 13-01 13Pxx PDF BibTeX XML Cite \textit{I. Yengui}, Computational algebra. Course and exercises with solutions. Hackensack, NJ: World Scientific (2021; Zbl 1475.13001) Full Text: DOI OpenURL
Schaller, David; Lafond, Manuel; Stadler, Peter F.; Wieseke, Nicolas; Hellmuth, Marc Indirect identification of horizontal gene transfer. (English) Zbl 1467.92134 J. Math. Biol. 83, No. 1, Paper No. 10, 73 p. (2021). MSC: 92D10 92D15 05C90 PDF BibTeX XML Cite \textit{D. Schaller} et al., J. Math. Biol. 83, No. 1, Paper No. 10, 73 p. (2021; Zbl 1467.92134) Full Text: DOI arXiv OpenURL
Altschuler, Jason M.; Boix-Adsera, Enric Wasserstein barycenters can be computed in polynomial time in fixed dimension. (English) Zbl 07370561 J. Mach. Learn. Res. 22, Paper No. 44, 19 p. (2021). MSC: 68T05 PDF BibTeX XML Cite \textit{J. M. Altschuler} and \textit{E. Boix-Adsera}, J. Mach. Learn. Res. 22, Paper No. 44, 19 p. (2021; Zbl 07370561) Full Text: arXiv Link OpenURL
Wang, Cong; Wu, Jie; Wu, Qiang Totally positive algebraic integers with small trace. (English) Zbl 1469.11483 Math. Comput. 90, No. 331, 2317-2332 (2021). Reviewer: Artūras Dubickas (Vilnius) MSC: 11Y40 11R06 PDF BibTeX XML Cite \textit{C. Wang} et al., Math. Comput. 90, No. 331, 2317--2332 (2021; Zbl 1469.11483) Full Text: DOI OpenURL
Zhou, Xiaoguang; Miao, Cuixia; Hu, Jiaming; Zou, Juan Two uniform machines scheduling with a job-dependent cumulative effect. (Chinese. English summary) Zbl 1474.90172 J. Qufu Norm. Univ., Nat. Sci. 47, No. 1, 30-34 (2021). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{X. Zhou} et al., J. Qufu Norm. Univ., Nat. Sci. 47, No. 1, 30--34 (2021; Zbl 1474.90172) OpenURL
Bucić, Matija; Long, Eoin; Shapira, Asaf; Sudakov, Benny Tournament quasirandomness from local counting. (English) Zbl 1474.05158 Combinatorica 41, No. 2, 175-208 (2021). Reviewer: David B. Penman (Colchester) MSC: 05C20 05C80 05D40 68Q87 PDF BibTeX XML Cite \textit{M. Bucić} et al., Combinatorica 41, No. 2, 175--208 (2021; Zbl 1474.05158) Full Text: DOI arXiv OpenURL
Dyer, Martin; Jerrum, Mark; Müller, Haiko; Vušković, Kristina Counting weighted independent sets beyond the permanent. (English) Zbl 1467.05124 SIAM J. Discrete Math. 35, No. 2, 1503-1524 (2021). MSC: 05C30 05C69 05C75 05C85 68Q25 68W20 PDF BibTeX XML Cite \textit{M. Dyer} et al., SIAM J. Discrete Math. 35, No. 2, 1503--1524 (2021; Zbl 1467.05124) Full Text: DOI arXiv OpenURL
Chudnovsky, Maria; Scott, Alex; Seymour, Paul Detecting a long odd hole. (English) Zbl 1474.05218 Combinatorica 41, No. 1, 1-30 (2021). MSC: 05C38 05C85 PDF BibTeX XML Cite \textit{M. Chudnovsky} et al., Combinatorica 41, No. 1, 1--30 (2021; Zbl 1474.05218) Full Text: DOI arXiv OpenURL
Imbach, Rémi; Pouget, Marc; Yap, Chee Clustering complex zeros of triangular systems of polynomials. (English) Zbl 07363378 Math. Comput. Sci. 15, No. 2, 271-292 (2021). MSC: 65H10 30C15 PDF BibTeX XML Cite \textit{R. Imbach} et al., Math. Comput. Sci. 15, No. 2, 271--292 (2021; Zbl 07363378) Full Text: DOI arXiv OpenURL
Panda, B. S.; Goyal, Pooja; Pradhan, D. Differentiating-total domination: approximation and hardness results. (English) Zbl 07362190 Theor. Comput. Sci. 876, 45-58 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. S. Panda} et al., Theor. Comput. Sci. 876, 45--58 (2021; Zbl 07362190) Full Text: DOI OpenURL
Menini, Laura; Possieri, Corrado; Tornambè, Antonio A dynamical interval Newton method. (English) Zbl 1466.93110 Eur. J. Control 59, 290-300 (2021). MSC: 93C85 93B53 93C10 49M15 PDF BibTeX XML Cite \textit{L. Menini} et al., Eur. J. Control 59, 290--300 (2021; Zbl 1466.93110) Full Text: DOI OpenURL
Abolpour, Roozbeh; Dehghani, Maryam; Sadabadi, Mahdieh S. Designing controller parameters of an LPV system via design space exploration. (English) Zbl 1466.93117 Eur. J. Control 59, 47-57 (2021). MSC: 93D05 93C05 PDF BibTeX XML Cite \textit{R. Abolpour} et al., Eur. J. Control 59, 47--57 (2021; Zbl 1466.93117) Full Text: DOI OpenURL
Defant, Colin; Price, Andrew Elvey; Guttmann, Anthony J. Asymptotics of 3-stack-sortable permutations. (English) Zbl 1466.05002 Electron. J. Comb. 28, No. 2, Research Paper P2.49, 29 p. (2021). MSC: 05A05 05A15 05A16 PDF BibTeX XML Cite \textit{C. Defant} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.49, 29 p. (2021; Zbl 1466.05002) Full Text: DOI arXiv OpenURL
Zhang, Xin; Li, Bi Linear arboricity of outer-1-planar graphs. (English) Zbl 1474.05109 J. Oper. Res. Soc. China 9, No. 1, 181-193 (2021). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{X. Zhang} and \textit{B. Li}, J. Oper. Res. Soc. China 9, No. 1, 181--193 (2021; Zbl 1474.05109) Full Text: DOI OpenURL
Adsul, Bharat; Garg, Jugal; Mehta, Ruta; Sohoni, Milind; von Stengel, Bernhard Fast algorithms for rank-1 bimatrix games. (English) Zbl 1470.91066 Oper. Res. 69, No. 2, 613-631 (2021). MSC: 91A68 91A05 91A10 PDF BibTeX XML Cite \textit{B. Adsul} et al., Oper. Res. 69, No. 2, 613--631 (2021; Zbl 1470.91066) Full Text: DOI arXiv OpenURL
Devillers, Raymond; Erofeev, Evgeny; Hujsa, Thomas Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond. (English) Zbl 1464.68236 Koutny, Maciej (ed.) et al., Transactions on Petri Nets and Other Models of Concurrency XV. Berlin: Springer. Lect. Notes Comput. Sci. 12530, 75-100 (2021). MSC: 68Q85 PDF BibTeX XML Cite \textit{R. Devillers} et al., Lect. Notes Comput. Sci. 12530, 75--100 (2021; Zbl 1464.68236) Full Text: DOI arXiv OpenURL
Madathil, Jayakrishnan; Sharma, Roohani; Zehavi, Meirav A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs. (English) Zbl 07357821 Algorithmica 83, No. 6, 1861-1884 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Madathil} et al., Algorithmica 83, No. 6, 1861--1884 (2021; Zbl 07357821) Full Text: DOI Link OpenURL
Gomes, Guilherme C. M.; Sau, Ignasi Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. (English) Zbl 07357815 Algorithmica 83, No. 6, 1677-1706 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{G. C. M. Gomes} and \textit{I. Sau}, Algorithmica 83, No. 6, 1677--1706 (2021; Zbl 07357815) Full Text: DOI arXiv OpenURL
Briskorn, Dirk; Davari, Morteza; Matuschke, Jannik Single-machine scheduling with an external resource. (English) Zbl 07355868 Eur. J. Oper. Res. 293, No. 2, 457-468 (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Briskorn} et al., Eur. J. Oper. Res. 293, No. 2, 457--468 (2021; Zbl 07355868) Full Text: DOI arXiv OpenURL
Averbakh, Igor; Berman, Oded; Kalcsics, Jörg; Krass, Dmitry Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams. (English) Zbl 1465.90037 Discrete Appl. Math. 300, 36-55 (2021). MSC: 90B80 90B25 PDF BibTeX XML Cite \textit{I. Averbakh} et al., Discrete Appl. Math. 300, 36--55 (2021; Zbl 1465.90037) Full Text: DOI OpenURL
Gharehgozli, Amir; Xu, Chao; Zhang, Wenda High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. (English) Zbl 07354334 Eur. J. Oper. Res. 289, No. 2, 495-507 (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Gharehgozli} et al., Eur. J. Oper. Res. 289, No. 2, 495--507 (2021; Zbl 07354334) Full Text: DOI OpenURL
Ravelo, Santiago Valdés Minimum constellation covers: hardness, approximability and polynomial cases. (English) Zbl 1468.90114 J. Comb. Optim. 41, No. 3, 603-624 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{S. V. Ravelo}, J. Comb. Optim. 41, No. 3, 603--624 (2021; Zbl 1468.90114) Full Text: DOI OpenURL
Djanković, Goran The least common multiple of random sets in polynomial rings over finite fields. (English) Zbl 07344922 Ramanujan J. 55, No. 1, 13-23 (2021). MSC: 11T55 11A05 11N60 11K99 PDF BibTeX XML Cite \textit{G. Djanković}, Ramanujan J. 55, No. 1, 13--23 (2021; Zbl 07344922) Full Text: DOI OpenURL
Luo, Taibo; Li, Hongmei; Ru, Shaofeng; Tong, Weitian; Xu, Yinfeng Multiple sink location problem in path networks with a combinational objective. (English) Zbl 1466.90089 Optim. Lett. 15, No. 2, 733-755 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{T. Luo} et al., Optim. Lett. 15, No. 2, 733--755 (2021; Zbl 1466.90089) Full Text: DOI OpenURL
Darvay, Zsolt; Illés, Tibor; Majoros, Csilla Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. (English) Zbl 1466.90108 Optim. Lett. 15, No. 2, 357-376 (2021). MSC: 90C33 90C51 PDF BibTeX XML Cite \textit{Z. Darvay} et al., Optim. Lett. 15, No. 2, 357--376 (2021; Zbl 1466.90108) Full Text: DOI OpenURL
Zhang, Binwu; Guan, Xiucui; Pardalos, Panos M.; Wang, Hui; Zhang, Qiao; Liu, Yan; Chen, Shuyi The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm. (English) Zbl 1466.90118 J. Glob. Optim. 79, No. 3, 757-777 (2021). MSC: 90C35 PDF BibTeX XML Cite \textit{B. Zhang} et al., J. Glob. Optim. 79, No. 3, 757--777 (2021; Zbl 1466.90118) Full Text: DOI OpenURL
Tongron, Yanapat; Kanasri, Narakorn Rompurk; Laohakosol, Vichian The depth of continued fraction expansion for some classes of rational functions. (English) Zbl 07337239 Asian-Eur. J. Math. 14, No. 3, Article ID 2150033, 13 p. (2021). MSC: 11A55 11A05 PDF BibTeX XML Cite \textit{Y. Tongron} et al., Asian-Eur. J. Math. 14, No. 3, Article ID 2150033, 13 p. (2021; Zbl 07337239) Full Text: DOI OpenURL
Wang, Rong-Hua An algorithmic approach to the \(q\)-summability problem of bivariate rational functions. (English) Zbl 1462.33012 J. Syst. Sci. Complex. 34, No. 1, 107-121 (2021). MSC: 33F05 39A13 40D05 PDF BibTeX XML Cite \textit{R.-H. Wang}, J. Syst. Sci. Complex. 34, No. 1, 107--121 (2021; Zbl 1462.33012) Full Text: DOI arXiv OpenURL
Panda, B. S.; Priyamvada Injective coloring of some subclasses of bipartite graphs and chordal graphs. (English) Zbl 1460.05066 Discrete Appl. Math. 291, 68-87 (2021). MSC: 05C15 05C85 05C40 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{Priyamvada}, Discrete Appl. Math. 291, 68--87 (2021; Zbl 1460.05066) Full Text: DOI OpenURL