Jain, Sparsh; Pallathumadam, Sreejith K.; Rajendraprasad, Deepak B\(_0\)-VPG representation of at-free outerplanar graphs. (English) Zbl 07824364 J. Graph Algorithms Appl. 27, No. 9, 853-869 (2023). MSC: 05C10 05C38 05C62 05C85 PDFBibTeX XMLCite \textit{S. Jain} et al., J. Graph Algorithms Appl. 27, No. 9, 853--869 (2023; Zbl 07824364) Full Text: DOI
Dürrschnabel, Dominik; Hanika, Tom; Stumme, Gerd Drawing order diagrams through two-dimension extension. (English) Zbl 07781100 J. Graph Algorithms Appl. 27, No. 9, 783-802 (2023). MSC: 05C62 05C20 05C85 05C90 06A07 68R10 PDFBibTeX XMLCite \textit{D. Dürrschnabel} et al., J. Graph Algorithms Appl. 27, No. 9, 783--802 (2023; Zbl 07781100) Full Text: DOI arXiv
Calderoni, Luca; Margara, Luciano; Marzolla, Moreno A heuristic for direct product graph decomposition. (English) Zbl 1522.05368 J. Graph Algorithms Appl. 27, No. 7, 581-601 (2023). MSC: 05C70 05C20 05C76 05C85 68R10 PDFBibTeX XMLCite \textit{L. Calderoni} et al., J. Graph Algorithms Appl. 27, No. 7, 581--601 (2023; Zbl 1522.05368) Full Text: DOI arXiv
Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander The complexity of drawing graphs on few lines and few planes. (English) Zbl 1522.05327 J. Graph Algorithms Appl. 27, No. 6, 459-488 (2023). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., J. Graph Algorithms Appl. 27, No. 6, 459--488 (2023; Zbl 1522.05327) Full Text: DOI
Arroyo, Alan; Felsner, Stefan Approximating the bundled crossing number. (English) Zbl 1522.05322 J. Graph Algorithms Appl. 27, No. 6, 433-457 (2023). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{A. Arroyo} and \textit{S. Felsner}, J. Graph Algorithms Appl. 27, No. 6, 433--457 (2023; Zbl 1522.05322) Full Text: DOI
Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus; Wolf, Petra Order reconfiguration under width constraints. (English) Zbl 1522.05310 J. Graph Algorithms Appl. 27, No. 6, 409-431 (2023). MSC: 05C60 05C85 PDFBibTeX XMLCite \textit{E. Arrighi} et al., J. Graph Algorithms Appl. 27, No. 6, 409--431 (2023; Zbl 1522.05310) Full Text: DOI
Da Lozzo, Giordano (ed.); Kindermann, Philipp (ed.) Guest editors’ foreword: Special issue on parameterized and approximation algorithms in graph drawing. (English) Zbl 07740691 J. Graph Algorithms Appl. 27, No. 6, 405-408 (2023). MSC: 00B15 05-06 05C85 PDFBibTeX XMLCite \textit{G. Da Lozzo} (ed.) and \textit{P. Kindermann} (ed.), J. Graph Algorithms Appl. 27, No. 6, 405--408 (2023; Zbl 07740691) Full Text: DOI
Jacomy, Mathieu Connected-closeness: a visual quantification of distances in network layouts. (English) Zbl 1522.05468 J. Graph Algorithms Appl. 27, No. 5, 341-404 (2023). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{M. Jacomy}, J. Graph Algorithms Appl. 27, No. 5, 341--404 (2023; Zbl 1522.05468) Full Text: DOI
Eppstein, David; Lincoln, Andrea; Williams, Virginia Vassilevska Quasipolynomiality of the smallest missing induced subgraph. (English) Zbl 1522.05313 J. Graph Algorithms Appl. 27, No. 5, 329-339 (2023). MSC: 05C60 05C85 05C10 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., J. Graph Algorithms Appl. 27, No. 5, 329--339 (2023; Zbl 1522.05313) Full Text: DOI arXiv
Arseneva, Elena; Gangopadhyay, Rahul; Istomina, Aleksandra Morphing tree drawings in a small 3D grid. (English) Zbl 1518.05140 J. Graph Algorithms Appl. 27, No. 4, 241-279 (2023). MSC: 05C62 05C05 05C85 68R10 PDFBibTeX XMLCite \textit{E. Arseneva} et al., J. Graph Algorithms Appl. 27, No. 4, 241--279 (2023; Zbl 1518.05140) Full Text: DOI
Rahman, Md. Saidur (ed.); Mutzel, Petra (ed.); Slamin (ed.) Guest editors’ foreword: Special issue on selected papers from the 16th international workshop on algorithms and computation (WALCOM 2022). (English) Zbl 1520.68008 J. Graph Algorithms Appl. 27, No. 4, 239-240 (2023). MSC: 68-06 05C85 68Wxx 00B25 PDFBibTeX XMLCite \textit{Md. S. Rahman} (ed.) et al., J. Graph Algorithms Appl. 27, No. 4, 239--240 (2023; Zbl 1520.68008) Full Text: DOI
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Improved (in-)approximability bounds for \(d\)-scattered set. (English) Zbl 1518.05049 J. Graph Algorithms Appl. 27, No. 3, 219-238 (2023). MSC: 05C12 05C85 68W25 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., J. Graph Algorithms Appl. 27, No. 3, 219--238 (2023; Zbl 1518.05049) Full Text: DOI
Simard, Frédéric; Magnien, Clémence; Latapy, Matthieu Computing betweenness centrality in link streams. (English) Zbl 1518.05182 J. Graph Algorithms Appl. 27, No. 3, 195-217 (2023). MSC: 05C85 05C82 05C12 05C30 PDFBibTeX XMLCite \textit{F. Simard} et al., J. Graph Algorithms Appl. 27, No. 3, 195--217 (2023; Zbl 1518.05182) Full Text: DOI arXiv
Rymar, Maciej; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf Towards classifying the polynomial-time solvability of temporal betweenness centrality. (English) Zbl 1518.05052 J. Graph Algorithms Appl. 27, No. 3, 173-194 (2023). MSC: 05C12 05C82 05C85 PDFBibTeX XMLCite \textit{M. Rymar} et al., J. Graph Algorithms Appl. 27, No. 3, 173--194 (2023; Zbl 1518.05052) Full Text: DOI
Klemz, Boris; Knorr, Kristin; Reddy, Meghana M.; Schröder, Felix Simplifying non-simple fan-planar drawings. (English) Zbl 1509.68203 J. Graph Algorithms Appl. 27, No. 2, 147-172 (2023). MSC: 68R10 05C10 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{B. Klemz} et al., J. Graph Algorithms Appl. 27, No. 2, 147--172 (2023; Zbl 1509.68203) Full Text: DOI
Erickson, Jeff; Lin, Patrick Planar and toroidal morphs made easier. (English) Zbl 1508.05159 J. Graph Algorithms Appl. 27, No. 2, 95-118 (2023). MSC: 05C85 05C10 05C76 68R10 68Q25 PDFBibTeX XMLCite \textit{J. Erickson} and \textit{P. Lin}, J. Graph Algorithms Appl. 27, No. 2, 95--118 (2023; Zbl 1508.05159) Full Text: DOI
Chimani, Markus; Ilsen, Max; Wiedera, Tilo Star-struck by fixed embeddings: modern crossing number heuristics. (English) Zbl 1508.05121 J. Graph Algorithms Appl. 27, No. 2, 71-94 (2023). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Graph Algorithms Appl. 27, No. 2, 71--94 (2023; Zbl 1508.05121) Full Text: DOI
Klawitter, Jonathan; Zink, Johannes Upward planar drawings with three and more slopes. (English) Zbl 1509.68202 J. Graph Algorithms Appl. 27, No. 2, 49-70 (2023). MSC: 68R10 05C10 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{J. Klawitter} and \textit{J. Zink}, J. Graph Algorithms Appl. 27, No. 2, 49--70 (2023; Zbl 1509.68202) Full Text: DOI
Carmesin, Sarah; Schulz, André Arrangements of orthogonal circles with many intersections. (English) Zbl 1508.05119 J. Graph Algorithms Appl. 27, No. 2, 49-70 (2023). MSC: 05C62 05C85 68Q25 05C38 PDFBibTeX XMLCite \textit{S. Carmesin} and \textit{A. Schulz}, J. Graph Algorithms Appl. 27, No. 2, 49--70 (2023; Zbl 1508.05119) Full Text: DOI
Rutter, Ignaz (ed.); Purchase, Helene (ed.) Guest editors’ foreword: Special issue of selected papers from the 29th international symposium on graph drawing and network visualization (GD 2021). (English) Zbl 07670310 J. Graph Algorithms Appl. 27, No. 2, 45-47 (2023). MSC: 00Bxx 05C85 PDFBibTeX XMLCite \textit{I. Rutter} (ed.) and \textit{H. Purchase} (ed.), J. Graph Algorithms Appl. 27, No. 2, 45--47 (2023; Zbl 07670310) Full Text: DOI
Gotsman, Craig; Hormann, Kai Efficient point-to-point resistance distance queries in large graphs. (English) Zbl 1508.05161 J. Graph Algorithms Appl. 27, No. 1, 35-44 (2023). MSC: 05C85 05C12 68Q25 PDFBibTeX XMLCite \textit{C. Gotsman} and \textit{K. Hormann}, J. Graph Algorithms Appl. 27, No. 1, 35--44 (2023; Zbl 1508.05161) Full Text: DOI
Cleary, Sean Restricted rotation distance between \(k\)-ary trees. (English) Zbl 1508.05158 J. Graph Algorithms Appl. 27, No. 1, 19-33 (2023). MSC: 05C85 05C05 05C25 05C76 20F65 68Q25 PDFBibTeX XMLCite \textit{S. Cleary}, J. Graph Algorithms Appl. 27, No. 1, 19--33 (2023; Zbl 1508.05158) Full Text: DOI
Akitaya, Hugo A.; Biniaz, Ahmad; Bose, Prosenjit; De Carufel, Jean-Lou; Maheshwari, Anil; Schultz Xavier da Silveira, Luís Fernando; Smid, Michiel The minimum moving spanning tree problem. (English) Zbl 1508.05155 J. Graph Algorithms Appl. 27, No. 1, 1-18 (2023). MSC: 05C85 PDFBibTeX XMLCite \textit{H. A. Akitaya} et al., J. Graph Algorithms Appl. 27, No. 1, 1--18 (2023; Zbl 1508.05155) Full Text: DOI
Balzotti, Lorenzo; Franciosa, Paolo G. Non-crossing shortest paths in undirected unweighted planar graphs in linear time. (English) Zbl 1508.05157 J. Graph Algorithms Appl. 26, No. 4, 589-606 (2022). MSC: 05C85 05C10 05C38 68Q25 PDFBibTeX XMLCite \textit{L. Balzotti} and \textit{P. G. Franciosa}, J. Graph Algorithms Appl. 26, No. 4, 589--606 (2022; Zbl 1508.05157) Full Text: DOI
Bader, David A.; Burkhardt, Paul A simple and efficient algorithm for finding minimum spanning tree replacement edges. (English) Zbl 1508.05156 J. Graph Algorithms Appl. 26, No. 4, 577-588 (2022). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{D. A. Bader} and \textit{P. Burkhardt}, J. Graph Algorithms Appl. 26, No. 4, 577--588 (2022; Zbl 1508.05156) Full Text: DOI arXiv
Keil, J. Mark; Mondal, Debajyoti; Moradi, Ehsan; Nekrich, Yakov Finding a maximum clique in a grounded 1-bend string graph. (English) Zbl 1508.05162 J. Graph Algorithms Appl. 26, No. 4, 553-575 (2022). MSC: 05C85 05C69 68Q17 PDFBibTeX XMLCite \textit{J. M. Keil} et al., J. Graph Algorithms Appl. 26, No. 4, 553--575 (2022; Zbl 1508.05162) Full Text: DOI arXiv
Hull, Thomas C.; Morales, Manuel; Nash, Sarah; Ter-Saakov, Natalya Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. (English) Zbl 1498.05190 J. Graph Algorithms Appl. 26, No. 4, 503-517 (2022). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{T. C. Hull} et al., J. Graph Algorithms Appl. 26, No. 4, 503--517 (2022; Zbl 1498.05190) Full Text: DOI arXiv
Biedl, Therese; Sheth, Milap Drawing Halin-graphs with small height. (English) Zbl 1499.68254 J. Graph Algorithms Appl. 26, No. 4, 473-502 (2022). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{T. Biedl} and \textit{M. Sheth}, J. Graph Algorithms Appl. 26, No. 4, 473--502 (2022; Zbl 1499.68254) Full Text: DOI arXiv
Lubiw, Anna; Miltzow, Tillmann; Mondal, Debajyoti The complexity of drawing a graph in a polygonal region. (English) Zbl 1499.68147 J. Graph Algorithms Appl. 26, No. 4, 421-446 (2022). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{A. Lubiw} et al., J. Graph Algorithms Appl. 26, No. 4, 421--446 (2022; Zbl 1499.68147) Full Text: DOI
Kellerhals, Leon; Koana, Tomohiro Parameterized complexity of geodetic set. (English) Zbl 1499.68152 J. Graph Algorithms Appl. 26, No. 4, 401-419 (2022). MSC: 68Q27 05C85 PDFBibTeX XMLCite \textit{L. Kellerhals} and \textit{T. Koana}, J. Graph Algorithms Appl. 26, No. 4, 401--419 (2022; Zbl 1499.68152) Full Text: DOI arXiv
Efrat, Alon; Fulek, Radoslav; Kobourov, Stephen; Tóth, Csaba D. Polygons with prescribed angles in 2D and 3D. (English) Zbl 1499.68268 J. Graph Algorithms Appl. 26, No. 3, 363-380 (2022). MSC: 68R10 05C85 68U05 PDFBibTeX XMLCite \textit{A. Efrat} et al., J. Graph Algorithms Appl. 26, No. 3, 363--380 (2022; Zbl 1499.68268) Full Text: DOI
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for queue layouts. (English) Zbl 1498.05257 J. Graph Algorithms Appl. 26, No. 3, 335-352 (2022). MSC: 05C85 PDFBibTeX XMLCite \textit{S. Bhore} et al., J. Graph Algorithms Appl. 26, No. 3, 335--352 (2022; Zbl 1498.05257) Full Text: DOI
Bekos, Michael A.; Binucci, Carla; Di Battista, Giuseppe; Didimo, Walter; Gronemann, Martin; Klein, Karsten; Patrignani, Maurizio; Rutter, Ignaz On turn-regular orthogonal representations. (English) Zbl 1498.05189 J. Graph Algorithms Appl. 26, No. 3, 285-306 (2022). MSC: 05C62 05C10 68R10 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 26, No. 3, 285--306 (2022; Zbl 1498.05189) Full Text: DOI
Liotta, Giuseppe (ed.) Editor in chief’s foreword: Special issue of selected papers from the 28th international symposium on graph drawing and network visualization (GD 2020). (English) Zbl 1498.00049 J. Graph Algorithms Appl. 26, No. 3, 283-284 (2022). MSC: 00B25 05-06 05C85 PDFBibTeX XMLCite \textit{G. Liotta} (ed.), J. Graph Algorithms Appl. 26, No. 3, 283--284 (2022; Zbl 1498.00049) Full Text: DOI
Belbasi, Mahdi; Fürer, Martin An improvement of Reed’s treewidth approximation. (English) Zbl 1498.05255 J. Graph Algorithms Appl. 26, No. 2, 257-282 (2022). MSC: 05C85 68W25 68Q25 PDFBibTeX XMLCite \textit{M. Belbasi} and \textit{M. Fürer}, J. Graph Algorithms Appl. 26, No. 2, 257--282 (2022; Zbl 1498.05255) Full Text: DOI
Hanaka, Tesshu; Kawai, Kazuma; Ono, Hirotaka Computing \(L(p, 1)\)-labeling with combined parameters. (English) Zbl 1498.05233 J. Graph Algorithms Appl. 26, No. 2, 241-255 (2022). MSC: 05C78 05C85 68Q27 PDFBibTeX XMLCite \textit{T. Hanaka} et al., J. Graph Algorithms Appl. 26, No. 2, 241--255 (2022; Zbl 1498.05233) Full Text: DOI
Aichholzer, Oswin; Arroyo, Alan; Masárová, Zuzana; Parada, Irene; Perz, Daniel; Pilz, Alexander; Tkadlec, Josef; Vogtenhuber, Birgit On compatible matchings. (English) Zbl 1498.05253 J. Graph Algorithms Appl. 26, No. 2, 225-240 (2022). MSC: 05C85 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., J. Graph Algorithms Appl. 26, No. 2, 225--240 (2022; Zbl 1498.05253) Full Text: DOI
Biniaz, Ahmad Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. (English) Zbl 1498.05259 J. Graph Algorithms Appl. 26, No. 2, 209-224 (2022). MSC: 05C85 68W25 05C22 68R10 PDFBibTeX XMLCite \textit{A. Biniaz}, J. Graph Algorithms Appl. 26, No. 2, 209--224 (2022; Zbl 1498.05259) Full Text: DOI
Hong, Seok-Hee (ed.); Nandy, Subhas C. (ed.); Uehara, Ryuhei (ed.) Guest editors’ foreword: Special issue on selected papers from the 15th international workshop on algorithms and computation (WALCOM 2021). (English) Zbl 1498.00047 J. Graph Algorithms Appl. 26, No. 2, 207-208 (2022). MSC: 00B25 05-06 05C85 PDFBibTeX XMLCite \textit{S.-H. Hong} (ed.) et al., J. Graph Algorithms Appl. 26, No. 2, 207--208 (2022; Zbl 1498.00047) Full Text: DOI
Best, Darcy; Ward, Max A faster algorithm for maximum independent set on interval filament graphs. (English) Zbl 1489.05137 J. Graph Algorithms Appl. 26, No. 1, 199-205 (2022). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{D. Best} and \textit{M. Ward}, J. Graph Algorithms Appl. 26, No. 1, 199--205 (2022; Zbl 1489.05137) Full Text: DOI arXiv
Klawitter, Jonathan; Mchedlidze, Tamara Upward planar drawings with two slopes. (English) Zbl 1489.05148 J. Graph Algorithms Appl. 26, No. 1, 171-198 (2022). MSC: 05C85 05C10 05C20 05C62 68R10 PDFBibTeX XMLCite \textit{J. Klawitter} and \textit{T. Mchedlidze}, J. Graph Algorithms Appl. 26, No. 1, 171--198 (2022; Zbl 1489.05148) Full Text: DOI arXiv
Bokal, Drago; Chimani, Markus; Nover, Alexander; Schierbaum, Jöran; Stolzmann, Tobias; Wagner, Mirko H.; Wiedera, Tilo Properties of large 2-crossing-critical graphs. (English) Zbl 1489.05139 J. Graph Algorithms Appl. 26, No. 1, 111-147 (2022). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{D. Bokal} et al., J. Graph Algorithms Appl. 26, No. 1, 111--147 (2022; Zbl 1489.05139) Full Text: DOI arXiv
Biedl, Therese Drawing outer-1-planar graphs revisited. (English) Zbl 1489.05138 J. Graph Algorithms Appl. 26, No. 1, 59-73 (2022). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{T. Biedl}, J. Graph Algorithms Appl. 26, No. 1, 59--73 (2022; Zbl 1489.05138) Full Text: DOI
Boomari, Hossein; Zarei, Alireza Visibility graphs of anchor polygons. (English) Zbl 1489.05140 J. Graph Algorithms Appl. 26, No. 1, 15-34 (2022). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{H. Boomari} and \textit{A. Zarei}, J. Graph Algorithms Appl. 26, No. 1, 15--34 (2022; Zbl 1489.05140) Full Text: DOI
Evans, William; Gethner, Ellen; Spalding-Jamieson, Jack; Wolff, Alexander Angle covers: algorithms and complexity. (English) Zbl 1489.05144 J. Graph Algorithms Appl. 25, No. 2, 643-661 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{W. Evans} et al., J. Graph Algorithms Appl. 25, No. 2, 643--661 (2021; Zbl 1489.05144) Full Text: DOI
De Luca, Felice; Di Giacomo, Emilio; Hong, Seok-Hee; Kobourov, Stephen; Lenhart, William; Liotta, Giuseppe; Meijer, Henk; Tappini, Alessandra; Wismath, Stephen Packing trees into 1-planar graphs. (English) Zbl 1489.05142 J. Graph Algorithms Appl. 25, No. 2, 605-624 (2021). MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{F. De Luca} et al., J. Graph Algorithms Appl. 25, No. 2, 605--624 (2021; Zbl 1489.05142) Full Text: DOI
Angelini, Patrizio; Rutter, Ignaz; Sandhya, T. P. Extending partial orthogonal drawings. (English) Zbl 1489.05135 J. Graph Algorithms Appl. 25, No. 1, 581-602 (2021). MSC: 05C85 05C10 68Q17 PDFBibTeX XMLCite \textit{P. Angelini} et al., J. Graph Algorithms Appl. 25, No. 1, 581--602 (2021; Zbl 1489.05135) Full Text: DOI
Acuña, Vicente; Soares de Lima, Leandro Ishi; Italiano, Giuseppe F.; Sciarria, Luca Pepè; Sagot, Marie-France; Sinaimeri, Blerina A family of tree-based generators for bubbles in directed graphs. (English) Zbl 1489.05133 J. Graph Algorithms Appl. 25, No. 1, 563-580 (2021). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{V. Acuña} et al., J. Graph Algorithms Appl. 25, No. 1, 563--580 (2021; Zbl 1489.05133) Full Text: DOI
Eppstein, David Bipartite and series-parallel graphs without planar Lombardi drawings. (English) Zbl 1489.05143 J. Graph Algorithms Appl. 25, No. 1, 549-562 (2021). MSC: 05C85 05C10 05C62 PDFBibTeX XMLCite \textit{D. Eppstein}, J. Graph Algorithms Appl. 25, No. 1, 549--562 (2021; Zbl 1489.05143) Full Text: DOI arXiv
Figiel, Aleksander; Himmel, Anne-Sophie; Nichterlein, André; Niedermeier, Rolf On 2-clubs in graph-based data clustering: theory and algorithm engineering. (English) Zbl 1489.05145 J. Graph Algorithms Appl. 25, No. 1, 521-547 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Figiel} et al., J. Graph Algorithms Appl. 25, No. 1, 521--547 (2021; Zbl 1489.05145) Full Text: DOI arXiv
Boyer, John M. Revising the Fellows-Kaschube \(K_{3,3}\) search. (English) Zbl 1489.05141 J. Graph Algorithms Appl. 25, No. 1, 513-520 (2021). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{J. M. Boyer}, J. Graph Algorithms Appl. 25, No. 1, 513--520 (2021; Zbl 1489.05141) Full Text: DOI
Förster, Henry; Ganian, Robert; Klute, Fabian; Nöllenburg, Martin On strict (outer-)confluent graphs. (English) Zbl 1490.68152 J. Graph Algorithms Appl. 25, No. 1, 481-512 (2021). MSC: 68R10 05C62 05C69 05C85 PDFBibTeX XMLCite \textit{H. Förster} et al., J. Graph Algorithms Appl. 25, No. 1, 481--512 (2021; Zbl 1490.68152) Full Text: DOI
Hertz, Alain Decycling bipartite graphs. (English) Zbl 1489.05147 J. Graph Algorithms Appl. 25, No. 1, 461-480 (2021). MSC: 05C85 05C38 68Q17 PDFBibTeX XMLCite \textit{A. Hertz}, J. Graph Algorithms Appl. 25, No. 1, 461--480 (2021; Zbl 1489.05147) Full Text: DOI
Pap, Gyula; Varnyú, József Synchronized traveling salesman problem. (English) Zbl 1489.05086 J. Graph Algorithms Appl. 25, No. 1, 437-459 (2021). MSC: 05C45 05C85 PDFBibTeX XMLCite \textit{G. Pap} and \textit{J. Varnyú}, J. Graph Algorithms Appl. 25, No. 1, 437--459 (2021; Zbl 1489.05086) Full Text: DOI arXiv
Bentert, Matthias; Weller, Mathias Tree containment with soft polytomies. (English) Zbl 1489.05136 J. Graph Algorithms Appl. 25, No. 1, 417-436 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Bentert} and \textit{M. Weller}, J. Graph Algorithms Appl. 25, No. 1, 417--436 (2021; Zbl 1489.05136) Full Text: DOI
Schaller, David; Geiß, Manuela; Hellmuth, Marc; Stadler, Peter F. Least resolved trees for two-colored best match graphs. (English) Zbl 1489.05018 J. Graph Algorithms Appl. 25, No. 1, 397-416 (2021). MSC: 05C05 05C20 05C85 05C90 PDFBibTeX XMLCite \textit{D. Schaller} et al., J. Graph Algorithms Appl. 25, No. 1, 397--416 (2021; Zbl 1489.05018) Full Text: DOI arXiv
Shantrinal, A. Arul; Klavžar, Sandi; Rajalaxmi, T. M.; Sundara Rajan, R. An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. (English) Zbl 1489.05149 J. Graph Algorithms Appl. 25, No. 1, 367-381 (2021). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{A. A. Shantrinal} et al., J. Graph Algorithms Appl. 25, No. 1, 367--381 (2021; Zbl 1489.05149) Full Text: DOI
Brückner, Guido; Rutter, Ignaz Radial level planarity with fixed embedding. (English) Zbl 1462.05334 J. Graph Algorithms Appl. 25, No. 1, 353-366 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{G. Brückner} and \textit{I. Rutter}, J. Graph Algorithms Appl. 25, No. 1, 353--366 (2021; Zbl 1462.05334) Full Text: DOI
Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Tais, Marco Schematic representation of large biconnected graphs. (English) Zbl 1462.05335 J. Graph Algorithms Appl. 25, No. 1, 311-352 (2021). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{G. Di Battista} et al., J. Graph Algorithms Appl. 25, No. 1, 311--352 (2021; Zbl 1462.05335) Full Text: DOI arXiv
Janssen, Remie Heading in the right direction? Using head moves to traverse phylogenetic network space. (English) Zbl 1464.92192 J. Graph Algorithms Appl. 25, No. 1, 263-310 (2021). MSC: 92D15 05C90 05C85 PDFBibTeX XMLCite \textit{R. Janssen}, J. Graph Algorithms Appl. 25, No. 1, 263--310 (2021; Zbl 1464.92192) Full Text: DOI arXiv
Tumurbaatar, Altansuren; Sottile, Matthew J. Algebraic algorithms for betweenness and percolation centrality. (English) Zbl 1462.05339 J. Graph Algorithms Appl. 25, No. 1, 241-261 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{A. Tumurbaatar} and \textit{M. J. Sottile}, J. Graph Algorithms Appl. 25, No. 1, 241--261 (2021; Zbl 1462.05339) Full Text: DOI
Brown, Paul; Fenner, Trevor Fast generation of unlabelled free trees using weight sequences. (English) Zbl 1457.05106 J. Graph Algorithms Appl. 25, No. 1, 219-240 (2021). MSC: 05C85 05C05 PDFBibTeX XMLCite \textit{P. Brown} and \textit{T. Fenner}, J. Graph Algorithms Appl. 25, No. 1, 219--240 (2021; Zbl 1457.05106) Full Text: DOI arXiv
Schaefer, Marcus On the complexity of some geometric problems with fixed parameters. (English) Zbl 1457.05111 J. Graph Algorithms Appl. 25, No. 1, 195-218 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Schaefer}, J. Graph Algorithms Appl. 25, No. 1, 195--218 (2021; Zbl 1457.05111) Full Text: DOI
Evans, William; Felsner, Stefan; Kleist, Linda; Kobourov, Stephen On area-universal quadrangulations. (English) Zbl 1457.05107 J. Graph Algorithms Appl. 25, No. 1, 171-193 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{W. Evans} et al., J. Graph Algorithms Appl. 25, No. 1, 171--193 (2021; Zbl 1457.05107) Full Text: DOI
Barth, Lukas; Brückner, Guido; Jungeblut, Paul; Radermacher, Marcel Multilevel planarity. (English) Zbl 1457.05105 J. Graph Algorithms Appl. 25, No. 1, 151-170 (2021). MSC: 05C85 05C10 05C20 PDFBibTeX XMLCite \textit{L. Barth} et al., J. Graph Algorithms Appl. 25, No. 1, 151--170 (2021; Zbl 1457.05105) Full Text: DOI
Fischer, Mareike; Liebscher, Volkmar On the balance of unrooted trees. (English) Zbl 1457.05109 J. Graph Algorithms Appl. 25, No. 1, 133-150 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Fischer} and \textit{V. Liebscher}, J. Graph Algorithms Appl. 25, No. 1, 133--150 (2021; Zbl 1457.05109) Full Text: DOI arXiv
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. Circumference of essentially 4-connected planar triangulations. (English) Zbl 1457.05108 J. Graph Algorithms Appl. 25, No. 1, 121-132 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{I. Fabrici} et al., J. Graph Algorithms Appl. 25, No. 1, 121--132 (2021; Zbl 1457.05108) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{V. Dujmović} et al., J. Graph Algorithms Appl. 25, No. 1, 43--57 (2021; Zbl 1452.05177) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{P. Kindermann} et al., J. Graph Algorithms Appl. 25, No. 1, 1--28 (2021; Zbl 1452.05179) 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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., J. Graph Algorithms Appl. 24, No. 4, 551--572 (2020; Zbl 1451.05220) Full Text: DOI arXiv
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 1476.68008 J. Graph Algorithms Appl. 24, No. 4, 547-549 (2020). MSC: 68-06 05C85 68R10 68U05 00B25 PDFBibTeX XMLCite \textit{D. Archambault} (ed.) and \textit{C. Toth} (ed.), J. Graph Algorithms Appl. 24, No. 4, 547--549 (2020; Zbl 1476.68008) 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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{M. Bentert} et al., J. Graph Algorithms Appl. 24, No. 3, 483--522 (2020; Zbl 1446.05085) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{B. A. M. van Geffen} et al., J. Graph Algorithms Appl. 24, No. 3, 461--482 (2020; Zbl 1446.05087) 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 PDFBibTeX XMLCite \textit{P. Damaschke}, J. Graph Algorithms Appl. 24, No. 3, 433--460 (2020; Zbl 1447.05107) Full Text: DOI
Altmanová, Kateřina; Kolman, Petr; Voborník, Jan On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow. (English) Zbl 1447.05192 J. Graph Algorithms Appl. 24, No. 3, 303-322 (2020). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Altmanová} et al., J. Graph Algorithms Appl. 24, No. 3, 303--322 (2020; Zbl 1447.05192) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{M. Scheucher} et al., J. Graph Algorithms Appl. 24, No. 3, 247--267 (2020; Zbl 1447.05065) Full Text: DOI arXiv
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 68Q27 68R10 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{P. Burkhardt} et al., J. Graph Algorithms Appl. 24, No. 3, 191--214 (2020; Zbl 1447.05193) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Graph Algorithms Appl. 24, No. 3, 155--170 (2020; Zbl 1447.05194) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{W. Ehounou} et al., J. Graph Algorithms Appl. 24, No. 3, 133--153 (2020; Zbl 1447.05069) Full Text: DOI
Mukhopadhyaya, Krishnendu (ed.); Nakano, Shin-Ichi (ed.) Guest editors’ foreword: Special issue on selected papers from the 13th international workshop on algorithms and computation (WALCOM 2019). (English) Zbl 1489.00047 J. Graph Algorithms Appl. 24, No. 2, 63-64 (2020). MSC: 00B25 05-06 05C85 PDFBibTeX XMLCite \textit{K. Mukhopadhyaya} (ed.) and \textit{S.-I. Nakano} (ed.), J. Graph Algorithms Appl. 24, No. 2, 63--64 (2020; Zbl 1489.00047) Full Text: DOI
Lemańska, Magdalena; Żyliński, Paweł Reconfiguring minimum dominating sets in trees. (English) Zbl 1433.05248 J. Graph Algorithms Appl. 24, No. 1, 47-61 (2020). MSC: 05C69 05C12 05C05 05C85 PDFBibTeX XMLCite \textit{M. Lemańska} and \textit{P. Żyliński}, J. Graph Algorithms Appl. 24, No. 1, 47--61 (2020; Zbl 1433.05248) Full Text: DOI
Nakano, Shin-Ichi A simple algorithm for \(r\)-gatherings on the line. (English) Zbl 1425.05155 J. Graph Algorithms Appl. 23, No. 5, 837-845 (2019). MSC: 05C85 05C90 05B25 90B80 PDFBibTeX XMLCite \textit{S.-I. Nakano}, J. Graph Algorithms Appl. 23, No. 5, 837--845 (2019; Zbl 1425.05155) Full Text: DOI
Kashyop, Manas Jyoti; Nagayama, Tsunehiko; Sadakane, Kunihiko Faster algorithms for shortest path and network flow based on graph decomposition. (English) Zbl 1425.05152 J. Graph Algorithms Appl. 23, No. 5, 781-813 (2019). MSC: 05C85 05C70 05C21 05C38 05C12 68Q25 PDFBibTeX XMLCite \textit{M. J. Kashyop} et al., J. Graph Algorithms Appl. 23, No. 5, 781--813 (2019; Zbl 1425.05152) Full Text: DOI
Fujito, Toshihiro; Kimura, Kei; Mizuno, Yuki Approximating partially bounded degree deletion on directed graphs. (English) Zbl 1427.05096 J. Graph Algorithms Appl. 23, No. 5, 759-780 (2019). MSC: 05C20 05C07 05C85 05C35 68Q17 68W25 PDFBibTeX XMLCite \textit{T. Fujito} et al., J. Graph Algorithms Appl. 23, No. 5, 759--780 (2019; Zbl 1427.05096) Full Text: DOI
Janssen, Remie; Jones, Mark; Kelk, Steven; Stamoulis, Georgios; Wu, Taoyang Treewidth of display graphs: bounds, brambles and applications. (English) Zbl 1419.05187 J. Graph Algorithms Appl. 23, No. 4, 715-743 (2019). MSC: 05C78 05C82 05C05 05C85 05C90 PDFBibTeX XMLCite \textit{R. Janssen} et al., J. Graph Algorithms Appl. 23, No. 4, 715--743 (2019; Zbl 1419.05187) Full Text: DOI arXiv
Bläsius, Thomas; Radermacher, Marcel; Rutter, Ignaz How to draw a planarization. (English) Zbl 1419.05200 J. Graph Algorithms Appl. 23, No. 4, 653-682 (2019). MSC: 05C85 PDFBibTeX XMLCite \textit{T. Bläsius} et al., J. Graph Algorithms Appl. 23, No. 4, 653--682 (2019; Zbl 1419.05200) Full Text: DOI
Ortali, Giacomo; Tollis, Ioannis G. A new framework for hierarchical drawings. (English) Zbl 1419.05150 J. Graph Algorithms Appl. 23, No. 3, 553-578 (2019). MSC: 05C62 05C20 PDFBibTeX XMLCite \textit{G. Ortali} and \textit{I. G. Tollis}, J. Graph Algorithms Appl. 23, No. 3, 553--578 (2019; Zbl 1419.05150) Full Text: DOI
Haraguchi, Kazuya; Momoi, Yusuke; Shurbevski, Aleksandar; Nagamochi, Hiroshi COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets. (English) Zbl 1420.05168 J. Graph Algorithms Appl. 23, No. 2, 434-458 (2019). MSC: 05C85 05C30 PDFBibTeX XMLCite \textit{K. Haraguchi} et al., J. Graph Algorithms Appl. 23, No. 2, 434--458 (2019; Zbl 1420.05168) Full Text: DOI
Chepoi, Victor; Dragan, Feodor F.; Habib, Michel; Vaxès, Yann; Alrasheed, Hend Fast approximation of eccentricities and distances in hyperbolic graphs. (English) Zbl 1416.05266 J. Graph Algorithms Appl. 23, No. 2, 393-433 (2019). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{V. Chepoi} et al., J. Graph Algorithms Appl. 23, No. 2, 393--433 (2019; Zbl 1416.05266) Full Text: DOI