Binucci, Carla; Didimo, Walter; Patrignani, Maurizio \(st\)-orientations with few transitive edges. (English) Zbl 07781093 J. Graph Algorithms Appl. 27, No. 8, 625-650 (2023). MSC: 05C62 05C20 05C10 90C05 90C10 PDFBibTeX XMLCite \textit{C. Binucci} et al., J. Graph Algorithms Appl. 27, No. 8, 625--650 (2023; Zbl 07781093) Full Text: DOI
Cornelsen, Sabine; Diatzko, Gregor Planar confluent orthogonal drawings of 4-modal digraphs. (English) Zbl 1522.05328 J. Graph Algorithms Appl. 27, No. 7, 523-540 (2023). MSC: 05C62 05C10 05C20 PDFBibTeX XMLCite \textit{S. Cornelsen} and \textit{G. Diatzko}, J. Graph Algorithms Appl. 27, No. 7, 523--540 (2023; Zbl 1522.05328) 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
Binucci, Carla; Didimo, Walter; Montecchiani, Fabrizio 1-planarity testing and embedding: an experimental study. (English) Zbl 1498.05260 Comput. Geom. 108, Article ID 101900, 11 p. (2023). MSC: 05C85 05C10 05C42 68R10 68Q25 PDFBibTeX XMLCite \textit{C. Binucci} et al., Comput. Geom. 108, Article ID 101900, 11 p. (2023; Zbl 1498.05260) 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
Chimani, Markus; Wiedera, Tilo Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast. (English) Zbl 1522.68394 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 19, 14 p. (2018). MSC: 68R10 05C10 05C38 68W40 90C10 90C35 PDFBibTeX XMLCite \textit{M. Chimani} and \textit{T. Wiedera}, LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 19, 14 p. (2018; Zbl 1522.68394) Full Text: DOI arXiv
Chimani, Markus; Hedtke, Ivo; Wiedera, Tilo Exact algorithms for the maximum planar subgraph problem: new models and experiments. (English) Zbl 1493.68262 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 22, 15 p. (2018). MSC: 68R10 05C10 05C85 68W05 90C10 PDFBibTeX XMLCite \textit{M. Chimani} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 22, 15 p. (2018; Zbl 1493.68262) Full Text: DOI arXiv
Chimani, Markus; Klein, Karsten; Wiedera, Tilo A note on the practicality of maximal planar subgraph algorithms. (English) Zbl 1478.68225 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, 357-364 (2016). MSC: 68R10 05C10 05C85 68W40 PDFBibTeX XMLCite \textit{M. Chimani} et al., Lect. Notes Comput. Sci. 9801, 357--364 (2016; Zbl 1478.68225) Full Text: DOI arXiv
Chimani, Markus; Gutwenger, Carsten; Mutzel, Petra; Wong, Hoi-Ming Upward planarization layout. (English) Zbl 1217.05070 J. Graph Algorithms Appl. 15, No. 1, 127-155 (2011). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Graph Algorithms Appl. 15, No. 1, 127--155 (2011; Zbl 1217.05070) Full Text: DOI EuDML
Buchheim, Christoph; Chimani, Markus; Ebner, Dietmar; Gutwenger, Carsten; Jünger, Michael; Klau, Gunnar W.; Mutzel, Petra; Weiskircher, René A branch-and-cut approach to the crossing number problem. (English) Zbl 1146.05017 Discrete Optim. 5, No. 2, 373-388 (2008). MSC: 05C10 90C35 90C57 PDFBibTeX XMLCite \textit{C. Buchheim} et al., Discrete Optim. 5, No. 2, 373--388 (2008; Zbl 1146.05017) Full Text: DOI