Szegedy, Mario; Newman, Ilan; Lee, Troy Query complexity (to appear). (English) Zbl 07177078 Hackensack, NJ: World Scientific (ISBN 978-981-322-320-2/hbk). 200 p. (2022). MSC: 68-02 68P05 68Q25 68R05 68W20 PDF BibTeX XML Cite \textit{M. Szegedy} et al., Query complexity (to appear). Hackensack, NJ: World Scientific (2022; Zbl 07177078) Full Text: DOI
Garber, David; Vishne, Uzi Property testing and expansion in cubical complexes. (English) Zbl 07335411 Discrete Comput. Geom. 65, No. 3, 893-915 (2021). MSC: 68W20 05E45 55N99 68R10 05C65 PDF BibTeX XML Cite \textit{D. Garber} and \textit{U. Vishne}, Discrete Comput. Geom. 65, No. 3, 893--915 (2021; Zbl 07335411) Full Text: DOI
Marinelli, Fabrizio; Pizzuti, Andrea; Rossi, Fabrizio LP-based dual bounds for the maximum quasi-clique problem. (English) Zbl 07335290 Discrete Appl. Math. 296, 118-140 (2021). MSC: 68R 68W 05C 68P PDF BibTeX XML Cite \textit{F. Marinelli} et al., Discrete Appl. Math. 296, 118--140 (2021; Zbl 07335290) Full Text: DOI
Li, Zhongguo; Dong, Zhen; Liang, Zhongchao; Ding, Zhengtao Surrogate-based distributed optimisation for expensive black-box functions. (English) Zbl 07335216 Automatica 125, Article ID 109407, 12 p. (2021). MSC: 93A16 93B70 68W15 PDF BibTeX XML Cite \textit{Z. Li} et al., Automatica 125, Article ID 109407, 12 p. (2021; Zbl 07335216) Full Text: DOI
Dorn, Britta; de Haan, Ronald; Schlotter, Ildikó Obtaining a proportional allocation by deleting items. (English) Zbl 07335033 Algorithmica 83, No. 5, 1559-1603 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{B. Dorn} et al., Algorithmica 83, No. 5, 1559--1603 (2021; Zbl 07335033) Full Text: DOI
Morin, Pat A fast algorithm for the product structure of planar graphs. (English) Zbl 07335032 Algorithmica 83, No. 5, 1544-1558 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{P. Morin}, Algorithmica 83, No. 5, 1544--1558 (2021; Zbl 07335032) Full Text: DOI
Demaine, Erik D.; Huang, Yamming; Liao, Chung-Shou; Sadakane, Kunihiko Approximating the Canadian traveller problem with online randomization. (English) Zbl 07335031 Algorithmica 83, No. 5, 1524-1543 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{E. D. Demaine} et al., Algorithmica 83, No. 5, 1524--1543 (2021; Zbl 07335031) Full Text: DOI
Cseh, Ágnes; Kavitha, Telikepalli Popular matchings in complete graphs. (English) Zbl 07335030 Algorithmica 83, No. 5, 1493-1523 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{Á. Cseh} and \textit{T. Kavitha}, Algorithmica 83, No. 5, 1493--1523 (2021; Zbl 07335030) Full Text: DOI
Mc Inerney, Fionn; Nisse, Nicolas; Pérennes, Stéphane Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between. (English) Zbl 07335029 Algorithmica 83, No. 5, 1459-1492 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{F. Mc Inerney} et al., Algorithmica 83, No. 5, 1459--1492 (2021; Zbl 07335029) Full Text: DOI
Duarte, Gabriel L.; Eto, Hiroshi; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lokshtanov, Daniel; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Souza, Uéverton S. Computing the largest bond and the maximum connected cut of a graph. (English) Zbl 07335028 Algorithmica 83, No. 5, 1421-1458 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{G. L. Duarte} et al., Algorithmica 83, No. 5, 1421--1458 (2021; Zbl 07335028) Full Text: DOI
Bessy, Stéphane; Bougeret, Marin; Krithika, R.; Sahu, Abhishek; Saurabh, Saket; Thiebaut, Jocelyn; Zehavi, Meirav Packing arc-disjoint cycles in tournaments. (English) Zbl 07335027 Algorithmica 83, No. 5, 1393-1420 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{S. Bessy} et al., Algorithmica 83, No. 5, 1393--1420 (2021; Zbl 07335027) Full Text: DOI
Bury, Marc; Gentili, Michele; Schwiegelshohn, Chris; Sorella, Mara Polynomial time approximation schemes for all 1-center problems on metric rational set similarities. (English) Zbl 07335026 Algorithmica 83, No. 5, 1371-1392 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Bury} et al., Algorithmica 83, No. 5, 1371--1392 (2021; Zbl 07335026) Full Text: DOI
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: 68W 05C PDF BibTeX XML Cite \textit{Y. Disser} et al., Algorithmica 83, No. 5, 1352--1370 (2021; Zbl 07335025) Full Text: DOI
Akitaya, Hugo A.; Arkin, Esther M.; Damian, Mirela; Demaine, Erik D.; Dujmović, Vida; Flatland, Robin; Korman, Matias; Palop, Belen; Parada, Irene; Renssen, André van; Sacristán, Vera Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers. (English) Zbl 07335024 Algorithmica 83, No. 5, 1316-1351 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{H. A. Akitaya} et al., Algorithmica 83, No. 5, 1316--1351 (2021; Zbl 07335024) Full Text: DOI
Mavronicolas, Marios; Michael, Loizos; Papadopoulou Lesta, Vicky; Persiano, Giuseppe; Philippou, Anna; Spirakis, Paul G. The price of defense. (English) Zbl 07335023 Algorithmica 83, No. 5, 1256-1315 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Mavronicolas} et al., Algorithmica 83, No. 5, 1256--1315 (2021; Zbl 07335023) Full Text: DOI
Chen, Chi-Yeh; Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung Matching cut in graphs with large minimum degree. (English) Zbl 07335022 Algorithmica 83, No. 5, 1238-1255 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{C.-Y. Chen} et al., Algorithmica 83, No. 5, 1238--1255 (2021; Zbl 07335022) Full Text: DOI
Leonardi, Stefano; Monaco, Gianpiero; Sankowski, Piotr; Zhang, Qiang Budget feasible mechanisms on matroids. (English) Zbl 07335021 Algorithmica 83, No. 5, 1222-1237 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{S. Leonardi} et al., Algorithmica 83, No. 5, 1222--1237 (2021; Zbl 07335021) Full Text: DOI
Bergougnoux, Benjamin; Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. Towards a polynomial kernel for directed feedback vertex set. (English) Zbl 07335020 Algorithmica 83, No. 5, 1201-1221 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{B. Bergougnoux} et al., Algorithmica 83, No. 5, 1201--1221 (2021; Zbl 07335020) Full Text: DOI
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka; Sandhya, T. P. Graph orientation with edge modifications. (English) Zbl 07334856 Int. J. Found. Comput. Sci. 32, No. 2, 209-233 (2021). MSC: 68R10 05C20 05C21 05C85 68W40 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Int. J. Found. Comput. Sci. 32, No. 2, 209--233 (2021; Zbl 07334856) Full Text: DOI
Levit, Vadim E.; Tankus, David Recognizing generating subgraphs revisited. (English) Zbl 07334849 Int. J. Found. Comput. Sci. 32, No. 1, 93-114 (2021). MSC: 68R10 05C69 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{V. E. Levit} and \textit{D. Tankus}, Int. J. Found. Comput. Sci. 32, No. 1, 93--114 (2021; Zbl 07334849) Full Text: DOI
Mukherjee, Mousumi; Pal, Debasattam On minimality of initial data required to uniquely characterize every trajectory in a discrete \(n\)-D system. (English) Zbl 07334372 SIAM J. Control Optim. 59, No. 2, 1520-1554 (2021). MSC: 39A14 35Exx 35Nxx 35N05 13P25 68W30 PDF BibTeX XML Cite \textit{M. Mukherjee} and \textit{D. Pal}, SIAM J. Control Optim. 59, No. 2, 1520--1554 (2021; Zbl 07334372) Full Text: DOI
Wang, Haitao; Zhang, Jingru An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees. (English) Zbl 07333147 SIAM J. Comput. 50, No. 2, 602-635 (2021). MSC: 68W40 PDF BibTeX XML Cite \textit{H. Wang} and \textit{J. Zhang}, SIAM J. Comput. 50, No. 2, 602--635 (2021; Zbl 07333147) Full Text: DOI
Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths. (English) Zbl 07333146 SIAM J. Comput. 50, No. 2, 555-601 (2021). MSC: 05C85 68W05 68W20 PDF BibTeX XML Cite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 555--601 (2021; Zbl 07333146) Full Text: DOI
Gawrychowski, Paweł; Kaplan, Haim; Mozes, Shay; Sharir, Micha; Weimann, Oren Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time. (English) Zbl 07333145 SIAM J. Comput. 50, No. 2, 509-554 (2021). MSC: 68R10 05C10 05C12 05C85 68W40 PDF BibTeX XML Cite \textit{P. Gawrychowski} et al., SIAM J. Comput. 50, No. 2, 509--554 (2021; Zbl 07333145) Full Text: DOI
Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors. (English) Zbl 07333143 SIAM J. Comput. 50, No. 2, 440-486 (2021). MSC: 05C85 68W05 68W20 PDF BibTeX XML Cite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 440--486 (2021; Zbl 07333143) Full Text: DOI
Jayaram, Rajesh; Woodruff, David Perfect \(L_p\) sampling in a data stream. (English) Zbl 07333142 SIAM J. Comput. 50, No. 2, 382-439 (2021). MSC: 68W01 68W20 PDF BibTeX XML Cite \textit{R. Jayaram} and \textit{D. Woodruff}, SIAM J. Comput. 50, No. 2, 382--439 (2021; Zbl 07333142) Full Text: DOI
Feng, Weiming; Vishnoi, Nisheeth K.; Yin, Yitong Dynamic sampling from graphical models. (English) Zbl 07333141 SIAM J. Comput. 50, No. 2, 350-381 (2021). MSC: 68Q87 68W20 PDF BibTeX XML Cite \textit{W. Feng} et al., SIAM J. Comput. 50, No. 2, 350--381 (2021; Zbl 07333141) Full Text: DOI
Li, Ke; Wu, Gang A randomized generalized low rank approximations of matrices algorithm for high dimensionality reduction and image compression. (English) Zbl 07332752 Numer. Linear Algebra Appl. 28, No. 1, e2338, 24 p. (2021). MSC: 65F55 68W20 94A08 PDF BibTeX XML Cite \textit{K. Li} and \textit{G. Wu}, Numer. Linear Algebra Appl. 28, No. 1, e2338, 24 p. (2021; Zbl 07332752) Full Text: DOI
Chen, Guanpu; Ming, Yang; Hong, Yiguang; Yi, Peng Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints. (English) Zbl 07332323 Automatica 123, Article ID 109313, 9 p. (2021). MSC: 91A10 68W15 93A16 PDF BibTeX XML Cite \textit{G. Chen} et al., Automatica 123, Article ID 109313, 9 p. (2021; Zbl 07332323) Full Text: DOI
Cao, Ben; Gu, Huaguang; Bai, Jiawei; Wu, Fuqiang Bifurcation and chaos of spontaneous oscillations of hair bundles in auditory hair cells. (English) Zbl 07331764 Int. J. Bifurcation Chaos Appl. Sci. Eng. 31, No. 4, Article ID 2130011, 20 p. (2021). MSC: 68U 68W 34 PDF BibTeX XML Cite \textit{B. Cao} et al., Int. J. Bifurcation Chaos Appl. Sci. Eng. 31, No. 4, Article ID 2130011, 20 p. (2021; Zbl 07331764) Full Text: DOI
Harvey, David; van der Hoeven, Joris Integer multiplication in time \(O(n\log n)\). (English) Zbl 07331716 Ann. Math. (2) 193, No. 2, 563-617 (2021). MSC: 11Y16 68W30 PDF BibTeX XML Cite \textit{D. Harvey} and \textit{J. van der Hoeven}, Ann. Math. (2) 193, No. 2, 563--617 (2021; Zbl 07331716) Full Text: DOI
Sutton, Andrew M. Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem. (English) Zbl 07331696 Algorithmica 83, No. 4, 1138-1163 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{A. M. Sutton}, Algorithmica 83, No. 4, 1138--1163 (2021; Zbl 07331696) Full Text: DOI
Lengler, Johannes; Sudholt, Dirk; Witt, Carsten The complex parameter landscape of the compact genetic algorithm. (English) Zbl 07331695 Algorithmica 83, No. 4, 1096-1137 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{J. Lengler} et al., Algorithmica 83, No. 4, 1096--1137 (2021; Zbl 07331695) Full Text: DOI
Antipov, Denis; Doerr, Benjamin A tight runtime analysis for the \((\mu + \lambda)\) EA. (English) Zbl 07331694 Algorithmica 83, No. 4, 1054-1095 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{D. Antipov} and \textit{B. Doerr}, Algorithmica 83, No. 4, 1054--1095 (2021; Zbl 07331694) Full Text: DOI
Doerr, Benjamin; Witt, Carsten; Yang, Jing Runtime analysis for self-adaptive mutation rates. (English) Zbl 07331693 Algorithmica 83, No. 4, 1012-1053 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{B. Doerr} et al., Algorithmica 83, No. 4, 1012--1053 (2021; Zbl 07331693) Full Text: DOI
Sudholt, Dirk Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial. (English) Zbl 07331692 Algorithmica 83, No. 4, 976-1011 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{D. Sudholt}, Algorithmica 83, No. 4, 976--1011 (2021; Zbl 07331692) Full Text: DOI
Qian, Chao; Bian, Chao; Yu, Yang; Tang, Ke; Yao, Xin Analysis of noisy evolutionary optimization when sampling fails. (English) Zbl 07331691 Algorithmica 83, No. 4, 940-975 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{C. Qian} et al., Algorithmica 83, No. 4, 940--975 (2021; Zbl 07331691) Full Text: DOI
Shi, Feng; Neumann, Frank; Wang, Jianxin Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem. (English) Zbl 07331690 Algorithmica 83, No. 4, 906-939 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{F. Shi} et al., Algorithmica 83, No. 4, 906--939 (2021; Zbl 07331690) Full Text: DOI
Huang, Chien-Chung; Kakimura, Naonori Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. (English) Zbl 07331688 Algorithmica 83, No. 3, 879-902 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{C.-C. Huang} and \textit{N. Kakimura}, Algorithmica 83, No. 3, 879--902 (2021; Zbl 07331688) Full Text: DOI
Feldman, Moran Guess free maximization of submodular and linear sums. (English) Zbl 07331687 Algorithmica 83, No. 3, 853-878 (2021). MSC: 68W25 68Q25 90C27 PDF BibTeX XML Cite \textit{M. Feldman}, Algorithmica 83, No. 3, 853--878 (2021; Zbl 07331687) Full Text: DOI
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 07331686 Algorithmica 83, No. 3, 822-852 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Bonamy} et al., Algorithmica 83, No. 3, 822--852 (2021; Zbl 07331686) Full Text: DOI
Boyar, Joan; Favrholdt, Lene Monrad; Kamali, Shahin; Larsen, Kim Skak Online bin covering with advice. (English) Zbl 07331685 Algorithmica 83, No. 3, 795-821 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{J. Boyar} et al., Algorithmica 83, No. 3, 795--821 (2021; Zbl 07331685) Full Text: DOI
Acan, Hüseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao Succinct encodings for families of interval graphs. (English) Zbl 07331684 Algorithmica 83, No. 3, 776-794 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{H. Acan} et al., Algorithmica 83, No. 3, 776--794 (2021; Zbl 07331684) Full Text: DOI
Hamm, Keaton; Huang, Longxiu Perturbations of CUR decompositions. (English) Zbl 07331677 SIAM J. Matrix Anal. Appl. 42, No. 1, 351-375 (2021). MSC: 65F55 15A23 65F30 68P99 68W20 PDF BibTeX XML Cite \textit{K. Hamm} and \textit{L. Huang}, SIAM J. Matrix Anal. Appl. 42, No. 1, 351--375 (2021; Zbl 07331677) Full Text: DOI
Crochemore, Maxime; Lecroq, Thierry; Rytter, Wojciech 125 problems in text algorithms. with solutions (to appear). (English) Zbl 07330959 Cambridge: Cambridge University Press (ISBN 978-1-108-83583-1/hbk). (2021). MSC: 68-01 00A07 68P05 68R15 68W32 PDF BibTeX XML
Klein, Shmuel Tomi Basic concepts in algorithms (to appear). (English) Zbl 07330894 Hackensack, NJ: World Scientific (ISBN 978-981-12-3758-4/hbk; 978-981-12-3852-9/pbk). 365 p. (2021). MSC: 68-01 68Wxx PDF BibTeX XML Cite \textit{S. T. Klein}, Basic concepts in algorithms (to appear). Hackensack, NJ: World Scientific (2021; Zbl 07330894) Full Text: DOI
Hamilton, Adam; Nguyen, Giang T.; Roughan, Matthew Counting Candy Crush configurations. (English) Zbl 07330783 Discrete Appl. Math. 295, 47-56 (2021). MSC: 05C65 05C15 05C30 05C85 68W20 PDF BibTeX XML Cite \textit{A. Hamilton} et al., Discrete Appl. Math. 295, 47--56 (2021; Zbl 07330783) Full Text: DOI
Tan, Bing; Qin, Xiaolong; Yao, Jen-Chih Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications. (English) Zbl 07329951 J. Sci. Comput. 87, No. 1, Paper No. 20, 34 p. (2021). MSC: 65J15 68W10 65K15 47J20 90C25 PDF BibTeX XML Cite \textit{B. Tan} et al., J. Sci. Comput. 87, No. 1, Paper No. 20, 34 p. (2021; Zbl 07329951) Full Text: DOI
Moorman, Jacob D.; Tu, Thomas K.; Molitor, Denali; Needell, Deanna Randomized Kaczmarz with averaging. (English) Zbl 07329853 BIT 61, No. 1, 337-359 (2021). MSC: 15A06 15B52 65F10 65F20 65Y20 68Q25 68W10 68W20 68W40 PDF BibTeX XML Cite \textit{J. D. Moorman} et al., BIT 61, No. 1, 337--359 (2021; Zbl 07329853) Full Text: DOI
Gutin, Gregory; Majumdar, Diptapriyo; Ordyniak, Sebastian; Wahlström, Magnus Parameterized pre-coloring extension and list coloring problems. (English) Zbl 07329533 SIAM J. Discrete Math. 35, No. 1, 575-596 (2021). MSC: 68Q27 05C85 68R10 68W05 05C15 PDF BibTeX XML Cite \textit{G. Gutin} et al., SIAM J. Discrete Math. 35, No. 1, 575--596 (2021; Zbl 07329533) Full Text: DOI
Dvořák, Pavel; Feldmann, Andreas E.; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 07329532 SIAM J. Discrete Math. 35, No. 1, 546-574 (2021). MSC: 68W25 05C85 68Q25 PDF BibTeX XML Cite \textit{P. Dvořák} et al., SIAM J. Discrete Math. 35, No. 1, 546--574 (2021; Zbl 07329532) Full Text: DOI
Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Simultaneous feedback edge set: a parameterized perspective. (English) Zbl 07328491 Algorithmica 83, No. 2, 753-774 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{A. Agrawal} et al., Algorithmica 83, No. 2, 753--774 (2021; Zbl 07328491) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian The power of cut-based parameters for computing edge-disjoint paths. (English) Zbl 07328490 Algorithmica 83, No. 2, 726-752 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{R. Ganian} and \textit{S. Ordyniak}, Algorithmica 83, No. 2, 726--752 (2021; Zbl 07328490) Full Text: DOI
Ferraioli, Diodato; Ventre, Carmine Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location. (English) Zbl 07328489 Algorithmica 83, No. 2, 695-725 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{D. Ferraioli} and \textit{C. Ventre}, Algorithmica 83, No. 2, 695--725 (2021; Zbl 07328489) Full Text: DOI
Buhrman, Harry; Christandl, Matthias; Koucký, Michal; Lotker, Zvi; Patt-Shamir, Boaz; Vereshchagin, Nikolay High entropy random selection protocols. (English) Zbl 07328488 Algorithmica 83, No. 2, 667-694 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{H. Buhrman} et al., Algorithmica 83, No. 2, 667--694 (2021; Zbl 07328488) Full Text: DOI
Biedl, Therese; Mehrabi, Saeed On orthogonally guarding orthogonal polygons with bounded treewidth. (English) Zbl 07328487 Algorithmica 83, No. 2, 641-666 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{T. Biedl} and \textit{S. Mehrabi}, Algorithmica 83, No. 2, 641--666 (2021; Zbl 07328487) Full Text: DOI
Matsubayashi, Akira Non-greedy online Steiner trees on outerplanar graphs. (English) Zbl 07328486 Algorithmica 83, No. 2, 613-640 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{A. Matsubayashi}, Algorithmica 83, No. 2, 613--640 (2021; Zbl 07328486) Full Text: DOI
Preissmann, Myriam; Robin, Cléophée; Trotignon, Nicolas On the complexity of colouring antiprismatic graphs. (English) Zbl 07328485 Algorithmica 83, No. 2, 589-612 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Preissmann} et al., Algorithmica 83, No. 2, 589--612 (2021; Zbl 07328485) Full Text: DOI
Nutov, Zeev On the tree augmentation problem. (English) Zbl 07328483 Algorithmica 83, No. 2, 553-575 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{Z. Nutov}, Algorithmica 83, No. 2, 553--575 (2021; Zbl 07328483) Full Text: DOI
Cantu, Angel A.; Luchsinger, Austin; Schweller, Robert; Wylie, Tim Covert computation in self-assembled circuits. (English) Zbl 07328482 Algorithmica 83, No. 2, 531-552 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{A. A. Cantu} et al., Algorithmica 83, No. 2, 531--552 (2021; Zbl 07328482) Full Text: DOI
Bilò, Vittorio; Mavronicolas, Marios The complexity of computational problems about Nash equilibria in symmetric win-lose games. (English) Zbl 07328481 Algorithmica 83, No. 2, 447-530 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{V. Bilò} and \textit{M. Mavronicolas}, Algorithmica 83, No. 2, 447--530 (2021; Zbl 07328481) Full Text: DOI
Bhowmick, Santanu; Inamdar, Tanmay; Varadarajan, Kasturi Fault-tolerant covering problems in metric spaces. (English) Zbl 07328480 Algorithmica 83, No. 2, 413-446 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{S. Bhowmick} et al., Algorithmica 83, No. 2, 413--446 (2021; Zbl 07328480) Full Text: DOI
Seif, Steve A faster diameter problem algorithm for a chordal graph, with a connection to its center problem. (English) Zbl 07327862 Discrete Math. 344, No. 5, Article ID 112326, 6 p. (2021). MSC: 68W 05C 68R 68Q PDF BibTeX XML Cite \textit{S. Seif}, Discrete Math. 344, No. 5, Article ID 112326, 6 p. (2021; Zbl 07327862) Full Text: DOI
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: 68W 68R PDF BibTeX XML Cite \textit{R. Krithika} et al., Discrete Appl. Math. 291, 286--299 (2021; Zbl 07327719) Full Text: DOI
Huq, Reaz; Kamiński, Bogumił; Mashatan, Atefeh; Prałat, Paweł; Szufel, Przemysław On broadcasting time in the model of travelling agents. (English) Zbl 07327715 Discrete Appl. Math. 291, 246-263 (2021). MSC: 68W 05C 91D 60C PDF BibTeX XML Cite \textit{R. Huq} et al., Discrete Appl. Math. 291, 246--263 (2021; Zbl 07327715) Full Text: DOI
Ducoffe, Guillaume; Popa, Alexandru The use of a pruned modular decomposition for maximum matching algorithms on some graph classes. (English) Zbl 07327712 Discrete Appl. Math. 291, 201-222 (2021). MSC: 68W 68Q 68R PDF BibTeX XML Cite \textit{G. Ducoffe} and \textit{A. Popa}, Discrete Appl. Math. 291, 201--222 (2021; Zbl 07327712) Full Text: DOI
Feldman, Moran; Svensson, Ola; Zenklusen, Rico Online contention resolution schemes with applications to Bayesian selection problems. (English) Zbl 07327267 SIAM J. Comput. 50, No. 2, 255-300 (2021). MSC: 68W27 68R05 68W40 PDF BibTeX XML Cite \textit{M. Feldman} et al., SIAM J. Comput. 50, No. 2, 255--300 (2021; Zbl 07327267) Full Text: DOI
Dütting, P.; Roughgarden, T.; Talgam-Cohen, I. The complexity of contracts. (English) Zbl 07327266 SIAM J. Comput. 50, No. 1, 211-254 (2021). MSC: 68W40 91B40 PDF BibTeX XML Cite \textit{P. Dütting} et al., SIAM J. Comput. 50, No. 1, 211--254 (2021; Zbl 07327266) Full Text: DOI
van der Hoeven, Joris; Lecerf, Grégoire On the complexity exponent of polynomial system solving. (English) Zbl 07326845 Found. Comput. Math. 21, No. 1, 1-57 (2021). Reviewer: Vladimir P. Kostov (Nice) MSC: 14-04 14Q20 14B05 68W30 PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, Found. Comput. Math. 21, No. 1, 1--57 (2021; Zbl 07326845) Full Text: DOI
Haeupler, Bernhard; Izumi, Taisuke; Zuzic, Goran Low-congestion shortcuts without embedding. (English) Zbl 07321644 Distrib. Comput. 34, No. 1, 79-90 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{B. Haeupler} et al., Distrib. Comput. 34, No. 1, 79--90 (2021; Zbl 07321644) Full Text: DOI
Ganesh, Chaya; Patra, Arpita Optimal extension protocols for Byzantine broadcast and agreement. (English) Zbl 07321643 Distrib. Comput. 34, No. 1, 59-77 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{C. Ganesh} and \textit{A. Patra}, Distrib. Comput. 34, No. 1, 59--77 (2021; Zbl 07321643) Full Text: DOI
Anta, Antonio Fernández; Hadjistasi, Theophanis; Nicolaou, Nicolas; Popa, Alexandru; Schwarzmann, Alexander A. Tractable low-delay atomic memory. (English) Zbl 07321642 Distrib. Comput. 34, No. 1, 33-58 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{A. F. Anta} et al., Distrib. Comput. 34, No. 1, 33--58 (2021; Zbl 07321642) Full Text: DOI
Levi, Reut; Medina, Moti; Ron, Dana Property testing of planarity in the CONGEST model. (English) Zbl 07321641 Distrib. Comput. 34, No. 1, 15-32 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{R. Levi} et al., Distrib. Comput. 34, No. 1, 15--32 (2021; Zbl 07321641) Full Text: DOI
Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. (English) Zbl 07321640 Distrib. Comput. 34, No. 1, 1-14 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{V. Bilò} et al., Distrib. Comput. 34, No. 1, 1--14 (2021; Zbl 07321640) Full Text: DOI
Roanes-Lozano, Eugenio; Galán-García, José Luis; Aguilera-Venegas, Gabriel A computer approach to overtaking station track layout diagram design using graphs. An alternative track diagram proposal for these stations. (English) Zbl 07319226 J. Comput. Appl. Math. 391, Article ID 113455, 13 p. (2021). MSC: 68W 26A 26 PDF BibTeX XML Cite \textit{E. Roanes-Lozano} et al., J. Comput. Appl. Math. 391, Article ID 113455, 13 p. (2021; Zbl 07319226) Full Text: DOI
Wang, Dongming; Xu, Juan A symbolic-numerical algorithm for isolating real roots of certain radical expressions. (English) Zbl 07319209 J. Comput. Appl. Math. 391, Article ID 113424, 19 p. (2021). MSC: 65H 65Y 68W 12Y 65 PDF BibTeX XML Cite \textit{D. Wang} and \textit{J. Xu}, J. Comput. Appl. Math. 391, Article ID 113424, 19 p. (2021; Zbl 07319209) Full Text: DOI
Doerr, Benjamin; Mayer, Sebastian The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. (English) Zbl 07316089 J. Complexity 63, Article ID 101521, 30 p. (2021). MSC: 65D15 65Y20 41A30 68W20 PDF BibTeX XML Cite \textit{B. Doerr} and \textit{S. Mayer}, J. Complexity 63, Article ID 101521, 30 p. (2021; Zbl 07316089) Full Text: DOI
van der Hoeven, Joris; Lecerf, Grégoire Fast computation of generic bivariate resultants. (English) Zbl 07316078 J. Complexity 62, Article ID 101499, 12 p. (2021). MSC: 13P10 68W30 11Y PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, J. Complexity 62, Article ID 101499, 12 p. (2021; Zbl 07316078) Full Text: DOI
Ábrahám, Erika; Davenport, James H.; England, Matthew; Kremer, Gereon Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings. (English) Zbl 07316066 J. Log. Algebr. Methods Program. 119, Article ID 100633, 33 p. (2021). MSC: 68W30 68V15 PDF BibTeX XML Cite \textit{E. Ábrahám} et al., J. Log. Algebr. Methods Program. 119, Article ID 100633, 33 p. (2021; Zbl 07316066) Full Text: DOI
Spiga, Pablo; Xia, Binzhou Constructing infinitely many half-arc-transitive covers of tetravalent graphs. (English) Zbl 07313981 J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021). MSC: 68W PDF BibTeX XML Cite \textit{P. Spiga} and \textit{B. Xia}, J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021; Zbl 07313981) Full Text: DOI
Khamparia, Aditya (ed.); Khanna, Ashish (ed.); Nguyen, Nhu Gia (ed.); Nguyen, Bao Le (ed.) Nature-inspired optimization algorithms. Recent advances in natural computing and biomedical applications. (English) Zbl 1454.68010 Intelligent Biomedical Data Analysis 4. Berlin: De Gruyter (ISBN 978-3-11-067606-8/hbk; 978-3-11-067611-2/ebook). xiii, 153 p. (2021). MSC: 68-06 68T05 68T20 68W50 90C59 92C50 00B15 PDF BibTeX XML Cite \textit{A. Khamparia} (ed.) et al., Nature-inspired optimization algorithms. Recent advances in natural computing and biomedical applications. Berlin: De Gruyter (2021; Zbl 1454.68010) Full Text: DOI
Bai, Jianchao; Chang, Xiaokai; Li, Jicheng; Xu, Fengmin Convergence revisit on generalized symmetric ADMM. (English) Zbl 07313462 Optimization 70, No. 1, 149-168 (2021). MSC: 65K10 68W40 90C25 PDF BibTeX XML Cite \textit{J. Bai} et al., Optimization 70, No. 1, 149--168 (2021; Zbl 07313462) Full Text: DOI
von zur Gathen, Joachim; Giesbrecht, Mark; Ziegler, Konstantin Counting invariant subspaces and decompositions of additive polynomials. (English) Zbl 07312671 J. Symb. Comput. 105, 214-233 (2021). MSC: 68W30 12Y05 PDF BibTeX XML Cite \textit{J. von zur Gathen} et al., J. Symb. Comput. 105, 214--233 (2021; Zbl 07312671) Full Text: DOI
Doliskani, Javad; Narayanan, Anand Kumar; Schost, Éric Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. (English) Zbl 07312670 J. Symb. Comput. 105, 199-213 (2021). MSC: 11G09 11Y16 68W30 11T06 PDF BibTeX XML Cite \textit{J. Doliskani} et al., J. Symb. Comput. 105, 199--213 (2021; Zbl 07312670) Full Text: DOI
Emiris, Ioannis Z.; Mantzaflaris, Angelos; Tsigaridas, Elias P. Multilinear polynomial systems: root isolation and bit complexity. (English) Zbl 07312668 J. Symb. Comput. 105, 145-164 (2021). MSC: 68Q 68W 11Y PDF BibTeX XML Cite \textit{I. Z. Emiris} et al., J. Symb. Comput. 105, 145--164 (2021; Zbl 07312668) Full Text: DOI
Moir, Robert H. C.; Corless, Robert M.; Jeffrey, David J. An unwinding number pair for continuous expressions of integrals. (English) Zbl 07312666 J. Symb. Comput. 105, 97-117 (2021). MSC: 68W30 PDF BibTeX XML Cite \textit{R. H. C. Moir} et al., J. Symb. Comput. 105, 97--117 (2021; Zbl 07312666) Full Text: DOI
Bender, Matías R.; Faugère, Jean-Charles; Perret, Ludovic; Tsigaridas, Elias A nearly optimal algorithm to decompose binary forms. (English) Zbl 07312665 J. Symb. Comput. 105, 71-96 (2021). MSC: 14Q 15A69 11E76 68W30 PDF BibTeX XML Cite \textit{M. R. Bender} et al., J. Symb. Comput. 105, 71--96 (2021; Zbl 07312665) Full Text: DOI
Hu, Jiaxiong; Monagan, Michael A fast parallel sparse polynomial GCD algorithm. (English) Zbl 07312663 J. Symb. Comput. 105, 28-63 (2021). MSC: 68W 11Y 11B PDF BibTeX XML Cite \textit{J. Hu} and \textit{M. Monagan}, J. Symb. Comput. 105, 28--63 (2021; Zbl 07312663) Full Text: DOI
Nagasaka, Kosaku Toward the best algorithm for approximate GCD of univariate polynomials. (English) Zbl 07312662 J. Symb. Comput. 105, 4-27 (2021). MSC: 68W30 PDF BibTeX XML Cite \textit{K. Nagasaka}, J. Symb. Comput. 105, 4--27 (2021; Zbl 07312662) Full Text: DOI
Kaltofen, Erich L. Foreword. (English) Zbl 07312661 J. Symb. Comput. 105, 1-3 (2021). MSC: 68W 13P PDF BibTeX XML Cite \textit{E. L. Kaltofen}, J. Symb. Comput. 105, 1--3 (2021; Zbl 07312661) Full Text: DOI
Henrion, Didier; Naldi, Simone; Safey El Din, Mohab Exact algorithms for semidefinite programs with degenerate feasible set. (English) Zbl 07312507 J. Symb. Comput. 104, 942-959 (2021). MSC: 90C22 68W30 90C51 90C05 90C60 13P15 14P10 PDF BibTeX XML Cite \textit{D. Henrion} et al., J. Symb. Comput. 104, 942--959 (2021; Zbl 07312507) Full Text: DOI
Guidolin, Andrea; Divasón, Jose; Romero, Ana; Vaccarino, Francesco Computing invariants for multipersistence via spectral systems and effective homology. (English) Zbl 07312499 J. Symb. Comput. 104, 724-753 (2021). MSC: 55N31 55T99 68W30 68U05 68P PDF BibTeX XML Cite \textit{A. Guidolin} et al., J. Symb. Comput. 104, 724--753 (2021; Zbl 07312499) Full Text: DOI
Malykh, M. D.; Sevastianov, L. A.; Yu, Y. On symbolic integration of algebraic functions. (English) Zbl 07312494 J. Symb. Comput. 104, 563-579 (2021). MSC: 68W30 12H05 34A05 34A09 65D20 11Y40 13P10 PDF BibTeX XML Cite \textit{M. D. Malykh} et al., J. Symb. Comput. 104, 563--579 (2021; Zbl 07312494) Full Text: DOI
Hong, Hoon; Yang, Jing A condition for multiplicity structure of univariate polynomials. (English) Zbl 07312492 J. Symb. Comput. 104, 523-538 (2021). MSC: 68W30 12D10 12E05 13-04 13P99 PDF BibTeX XML Cite \textit{H. Hong} and \textit{J. Yang}, J. Symb. Comput. 104, 523--538 (2021; Zbl 07312492) Full Text: DOI
Chen, Shaoshi; Du, Lixin; Wang, Rong-Hua; Zhu, Chaochao On the existence of telescopers for rational functions in three variables. (English) Zbl 07312491 J. Symb. Comput. 104, 494-522 (2021). MSC: 68W30 05A19 12 65Q 39A PDF BibTeX XML Cite \textit{S. Chen} et al., J. Symb. Comput. 104, 494--522 (2021; Zbl 07312491) Full Text: DOI
Doris, Christopher Exact \(p\)-adic computation in Magma. (English) Zbl 07312490 J. Symb. Comput. 104, 476-493 (2021). MSC: 68W 11S 12E 11Y PDF BibTeX XML Cite \textit{C. Doris}, J. Symb. Comput. 104, 476--493 (2021; Zbl 07312490) Full Text: DOI
Dong, Rina; Wang, Dongming Computing strong regular characteristic pairs with Gröbner bases. (English) Zbl 07312482 J. Symb. Comput. 104, 312-327 (2021). Reviewer: Amir Hashemi (Isfahan) MSC: 13P10 68W30 PDF BibTeX XML Cite \textit{R. Dong} and \textit{D. Wang}, J. Symb. Comput. 104, 312--327 (2021; Zbl 07312482) Full Text: DOI
Chen, Justin; Vemulapalli, Sameera; Zhang, Leon Computing unit groups of curves. (English) Zbl 07312479 J. Symb. Comput. 104, 236-255 (2021). MSC: 68W PDF BibTeX XML Cite \textit{J. Chen} et al., J. Symb. Comput. 104, 236--255 (2021; Zbl 07312479) Full Text: DOI
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann Computing the multilinear factors of lacunary polynomials without heights. (English) Zbl 07312477 J. Symb. Comput. 104, 183-206 (2021). MSC: 68W30 11Y16 68Q25 11R09 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., J. Symb. Comput. 104, 183--206 (2021; Zbl 07312477) Full Text: DOI
Imamoglu, Erdal; Kaltofen, Erich L. On computing the degree of a Chebyshev polynomial from its value. (English) Zbl 07312475 J. Symb. Comput. 104, 159-167 (2021). MSC: 68W 94B 65D PDF BibTeX XML Cite \textit{E. Imamoglu} and \textit{E. L. Kaltofen}, J. Symb. Comput. 104, 159--167 (2021; Zbl 07312475) Full Text: DOI