Bekos, Michael; Gronemann, Martin; Raftopoulou, Chrysanthi N. An improved upper bound on the queue number of planar graphs. (English) Zbl 1515.68223 Algorithmica 85, No. 2, 544-562 (2023). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{M. Bekos} et al., Algorithmica 85, No. 2, 544--562 (2023; Zbl 1515.68223) Full Text: DOI
Donkers, Huib; Jansen, Bart M. P.; Włodarczyk, Michał Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size. (English) Zbl 07608295 Algorithmica 84, No. 11, 3407-3458 (2022). MSC: 68Wxx 05Cxx 05C10 68R10 PDFBibTeX XMLCite \textit{H. Donkers} et al., Algorithmica 84, No. 11, 3407--3458 (2022; Zbl 07608295) Full Text: DOI arXiv
Baste, Julien; Thilikos, Dimitrios M. Contraction bidimensionality of geometric intersection graphs. (English) Zbl 1515.05052 Algorithmica 84, No. 2, 510-531 (2022). MSC: 05C10 05C62 05C75 05C85 PDFBibTeX XMLCite \textit{J. Baste} and \textit{D. M. Thilikos}, Algorithmica 84, No. 2, 510--531 (2022; Zbl 1515.05052) Full Text: DOI arXiv Link
Auer, Christopher; Bachmaier, Christian; Brandenburg, Franz J.; Gleißner, Andreas; Hanauer, Kathrin; Neuwirth, Daniel; Reislhuber, Josef Correction to: “Outer 1-planar graphs”. (English) Zbl 1474.68207 Algorithmica 83, No. 11, 3534-3535 (2021). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{C. Auer} et al., Algorithmica 83, No. 11, 3534--3535 (2021; Zbl 1474.68207) Full Text: DOI
Fuentes-Sepúlveda, José; Seco, Diego; Viaña, Raquel Succinct encoding of binary strings representing triangulations. (English) Zbl 1518.68074 Algorithmica 83, No. 11, 3432-3468 (2021). MSC: 68P05 05C10 68P30 68R10 68U05 PDFBibTeX XMLCite \textit{J. Fuentes-Sepúlveda} et al., Algorithmica 83, No. 11, 3432--3468 (2021; Zbl 1518.68074) Full Text: DOI
Da Lozzo, Giordano; Eppstein, David; Goodrich, Michael T.; Gupta, Siddharth C-planarity testing of embedded clustered graphs with bounded dual carving-width. (English) Zbl 1515.68235 Algorithmica 83, No. 8, 2471-2502 (2021). MSC: 68R10 05C10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{G. Da Lozzo} et al., Algorithmica 83, No. 8, 2471--2502 (2021; Zbl 1515.68235) Full Text: DOI arXiv
Feuilloley, Laurent; Fraigniaud, Pierre; Montealegre, Pedro; Rapaport, Ivan; Rémila, Éric; Todinca, Ioan Compact distributed certification of planar graphs. (English) Zbl 1515.68238 Algorithmica 83, No. 7, 2215-2244 (2021). MSC: 68R10 05C10 68M12 68Q10 68W15 PDFBibTeX XMLCite \textit{L. Feuilloley} et al., Algorithmica 83, No. 7, 2215--2244 (2021; Zbl 1515.68238) Full Text: DOI arXiv
Morin, Pat A fast algorithm for the product structure of planar graphs. (English) Zbl 1522.05072 Algorithmica 83, No. 5, 1544-1558 (2021). Reviewer: Brahadeesh Sankarnarayanan (Mumbai) MSC: 05C10 05C75 05C76 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Morin}, Algorithmica 83, No. 5, 1544--1558 (2021; Zbl 1522.05072) Full Text: DOI arXiv
Aichholzer, Oswin; Cardinal, Jean; Huynh, Tony; Knauer, Kolja; Mütze, Torsten; Steiner, Raphael; Vogtenhuber, Birgit Flip distances between graph orientations. (English) Zbl 1511.05100 Algorithmica 83, No. 1, 116-143 (2021). MSC: 05C30 05C10 52A10 68Q25 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Algorithmica 83, No. 1, 116--143 (2021; Zbl 1511.05100) Full Text: DOI
Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Roselli, Vincenzo Upward planar morphs. (English) Zbl 1455.68137 Algorithmica 82, No. 10, 2985-3017 (2020). MSC: 68R10 05C10 05C20 68U05 PDFBibTeX XMLCite \textit{G. Da Lozzo} et al., Algorithmica 82, No. 10, 2985--3017 (2020; Zbl 1455.68137) Full Text: DOI
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey Queue layouts of planar 3-trees. (English) Zbl 1457.05024 Algorithmica 82, No. 9, 2564-2585 (2020). MSC: 05C10 05C05 05C30 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Algorithmica 82, No. 9, 2564--2585 (2020; Zbl 1457.05024) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 1447.05142 Algorithmica 82, No. 9, 2432-2473 (2020). MSC: 05C62 05C85 05C69 68Q17 90C27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 9, 2432--2473 (2020; Zbl 1447.05142) Full Text: DOI
Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1433.68307 Algorithmica 82, No. 6, 1703-1739 (2020). MSC: 68R10 05C10 05C69 05C70 05C85 68U05 68W25 PDFBibTeX XMLCite \textit{M. Pilipczuk} et al., Algorithmica 82, No. 6, 1703--1739 (2020; Zbl 1433.68307) Full Text: DOI Link
Aronov, Boris; de Berg, Mark; Markovic, Aleksandar; Woeginger, Gerhard Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces. (English) Zbl 1436.05035 Algorithmica 82, No. 5, 1081-1100 (2020). MSC: 05C15 05C05 05C10 05C82 PDFBibTeX XMLCite \textit{B. Aronov} et al., Algorithmica 82, No. 5, 1081--1100 (2020; Zbl 1436.05035) Full Text: DOI
Karpov, Nikolai; Pilipczuk, Marcin; Zych-Pawlewicz, Anna An exponential lower bound for cut sparsifiers in planar graphs. (English) Zbl 1430.68220 Algorithmica 81, No. 10, 4029-4042 (2019). MSC: 68R10 05C10 68Q17 PDFBibTeX XMLCite \textit{N. Karpov} et al., Algorithmica 81, No. 10, 4029--4042 (2019; Zbl 1430.68220) Full Text: DOI
Kociumaka, Tomasz; Pilipczuk, Marcin Deleting vertices to graphs of bounded genus. (English) Zbl 1429.68194 Algorithmica 81, No. 9, 3655-3691 (2019). MSC: 68R10 05C10 05C85 68Q27 PDFBibTeX XMLCite \textit{T. Kociumaka} and \textit{M. Pilipczuk}, Algorithmica 81, No. 9, 3655--3691 (2019; Zbl 1429.68194) Full Text: DOI arXiv
Chitnis, Rajesh; Feldmann, Andreas Emil; Suchý, Ondřej A tight lower bound for planar Steiner orientation. (English) Zbl 1425.68307 Algorithmica 81, No. 8, 3200-3216 (2019). MSC: 68R10 05C10 05C20 05C85 68Q17 68Q25 68Q27 68W25 PDFBibTeX XMLCite \textit{R. Chitnis} et al., Algorithmica 81, No. 8, 3200--3216 (2019; Zbl 1425.68307) Full Text: DOI
Chan, Timothy M.; Skrepetos, Dimitrios Faster approximate diameter and distance oracles in planar graphs. (English) Zbl 1425.68454 Algorithmica 81, No. 8, 3075-3098 (2019). MSC: 68W25 05C10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{D. Skrepetos}, Algorithmica 81, No. 8, 3075--3098 (2019; Zbl 1425.68454) Full Text: DOI Link
Angelini, Patrizio; Bekos, Michael A.; Liotta, Giuseppe; Montecchiani, Fabrizio Universal slope sets for 1-bend planar drawings. (English) Zbl 1421.68102 Algorithmica 81, No. 6, 2527-2556 (2019). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 81, No. 6, 2527--2556 (2019; Zbl 1421.68102) Full Text: DOI arXiv
Angelini, Patrizio; Da Lozzo, Giordano Clustered planarity with pipes. (English) Zbl 1421.68103 Algorithmica 81, No. 6, 2484-2526 (2019). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Angelini} and \textit{G. Da Lozzo}, Algorithmica 81, No. 6, 2484--2526 (2019; Zbl 1421.68103) Full Text: DOI Link
Angelini, Patrizio; Bekos, Michael A. Hierarchical partial planarity. (English) Zbl 1421.68101 Algorithmica 81, No. 6, 2196-2221 (2019). MSC: 68R10 05C10 05C85 68W40 PDFBibTeX XMLCite \textit{P. Angelini} and \textit{M. A. Bekos}, Algorithmica 81, No. 6, 2196--2221 (2019; Zbl 1421.68101) Full Text: DOI arXiv
Brandenburg, Franz J. Characterizing and recognizing 4-map graphs. (English) Zbl 1423.05050 Algorithmica 81, No. 5, 1818-1843 (2019). MSC: 05C10 05C85 68W40 68R10 PDFBibTeX XMLCite \textit{F. J. Brandenburg}, Algorithmica 81, No. 5, 1818--1843 (2019; Zbl 1423.05050) Full Text: DOI
Bannister, Michael J.; Devanny, William E.; Dujmović, Vida; Eppstein, David; Wood, David R. Track layouts, layered path decompositions, and leveled planarity. (English) Zbl 1421.68105 Algorithmica 81, No. 4, 1561-1583 (2019). MSC: 68R10 05C10 68Q25 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Algorithmica 81, No. 4, 1561--1583 (2019; Zbl 1421.68105) Full Text: DOI arXiv
Kammer, Frank; Kratsch, Dieter; Laudahn, Moritz Space-efficient biconnected components and recognition of outerplanar graphs. (English) Zbl 1444.68077 Algorithmica 81, No. 3, 1180-1204 (2019). MSC: 68Q25 05C10 05C40 05C85 PDFBibTeX XMLCite \textit{F. Kammer} et al., Algorithmica 81, No. 3, 1180--1204 (2019; Zbl 1444.68077) Full Text: DOI Link
Bentz, Cédric An FPT algorithm for planar multicuts with sources and sinks on the outer face. (English) Zbl 1410.68151 Algorithmica 81, No. 1, 224-237 (2019). MSC: 68Q25 05C10 05C22 05C85 68R10 PDFBibTeX XMLCite \textit{C. Bentz}, Algorithmica 81, No. 1, 224--237 (2019; Zbl 1410.68151) Full Text: DOI arXiv
Mémoli, Facundo; Sidiropoulos, Anastasios; Sridhar, Vijay Quasimetric embeddings and their applications. (English) Zbl 1401.68255 Algorithmica 80, No. 12, 3803-3824 (2018). MSC: 68R10 05C10 68U05 PDFBibTeX XMLCite \textit{F. Mémoli} et al., Algorithmica 80, No. 12, 3803--3824 (2018; Zbl 1401.68255) Full Text: DOI Link
Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz Simultaneous embedding: edge orderings, relative positions, cutvertices. (English) Zbl 1394.68263 Algorithmica 80, No. 4, 1214-1277 (2018). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 05C10 05C85 68W40 PDFBibTeX XMLCite \textit{T. Bläsius} et al., Algorithmica 80, No. 4, 1214--1277 (2018; Zbl 1394.68263) Full Text: DOI arXiv
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1390.68498 Algorithmica 80, No. 3, 977-994 (2018). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Algorithmica 80, No. 3, 977--994 (2018; Zbl 1390.68498) Full Text: DOI arXiv
Bekos, Michael A.; Bruckdorfer, Till; Kaufmann, Michael; Raftopoulou, Chrysanthi N. The book thickness of 1-planar graphs is constant. (English) Zbl 1372.05049 Algorithmica 79, No. 2, 444-465 (2017). MSC: 05C10 05C62 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 79, No. 2, 444--465 (2017; Zbl 1372.05049) Full Text: DOI arXiv
Bekos, Michael A.; Cornelsen, Sabine; Grilli, Luca; Hong, Seok-Hee; Kaufmann, Michael On the recognition of fan-planar and maximal outer-fan-planar graphs. (English) Zbl 1372.68201 Algorithmica 79, No. 2, 401-427 (2017). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 79, No. 2, 401--427 (2017; Zbl 1372.68201) Full Text: DOI
Suchý, Ondřej Extending the kernel for planar Steiner tree to the number of Steiner vertices. (English) Zbl 1372.68146 Algorithmica 79, No. 1, 189-210 (2017). MSC: 68Q25 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{O. Suchý}, Algorithmica 79, No. 1, 189--210 (2017; Zbl 1372.68146) Full Text: DOI Link
Colin de Verdière, Éric Multicuts in planar and bounded-genus graphs with bounded number of terminals. (English) Zbl 1371.05285 Algorithmica 78, No. 4, 1206-1224 (2017). MSC: 05C85 05C10 68Q25 90C27 PDFBibTeX XMLCite \textit{É. Colin de Verdière}, Algorithmica 78, No. 4, 1206--1224 (2017; Zbl 1371.05285) Full Text: DOI arXiv HAL
Galčík, František; Katrenič, Ján; Semanišin, Gabriel On computing an optimal semi-matching. (English) Zbl 1371.05227 Algorithmica 78, No. 3, 896-913 (2017). MSC: 05C70 05C42 05C85 05C10 68Q25 PDFBibTeX XMLCite \textit{F. Galčík} et al., Algorithmica 78, No. 3, 896--913 (2017; Zbl 1371.05227) Full Text: DOI
Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio Strip planarity testing for embedded planar graphs. (English) Zbl 1360.68486 Algorithmica 77, No. 4, 1022-1059 (2017). MSC: 68Q25 05C10 05C62 68R10 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 77, No. 4, 1022--1059 (2017; Zbl 1360.68486) Full Text: DOI arXiv
Dillabaugh, Craig; He, Meng; Maheshwari, Anil; Zeh, Norbert I/O-efficient path traversal in succinct planar graphs. (English) Zbl 1364.68305 Algorithmica 77, No. 3, 714-755 (2017). MSC: 68R10 05C10 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dillabaugh} et al., Algorithmica 77, No. 3, 714--755 (2017; Zbl 1364.68305) Full Text: DOI
Adler, Isolde; Kolliopoulos, Stavros G.; Thilikos, Dimitrios M. Planar disjoint-paths completion. (English) Zbl 1350.68121 Algorithmica 76, No. 2, 401-425 (2016). MSC: 68Q25 05C10 05C38 PDFBibTeX XMLCite \textit{I. Adler} et al., Algorithmica 76, No. 2, 401--425 (2016; Zbl 1350.68121) Full Text: DOI Link
Bekos, Michael A.; Gronemann, Martin; Raftopoulou, Chrysanthi N. Two-page book embeddings of 4-planar graphs. (English) Zbl 1339.05066 Algorithmica 75, No. 1, 158-185 (2016). MSC: 05C10 05C45 05C60 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 75, No. 1, 158--185 (2016; Zbl 1339.05066) Full Text: DOI Link
Auer, Christopher; Bachmaier, Christian; Brandenburg, Franz J.; Gleißner, Andreas; Hanauer, Kathrin; Neuwirth, Daniel; Reislhuber, Josef Outer 1-planar graphs. (English) Zbl 1339.68197 Algorithmica 74, No. 4, 1293-1320 (2016); correction ibid. 83, No. 11, 3534-3535 (2021). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{C. Auer} et al., Algorithmica 74, No. 4, 1293--1320 (2016; Zbl 1339.68197) Full Text: DOI
Cheong, Otfried; Har-Peled, Sariel; Kim, Heuna; Kim, Hyo-Sil On the number of edges of fan-crossing free graphs. (English) Zbl 1330.05048 Algorithmica 73, No. 4, 673-695 (2015). MSC: 05C10 05C35 05C62 68R10 PDFBibTeX XMLCite \textit{O. Cheong} et al., Algorithmica 73, No. 4, 673--695 (2015; Zbl 1330.05048) Full Text: DOI arXiv
Hartmann, Tanja; Rollin, Jonathan; Rutter, Ignaz Regular augmentation of planar graphs. (English) Zbl 1328.05055 Algorithmica 73, No. 2, 306-370 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 05C10 05C60 05C85 05C76 68Q17 05C40 PDFBibTeX XMLCite \textit{T. Hartmann} et al., Algorithmica 73, No. 2, 306--370 (2015; Zbl 1328.05055) Full Text: DOI
Yoshida, Yuichi; Ito, Hiro Testing outerplanarity of bounded degree graphs. (English) Zbl 1319.68162 Algorithmica 73, No. 1, 1-20 (2015). MSC: 68R10 05C10 05C85 68W20 PDFBibTeX XMLCite \textit{Y. Yoshida} and \textit{H. Ito}, Algorithmica 73, No. 1, 1--20 (2015; Zbl 1319.68162) Full Text: DOI
Hong, Seok-Hee; Eades, Peter; Katoh, Naoki; Liotta, Giuseppe; Schweitzer, Pascal; Suzuki, Yusuke A linear-time algorithm for testing outer-1-planarity. (English) Zbl 1319.68158 Algorithmica 72, No. 4, 1033-1054 (2015). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{S.-H. Hong} et al., Algorithmica 72, No. 4, 1033--1054 (2015; Zbl 1319.68158) Full Text: DOI
Di Giacomo, Emilio; Liotta, Giuseppe; Meijer, Henk The approximate rectangle of influence drawability problem. (English) Zbl 1325.68168 Algorithmica 72, No. 2, 620-655 (2015). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Algorithmica 72, No. 2, 620--655 (2015; Zbl 1325.68168) Full Text: DOI Link
Angelini, Patrizio; Didimo, Walter; Kobourov, Stephen; Mchedlidze, Tamara; Roselli, Vincenzo; Symvonis, Antonios; Wismath, Stephen Monotone drawings of graphs with fixed embedding. (English) Zbl 1314.68209 Algorithmica 71, No. 2, 233-257 (2015). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 71, No. 2, 233--257 (2015; Zbl 1314.68209) Full Text: DOI
Feldmann, Andreas Emil; Widmayer, Peter An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs. (English) Zbl 1307.05211 Algorithmica 71, No. 1, 181-200 (2015). MSC: 05C85 05C10 68Q25 68R10 90C39 PDFBibTeX XMLCite \textit{A. E. Feldmann} and \textit{P. Widmayer}, Algorithmica 71, No. 1, 181--200 (2015; Zbl 1307.05211) Full Text: DOI
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve Minimum fill-in of sparse graphs: kernelization and approximation. (English) Zbl 1310.68106 Algorithmica 71, No. 1, 1-20 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 68Q25 05C10 05C85 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 71, No. 1, 1--20 (2015; Zbl 1310.68106) Full Text: DOI Link
Di Giacomo, Emilio; Didimo, Walter; Eades, Peter; Liotta, Giuseppe 2-layer right angle crossing drawings. (English) Zbl 1303.05129 Algorithmica 68, No. 4, 954-997 (2014). MSC: 05C62 05C10 05C60 05C69 05C85 68Q17 68U05 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Algorithmica 68, No. 4, 954--997 (2014; Zbl 1303.05129) Full Text: DOI
Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal graph drawing with flexibility constraints. (English) Zbl 1303.05182 Algorithmica 68, No. 4, 859-885 (2014). MSC: 05C85 05C10 05C60 05C62 05C35 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Bläsius} et al., Algorithmica 68, No. 4, 859--885 (2014; Zbl 1303.05182) Full Text: DOI Link
Xu, Jinhui; Xu, Lei; Papadopoulou, Evanthia Computing the map of geometric minimal cuts. (English) Zbl 1303.05202 Algorithmica 68, No. 4, 805-834 (2014). MSC: 05C85 05C10 05C60 68R10 68U05 PDFBibTeX XMLCite \textit{J. Xu} et al., Algorithmica 68, No. 4, 805--834 (2014; Zbl 1303.05202) Full Text: DOI
McGrae, Andrew R. A.; Zito, Michele The complexity of the empire colouring problem. (English) Zbl 1318.68095 Algorithmica 68, No. 2, 483-503 (2014). MSC: 68Q25 05C10 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{A. R. A. McGrae} and \textit{M. Zito}, Algorithmica 68, No. 2, 483--503 (2014; Zbl 1318.68095) Full Text: DOI arXiv
Borradaile, Glencora; Demaine, Erik D.; Tazari, Siamak Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. (English) Zbl 1303.05183 Algorithmica 68, No. 2, 287-311 (2014). MSC: 05C85 05C40 05C10 05C05 05C22 05C82 PDFBibTeX XMLCite \textit{G. Borradaile} et al., Algorithmica 68, No. 2, 287--311 (2014; Zbl 1303.05183) Full Text: DOI Link
Busch, Costas; Lafortune, Ryan; Tirthapura, Srikanta Sparse covers for planar graphs and graphs that exclude a fixed minor. (English) Zbl 1294.05058 Algorithmica 69, No. 3, 658-684 (2014). MSC: 05C10 05C38 05C35 05C83 PDFBibTeX XMLCite \textit{C. Busch} et al., Algorithmica 69, No. 3, 658--684 (2014; Zbl 1294.05058) Full Text: DOI Link
Mertzios, George B. An intersection model for multitolerance graphs: efficient algorithms and hierarchy. (English) Zbl 1291.05201 Algorithmica 69, No. 3, 540-581 (2014). MSC: 05C90 05C10 05C15 05C22 05C69 92D20 PDFBibTeX XMLCite \textit{G. B. Mertzios}, Algorithmica 69, No. 3, 540--581 (2014; Zbl 1291.05201) Full Text: DOI Link
Alam, M. Jawaherul; Biedl, Therese; Felsner, Stefan; Gerasch, Andreas; Kaufmann, Michael; Kobourov, Stephen G. Linear-time algorithms for hole-free rectilinear proportional contact graph representations. (English) Zbl 1275.05037 Algorithmica 67, No. 1, 3-22 (2013). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{M. J. Alam} et al., Algorithmica 67, No. 1, 3--22 (2013; Zbl 1275.05037) Full Text: DOI
Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Diameter and broadcast time of random geometric graphs in arbitrary dimensions. (English) Zbl 1275.05050 Algorithmica 67, No. 1, 65-88 (2013). MSC: 05C80 05C10 05C12 94A05 PDFBibTeX XMLCite \textit{T. Friedrich} et al., Algorithmica 67, No. 1, 65--88 (2013; Zbl 1275.05050) Full Text: DOI Link
Drmota, Michael; Panagiotou, Konstantinos A central limit theorem for the number of degree-\(k\) vertices in random maps. (English) Zbl 1275.05013 Algorithmica 66, No. 4, 741-761 (2013). MSC: 05C07 05C80 05C10 60B99 60F05 PDFBibTeX XMLCite \textit{M. Drmota} and \textit{K. Panagiotou}, Algorithmica 66, No. 4, 741--761 (2013; Zbl 1275.05013) Full Text: DOI
Guo, Longkun; Shen, Hong On finding Min-Min disjoint paths. (English) Zbl 1281.68125 Algorithmica 66, No. 3, 641-653 (2013). MSC: 68Q17 05C85 05C10 05C38 PDFBibTeX XMLCite \textit{L. Guo} and \textit{H. Shen}, Algorithmica 66, No. 3, 641--653 (2013; Zbl 1281.68125) Full Text: DOI
Liao, Chung-Shou; Lee, D. T. Power domination in circular-arc graphs. (English) Zbl 1259.05130 Algorithmica 65, No. 2, 443-466 (2013). MSC: 05C69 05C10 05C85 PDFBibTeX XMLCite \textit{C.-S. Liao} and \textit{D. T. Lee}, Algorithmica 65, No. 2, 443--466 (2013; Zbl 1259.05130) Full Text: DOI
Ito, Takehiro; Miyamoto, Yuichiro; Ono, Hirotaka; Tamaki, Hisao; Uehara, Ryuhei Route-enabling graph orientation problems. (English) Zbl 1259.68079 Algorithmica 65, No. 2, 317-338 (2013). MSC: 68Q17 05C60 05C10 05C85 90C35 68W25 PDFBibTeX XMLCite \textit{T. Ito} et al., Algorithmica 65, No. 2, 317--338 (2013; Zbl 1259.68079) Full Text: DOI
Gu, Qian-Ping; Tamaki, Hisao Improved bounds on the planar branchwidth with respect to the largest grid minor size. (English) Zbl 1257.05028 Algorithmica 64, No. 3, 416-453 (2012). MSC: 05C10 05C83 05C78 05C65 PDFBibTeX XMLCite \textit{Q.-P. Gu} and \textit{H. Tamaki}, Algorithmica 64, No. 3, 416--453 (2012; Zbl 1257.05028) Full Text: DOI
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Fast minor testing in planar graphs. (English) Zbl 1254.05185 Algorithmica 64, No. 1, 69-84 (2012). Reviewer: Ján Plesník (Bratislava) MSC: 05C83 05C10 05C85 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Algorithmica 64, No. 1, 69--84 (2012; Zbl 1254.05185) Full Text: DOI Link
Bonsma, Paul; Breuer, Felix Counting hexagonal patches and independent sets in circle graphs. (English) Zbl 1239.05093 Algorithmica 63, No. 3, 645-671 (2012). MSC: 05C30 05C10 05C85 05C90 68Q17 PDFBibTeX XMLCite \textit{P. Bonsma} and \textit{F. Breuer}, Algorithmica 63, No. 3, 645--671 (2012; Zbl 1239.05093) Full Text: DOI
Duncan, C. A.; Gansner, E. R.; Hu, Y. F.; Kaufmann, M.; Kobourov, S. G. Optimal polygonal representation of planar graphs. (English) Zbl 1239.05126 Algorithmica 63, No. 3, 672-691 (2012). MSC: 05C62 05C10 05C85 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., Algorithmica 63, No. 3, 672--691 (2012; Zbl 1239.05126) Full Text: DOI arXiv
Aazami, A.; Cheriyan, J.; Jampani, K. R. Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. (English) Zbl 1236.68076 Algorithmica 63, No. 1-2, 425-456 (2012). MSC: 68Q17 68W25 05C70 05C05 05C10 PDFBibTeX XMLCite \textit{A. Aazami} et al., Algorithmica 63, No. 1--2, 425--456 (2012; Zbl 1236.68076) Full Text: DOI
Bernardi, Olivier; Fusy, Éric Schnyder decompositions for regular plane graphs and application to drawing. (English) Zbl 1239.05038 Algorithmica 62, No. 3-4, 1159-1197 (2012). MSC: 05C10 05C78 05C05 PDFBibTeX XMLCite \textit{O. Bernardi} and \textit{É. Fusy}, Algorithmica 62, No. 3--4, 1159--1197 (2012; Zbl 1239.05038) Full Text: DOI arXiv
Marx, Dániel; Schlotter, Ildikó Obtaining a planar graph by vertex deletion. (English) Zbl 1239.05044 Algorithmica 62, No. 3-4, 807-822 (2012). MSC: 05C10 05C85 PDFBibTeX XMLCite \textit{D. Marx} and \textit{I. Schlotter}, Algorithmica 62, No. 3--4, 807--822 (2012; Zbl 1239.05044) Full Text: DOI
Hong, Seok-Hee; Nagamochi, Hiroshi A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners. (English) Zbl 1239.05129 Algorithmica 62, No. 3-4, 1122-1158 (2012). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{S.-H. Hong} and \textit{H. Nagamochi}, Algorithmica 62, No. 3--4, 1122--1158 (2012; Zbl 1239.05129) Full Text: DOI
Cabello, Sergio Many distances in planar graphs. (English) Zbl 1239.05046 Algorithmica 62, No. 1-2, 361-381 (2012). MSC: 05C12 05C10 05C85 05C70 68P05 PDFBibTeX XMLCite \textit{S. Cabello}, Algorithmica 62, No. 1--2, 361--381 (2012; Zbl 1239.05046) Full Text: DOI
Hong, Seok-Hee; Nagamochi, Hiroshi Extending Steinitz’s theorem to upward star-shaped polyhedra and spherical polyhedra. (English) Zbl 1235.05097 Algorithmica 61, No. 4, 1022-1076 (2011). MSC: 05C62 05C10 52B99 PDFBibTeX XMLCite \textit{S.-H. Hong} and \textit{H. Nagamochi}, Algorithmica 61, No. 4, 1022--1076 (2011; Zbl 1235.05097) Full Text: DOI
Al-Jubeh, Marwan; Ishaque, Mashhood; Rédei, Kristóf; Souvaine, Diane L.; Tóth, Csaba D.; Valtr, Pavel Augmenting the edge connectivity of planar straight line graphs to three. (English) Zbl 1235.05077 Algorithmica 61, No. 4, 971-999 (2011). MSC: 05C40 05C10 PDFBibTeX XMLCite \textit{M. Al-Jubeh} et al., Algorithmica 61, No. 4, 971--999 (2011; Zbl 1235.05077) Full Text: DOI
Dowden, Chris; Addario-Berry, Louigi Subgraphs of 4-regular planar graphs. (English) Zbl 1228.05126 Algorithmica 61, No. 3, 758-776 (2011). MSC: 05C10 05C80 05C85 PDFBibTeX XMLCite \textit{C. Dowden} and \textit{L. Addario-Berry}, Algorithmica 61, No. 3, 758--776 (2011; Zbl 1228.05126) Full Text: DOI arXiv
Kaplan, Haim; Nussbaum, Yahav Maximum flow in directed planar graphs with vertex capacities. (English) Zbl 1223.05106 Algorithmica 61, No. 1, 174-189 (2011). MSC: 05C21 05C10 05C20 PDFBibTeX XMLCite \textit{H. Kaplan} and \textit{Y. Nussbaum}, Algorithmica 61, No. 1, 174--189 (2011; Zbl 1223.05106) Full Text: DOI Link
Emek, Yuval \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees. (English) Zbl 1223.05040 Algorithmica 61, No. 1, 141-160 (2011). MSC: 05C10 05C60 05C85 05C05 68W20 PDFBibTeX XMLCite \textit{Y. Emek}, Algorithmica 61, No. 1, 141--160 (2011; Zbl 1223.05040) Full Text: DOI
Angelini, Patrizio; Di Battista, Giuseppe; Patrignani, Maurizio Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time. (English) Zbl 1217.05064 Algorithmica 60, No. 4, 890-937 (2011). MSC: 05C10 05C60 05C85 68W40 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 60, No. 4, 890--937 (2011; Zbl 1217.05064) Full Text: DOI
Cabello, Sergio; Mohar, Bojan Crossing number and weighted crossing number of near-planar graphs. (English) Zbl 1218.68083 Algorithmica 60, No. 3, 484-504 (2011). MSC: 68Q17 05C10 05C62 PDFBibTeX XMLCite \textit{S. Cabello} and \textit{B. Mohar}, Algorithmica 60, No. 3, 484--504 (2011; Zbl 1218.68083) Full Text: DOI
Pelsmajer, Michael J.; Schaefer, Marcus; Štefankovič, Daniel Crossing numbers of graphs with rotation systems. (English) Zbl 1218.68087 Algorithmica 60, No. 3, 679-702 (2011). MSC: 68Q17 05C10 05C20 05C62 68R10 PDFBibTeX XMLCite \textit{M. J. Pelsmajer} et al., Algorithmica 60, No. 3, 679--702 (2011; Zbl 1218.68087) Full Text: DOI
Dumitrescu, Adrian; Tóth, Csaba D. Minimum weight convex Steiner partitions. (English) Zbl 1218.05124 Algorithmica 60, No. 3, 627-652 (2011). MSC: 05C70 05C10 05C62 68U05 68W25 68W40 PDFBibTeX XMLCite \textit{A. Dumitrescu} and \textit{C. D. Tóth}, Algorithmica 60, No. 3, 627--652 (2011; Zbl 1218.05124) Full Text: DOI
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V. Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. (English) Zbl 1200.05223 Algorithmica 58, No. 3, 790-810 (2010). MSC: 05C85 05C10 05C45 PDFBibTeX XMLCite \textit{F. Dorn} et al., Algorithmica 58, No. 3, 790--810 (2010; Zbl 1200.05223) Full Text: DOI Link
Kowalik, Lukasz Fast 3-coloring triangle-free planar graphs. (English) Zbl 1200.05230 Algorithmica 58, No. 3, 770-789 (2010). MSC: 05C85 05C15 05C10 PDFBibTeX XMLCite \textit{L. Kowalik}, Algorithmica 58, No. 3, 770--789 (2010; Zbl 1200.05230) Full Text: DOI Link
Hong, Seok-Hee; Nagamochi, Hiroshi A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs. (English) Zbl 1205.68262 Algorithmica 58, No. 2, 433-460 (2010). MSC: 68R10 05C10 05C85 68U05 PDFBibTeX XMLCite \textit{S.-H. Hong} and \textit{H. Nagamochi}, Algorithmica 58, No. 2, 433--460 (2010; Zbl 1205.68262) Full Text: DOI
Dragan, Feodor F.; Yan, Chenyu Collective tree spanners in graphs with bounded parameters. (English) Zbl 1223.05247 Algorithmica 57, No. 1, 22-43 (2010). MSC: 05C75 05C10 05C12 05C70 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{C. Yan}, Algorithmica 57, No. 1, 22--43 (2010; Zbl 1223.05247) Full Text: DOI
García, A.; Hurtado, F.; Noy, M.; Tejel, J. Augmenting the connectivity of outerplanar graphs. (English) Zbl 1231.05158 Algorithmica 56, No. 2, 160-179 (2010). MSC: 05C40 05C85 68R10 05C10 PDFBibTeX XMLCite \textit{A. García} et al., Algorithmica 56, No. 2, 160--179 (2010; Zbl 1231.05158) Full Text: DOI
Robinson, Rebecca; Farr, Graham Structure and recognition of graphs with no 6-wheel subdivision. (English) Zbl 1194.05107 Algorithmica 55, No. 4, 703-728 (2009). MSC: 05C60 05C85 68R10 PDFBibTeX XMLCite \textit{R. Robinson} and \textit{G. Farr}, Algorithmica 55, No. 4, 703--728 (2009; Zbl 1194.05107) Full Text: DOI
Aronov, Boris; Carmi, Paz; Katz, Matthew J. Minimum-cost load-balancing partitions. (English) Zbl 1191.68754 Algorithmica 54, No. 3, 318-336 (2009). MSC: 68U05 05C10 65D18 68W25 PDFBibTeX XMLCite \textit{B. Aronov} et al., Algorithmica 54, No. 3, 318--336 (2009; Zbl 1191.68754) Full Text: DOI
Bollobás, Béla; Kindler, Guy; Leader, Imre; O’Donnell, Ryan Eliminating cycles in the discrete torus. (English) Zbl 1140.05019 Algorithmica 50, No. 4, 446-454 (2008). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Algorithmica 50, No. 4, 446--454 (2008; Zbl 1140.05019) Full Text: DOI
Poulalhon, Dominique; Schaeffer, Gilles Optimal coding and sampling of triangulations. (English) Zbl 1106.68114 Algorithmica 46, No. 3-4, 505-527 (2006). MSC: 68U05 05C10 PDFBibTeX XMLCite \textit{D. Poulalhon} and \textit{G. Schaeffer}, Algorithmica 46, No. 3--4, 505--527 (2006; Zbl 1106.68114) Full Text: DOI
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R. A fixed-parameter approach to 2-layer planarization. (English) Zbl 1095.68081 Algorithmica 45, No. 2, 159-182 (2006). MSC: 68R10 05C10 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Algorithmica 45, No. 2, 159--182 (2006; Zbl 1095.68081) Full Text: DOI
Gutwenger, Carsten; Mutzel, Petra; Weiskircher, René Inserting an edge into a planar graph. (English) Zbl 1065.68075 Algorithmica 41, No. 4, 289-308 (2005). MSC: 68R10 05C10 68Q25 PDFBibTeX XMLCite \textit{C. Gutwenger} et al., Algorithmica 41, No. 4, 289--308 (2005; Zbl 1065.68075) Full Text: DOI
Chen, Zhi-Zhong; He, Xin Disk embeddings of planar graphs. (English) Zbl 1053.05031 Algorithmica 38, No. 4, 539-576 (2004). Reviewer: Ján Plesník (Bratislava) MSC: 05C10 05C85 PDFBibTeX XMLCite \textit{Z.-Z. Chen} and \textit{X. He}, Algorithmica 38, No. 4, 539--576 (2004; Zbl 1053.05031) Full Text: DOI
Tamaki, Hisao; Tokuyama, Takeshi A characterization of planar graphs by pseudo-line arrangements. (English) Zbl 1045.68106 Algorithmica 35, No. 3, 269-285 (2003). MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{H. Tamaki} and \textit{T. Tokuyama}, Algorithmica 35, No. 3, 269--285 (2003; Zbl 1045.68106) Full Text: DOI
Weng, J. F.; MacGregor Smith, J. Steiner minimal trees with one polygonal obstacle. (English) Zbl 1054.90064 Algorithmica 29, No. 4, 638-648 (2001). MSC: 90C27 05C10 68U05 68W40 PDFBibTeX XMLCite \textit{J. F. Weng} and \textit{J. MacGregor Smith}, Algorithmica 29, No. 4, 638--648 (2001; Zbl 1054.90064) Full Text: DOI
Eppstein, D. Diameter and treewidth in minor-closed graph families. (English) Zbl 0963.05128 Algorithmica 27, No. 3-4, 275-291 (2000). MSC: 05C85 68R10 05C10 68W25 PDFBibTeX XMLCite \textit{D. Eppstein}, Algorithmica 27, No. 3--4, 275--291 (2000; Zbl 0963.05128) Full Text: DOI arXiv
Di Battista, G.; Tamassia, R.; Vismara, L. Output-sensitive reporting of disjoint paths. (English) Zbl 0921.68063 Algorithmica 23, No. 4, 302-340 (1999). MSC: 68R10 05C85 05C10 68P05 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Algorithmica 23, No. 4, 302--340 (1999; Zbl 0921.68063) Full Text: DOI
Biedl, T.; Kant, G.; Kaufmann, M. On triangulating planar graphs under the four-connectivity constraint. (English) Zbl 0898.68053 Algorithmica 19, No. 4, 427-446 (1997). MSC: 68R10 05C10 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., Algorithmica 19, No. 4, 427--446 (1997; Zbl 0898.68053) Full Text: DOI
Shahrokhi, Farhad; Székely, László A.; Sýkora, Ondrej; Vrto, Imrich Drawings of graphs on surfaces with few crossings. (English) Zbl 0854.68074 Algorithmica 16, No. 1, 118-131 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{F. Shahrokhi} et al., Algorithmica 16, No. 1, 118--131 (1996; Zbl 0854.68074) Full Text: DOI
Eades, Peter; Wormald, Nicholas C. Edge crossings in drawings of bipartite graphs. (English) Zbl 0804.68107 Algorithmica 11, No. 4, 379-403 (1994). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Eades} and \textit{N. C. Wormald}, Algorithmica 11, No. 4, 379--403 (1994; Zbl 0804.68107) Full Text: DOI
Bertolazzi, P.; Di Battista, G.; Liotta, G.; Mannino, C. Upward drawings of triconnected digraphs. (English) Zbl 1211.68477 Algorithmica 12, No. 6, 476-497 (1994). MSC: 68U10 05C10 05C20 68R10 PDFBibTeX XMLCite \textit{P. Bertolazzi} et al., Algorithmica 12, No. 6, 476--497 (1994; Zbl 1211.68477) Full Text: DOI
Ramprasad, P. B.; Rangan, C. Pandu A linear algorithm for the all-bidirectional-edges problem on planar graphs. (English) Zbl 0768.68173 Algorithmica 9, No. 3, 199-216 (1993). MSC: 68R10 68Q25 05C10 05C78 05C85 05C38 PDFBibTeX XMLCite \textit{P. B. Ramprasad} and \textit{C. P. Rangan}, Algorithmica 9, No. 3, 199--216 (1993; Zbl 0768.68173) Full Text: DOI
Sarrafzadeh, M.; Lou, R. D. Maximum \(k\)-covering of weighted transitive graphs with applications. (English) Zbl 0766.68103 Algorithmica 9, No. 1, 84-100 (1993). MSC: 68R10 94C15 68U05 68Q25 90B15 PDFBibTeX XMLCite \textit{M. Sarrafzadeh} and \textit{R. D. Lou}, Algorithmica 9, No. 1, 84--100 (1993; Zbl 0766.68103) Full Text: DOI
Levcopoulos, Christos; Lingas, Andrzej There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. (English) Zbl 0764.05021 Algorithmica 8, No. 3, 251-256 (1992). Reviewer: S.Stahl (Lawrence) MSC: 05C10 05C85 05C05 68Q25 94C15 PDFBibTeX XMLCite \textit{C. Levcopoulos} and \textit{A. Lingas}, Algorithmica 8, No. 3, 251--256 (1992; Zbl 0764.05021) Full Text: DOI