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
Changat, Manoj; Narasimha-Shenoi, Prasanth G.; Nezhad, Ferdoos Hossein; Kovše, Matjaž; Mohandas, Shilpa; Ramachandran, Abisha; Stadler, Peter F. Transit sets of two-point crossover. (English) Zbl 07313296 Art Discrete Appl. Math. 4, No. 1, Paper No. P1.09, 10 p. (2021). MSC: 05C62 05C75 PDF BibTeX XML Cite \textit{M. Changat} et al., Art Discrete Appl. Math. 4, No. 1, Paper No. P1.09, 10 p. (2021; Zbl 07313296) Full Text: DOI
Tura, Fernando C. A conjecture on the eigenvalues of threshold graphs. (English) Zbl 07312070 Linear Algebra Appl. 612, 345-356 (2021). MSC: 15A18 05C50 05C85 PDF BibTeX XML Cite \textit{F. C. Tura}, Linear Algebra Appl. 612, 345--356 (2021; Zbl 07312070) Full Text: DOI
Leiter, Noam; Zelazo, Daniel Edge-matching graph contractions and their interlacing properties. (English) Zbl 07312067 Linear Algebra Appl. 612, 289-317 (2021). MSC: 05A18 05C05 05C38 05C50 05C85 06A06 15A18 PDF BibTeX XML Cite \textit{N. Leiter} and \textit{D. Zelazo}, Linear Algebra Appl. 612, 289--317 (2021; Zbl 07312067) 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 05C70 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
Giannopoulou, Archontia; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin Linear kernels for edge deletion problems to immersion-closed graph classes. (English) Zbl 07310603 SIAM J. Discrete Math. 35, No. 1, 105-151 (2021). MSC: 05C70 05C75 05C83 05C85 PDF BibTeX XML Cite \textit{A. Giannopoulou} et al., SIAM J. Discrete Math. 35, No. 1, 105--151 (2021; Zbl 07310603) Full Text: DOI
Nobili, Paolo; Sassano, Antonio An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs. (English) Zbl 07310585 Math. Program. 186, No. 1-2 (A), 409-437 (2021). MSC: 05C69 05C85 05C70 PDF BibTeX XML Cite \textit{P. Nobili} and \textit{A. Sassano}, Math. Program. 186, No. 1--2 (A), 409--437 (2021; Zbl 07310585) Full Text: DOI
Boyd, Sylvia; Sebő, András The salesman’s improved tours for fundamental classes. (English) Zbl 07310581 Math. Program. 186, No. 1-2 (A), 289-307 (2021). MSC: 90C27 05C85 PDF BibTeX XML Cite \textit{S. Boyd} and \textit{A. Sebő}, Math. Program. 186, No. 1--2 (A), 289--307 (2021; Zbl 07310581) Full Text: DOI
Urschel, John C.; Zikatanov, Ludmil T. Discrete trace theorems and energy minimizing spring embeddings of planar graphs. (English) Zbl 07309790 Linear Algebra Appl. 609, 73-107 (2021). MSC: 05C50 05C10 05C40 05C62 05C85 15A18 PDF BibTeX XML Cite \textit{J. C. Urschel} and \textit{L. T. Zikatanov}, Linear Algebra Appl. 609, 73--107 (2021; Zbl 07309790) 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
Epple, Dennis A.; Huang, Jing \((k,l)\)-colourings and Ferrers diagram representations of cographs. (English) Zbl 07307245 Eur. J. Comb. 91, Article ID 103208, 12 p. (2021). MSC: 05C15 05C62 05C85 PDF BibTeX XML Cite \textit{D. A. Epple} and \textit{J. Huang}, Eur. J. Comb. 91, Article ID 103208, 12 p. (2021; Zbl 07307245) Full Text: DOI
Duraj, Lech; Kozik, Jakub; Shabanov, Dmitry Random hypergraphs and property B. (English) Zbl 07307242 Eur. J. Comb. 91, Article ID 103205, 11 p. (2021). MSC: 05C80 05C65 05C15 68W20 PDF BibTeX XML Cite \textit{L. Duraj} et al., Eur. J. Comb. 91, Article ID 103205, 11 p. (2021; Zbl 07307242) Full Text: DOI
Duque, Frank; Fabila-Monroy, Ruy; Hernández-Vélez, César; Hidalgo-Toscano, Carlos Counting the number of crossings in geometric graphs. (English) Zbl 07306056 Inf. Process. Lett. 165, Article ID 106028, 5 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{F. Duque} et al., Inf. Process. Lett. 165, Article ID 106028, 5 p. (2021; Zbl 07306056) 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
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 07305079 Theor. Comput. Sci. 858, 49-63 (2021). MSC: 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 858, 49--63 (2021; Zbl 07305079) Full Text: DOI
Lamprou, Ioannis; Sigalas, Ioannis; Zissimopoulos, Vassilis Improved budgeted connected domination and budgeted edge-vertex domination. (English) Zbl 07305076 Theor. Comput. Sci. 858, 1-12 (2021). MSC: 68W25 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{I. Lamprou} et al., Theor. Comput. Sci. 858, 1--12 (2021; Zbl 07305076) 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
Albers, Susanne; Schraink, Sebastian Tight bounds for online coloring of basic graph classes. (English) Zbl 07303851 Algorithmica 83, No. 1, 337-360 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{S. Albers} and \textit{S. Schraink}, Algorithmica 83, No. 1, 337--360 (2021; Zbl 07303851) 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
Frieze, Alan; Pegden, Wesley; Sorkin, Gregory B.; Tkocz, Tomasz Minimum-weight combinatorial structures under random cost-constraints. (English) Zbl 07303543 Electron. J. Comb. 28, No. 1, Research Paper P1.20, 18 p. (2021). MSC: 05C80 05C85 90C27 PDF BibTeX XML Cite \textit{A. Frieze} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.20, 18 p. (2021; Zbl 07303543) Full Text: DOI
Döcker, Janosch; Linz, Simone; Semple, Charles Display sets of normal and tree-child networks. (English) Zbl 07303531 Electron. J. Comb. 28, No. 1, Research Paper P1.8, 21 p. (2021). MSC: 05C82 05C20 05C85 92D15 92C42 PDF BibTeX XML Cite \textit{J. Döcker} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.8, 21 p. (2021; Zbl 07303531) 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
Fraser, Melanie Lewis Carroll and the red hot potato: a graph theoretic approach to a linear algebraic identity. (English) Zbl 07299420 Discrete Math. 344, No. 1, Article ID 112160, 13 p. (2021). MSC: 05C50 05C05 PDF BibTeX XML Cite \textit{M. Fraser}, Discrete Math. 344, No. 1, Article ID 112160, 13 p. (2021; Zbl 07299420) 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
Slettnes, Espen Minimal embedding dimensions of rectangle \(k\)-visibility graphs. (English) Zbl 1452.05181 J. Graph Algorithms Appl. 25, No. 1, 59-96 (2021). MSC: 05C85 PDF BibTeX XML Cite \textit{E. Slettnes}, J. Graph Algorithms Appl. 25, No. 1, 59--96 (2021; Zbl 1452.05181) Full Text: DOI
Dujmović, Vida; Morin, Pat; Yelle, Céline Two results on layered pathwidth and linear layouts. (English) Zbl 1452.05177 J. Graph Algorithms Appl. 25, No. 1, 43-57 (2021). MSC: 05C85 PDF BibTeX XML Cite \textit{V. Dujmović} et al., J. Graph Algorithms Appl. 25, No. 1, 43--57 (2021; Zbl 1452.05177) 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
Champseix, Nicolas; Galby, Esther; Munaro, Andrea; Ries, Bernard CPG graphs: some structural and hardness results. (English) Zbl 07293740 Discrete Appl. Math. 290, 17-35 (2021). Reviewer: Iztok Peterin (Maribor) MSC: 05C62 05C38 68Q25 05C76 PDF BibTeX XML Cite \textit{N. Champseix} et al., Discrete Appl. Math. 290, 17--35 (2021; Zbl 07293740) Full Text: DOI
Tamura, Yuma; Ito, Takehiro; Zhou, Xiao Approximability of the independent feedback vertex set problem for bipartite graphs. (English) Zbl 07285608 Theor. Comput. Sci. 849, 227-236 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{Y. Tamura} et al., Theor. Comput. Sci. 849, 227--236 (2021; Zbl 07285608) Full Text: DOI
Castañeda, Armando; Fraigniaud, Pierre; Paz, Ami; Rajsbaum, Sergio; Roy, Matthieu; Travers, Corentin A topological perspective on distributed network algorithms. (English) Zbl 07285599 Theor. Comput. Sci. 849, 121-137 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{A. Castañeda} et al., Theor. Comput. Sci. 849, 121--137 (2021; Zbl 07285599) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo Gathering robots in graphs: the central role of synchronicity. (English) Zbl 07285598 Theor. Comput. Sci. 849, 99-120 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{S. Cicerone} et al., Theor. Comput. Sci. 849, 99--120 (2021; Zbl 07285598) Full Text: DOI
Bärtschi, Andreas; Bampas, Evangelos; Chalopin, Jérémie; Das, Shantanu; Karousatou, Christina; Mihalák, Matúš Near-gathering of energy-constrained mobile agents. (English) Zbl 07285595 Theor. Comput. Sci. 849, 35-46 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{A. Bärtschi} et al., Theor. Comput. Sci. 849, 35--46 (2021; Zbl 07285595) Full Text: DOI
Lu, Hongliang; Wang, Wei; Jiang, Yaolin On the complexity of all \(( g , f )\)-factors problem. (English) Zbl 1453.05103 Discrete Math. 344, No. 2, Article ID 112193, 4 p. (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{H. Lu} et al., Discrete Math. 344, No. 2, Article ID 112193, 4 p. (2021; Zbl 1453.05103) Full Text: DOI
Crespelle, Christophe; Lokshtanov, Daniel; Phan, Thi Ha Duong; Thierry, Eric Faster and enhanced inclusion-minimal cograph completion. (English) Zbl 1451.05226 Discrete Appl. Math. 288, 138-151 (2021). MSC: 05C85 05C70 68Q17 PDF BibTeX XML Cite \textit{C. Crespelle} et al., Discrete Appl. Math. 288, 138--151 (2021; Zbl 1451.05226) Full Text: DOI
Asahiro, Yuichi; Furukawa, Tetsuya; Ikegami, Keiichi; Miyano, Eiji; Yagita, Tsuyoshi How to pack directed acyclic graphs into small blocks. (English) Zbl 1451.05188 Discrete Appl. Math. 288, 91-113 (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Discrete Appl. Math. 288, 91--113 (2021; Zbl 1451.05188) Full Text: DOI
Enright, Jessica; Meeks, Kitty; Skerman, Fiona Assigning times to minimise reachability in temporal graphs. (English) Zbl 07265474 J. Comput. Syst. Sci. 115, 169-186 (2021). MSC: 68 PDF BibTeX XML Cite \textit{J. Enright} et al., J. Comput. Syst. Sci. 115, 169--186 (2021; Zbl 07265474) 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
Elvey Price, Andrew; Fang, Wenjie; Wallner, Michael Compacted binary trees admit a stretched exponential. (English) Zbl 1448.05034 J. Comb. Theory, Ser. A 177, Article ID 105306, 40 p. (2021). MSC: 05C05 05C20 05C38 05C85 68Q45 PDF BibTeX XML Cite \textit{A. Elvey Price} et al., J. Comb. Theory, Ser. A 177, Article ID 105306, 40 p. (2021; Zbl 1448.05034) 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
Susanti, Yeni; Indah Puspitasari, Yulia; Khotimah, Husnul On total edge irregularity strength of staircase graphs and related graphs. (English) Zbl 07317620 Iran. J. Math. Sci. Inform. 15, No. 1, 1-13 (2020). MSC: 05C78 05C85 PDF BibTeX XML Cite \textit{Y. Susanti} et al., Iran. J. Math. Sci. Inform. 15, No. 1, 1--13 (2020; Zbl 07317620) Full Text: Link
Harutyunyan, Ararat; Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris On the complexity of the upper \(r\)-tolerant edge cover problem. (English) Zbl 07316481 Barbosa, Luís Soares (ed.) et al., Topics in theoretical computer science. Third IFIP WG 1.8 international conference, TTCS 2020, Tehran, Iran, July 1–2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-57851-0/pbk; 978-3-030-57852-7/ebook). Lecture Notes in Computer Science 12281, 32-47 (2020). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Harutyunyan} et al., Lect. Notes Comput. Sci. 12281, 32--47 (2020; Zbl 07316481) 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: 05C57 05C85 05C05 68R10 91A43 91A46 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
Adasme, Pablo; Dehghan Firoozabadi, Ali Degree-constrained \(k\)-minimum spanning tree problem. (English) Zbl 07304968 Complexity 2020, Article ID 7628105, 25 p. (2020). MSC: 90C35 90C27 90C59 05C05 05C85 PDF BibTeX XML Cite \textit{P. Adasme} and \textit{A. Dehghan Firoozabadi}, Complexity 2020, Article ID 7628105, 25 p. (2020; Zbl 07304968) Full Text: DOI
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
Wang, Haitao; Xue, Jie Near-optimal algorithms for shortest paths in weighted unit-disk graphs. (English) Zbl 07303719 Discrete Comput. Geom. 64, No. 4, 1141-1166 (2020). MSC: 68Q 68R 68P 68R99 68Q25 68P05 PDF BibTeX XML Cite \textit{H. Wang} and \textit{J. Xue}, Discrete Comput. Geom. 64, No. 4, 1141--1166 (2020; Zbl 07303719) 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
Salemi, Hosseinali; Buchanan, Austin Parsimonious formulations for low-diameter clusters. (English) Zbl 1452.90083 Math. Program. Comput. 12, No. 3, 493-528 (2020). MSC: 90B10 90C10 90C27 90C35 05C12 05C69 05C85 91D30 PDF BibTeX XML Cite \textit{H. Salemi} and \textit{A. Buchanan}, Math. Program. Comput. 12, No. 3, 493--528 (2020; Zbl 1452.90083) Full Text: DOI
Brandt, Sebastian; Uitto, Jara; Wattenhofer, Roger A tight lower bound for semi-synchronous collaborative grid exploration. (English) Zbl 07300285 Distrib. Comput. 33, No. 6, 471-484 (2020). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{S. Brandt} et al., Distrib. Comput. 33, No. 6, 471--484 (2020; Zbl 07300285) 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
Chuzhoy, Julia; Kim, David H. K.; Nimavat, Rachit New hardness results for routing on disjoint paths. (English) Zbl 07294218 SIAM J. Comput. 49, No. 6, STOC17-189-STOC17-237 (2020). MSC: 68Q25 68W25 PDF BibTeX XML Cite \textit{J. Chuzhoy} et al., SIAM J. Comput. 49, No. 6, STOC17--189-STOC17--237 (2020; Zbl 07294218) Full Text: DOI
Dai, Mei-Feng; Ju, Ting-Ting; Hou, Yong-Bo; Huang, Fang; Tang, Dong-Lei; Su, Wei-Yi Applications of Markov spectra for the weighted partition network by the substitution rule. (English) Zbl 1451.05216 Commun. Theor. Phys. 72, No. 5, Article ID 055602, 8 p. (2020). MSC: 05C82 05C85 PDF BibTeX XML Cite \textit{M.-F. Dai} et al., Commun. Theor. Phys. 72, No. 5, Article ID 055602, 8 p. (2020; Zbl 1451.05216) 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
Chen, Fati; Piccinini, Laurent; Poncelet, Pascal; Sallaberry, Arnaud Node overlap removal algorithms: an extended comparative study. (English) Zbl 1451.05225 J. Graph Algorithms Appl. 24, No. 4, 683-706 (2020). MSC: 05C85 PDF BibTeX XML Cite \textit{F. Chen} et al., J. Graph Algorithms Appl. 24, No. 4, 683--706 (2020; Zbl 1451.05225) Full Text: DOI
Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes Recognizing stick graphs with and without length constraints. (English) Zbl 1451.05223 J. Graph Algorithms Appl. 24, No. 4, 657-681 (2020). MSC: 05C85 68Q25 PDF BibTeX XML Cite \textit{S. Chaplick} et al., J. Graph Algorithms Appl. 24, No. 4, 657--681 (2020; Zbl 1451.05223) Full Text: DOI
Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-won; Ravsky, Alexander; Wolff, Alexander Bundled crossings revisited. (English) Zbl 1451.05224 J. Graph Algorithms Appl. 24, No. 4, 621-655 (2020). MSC: 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Chaplick} et al., J. Graph Algorithms Appl. 24, No. 4, 621--655 (2020; Zbl 1451.05224) Full Text: DOI
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for book embedding problems. (English) Zbl 1451.05222 J. Graph Algorithms Appl. 24, No. 4, 603-620 (2020). MSC: 05C85 PDF BibTeX XML Cite \textit{S. Bhore} et al., J. Graph Algorithms Appl. 24, No. 4, 603--620 (2020; Zbl 1451.05222) 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
Archambault, Daniel (ed.); Toth, Csaba (ed.) Guest editors’ foreword: special issue of selected papers from the 27th international symposium on graph drawing and network visualization (GD 2019). (English) Zbl 07288641 J. Graph Algorithms Appl. 24, No. 4, 547-549 (2020). MSC: 00Bxx 05C85 PDF BibTeX XML Cite \textit{D. Archambault} (ed.) and \textit{C. Toth} (ed.), J. Graph Algorithms Appl. 24, No. 4, 547--549 (2020; Zbl 07288641) Full Text: DOI
Gurski, Frank; Komander, Dominique; Rehs, Carolin Solutions for subset sum problems with special digraph constraints. (English) Zbl 07285844 Math. Methods Oper. Res. 92, No. 2, 401-433 (2020). MSC: 90C27 05C85 90C39 05C69 PDF BibTeX XML Cite \textit{F. Gurski} et al., Math. Methods Oper. Res. 92, No. 2, 401--433 (2020; Zbl 07285844) Full Text: DOI
Braun, Benjamin; Vega, Julianne Hajós-type constructions and neighborhood complexes. (English) Zbl 1453.05032 SIAM J. Discrete Math. 34, No. 4, 2424-2447 (2020). MSC: 05C15 05C85 05E45 PDF BibTeX XML Cite \textit{B. Braun} and \textit{J. Vega}, SIAM J. Discrete Math. 34, No. 4, 2424--2447 (2020; Zbl 1453.05032) Full Text: DOI
Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David; Rawitz, Dror Efficiently realizing interval sequences. (English) Zbl 1453.05123 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 1453.05123) Full Text: DOI
Kawarabayashi, Ken-ichi; Xu, Chao Minimum violation vertex maps and their applications to cut problems. (English) Zbl 1453.05072 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 1453.05072) Full Text: DOI
Dehghan, Ali; Banihashemi, Amir H. On computing the number of short cycles in bipartite graphs using the spectrum of the directed edge matrix. (English) Zbl 1452.05094 IEEE Trans. Inf. Theory 66, No. 10, 6037-6047 (2020). MSC: 05C38 94B05 05C85 05C50 PDF BibTeX XML Cite \textit{A. Dehghan} and \textit{A. H. Banihashemi}, IEEE Trans. Inf. Theory 66, No. 10, 6037--6047 (2020; Zbl 1452.05094) Full Text: DOI
Dehghan, Ali; Banihashemi, Amir H. On finding bipartite graphs with a small number of short cycles and large girth. (English) Zbl 1452.05093 IEEE Trans. Inf. Theory 66, No. 10, 6024-6036 (2020). MSC: 05C38 94B05 05C65 05C75 05C85 PDF BibTeX XML Cite \textit{A. Dehghan} and \textit{A. H. Banihashemi}, IEEE Trans. Inf. Theory 66, No. 10, 6024--6036 (2020; Zbl 1452.05093) Full Text: DOI
Stewart, Ian Finite characterization of the coarsest balanced coloring of a network. (English) Zbl 1453.05039 Int. J. Bifurcation Chaos Appl. Sci. Eng. 30, No. 14, Article ID 2050212, 13 p. (2020). MSC: 05C15 05C82 05C85 68Q17 PDF BibTeX XML Cite \textit{I. Stewart}, Int. J. Bifurcation Chaos Appl. Sci. Eng. 30, No. 14, Article ID 2050212, 13 p. (2020; Zbl 1453.05039) 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)
Elkin, Michael Distributed exact shortest paths in sublinear time. (English) Zbl 07273086 J. ACM 67, No. 3, Article No. 15, 36 p. (2020). MSC: 68 PDF BibTeX XML Cite \textit{M. Elkin}, J. ACM 67, No. 3, Article No. 15, 36 p. (2020; Zbl 07273086) Full Text: DOI
Elkin, Michael A simple deterministic distributed MST algorithm with near-optimal time and message complexities. (English) Zbl 07273084 J. ACM 67, No. 2, Article No. 13, 15 p. (2020). MSC: 68 PDF BibTeX XML Cite \textit{M. Elkin}, J. ACM 67, No. 2, Article No. 13, 15 p. (2020; Zbl 07273084) Full Text: DOI
Spencer, Joel Erdős magic. (English) Zbl 07272502 Chung, Fan (ed.) et al., 50 years of combinatorics, graph theory, and computing. Research surveys of the Southeastern international conference, SEICCGTC. Boca Raton, FL: CRC Press (ISBN 978-0-367-23503-1/hbk; 978-0-429-28009-2/ebook). Discrete Mathematics and Its Applications, 97-107 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C80 05C85 68W20 PDF BibTeX XML Cite \textit{J. Spencer}, in: 50 years of combinatorics, graph theory, and computing. Research surveys of the Southeastern international conference, SEICCGTC. Boca Raton, FL: CRC Press. 97--107 (2020; Zbl 07272502)
Morrow, Zachary; Stoyanov, Miroslav A method for dimensionally adaptive sparse trigonometric interpolation of periodic functions. (English) Zbl 1453.65032 SIAM J. Sci. Comput. 42, No. 4, A2436-A2460 (2020). MSC: 65D05 65D15 65T40 92E10 PDF BibTeX XML Cite \textit{Z. Morrow} and \textit{M. Stoyanov}, SIAM J. Sci. Comput. 42, No. 4, A2436--A2460 (2020; Zbl 1453.65032) Full Text: DOI
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
Xiao, Mingyu; Kou, Shaowei Parameterized algorithms and kernels for almost induced matching. (English) Zbl 07270957 Theor. Comput. Sci. 846, 103-113 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{M. Xiao} and \textit{S. Kou}, Theor. Comput. Sci. 846, 103--113 (2020; Zbl 07270957) Full Text: DOI
Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Zhu, Xuding Clustering powers of sparse graphs. (English) Zbl 1451.05131 Electron. J. Comb. 27, No. 4, Research Paper P4.17, 20 p. (2020). MSC: 05C42 05C85 05C15 PDF BibTeX XML Cite \textit{J. Nešetřil} et al., Electron. J. Comb. 27, No. 4, Research Paper P4.17, 20 p. (2020; Zbl 1451.05131) Full Text: DOI
Ajay, Jammigumpula; Das, Avinandan; Dutta, Binayak; Karmakar, Arindam; Roy, Sasanka; Saikia, Navaneeta Problems on one way road networks. (English) Zbl 1446.05084 J. Graph Algorithms Appl. 24, No. 3, 523-546 (2020). MSC: 05C85 68Q17 PDF BibTeX XML Cite \textit{J. Ajay} et al., J. Graph Algorithms Appl. 24, No. 3, 523--546 (2020; Zbl 1446.05084) Full Text: DOI
Bentert, Matthias; Dittmann, Alexander; Kellerhals, Leon; Nichterlein, André; Niedermeier, Rolf An adaptive version of Brandes’ algorithm for betweenness centrality. (English) Zbl 1446.05085 J. Graph Algorithms Appl. 24, No. 3, 483-522 (2020). MSC: 05C85 PDF BibTeX XML Cite \textit{M. Bentert} et al., J. Graph Algorithms Appl. 24, No. 3, 483--522 (2020; Zbl 1446.05085) Full Text: DOI
van Geffen, Bas A. M.; Jansen, Bart M. P.; de Kroon, Arnoud A. W. M.; Morel, Rolf Lower bounds for dynamic programming on planar graphs of bounded cutwidth. (English) Zbl 1446.05087 J. Graph Algorithms Appl. 24, No. 3, 461-482 (2020). MSC: 05C85 90C39 68Q17 90C60 PDF BibTeX XML Cite \textit{B. A. M. van Geffen} et al., J. Graph Algorithms Appl. 24, No. 3, 461--482 (2020; Zbl 1446.05087) 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
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Going far from degeneracy. (English) Zbl 1451.05229 SIAM J. Discrete Math. 34, No. 3, 1587-1601 (2020). MSC: 05C85 05C12 05C38 68Q17 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 34, No. 3, 1587--1601 (2020; Zbl 1451.05229) Full Text: DOI
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
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. I: General upper bounds. (English) Zbl 1450.05084 SIAM J. Discrete Math. 34, No. 3, 1623-1648 (2020). MSC: 05C83 05C85 68Q25 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., SIAM J. Discrete Math. 34, No. 3, 1623--1648 (2020; Zbl 1450.05084) 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