Hickingbotham, Robert; Illingworth, Freddie; Mohar, Bojan; Wood, David R. Treewidth, circle graphs, and circular drawings. (English) Zbl 07818433 SIAM J. Discrete Math. 38, No. 1, 965-987 (2024). MSC: 05C83 05C62 05C10 05C76 PDFBibTeX XMLCite \textit{R. Hickingbotham} et al., SIAM J. Discrete Math. 38, No. 1, 965--987 (2024; Zbl 07818433) Full Text: DOI arXiv
Madera-Ramírez, Francisco; Trejo-Sánchez, Joel Antonio; López-Martínez, José; Ríos-Martínez, Jorge Crossing edge minimization in radial outerplanar layered graphs using segment paths. (English) Zbl 07775236 Optim. Methods Softw. 38, No. 6, 1142-1162 (2023). MSC: 68-XX 05-XX PDFBibTeX XMLCite \textit{F. Madera-Ramírez} et al., Optim. Methods Softw. 38, No. 6, 1142--1162 (2023; Zbl 07775236) Full Text: DOI
Mohar, Bojan From art and circuit design to geometry and combinatorics. (English) Zbl 1526.05105 Hujdurović, Ademir (ed.) et al., European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20–26, 2021. Berlin: European Mathematical Society (EMS). 663-676 (2023). MSC: 05C62 52C10 PDFBibTeX XMLCite \textit{B. Mohar}, in: European congress of mathematics. Proceedings of the 8th congress, 8ECM, Portorož, Slovenia, June 20--26, 2021. Berlin: European Mathematical Society (EMS). 663--676 (2023; Zbl 1526.05105) Full Text: DOI
Gangopadhyay, Rahul; Ayan Maximum rectilinear crossing number of uniform hypergraphs. (English) Zbl 1525.05139 Graphs Comb. 39, No. 6, Paper No. 114, 26 p. (2023). MSC: 05C65 05C62 05C35 52B05 68Q17 PDFBibTeX XMLCite \textit{R. Gangopadhyay} and \textit{Ayan}, Graphs Comb. 39, No. 6, Paper No. 114, 26 p. (2023; Zbl 1525.05139) Full Text: DOI arXiv
Chimani, Markus; Hliněný, Petr Inserting multiple edges into a planar graph. (English) Zbl 07740695 J. Graph Algorithms Appl. 27, No. 6, 489-522 (2023). Reviewer: I. M. Erusalimskiy (Rostow-na-Donu) MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{M. Chimani} and \textit{P. Hliněný}, J. Graph Algorithms Appl. 27, No. 6, 489--522 (2023; Zbl 07740695) 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
Staš, Michal; Timková, Mária The crossing numbers of join products of four graphs of order five with paths and cycles. (English) Zbl 1520.05083 Opusc. Math. 43, No. 6, 865-883 (2023). MSC: 05C76 05C10 05C38 PDFBibTeX XMLCite \textit{M. Staš} and \textit{M. Timková}, Opusc. Math. 43, No. 6, 865--883 (2023; Zbl 1520.05083) Full Text: DOI
Aichholzer, Oswin; Knorr, Kristin; Mulzer, Wolfgang; El Maalouly, Nicolas; Obenaus, Johannes; Paul, Rosna; Reddy, Meghana M.; Vogtenhuber, Birgit; Weinberger, Alexandra Compatible spanning trees in simple drawings of \(K_n\). (English) Zbl 07727749 Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 16-24 (2023). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Lect. Notes Comput. Sci. 13764, 16--24 (2023; Zbl 07727749) Full Text: DOI arXiv
Schaefer, Marcus Hanani-Tutte and hierarchical partial planarity. (English) Zbl 1504.05200 SIAM J. Discrete Math. 36, No. 4, 2959-2974 (2022). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{M. Schaefer}, SIAM J. Discrete Math. 36, No. 4, 2959--2974 (2022; Zbl 1504.05200) Full Text: DOI
Felsner, Stefan; Hoffmann, Michael; Knorr, Kristin; Kynčl, Jan; Parada, Irene On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens. (English) Zbl 1498.05076 J. Graph Algorithms Appl. 26, No. 3, 381-399 (2022). MSC: 05C10 05C30 05C62 68R10 PDFBibTeX XMLCite \textit{S. Felsner} et al., J. Graph Algorithms Appl. 26, No. 3, 381--399 (2022; Zbl 1498.05076) Full Text: DOI
Zehavi, Meirav Parameterized analysis and crossing minimization problems. (English) Zbl 1507.68232 Comput. Sci. Rev. 45, Article ID 100490, 14 p. (2022). MSC: 68R10 68Q27 68W05 68-01 68-02 PDFBibTeX XMLCite \textit{M. Zehavi}, Comput. Sci. Rev. 45, Article ID 100490, 14 p. (2022; Zbl 1507.68232) Full Text: DOI
Ábrego, Bernardo M.; Fernández-Merchant, Silvia The outerplanar crossing number of the complete bipartite graph. (English) Zbl 1497.05049 Discrete Appl. Math. 321, 379-384 (2022). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{B. M. Ábrego} and \textit{S. Fernández-Merchant}, Discrete Appl. Math. 321, 379--384 (2022; Zbl 1497.05049) Full Text: DOI
Burjons, Elisabet; Fuchs, Janosch; Lotze, Henri The slotted online one-sided crossing minimization problem on 2-regular graphs. (English) Zbl 07577703 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 243-256 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{E. Burjons} et al., Lect. Notes Comput. Sci. 13270, 243--256 (2022; Zbl 07577703) Full Text: DOI arXiv
Ábrego, Bernardo M.; Fernández-Merchant, Silvia; Figueroa, Ana Paulina; Montellano-Ballesteros, Juan José; Rivera-Campo, Eduardo The crossing number of twisted graphs. (English) Zbl 1497.05050 Graphs Comb. 38, No. 5, Paper No. 134, 25 p. (2022). Reviewer: Xueliang Li (Tianjin) MSC: 05C10 05C35 05C62 52C10 05C60 68R10 PDFBibTeX XMLCite \textit{B. M. Ábrego} et al., Graphs Comb. 38, No. 5, Paper No. 134, 25 p. (2022; Zbl 1497.05050) Full Text: DOI
Arroyo, Alan; Felsner, Stefan Approximating the bundled crossing number. (English) Zbl 07556586 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 383-395 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{A. Arroyo} and \textit{S. Felsner}, Lect. Notes Comput. Sci. 13174, 383--395 (2022; Zbl 07556586) 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
Schaefer, Marcus; Štefankovič, Daniel The degenerate crossing number and higher-genus embeddings. (English) Zbl 1490.68164 J. Graph Algorithms Appl. 26, No. 1, 35-58 (2022). MSC: 68R10 05C10 68Q17 PDFBibTeX XMLCite \textit{M. Schaefer} and \textit{D. Štefankovič}, J. Graph Algorithms Appl. 26, No. 1, 35--58 (2022; Zbl 1490.68164) Full Text: DOI
Pach, János; Tardos, Gábor; Tóth, Géza Crossings between non-homotopic edges. (English) Zbl 1490.05189 J. Comb. Theory, Ser. B 156, 389-404 (2022). MSC: 05C62 05C10 52C10 PDFBibTeX XMLCite \textit{J. Pach} et al., J. Comb. Theory, Ser. B 156, 389--404 (2022; Zbl 1490.05189) Full Text: DOI
Chimani, Markus; Kindermann, Philipp; Montecchiani, Fabrizio; Valtr, Pavel Crossing numbers of beyond-planar graphs. (English) Zbl 1485.68176 Theor. Comput. Sci. 898, 44-49 (2022). Reviewer: I. M. Erusalimskiy (Rostow-na-Donu) MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{M. Chimani} et al., Theor. Comput. Sci. 898, 44--49 (2022; Zbl 1485.68176) Full Text: DOI arXiv
García Olaverri, Alfredo; Tejel Altarriba, Javier; Pilz, Alexander On plane subgraphs of complete topological drawings. (English) Zbl 1475.05122 Ars Math. Contemp. 20, No. 1, 69-87 (2021). MSC: 05C62 05C10 68Q17 PDFBibTeX XMLCite \textit{A. García Olaverri} et al., Ars Math. Contemp. 20, No. 1, 69--87 (2021; Zbl 1475.05122) Full Text: DOI
Yang, Xiwu; Wang, Yizhen The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz’s conjecture holds. (English) Zbl 1470.05045 Graphs Comb. 37, No. 3, 1083-1088 (2021). MSC: 05C10 PDFBibTeX XMLCite \textit{X. Yang} and \textit{Y. Wang}, Graphs Comb. 37, No. 3, 1083--1088 (2021; Zbl 1470.05045) 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 PDFBibTeX XMLCite \textit{M. Schaefer}, J. Graph Algorithms Appl. 25, No. 1, 29--41 (2021; Zbl 1452.05180) Full Text: DOI
Aichholzer, Oswin; Hoffmann, Michael; Obenaus, Johannes; Paul, Rosna; Perz, Daniel; Seiferth, Nadja; Vogtenhuber, Birgit; Weinberger, Alexandra Plane spanning trees in edge-colored simple drawings of \(K_n\). (English) Zbl 07436639 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 482-489 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Lect. Notes Comput. Sci. 12590, 482--489 (2020; Zbl 07436639) Full Text: DOI arXiv
Hoffmann, Michael; Liu, Chih-Hung; Reddy, Meghana M.; Tóth, Csaba D. Simple topological drawings of \(k\)-planar graphs. (English) Zbl 07436633 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 390-402 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{M. Hoffmann} et al., Lect. Notes Comput. Sci. 12590, 390--402 (2020; Zbl 07436633) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Crossings between non-homotopic edges. (English) Zbl 07436630 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 359-371 (2020). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{J. Pach} et al., Lect. Notes Comput. Sci. 12590, 359--371 (2020; Zbl 07436630) Full Text: DOI arXiv
Clancy, Kieran; Haythorpe, Michael; Newcombe, Alex; Pegg, Ed jun. There are no cubic graphs on 26 vertices with crossing number 10 or 11. (English) Zbl 1459.05055 Graphs Comb. 36, No. 6, 1713-1721 (2020). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{K. Clancy} et al., Graphs Comb. 36, No. 6, 1713--1721 (2020; Zbl 1459.05055) Full Text: DOI arXiv
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
Clancy, Kieran; Haythorpe, Michael; Newcombe, Alex A survey of graphs with known or bounded crossing numbers. (English) Zbl 1453.05024 Australas. J. Comb. 78, Part 2, 209-296 (2020). MSC: 05C10 05C75 05C76 PDFBibTeX XMLCite \textit{K. Clancy} et al., Australas. J. Comb. 78, Part 2, 209--296 (2020; Zbl 1453.05024) Full Text: arXiv Link
Aichholzer, Oswin; Duque, Frank; Fabila-Monroy, Ruy; García-Quintero, Oscar E.; Hidalgo-Toscano, Carlos An ongoing project to improve the rectilinear and the pseudolinear crossing constants. (English) Zbl 1447.05140 J. Graph Algorithms Appl. 24, No. 3, 421-432 (2020). MSC: 05C62 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., J. Graph Algorithms Appl. 24, No. 3, 421--432 (2020; Zbl 1447.05140) Full Text: DOI arXiv
de Mesmay, Arnaud; Schaefer, Marcus; Sedgwick, Eric Link crossing number is NP-hard. (English) Zbl 1455.57010 J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020). Reviewer: Mehdi Yazdi (Oxford) MSC: 57K10 57M15 68Q17 68R10 PDFBibTeX XMLCite \textit{A. de Mesmay} et al., J. Knot Theory Ramifications 29, No. 6, Article ID 2050043, 15 p. (2020; Zbl 1455.57010) Full Text: DOI arXiv
Kynčl, Jan Simple realizability of complete abstract topological graphs simplified. (English) Zbl 1508.05042 Discrete Comput. Geom. 64, No. 1, 1-27 (2020). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{J. Kynčl}, Discrete Comput. Geom. 64, No. 1, 1--27 (2020; Zbl 1508.05042) Full Text: DOI arXiv
Pach, János; Tóth, Géza A crossing lemma for multigraphs. (English) Zbl 1446.05026 Discrete Comput. Geom. 63, No. 4, 918-933 (2020). Reviewer: Juan José Montellano Ballesteros (Coyoacán) MSC: 05C10 05C35 05C30 68R10 PDFBibTeX XMLCite \textit{J. Pach} and \textit{G. Tóth}, Discrete Comput. Geom. 63, No. 4, 918--933 (2020; Zbl 1446.05026) Full Text: DOI Link
Ábrego, Bernardo; Fernández-Merchant, Silvia; Sparks, Athena The bipartite-cylindrical crossing number of the complete bipartite graph. (English) Zbl 1436.05077 Graphs Comb. 36, No. 2, 205-220 (2020). MSC: 05C62 PDFBibTeX XMLCite \textit{B. Ábrego} et al., Graphs Comb. 36, No. 2, 205--220 (2020; Zbl 1436.05077) Full Text: DOI
Agrawal, Akanksha; Guśpiel, Grzegorz; Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Connecting the dots (with Minimum Crossings). (English) Zbl 07559207 Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 7, 17 p. (2019). MSC: 68U05 PDFBibTeX XMLCite \textit{A. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 7, 17 p. (2019; Zbl 07559207) Full Text: DOI
Chaplick, Steven; Klute, Fabian; Parada, Irene; Rollin, Jonathan; Ueckerdt, Torsten Edge-minimum saturated \(k\)-planar drawings. (English) Zbl 07551730 Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 3-17 (2021). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 12868, 3--17 (2019; Zbl 07551730) Full Text: DOI arXiv
Demaine, Erik D.; Goodrich, Timothy D.; Kloster, Kyle; Lavallee, Brian; Liu, Quanquan C.; Sullivan, Blair D.; Vakilian, Ali; van der Poel, Andrew Structural rounding: approximation algorithms for graphs near an algorithmically tractable class. (English) Zbl 07525474 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 37, 15 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{E. D. Demaine} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 37, 15 p. (2019; Zbl 07525474) Full Text: DOI arXiv
Aichholzer, Oswin; Fabila-Monroy, Ruy; Fuchs, Adrian; Hidalgo-Toscano, Carlos; Parada, Irene; Vogtenhuber, Birgit; Zaragoza, Francisco On the 2-colored crossing number. (English) Zbl 07266108 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 87-100 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Lect. Notes Comput. Sci. 11904, 87--100 (2019; Zbl 07266108) Full Text: DOI arXiv
Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Jiwon; Ravsky, Alexander; Wolff, Alexander Bundled crossings revisited. (English) Zbl 07266106 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 63-77 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 11904, 63--77 (2019; Zbl 07266106) Full Text: DOI arXiv
Pach, János; Tóth, Géza A crossing lemma for multigraphs. (English) Zbl 1489.05033 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 65, 13 p. (2018). MSC: 05C10 05C35 05C30 68R10 PDFBibTeX XMLCite \textit{J. Pach} and \textit{G. Tóth}, LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 65, 13 p. (2018; Zbl 1489.05033) Full Text: DOI arXiv
Chaplick, Steven; Kryven, Myroslav; Liotta, Giuseppe; Löffler, Andre; Wolff, Alexander Beyond outerplanarity. (English) Zbl 1503.68213 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 546-559 (2018). MSC: 68R10 68Q25 68U05 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 10692, 546--559 (2018; Zbl 1503.68213) Full Text: DOI arXiv
Hliněný, Petr; Thomassen, Carsten Deciding parity of graph crossing number. (English) Zbl 1393.05087 SIAM J. Discrete Math. 32, No. 3, 1962-1965 (2018). MSC: 05C10 68Q25 PDFBibTeX XMLCite \textit{P. Hliněný} and \textit{C. Thomassen}, SIAM J. Discrete Math. 32, No. 3, 1962--1965 (2018; Zbl 1393.05087) Full Text: DOI
Duque, Frank; González-Aguilar, Hernán; Hernández-Vélez, César; Leaños, Jesús; Medina, Carolina The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph. (English) Zbl 1388.05046 Electron. J. Comb. 25, No. 2, Research Paper P2.43, 11 p. (2018). MSC: 05C10 68Q25 05C85 PDFBibTeX XMLCite \textit{F. Duque} et al., Electron. J. Comb. 25, No. 2, Research Paper P2.43, 11 p. (2018; Zbl 1388.05046) Full Text: arXiv Link
Dujmović, Vida; Joret, Gwenaël; Morin, Pat; Norin, Sergey; Wood, David R. Orthogonal tree decompositions of graphs. (English) Zbl 1383.05257 SIAM J. Discrete Math. 32, No. 2, 839-863 (2018); corrigendum ibid. 32, No. 4, 3003-3004 (2018). MSC: 05C70 05C05 05C83 05C62 05C75 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 32, No. 2, 839--863 (2018; Zbl 1383.05257) Full Text: DOI arXiv
Pach, János; Székely, László A.; Tóth, Csaba D.; Tóth, Géza Note on \(k\)-planar crossing numbers. (English) Zbl 1380.05165 Comput. Geom. 68, 2-6 (2018). MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{J. Pach} et al., Comput. Geom. 68, 2--6 (2018; Zbl 1380.05165) Full Text: DOI arXiv
Biedl, Therese; Chimani, Markus; Derka, Martin; Mutzel, Petra Crossing number for graphs with bounded pathwidth. (English) Zbl 1457.68204 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 13, 13 p. (2017). MSC: 68R10 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{T. Biedl} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 13, 13 p. (2017; Zbl 1457.68204) Full Text: DOI arXiv
Hubard, Alfredo; Kaluža, Vojtěch; de Mesmay, Arnaud; Tancer, Martin Shortest path embeddings of graphs on surfaces. (English) Zbl 1384.05073 Discrete Comput. Geom. 58, No. 4, 921-945 (2017). Reviewer: Ortrud R. Oellermann (Winnipeg) MSC: 05C10 05C60 53C23 PDFBibTeX XMLCite \textit{A. Hubard} et al., Discrete Comput. Geom. 58, No. 4, 921--945 (2017; Zbl 1384.05073) Full Text: DOI arXiv Link
Ábrego, Bernardo M.; Fernández-Merchant, Silvia The rectilinear local crossing number of \(K_{n}\). (English) Zbl 1366.05073 J. Comb. Theory, Ser. A 151, 131-145 (2017). MSC: 05C62 PDFBibTeX XMLCite \textit{B. M. Ábrego} and \textit{S. Fernández-Merchant}, J. Comb. Theory, Ser. A 151, 131--145 (2017; Zbl 1366.05073) Full Text: DOI arXiv
Anshu, Anurag; Gangopadhyay, Rahul; Shannigrahi, Saswata; Vusirikala, Satyanarayana On the rectilinear crossing number of complete uniform hypergraphs. (English) Zbl 1368.05106 Comput. Geom. 61, 38-47 (2017). MSC: 05C65 05C62 PDFBibTeX XMLCite \textit{A. Anshu} et al., Comput. Geom. 61, 38--47 (2017; Zbl 1368.05106) Full Text: DOI arXiv
Dujmović, Vida; Eppstein, David; Wood, David R. Structure of graphs with locally restricted crossings. (English) Zbl 1362.05121 SIAM J. Discrete Math. 31, No. 2, 805-824 (2017). MSC: 05C83 05C62 05C10 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 31, No. 2, 805--824 (2017; Zbl 1362.05121) Full Text: DOI arXiv
Hernández-Vélez, César; Leaños, Jesús; Salazar, Gelasio On the pseudolinear crossing number. (English) Zbl 1359.05085 J. Graph Theory 84, No. 3, 297-310 (2017). MSC: 05C62 PDFBibTeX XMLCite \textit{C. Hernández-Vélez} et al., J. Graph Theory 84, No. 3, 297--310 (2017; Zbl 1359.05085) Full Text: DOI arXiv
Fox, Jacob; Pach, János; Suk, Andrew Approximating the rectilinear crossing number. (English) Zbl 1478.68234 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 413-426 (2016). MSC: 68R10 68U05 68W05 68W25 PDFBibTeX XMLCite \textit{J. Fox} et al., Lect. Notes Comput. Sci. 9801, 413--426 (2016; Zbl 1478.68234) Full Text: DOI arXiv Link
Alam, Md. Jawaherul; Fink, Martin; Pupyrev, Sergey The bundled crossing number. (English) Zbl 1478.68208 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 399-412 (2016). MSC: 68R10 68U05 68W25 PDFBibTeX XMLCite \textit{Md. J. Alam} et al., Lect. Notes Comput. Sci. 9801, 399--412 (2016; Zbl 1478.68208) Full Text: DOI arXiv Link
Székely, László A. Turán’s brick factory problem: the status of the conjectures of Zarankiewicz and Hill. (English) Zbl 1352.05060 Gera, Ralucca (ed.) et al., Graph theory. Favorite conjectures and open problems – 1. Cham: Springer (ISBN 978-3-319-31938-4/hbk; 978-3-319-31940-7/ebook). Problem Books in Mathematics, 211-230 (2016). MSC: 05C10 05C62 05C60 52C10 PDFBibTeX XMLCite \textit{L. A. Székely}, in: Graph theory. Favorite conjectures and open problems -- 1. Cham: Springer. 211--230 (2016; Zbl 1352.05060) Full Text: DOI
Bald, Samuel; Johnson, Matthew P.; Liu, Ou Approximating the maximum rectilinear crossing number. (English) Zbl 1476.68190 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 455-467 (2016). MSC: 68R10 68Q17 68T20 68W20 68W25 PDFBibTeX XMLCite \textit{S. Bald} et al., Lect. Notes Comput. Sci. 9797, 455--467 (2016; Zbl 1476.68190) Full Text: DOI
Binucci, Carla; Di Giacomo, Emilio; Didimo, Walter; Montecchiani, Fabrizio; Patrignani, Maurizio; Symvonis, Antonios; Tollis, Ioannis G. Fan-planarity: properties and complexity. (English) Zbl 1317.68134 Theor. Comput. Sci. 589, 76-86 (2015). MSC: 68R10 05C10 68Q17 PDFBibTeX XMLCite \textit{C. Binucci} et al., Theor. Comput. Sci. 589, 76--86 (2015; Zbl 1317.68134) Full Text: DOI arXiv
Balko, Martin; Fulek, Radoslav; Kynčl, Jan Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\). (English) Zbl 1307.05058 Discrete Comput. Geom. 53, No. 1, 107-143 (2015). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. Balko} et al., Discrete Comput. Geom. 53, No. 1, 107--143 (2014; Zbl 1307.05058) Full Text: DOI arXiv
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio Shellable drawings and the cylindrical crossing number of \(K_n\). (English) Zbl 1306.05166 Discrete Comput. Geom. 52, No. 4, 743-753 (2014). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{B. M. Ábrego} et al., Discrete Comput. Geom. 52, No. 4, 743--753 (2014; Zbl 1306.05166) Full Text: DOI arXiv Backlinks: MO