Chen, Pengwen; Cheng, Chung-Kuan; Wang, Xinyuan Arnoldi algorithms with structured orthogonalization. (English) Zbl 07314375 SIAM J. Numer. Anal. 59, No. 1, 370-400 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{P. Chen} et al., SIAM J. Numer. Anal. 59, No. 1, 370--400 (2021; Zbl 07314375) Full Text: DOI
Averkov, Gennadiy; Chavez, A.; De Loera, J. A.; Gillespie, Bryan The lattice of cycles of an undirected graph. (English) Zbl 07312041 Linear Algebra Appl. 611, 213-236 (2021). MSC: 05C50 05C38 52C07 05C85 68R10 PDF BibTeX XML Cite \textit{G. Averkov} et al., Linear Algebra Appl. 611, 213--236 (2021; Zbl 07312041) Full Text: DOI
Grzesik, Andrzej; Klimošová, Tereza; Pilipczuk, Marcin; Pilipczuk, Michał Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs. (English) Zbl 07310930 Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021). MSC: 05C69 05C75 05C85 68R10 PDF BibTeX XML Cite \textit{A. Grzesik} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021; Zbl 07310930) Full Text: DOI
Cohen-Addad, Vincent; Colin de Verdière, Éric; de Mesmay, Arnaud A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals. (English) Zbl 07307639 SIAM J. Comput. 50, 1-31 (2021). MSC: 05C10 05C85 57M15 57N05 68Q25 68R10 68W05 68W25 PDF BibTeX XML Cite \textit{V. Cohen-Addad} et al., SIAM J. Comput. 50, 1--31 (2021; Zbl 07307639) Full Text: DOI
Abreu, Alexandre; Cunha, Luís; de Figueiredo, Celina; Kowada, Luis; Marquezino, Franklin; Portugal, Renato; Posner, Daniel A computational complexity comparative study of graph tessellation problems. (English) Zbl 07305081 Theor. Comput. Sci. 858, 81-89 (2021). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Abreu} et al., Theor. Comput. Sci. 858, 81--89 (2021; Zbl 07305081) Full Text: DOI
Chuzhoy, Julia; Tan, Zihan Towards tight(er) bounds for the excluded grid theorem. (English) Zbl 07304893 J. Comb. Theory, Ser. B 146, 219-265 (2021). MSC: 05C83 68Q25 PDF BibTeX XML Cite \textit{J. Chuzhoy} and \textit{Z. Tan}, J. Comb. Theory, Ser. B 146, 219--265 (2021; Zbl 07304893) Full Text: DOI
Fuchs, Michael; Holmgren, Cecilia; Mitsche, Dieter; Neininger, Ralph A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. (English) Zbl 07303836 Discrete Appl. Math. 292, 64-71 (2021). MSC: 68Q 68R 68R10 68Q25 PDF BibTeX XML Cite \textit{M. Fuchs} et al., Discrete Appl. Math. 292, 64--71 (2021; Zbl 07303836) Full Text: DOI
Lozano, Antoni; Mora, Mercè; Seara, Carlos; Tey, Joaquín Caterpillars are antimagic. (English) Zbl 07302839 Mediterr. J. Math. 18, No. 2, Paper No. 39, 12 p. (2021). MSC: 05C78 05C85 68R10 PDF BibTeX XML Cite \textit{A. Lozano} et al., Mediterr. J. Math. 18, No. 2, Paper No. 39, 12 p. (2021; Zbl 07302839) Full Text: DOI
Boscain, Ugo; Pozzoli, Eugenio; Sigalotti, Mario Classical and quantum controllability of a rotating symmetric molecule. (English) Zbl 07299442 SIAM J. Control Optim. 59, No. 1, 156-184 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{U. Boscain} et al., SIAM J. Control Optim. 59, No. 1, 156--184 (2021; Zbl 07299442) Full Text: DOI
Beineke, Lowell W. (ed.); Golumbic, Martin Charles (ed.); Wilson, Robin J. (ed.) Topics in algorithmic graph theory (to appear). (English) Zbl 07298511 Encyclopedia of Mathematics and Its Applications 178. Cambridge: Cambridge University Press (ISBN 978-1-108-49260-7/hbk). (2021). MSC: 68-06 05-06 05C85 68R10 00B15 PDF BibTeX XML
Kang, Ming-Hsuan; Lin, Wu-Hsiung Equilateral spherical drawings of planar Cayley graphs. (English) Zbl 1452.05178 J. Graph Algorithms Appl. 25, No. 1, 97-119 (2021). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{M.-H. Kang} and \textit{W.-H. Lin}, J. Graph Algorithms Appl. 25, No. 1, 97--119 (2021; Zbl 1452.05178) Full Text: DOI
Schaefer, Marcus Complexity of geometric \(k\)-planarity for fixed \(k\). (English) Zbl 1452.05180 J. Graph Algorithms Appl. 25, No. 1, 29-41 (2021). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{M. Schaefer}, J. Graph Algorithms Appl. 25, No. 1, 29--41 (2021; Zbl 1452.05180) Full Text: DOI
Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena; Schulz, André Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles. (English) Zbl 1452.05179 J. Graph Algorithms Appl. 25, No. 1, 1-28 (2021). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{P. Kindermann} et al., J. Graph Algorithms Appl. 25, No. 1, 1--28 (2021; Zbl 1452.05179) Full Text: DOI
Ryabov, G. On Cayley representations of finite graphs over abelian \(p\)-groups. (English. Russian original) Zbl 07296449 St. Petersbg. Math. J. 32, No. 1, 71-89 (2021); translation from Algebra Anal. 32, No. 1, 94-120 (2020). MSC: 05C62 05C25 05C85 05C60 20B35 20C05 PDF BibTeX XML Cite \textit{G. Ryabov}, St. Petersbg. Math. J. 32, No. 1, 71--89 (2021; Zbl 07296449); translation from Algebra Anal. 32, No. 1, 94--120 (2020) Full Text: DOI
Mukdasanit, Supachai; Kantabutra, Sanpawat Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes. (English) Zbl 07265467 J. Comput. Syst. Sci. 115, 54-63 (2021). MSC: 68 PDF BibTeX XML Cite \textit{S. Mukdasanit} and \textit{S. Kantabutra}, J. Comput. Syst. Sci. 115, 54--63 (2021; Zbl 07265467) Full Text: DOI
Boreland, G.; Todorov, I. G.; Winter, A. Sandwich theorems and capacity bounds for non-commutative graphs. (English) Zbl 1448.05159 J. Comb. Theory, Ser. A 177, Article ID 105302, 39 p. (2021). MSC: 05C70 68Q25 94A24 81P45 94A40 PDF BibTeX XML Cite \textit{G. Boreland} et al., J. Comb. Theory, Ser. A 177, Article ID 105302, 39 p. (2021; Zbl 1448.05159) Full Text: DOI
Butler, Steve; Erickson, Craig; Fallat, Shaun; Hall, H. Tracy; Kroschel, Brenda; Lin, Jephian C.-H.; Shader, Bryan; Warnberg, Nathan; Yang, Boting Correction to: “Properties of a \(q\)-analogue of zero forcing”. (English) Zbl 07311120 Graphs Comb. 36, No. 5, 1421-1422 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{S. Butler} et al., Graphs Comb. 36, No. 5, 1421--1422 (2020; Zbl 07311120) Full Text: DOI
Butler, Steve; Erickson, Craig; Fallat, Shaun; Hall, H. Tracy; Kroschel, Brenda; Lin, Jephian C.-H.; Shader, Bryan; Warnberg, Nathan; Yang, Boting Properties of a \(q\)-analogue of zero forcing. (English) Zbl 07311119 Graphs Comb. 36, No. 5, 1401-1419 (2020); correction ibid. 36, No. 5, 1421-1422 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{S. Butler} et al., Graphs Comb. 36, No. 5, 1401--1419 (2020; Zbl 07311119) Full Text: DOI
Lehotay-Kéry, Péter; Kiss, Attila Genome classification using overlap graph centralities. (English) Zbl 07307807 Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 51, 131-146 (2020). MSC: 92D10 05C90 PDF BibTeX XML Cite \textit{P. Lehotay-Kéry} and \textit{A. Kiss}, Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 51, 131--146 (2020; Zbl 07307807) Full Text: Link
Erickson, Jeff; Wang, Yipu Topologically trivial closed walks in directed surface graphs. (English) Zbl 07303724 Discrete Comput. Geom. 64, No. 4, 1253-1294 (2020). MSC: 68Q 68R 90B 68Q25 90B06 68R10 68Q45 PDF BibTeX XML Cite \textit{J. Erickson} and \textit{Y. Wang}, Discrete Comput. Geom. 64, No. 4, 1253--1294 (2020; Zbl 07303724) Full Text: DOI
Schnider, Patrick Ham-sandwich cuts and center transversals in subspaces. (English) Zbl 07303721 Discrete Comput. Geom. 64, No. 4, 1192-1209 (2020). MSC: 52A35 05A17 54H25 94C15 68Q25 PDF BibTeX XML Cite \textit{P. Schnider}, Discrete Comput. Geom. 64, No. 4, 1192--1209 (2020; Zbl 07303721) Full Text: DOI
Calvetti, Daniela; Pragliola, Monica; Somersalo, Erkki Sparsity promoting hybrid solvers for hierarchical Bayesian inverse problems. (English) Zbl 07303422 SIAM J. Sci. Comput. 42, No. 6, A3761-A3784 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{D. Calvetti} et al., SIAM J. Sci. Comput. 42, No. 6, A3761--A3784 (2020; Zbl 07303422) Full Text: DOI
Kallaugher, John; Price, Eric Separations and equivalences between turnstile streaming and linear sketching. (English) Zbl 07298323 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1223-1236 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Kallaugher} and \textit{E. Price}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1223--1236 (2020; Zbl 07298323) Full Text: DOI
Gupta, Anupam; Lee, Euiwoong; Li, Jason The Karger-Stein algorithm is optimal for k-cut. (English) Zbl 07298263 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 473-484 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Gupta} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 473--484 (2020; Zbl 07298263) Full Text: DOI
Shanthi, A. S.; Thomas, Diana Grace Liar’s domination in Sierpinski-like graphs. (English) Zbl 07296943 South East Asian J. Math. Math. Sci. 16, No. 2, 121-130 (2020). MSC: 97K30 05C85 PDF BibTeX XML Cite \textit{A. S. Shanthi} and \textit{D. G. Thomas}, South East Asian J. Math. Math. Sci. 16, No. 2, 121--130 (2020; Zbl 07296943) Full Text: Link
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 07294226 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). MSC: 05C85 05C10 68R10 05C83 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 07294226) Full Text: DOI
Duan, Ran; Pettie, Seth Connectivity oracles for graphs subject to vertex failures. (English) Zbl 07294225 SIAM J. Comput. 49, No. 6, 1363-1396 (2020). MSC: 68P05 05C40 05C85 68R10 PDF BibTeX XML Cite \textit{R. Duan} and \textit{S. Pettie}, SIAM J. Comput. 49, No. 6, 1363--1396 (2020; Zbl 07294225) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 07294223 SIAM J. Comput. 49, No. 6, 1291-1331 (2020). MSC: 68U05 68W05 68Q25 05C10 05C69 PDF BibTeX XML Cite \textit{M. de Berg} et al., SIAM J. Comput. 49, No. 6, 1291--1331 (2020; Zbl 07294223) Full Text: DOI
Kumar, Akash; Seshadhri, C.; Stolman, Andrew Random walks and forbidden minors I: an \(n^{1/2+o(1)}\)-query one-sided tester for minor closed properties on bounded degree graphs. (English) Zbl 07294220 SIAM J. Comput. 49, No. 6, FOCS18-216-FOCS18-249 (2020). MSC: 68Q25 68R10 68W20 05C83 PDF BibTeX XML Cite \textit{A. Kumar} et al., SIAM J. Comput. 49, No. 6, FOCS18--216-FOCS18--249 (2020; Zbl 07294220) Full Text: DOI
Daskalakis, Emmanouil; Herrmann, Felix J.; Kuske, Rachel Accelerating sparse recovery by reducing chatter. (English) Zbl 07292223 SIAM J. Imaging Sci. 13, No. 3, 1211-1239 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{E. Daskalakis} et al., SIAM J. Imaging Sci. 13, No. 3, 1211--1239 (2020; Zbl 07292223) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Schneck, Thomas Efficient generation of different topological representations of graphs beyond-planarity. (English) Zbl 1451.05055 J. Graph Algorithms Appl. 24, No. 4, 573-601 (2020). MSC: 05C10 05C62 05C85 PDF BibTeX XML Cite \textit{P. Angelini} et al., J. Graph Algorithms Appl. 24, No. 4, 573--601 (2020; Zbl 1451.05055) Full Text: DOI
Aichholzer, Oswin; Balko, Martin; Hoffmann, Michael; Kynčl, Jan; Mulzer, Wolfgang; Parada, Irene; Pilz, Alexander; Scheucher, Manfred; Valtr, Pavel; Vogtenhuber, Birgit; Welzl, Emo Minimal representations of order types by geometric graphs. (English) Zbl 1451.05220 J. Graph Algorithms Appl. 24, No. 4, 551-572 (2020). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{O. Aichholzer} et al., J. Graph Algorithms Appl. 24, No. 4, 551--572 (2020; Zbl 1451.05220) Full Text: DOI
Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David; Rawitz, Dror Efficiently realizing interval sequences. (English) Zbl 07282387 SIAM J. Discrete Math. 34, No. 4, 2318-2337 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{A. Bar-Noy} et al., SIAM J. Discrete Math. 34, No. 4, 2318--2337 (2020; Zbl 07282387) Full Text: DOI
Kawarabayashi, Ken-ichi; Xu, Chao Minimum violation vertex maps and their applications to cut problems. (English) Zbl 07282379 SIAM J. Discrete Math. 34, No. 4, 2183-2207 (2020). MSC: 05C60 05C75 05C85 05C20 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} and \textit{C. Xu}, SIAM J. Discrete Math. 34, No. 4, 2183--2207 (2020; Zbl 07282379) Full Text: DOI
Romero, Pantaleón D.; Coêlho, Jéferson R. P.; Mendes de Jesus, Catarina An algorithm for the determination of graphs associated to fold maps between closed surfaces. (English) Zbl 1448.58031 Math. Methods Appl. Sci. 43, No. 14, 8177-8191 (2020). MSC: 58K05 05C85 57R45 58K15 68R10 PDF BibTeX XML Cite \textit{P. D. Romero} et al., Math. Methods Appl. Sci. 43, No. 14, 8177--8191 (2020; Zbl 1448.58031) Full Text: DOI
Exoo, Geoffrey; Ismailescu, Dan A 6-chromatic two-distance graph in the plane. (English) Zbl 1452.05048 Geombinatorics 29, No. 3, 97-103 (2020). MSC: 05C12 05C10 05C15 05C85 PDF BibTeX XML Cite \textit{G. Exoo} and \textit{D. Ismailescu}, Geombinatorics 29, No. 3, 97--103 (2020; Zbl 1452.05048)
Azad, Ariful; Buluç, Aydin; Li, Xiaoye S.; Wang, Xinliang; Langguth, Johannes A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs. (English) Zbl 1451.05189 SIAM J. Sci. Comput. 42, No. 4, C143-C168 (2020). MSC: 05C70 05C85 05C22 68W10 05D15 68W25 PDF BibTeX XML Cite \textit{A. Azad} et al., SIAM J. Sci. Comput. 42, No. 4, C143--C168 (2020; Zbl 1451.05189) Full Text: DOI
Daneshmand, Amir; Scutari, Gesualdo; Kungurtsev, Vyacheslav Second-order guarantees of distributed gradient algorithms. (English) Zbl 07271854 SIAM J. Optim. 30, No. 4, 3029-3068 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{A. Daneshmand} et al., SIAM J. Optim. 30, No. 4, 3029--3068 (2020; Zbl 07271854) Full Text: DOI
Buzatu, Radu On the computational complexity of optimization convex covering problems of graphs. (English) Zbl 1445.68107 Comput. Sci. J. Mold. 28, No. 2, 187-200 (2020). MSC: 68Q25 05C70 68Q17 68R10 PDF BibTeX XML Cite \textit{R. Buzatu}, Comput. Sci. J. Mold. 28, No. 2, 187--200 (2020; Zbl 1445.68107) Full Text: Link
Benazi, Makhlouf; Lamiche, Chaabane Community detection based on node similarity without thresholds. (English) Zbl 1445.68148 Comput. Sci. J. Mold. 28, No. 1, 104-119 (2020). MSC: 68R10 68W40 91D30 PDF BibTeX XML Cite \textit{M. Benazi} and \textit{C. Lamiche}, Comput. Sci. J. Mold. 28, No. 1, 104--119 (2020; Zbl 1445.68148) Full Text: Link
Saleem, Zain Hamid Max-independent set and the quantum alternating operator ansatz. (English) Zbl 1450.81027 Int. J. Quantum Inf. 18, No. 4, Article ID 2050011, 10 p. (2020). MSC: 81P68 05C69 68R10 68U05 PDF BibTeX XML Cite \textit{Z. H. Saleem}, Int. J. Quantum Inf. 18, No. 4, Article ID 2050011, 10 p. (2020; Zbl 1450.81027) Full Text: DOI
Avin, Chen; Bienkowski, Marcin; Loukas, Andreas; Pacut, Maciej; Schmid, Stefan Dynamic balanced graph partitioning. (English) Zbl 07267908 SIAM J. Discrete Math. 34, No. 3, 1791-1812 (2020). MSC: 68R10 68W05 68W40 68Q25 PDF BibTeX XML Cite \textit{C. Avin} et al., SIAM J. Discrete Math. 34, No. 3, 1791--1812 (2020; Zbl 07267908) Full Text: DOI
Hell, Pavol; Huang, Jing; Lin, Jephian C.-H.; McConnell, Ross M. Bipartite analogues of comparability and cocomparability graphs. (English) Zbl 1450.05089 SIAM J. Discrete Math. 34, No. 3, 1969-1983 (2020). MSC: 05C99 05C75 05C85 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1969--1983 (2020; Zbl 1450.05089) Full Text: DOI
Zheng, Ruigang; Chen, Weifu; Feng, Guocan A concise survey on graph convolutional networks. (Chinese. English summary) Zbl 07266360 Acta Sci. Nat. Univ. Sunyatseni 59, No. 2, 1-14 (2020). MSC: 05C85 68R10 68T05 PDF BibTeX XML Cite \textit{R. Zheng} et al., Acta Sci. Nat. Univ. Sunyatseni 59, No. 2, 1--14 (2020; Zbl 07266360) Full Text: DOI
Gu, Yanbo; Li, Jingwen; Wen, Fei Randomly generated algorithm of hexagonal system with equal Randić energy. (Chinese. English summary) Zbl 07266344 Acta Sci. Nat. Univ. Nankaiensis 53, No. 2, 7-13 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{Y. Gu} et al., Acta Sci. Nat. Univ. Nankaiensis 53, No. 2, 7--13 (2020; Zbl 07266344)
Sun, Tianyuan; Wang, Yongcai; Li, Deying A survey and evaluation of graph realization algorithms. (Chinese. English summary) Zbl 07266273 Acta Autom. Sin. 46, No. 4, 613-630 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{T. Sun} et al., Acta Autom. Sin. 46, No. 4, 613--630 (2020; Zbl 07266273) Full Text: DOI
Bordenave, Charles; Feige, Uriel; Mossel, Elchanan Shotgun assembly of random jigsaw puzzles. (English) Zbl 1450.05023 Random Struct. Algorithms 56, No. 4, 998-1015 (2020). MSC: 05C15 05C99 05C85 60C05 PDF BibTeX XML Cite \textit{C. Bordenave} et al., Random Struct. Algorithms 56, No. 4, 998--1015 (2020; Zbl 1450.05023) Full Text: DOI
Biniaz, Ahmad Plane hop spanners for unit disk graphs: simpler and better. (English) Zbl 1450.05083 Comput. Geom. 89, Article ID 101622, 12 p. (2020). MSC: 05C82 05C85 05C12 68R10 68M10 PDF BibTeX XML Cite \textit{A. Biniaz}, Comput. Geom. 89, Article ID 101622, 12 p. (2020; Zbl 1450.05083) Full Text: DOI
Banik, Aritra; Sahlot, Vibha; Saurabh, Saket Approximation algorithms for geometric conflict free covering problems. (English) Zbl 1444.68272 Comput. Geom. 89, Article ID 101591, 8 p. (2020). MSC: 68U05 05C62 68R10 68W25 PDF BibTeX XML Cite \textit{A. Banik} et al., Comput. Geom. 89, Article ID 101591, 8 p. (2020; Zbl 1444.68272) Full Text: DOI
Pilz, Alexander; Welzl, Emo; Wettstein, Manuel From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices. (English) Zbl 1450.05016 Discrete Comput. Geom. 64, No. 3, 1067-1097 (2020). MSC: 05C10 05C62 05C30 52C99 68U05 68Q25 PDF BibTeX XML Cite \textit{A. Pilz} et al., Discrete Comput. Geom. 64, No. 3, 1067--1097 (2020; Zbl 1450.05016) Full Text: DOI
Keller, Chaya; Smorodinsky, Shakhar Conflict-free coloring of intersection graphs of geometric objects. (English) Zbl 1450.05030 Discrete Comput. Geom. 64, No. 3, 916-941 (2020). MSC: 05C15 05C10 68W40 PDF BibTeX XML Cite \textit{C. Keller} and \textit{S. Smorodinsky}, Discrete Comput. Geom. 64, No. 3, 916--941 (2020; Zbl 1450.05030) Full Text: DOI
Gorgi, Abbass; El Ouali, Mourad; Srivastav, Anand; Hachimi, Mohamed Approximation of set multi-cover via hypergraph matching. (English) Zbl 07264850 Theor. Comput. Sci. 845, 136-143 (2020). MSC: 68R10 05C65 05C70 05C85 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{A. Gorgi} et al., Theor. Comput. Sci. 845, 136--143 (2020; Zbl 07264850) Full Text: DOI
Coviello Gonzalez, Miguel; Chrobak, Marek Towards a theory of mixing graphs: a characterization of perfect mixability. (English) Zbl 07264848 Theor. Comput. Sci. 845, 98-121 (2020). MSC: 68R10 05C85 68Q09 68W40 PDF BibTeX XML Cite \textit{M. Coviello Gonzalez} and \textit{M. Chrobak}, Theor. Comput. Sci. 845, 98--121 (2020; Zbl 07264848) Full Text: DOI
Behera, Balaram D. Sorting an array using the topological sort of a corresponding comparison graph. (English) Zbl 07264847 Theor. Comput. Sci. 845, 76-97 (2020). MSC: 68P10 68R10 PDF BibTeX XML Cite \textit{B. D. Behera}, Theor. Comput. Sci. 845, 76--97 (2020; Zbl 07264847) Full Text: DOI
Jallu, Ramesh K.; Jena, Sangram K.; Das, Gautam K. Liar’s domination in unit disk graphs. (English) Zbl 07264844 Theor. Comput. Sci. 845, 38-49 (2020). MSC: 68R10 05C62 05C69 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{R. K. Jallu} et al., Theor. Comput. Sci. 845, 38--49 (2020; Zbl 07264844) Full Text: DOI
Choudhary, Pratibha; Jain, Pallavi; Krithika, R.; Sahlot, Vibha Vertex deletion on split graphs: beyond 4-hitting set. (English) Zbl 07264843 Theor. Comput. Sci. 845, 21-37 (2020). MSC: 68R10 68Q27 68W25 PDF BibTeX XML Cite \textit{P. Choudhary} et al., Theor. Comput. Sci. 845, 21--37 (2020; Zbl 07264843) Full Text: DOI
Haraguchi, Kazuya; Torii, Kotaro; Endo, Motomu Maximum weighted matching with few edge crossings for 2-layered bipartite graph. (English) Zbl 1448.05097 Discrete Appl. Math. 287, 40-52 (2020). MSC: 05C22 05C35 05C70 05C85 PDF BibTeX XML Cite \textit{K. Haraguchi} et al., Discrete Appl. Math. 287, 40--52 (2020; Zbl 1448.05097) Full Text: DOI
Bowler, Nathan; Jowett, Susan Recognising graphic and matroidal connectivity functions. (English) Zbl 1448.05029 Discrete Math. 343, No. 12, Article ID 112093, 7 p. (2020). MSC: 05B35 05C99 05C85 52B40 68Q17 PDF BibTeX XML Cite \textit{N. Bowler} and \textit{S. Jowett}, Discrete Math. 343, No. 12, Article ID 112093, 7 p. (2020; Zbl 1448.05029) Full Text: DOI
Malmberg, Filip; Ciesielski, Krzysztof Chris Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions. (English) Zbl 07255770 J. Math. Imaging Vis. 62, No. 5, 737-750 (2020). MSC: 68 94 68Q25 68W40 68R10 PDF BibTeX XML Cite \textit{F. Malmberg} and \textit{K. C. Ciesielski}, J. Math. Imaging Vis. 62, No. 5, 737--750 (2020; Zbl 07255770) Full Text: DOI
Louridas, Panos Algorithms. (English) Zbl 1444.68003 The MIT Press Essential Knowledge Series. Cambridge, MA: MIT Press (ISBN 978-0-262-53902-9/pbk). xii, 280 p. (2020). MSC: 68-01 00A09 68P10 68R10 68T05 68Wxx PDF BibTeX XML Cite \textit{P. Louridas}, Algorithms. Cambridge, MA: MIT Press (2020; Zbl 1444.68003)
Cheng, Songsong; Liang, Shu Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate. (English) Zbl 07250737 Kybernetika 56, No. 3, 559-577 (2020). MSC: 90C33 68W15 PDF BibTeX XML Cite \textit{S. Cheng} and \textit{S. Liang}, Kybernetika 56, No. 3, 559--577 (2020; Zbl 07250737) Full Text: DOI
Rajalaxmi, T. M.; Parthiban, N.; Ryan, Joe; Shantrinal, A. Arul; Rajan, R. Sundara A linear time algorithm for embedding chord graphs into certain necklace and windmill graphs. (English) Zbl 07250384 DML, Discrete Math. Lett. 3, 50-56 (2020). MSC: 05C12 05C60 05C85 PDF BibTeX XML Cite \textit{T. M. Rajalaxmi} et al., DML, Discrete Math. Lett. 3, 50--56 (2020; Zbl 07250384) Full Text: Link
Zhang, Jiawei; Luo, Zhi-Quan A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. (English) Zbl 07248640 SIAM J. Optim. 30, No. 3, 2272-2302 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{J. Zhang} and \textit{Z.-Q. Luo}, SIAM J. Optim. 30, No. 3, 2272--2302 (2020; Zbl 07248640) Full Text: DOI
Sangha, Pavan; Zito, Michele Independent sets in Line of Sight networks. (English) Zbl 1448.05154 Discrete Appl. Math. 286, 100-115 (2020). MSC: 05C69 05C85 05C82 05C90 68W25 PDF BibTeX XML Cite \textit{P. Sangha} and \textit{M. Zito}, Discrete Appl. Math. 286, 100--115 (2020; Zbl 1448.05154) Full Text: DOI
Alon, Yahav; Krivelevich, Michael Finding a Hamilton cycle fast on average using rotations and extensions. (English) Zbl 07247996 Random Struct. Algorithms 57, No. 1, 32-46 (2020). MSC: 68R10 05C38 05C45 05C80 05C85 68W40 PDF BibTeX XML Cite \textit{Y. Alon} and \textit{M. Krivelevich}, Random Struct. Algorithms 57, No. 1, 32--46 (2020; Zbl 07247996) Full Text: DOI
Akrida, Eleni C.; Mertzios, George B.; Nikoletseas, Sotiris; Raptopoulos, Christoforos; Spirakis, Paul G.; Zamaraev, Viktor How fast can we reach a target vertex in stochastic temporal graphs? (English) Zbl 07244279 J. Comput. Syst. Sci. 114, 65-83 (2020). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 68Q87 68W25 PDF BibTeX XML Cite \textit{E. C. Akrida} et al., J. Comput. Syst. Sci. 114, 65--83 (2020; Zbl 07244279) Full Text: DOI
Wang, Biing-Feng; Ye, Jhih-Hong; Li, Chih-Yu An improved algorithm for the minmax regret path center problem on trees. (English) Zbl 1446.68126 J. Comput. Syst. Sci. 114, 36-47 (2020). MSC: 68R10 68W40 90B80 90C35 90C47 PDF BibTeX XML Cite \textit{B.-F. Wang} et al., J. Comput. Syst. Sci. 114, 36--47 (2020; Zbl 1446.68126) Full Text: DOI
Damaschke, Peter Enumerating grid layouts of graphs. (English) Zbl 1447.05107 J. Graph Algorithms Appl. 24, No. 3, 433-460 (2020). MSC: 05C30 05C85 PDF BibTeX XML Cite \textit{P. Damaschke}, J. Graph Algorithms Appl. 24, No. 3, 433--460 (2020; Zbl 1447.05107) Full Text: DOI
Scheucher, Manfred; Schrezenmaier, Hendrik; Steiner, Raphael A note on universal point sets for planar graphs. (English) Zbl 1447.05065 J. Graph Algorithms Appl. 24, No. 3, 247-267 (2020). MSC: 05C10 05C30 05C85 68R10 PDF BibTeX XML Cite \textit{M. Scheucher} et al., J. Graph Algorithms Appl. 24, No. 3, 247--267 (2020; Zbl 1447.05065) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 90C35 PDF BibTeX XML Cite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Burkhardt, Paul; Faber, Vance; Harris, David G. Bounds and algorithms for graph trusses. (English) Zbl 1447.05193 J. Graph Algorithms Appl. 24, No. 3, 191-214 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{P. Burkhardt} et al., J. Graph Algorithms Appl. 24, No. 3, 191--214 (2020; Zbl 1447.05193) Full Text: DOI
Solano, Geoffrey; Blin, Guillaume; Raffinot, Mathieu; Clemente, Jhoirene; Caro, Jaime On the approximability of the minimum weight \(t\)-partite clique problem. (English) Zbl 1447.05196 J. Graph Algorithms Appl. 24, No. 3, 171-190 (2020). MSC: 05C85 05C69 05C90 92D10 68Q17 68Q25 PDF BibTeX XML Cite \textit{G. Solano} et al., J. Graph Algorithms Appl. 24, No. 3, 171--190 (2020; Zbl 1447.05196) Full Text: DOI
Chimani, Markus; Dahn, Christine; Juhnke-Kubitzke, Martina; Kriege, Nils M.; Mutzel, Petra; Nover, Alexander Maximum cut parameterized by crossing number. (English) Zbl 1447.05194 J. Graph Algorithms Appl. 24, No. 3, 155-170 (2020). MSC: 05C85 05C22 05C30 05C62 68Q25 PDF BibTeX XML Cite \textit{M. Chimani} et al., J. Graph Algorithms Appl. 24, No. 3, 155--170 (2020; Zbl 1447.05194) Full Text: DOI
Ehounou, Wilfried; Barth, Dominique; de Moissac, Arnaud; Watel, Dimitri; Weisser, Marc-Antoine Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. (English) Zbl 1447.05069 J. Graph Algorithms Appl. 24, No. 3, 133-153 (2020). MSC: 05C12 05C35 05C82 05C85 05C90 05C20 PDF BibTeX XML Cite \textit{W. Ehounou} et al., J. Graph Algorithms Appl. 24, No. 3, 133--153 (2020; Zbl 1447.05069) Full Text: DOI
An, Zhao; Feng, Qilong; Kanj, Iyad; Xia, Ge The complexity of tree partitioning. (English) Zbl 07243308 Algorithmica 82, No. 9, 2606-2643 (2020). MSC: 68R10 05C05 05C70 05C85 68Q27 68W40 PDF BibTeX XML Cite \textit{Z. An} et al., Algorithmica 82, No. 9, 2606--2643 (2020; Zbl 07243308) Full Text: DOI
Brandt, Sebastian; Foerster, Klaus-Tycho; Maurer, Jonathan; Wattenhofer, Roger Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs. (English) Zbl 07243139 Theor. Comput. Sci. 839, 176-185 (2020). MSC: 68W27 68R10 PDF BibTeX XML Cite \textit{S. Brandt} et al., Theor. Comput. Sci. 839, 176--185 (2020; Zbl 07243139) Full Text: DOI
Feng, Yan-Quan; Kovács, István; Yang, Da-Wei On groups all of whose Haar graphs are Cayley graphs. (English) Zbl 1447.05103 J. Algebr. Comb. 52, No. 1, 59-76 (2020). MSC: 05C25 05E18 20B25 05C85 05C12 05C60 05C38 PDF BibTeX XML Cite \textit{Y.-Q. Feng} et al., J. Algebr. Comb. 52, No. 1, 59--76 (2020; Zbl 1447.05103) Full Text: DOI
Eppstein, David Treetopes and their graphs. (English) Zbl 07242476 Discrete Comput. Geom. 64, No. 2, 259-289 (2020). MSC: 52B10 05C05 05C62 68W40 05C10 05C99 52B05 PDF BibTeX XML Cite \textit{D. Eppstein}, Discrete Comput. Geom. 64, No. 2, 259--289 (2020; Zbl 07242476) Full Text: DOI
Couto, Fernanda; Cunha, Luís Felipe I. Hardness and efficiency on minimizing maximum distances in spanning trees. (English) Zbl 07242334 Theor. Comput. Sci. 838, 168-179 (2020). MSC: 68R10 05C12 68Q17 68Q25 PDF BibTeX XML Cite \textit{F. Couto} and \textit{L. F. I. Cunha}, Theor. Comput. Sci. 838, 168--179 (2020; Zbl 07242334) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for minimum weight connected-\(k\)-subgraph cover. (English) Zbl 07242333 Theor. Comput. Sci. 838, 160-167 (2020). MSC: 68R10 05C70 05C85 68W25 90C27 PDF BibTeX XML Cite \textit{P. Liu} et al., Theor. Comput. Sci. 838, 160--167 (2020; Zbl 07242333) Full Text: DOI
J., Girish Raguvir; Kashyop, Manas Jyoti; Narayanaswamy, N. S. Dynamic data structures for interval coloring. (English) Zbl 07242331 Theor. Comput. Sci. 838, 126-142 (2020). MSC: 68P05 05C15 05C62 05C85 68R10 PDF BibTeX XML Cite \textit{G. R. J.} et al., Theor. Comput. Sci. 838, 126--142 (2020; Zbl 07242331) Full Text: DOI
Bliznets, Ivan; Sagunov, Danil Lower bounds for the happy coloring problems. (English) Zbl 07242329 Theor. Comput. Sci. 838, 94-110 (2020). MSC: 68R10 05C15 68Q17 68Q27 68W20 PDF BibTeX XML Cite \textit{I. Bliznets} and \textit{D. Sagunov}, Theor. Comput. Sci. 838, 94--110 (2020; Zbl 07242329) Full Text: DOI
Le, Hung; Zheng, Baigong Local search is a PTAS for feedback vertex set in minor-free graphs. (English) Zbl 07242323 Theor. Comput. Sci. 838, 17-24 (2020). MSC: 68R10 68W25 PDF BibTeX XML Cite \textit{H. Le} and \textit{B. Zheng}, Theor. Comput. Sci. 838, 17--24 (2020; Zbl 07242323) Full Text: DOI
Gitler, Isidoro; Sandoval-Angeles, Gustavo An algorithm for delta-wye reduction of almost-planar graphs. (English) Zbl 1447.05195 Discrete Appl. Math. 285, 631-641 (2020). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{I. Gitler} and \textit{G. Sandoval-Angeles}, Discrete Appl. Math. 285, 631--641 (2020; Zbl 1447.05195) Full Text: DOI
Nägele, Martin; Zenklusen, Rico A new contraction technique with applications to congruency-constrained cuts. (English) Zbl 1450.90046 Math. Program. 183, No. 1-2 (B), 455-481 (2020). MSC: 90C27 90C35 68R05 68Q25 05C99 PDF BibTeX XML Cite \textit{M. Nägele} and \textit{R. Zenklusen}, Math. Program. 183, No. 1--2 (B), 455--481 (2020; Zbl 1450.90046) Full Text: DOI
Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu Conflict free version of covering problems on graphs: classical and parameterized. (English) Zbl 07240646 Theory Comput. Syst. 64, No. 6, 1067-1093 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{P. Jain} et al., Theory Comput. Syst. 64, No. 6, 1067--1093 (2020; Zbl 07240646) Full Text: DOI
Durfee, David; Peebles, John; Peng, Richard; Rao, Anup B. Determinant-preserving sparsification of SDDM matrices. (English) Zbl 1451.68200 SIAM J. Comput. 49, No. 4, FOCS17-350-FOCS17-408 (2020). MSC: 68R10 05C50 05C80 68Q87 68W25 PDF BibTeX XML Cite \textit{D. Durfee} et al., SIAM J. Comput. 49, No. 4, FOCS17--350-FOCS17--408 (2020; Zbl 1451.68200) Full Text: DOI
Navon, Tal; Peleg, David Mixed fault tolerance in server assignment: combining reinforcement and backup. (English) Zbl 1452.68028 Theor. Comput. Sci. 836, 76-93 (2020). MSC: 68M15 68R10 68W25 90B80 PDF BibTeX XML Cite \textit{T. Navon} and \textit{D. Peleg}, Theor. Comput. Sci. 836, 76--93 (2020; Zbl 1452.68028) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. (English) Zbl 1452.68139 Theor. Comput. Sci. 836, 59-64 (2020). MSC: 68R10 05C22 05C62 68W25 PDF BibTeX XML Cite \textit{P. Liu} et al., Theor. Comput. Sci. 836, 59--64 (2020; Zbl 1452.68139) Full Text: DOI
Becchetti, Luca; Clementi, Andrea E.; Natale, Emanuele; Pasquale, Francesco; Trevisan, Luca Find your place: simple distributed algorithms for community detection. (English) Zbl 1451.68344 SIAM J. Comput. 49, No. 4, 821-864 (2020). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{L. Becchetti} et al., SIAM J. Comput. 49, No. 4, 821--864 (2020; Zbl 1451.68344) Full Text: DOI
Chalermsook, Parinya; Cygan, Marek; Kortsarz, Guy; Laekhanukit, Bundit; Manurangsi, Pasin; Nanongkai, Danupon; Trevisan, Luca From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more. (English) Zbl 1452.68083 SIAM J. Comput. 49, No. 4, 772-810 (2020). MSC: 68Q17 05C69 68Q27 68R10 68W25 68W40 PDF BibTeX XML Cite \textit{P. Chalermsook} et al., SIAM J. Comput. 49, No. 4, 772--810 (2020; Zbl 1452.68083) Full Text: DOI
Eden, Talya; Ron, Dana; Seshadhri, C. On approximating the number of \(k\)-cliques in sublinear time. (English) Zbl 1452.68276 SIAM J. Comput. 49, No. 4, 747-771 (2020). MSC: 68W25 05C69 68Q25 68R10 68W20 PDF BibTeX XML Cite \textit{T. Eden} et al., SIAM J. Comput. 49, No. 4, 747--771 (2020; Zbl 1452.68276) Full Text: DOI
Harris, David G. Distributed local approximation algorithms for maximum matching in graphs and hypergraphs. (English) Zbl 1445.05098 SIAM J. Comput. 49, No. 4, 711-746 (2020). MSC: 05C82 05C65 05C85 05C70 05C35 68W25 68Q10 PDF BibTeX XML Cite \textit{D. G. Harris}, SIAM J. Comput. 49, No. 4, 711--746 (2020; Zbl 1445.05098) Full Text: DOI
Lintzmayer, Carla N.; Miyazawa, Flávio K.; Moura, Phablo F. S.; Xavier, Eduardo C. Randomized approximation scheme for Steiner multi cycle in the Euclidean plane. (English) Zbl 1452.68138 Theor. Comput. Sci. 835, 134-155 (2020). MSC: 68R10 68U05 68W20 68W25 90B06 PDF BibTeX XML Cite \textit{C. N. Lintzmayer} et al., Theor. Comput. Sci. 835, 134--155 (2020; Zbl 1452.68138) Full Text: DOI
Tollis, Ioannis G.; Kakoulis, Konstantinos G. Algorithms for visualizing phylogenetic networks. (English) Zbl 1452.68142 Theor. Comput. Sci. 835, 31-43 (2020). MSC: 68R10 68W40 92D15 PDF BibTeX XML Cite \textit{I. G. Tollis} and \textit{K. G. Kakoulis}, Theor. Comput. Sci. 835, 31--43 (2020; Zbl 1452.68142) Full Text: DOI
Li, Congcong; Liu, Jinglei Random graphic model generation algorithm based on Prüfer code. (Chinese. English summary) Zbl 1449.05232 J. Shaanxi Norm. Univ., Nat. Sci. Ed. 48, No. 2, 43-51 (2020). MSC: 05C85 05C80 05C90 68R10 68T99 PDF BibTeX XML Cite \textit{C. Li} and \textit{J. Liu}, J. Shaanxi Norm. Univ., Nat. Sci. Ed. 48, No. 2, 43--51 (2020; Zbl 1449.05232) Full Text: DOI
Bonnet, Édouard; Bousquet, Nicolas; Charbit, Pierre; Thomassé, Stéphan; Watrigant, Rémi Parameterized complexity of independent set in H-free graphs. (English) Zbl 1452.68090 Algorithmica 82, No. 8, 2360-2394 (2020). MSC: 68Q27 05C69 05C85 68Q17 68R10 PDF BibTeX XML Cite \textit{É. Bonnet} et al., Algorithmica 82, No. 8, 2360--2394 (2020; Zbl 1452.68090) Full Text: DOI
Eppstein, David; Havvaei, Elham Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1452.68135 Algorithmica 82, No. 8, 2337-2359 (2020). MSC: 68R10 03B70 05C05 05C76 05C85 68Q27 92D15 PDF BibTeX XML Cite \textit{D. Eppstein} and \textit{E. Havvaei}, Algorithmica 82, No. 8, 2337--2359 (2020; Zbl 1452.68135) Full Text: DOI
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; dos Santos, Vinícius Fernandes; Sau, Ignasi; Silva, Ana Dual parameterization of weighted coloring. (English) Zbl 1452.68129 Algorithmica 82, No. 8, 2316-2336 (2020). MSC: 68R10 05C15 68Q27 68W40 PDF BibTeX XML Cite \textit{J. Araújo} et al., Algorithmica 82, No. 8, 2316--2336 (2020; Zbl 1452.68129) Full Text: DOI
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 1452.68134 Algorithmica 82, No. 8, 2292-2315 (2020). MSC: 68R10 05C09 05C12 68P05 68Q25 68U05 PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 82, No. 8, 2292--2315 (2020; Zbl 1452.68134) Full Text: DOI