Călinescu, Gruia; Kaul, Hemanshu; Kudarzi, Bahareh An improved algorithm for finding maximum outerplanar subgraphs. (English) Zbl 07794329 Discrete Appl. Math. 342, 207-217 (2024). MSC: 68-XX 65-XX PDFBibTeX XMLCite \textit{G. Călinescu} et al., Discrete Appl. Math. 342, 207--217 (2024; Zbl 07794329) Full Text: DOI arXiv
Eppstein, David; Frishberg, Daniel; Osegueda, Martha C. Angles of arc-polygons and lombardi drawings of cacti. (English) Zbl 1514.05115 Comput. Geom. 112, Article ID 101982, 11 p. (2023). MSC: 05C62 68R10 05C10 68U05 05C85 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Comput. Geom. 112, Article ID 101982, 11 p. (2023; Zbl 1514.05115) Full Text: DOI arXiv
Chalermsook, Parinya; Schmid, Andreas; Uniyal, Sumedha A tight extremal bound on the Lovász cactus number in planar graphs. (English) Zbl 07559128 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 19, 14 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Chalermsook} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 19, 14 p. (2019; Zbl 07559128) Full Text: DOI arXiv
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
Chekuri, Chandra; Sidiropoulos, Anastasios Approximation algorithms for Euler genus and related problems. (English) Zbl 1398.68663 SIAM J. Comput. 47, No. 4, 1610-1643 (2018). MSC: 68W25 05C10 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{A. Sidiropoulos}, SIAM J. Comput. 47, No. 4, 1610--1643 (2018; Zbl 1398.68663) Full Text: DOI arXiv
Chalermsook, Parinya; Schmid, Andreas Finding triangles for maximum planar subgraphs. (English) Zbl 1485.68310 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 373-384 (2017). MSC: 68W25 68Q17 68R10 PDFBibTeX XMLCite \textit{P. Chalermsook} and \textit{A. Schmid}, Lect. Notes Comput. Sci. 10167, 373--384 (2017; Zbl 1485.68310) Full Text: DOI
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; Hedtke, Ivo; Wiedera, Tilo Limits of greedy approximation algorithms for the maximum planar subgraph problem. (English) Zbl 1478.68224 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 334-346 (2016). MSC: 68R10 05C10 68Q17 68W25 PDFBibTeX XMLCite \textit{M. Chimani} et al., Lect. Notes Comput. Sci. 9843, 334--346 (2016; Zbl 1478.68224) Full Text: DOI
de Oliveira Oliveira, Mateus An algorithmic metatheorem for directed treewidth. (English) Zbl 1333.05139 Discrete Appl. Math. 204, 49-76 (2016). MSC: 05C20 05C12 05C05 03B15 PDFBibTeX XMLCite \textit{M. de Oliveira Oliveira}, Discrete Appl. Math. 204, 49--76 (2016; Zbl 1333.05139) Full Text: DOI arXiv
Cheung, Ho Yee; Lau, Lap Chi; Leung, Kai Man Algebraic algorithms for linear matroid parity problems. (English) Zbl 1333.05062 ACM Trans. Algorithms 10, No. 3, Article No. 10, 26 p. (2014). MSC: 05B35 05C35 05C38 05C70 05C85 68W20 68W40 PDFBibTeX XMLCite \textit{H. Y. Cheung} et al., ACM Trans. Algorithms 10, No. 3, Article No. 10, 26 p. (2014; Zbl 1333.05062) Full Text: DOI
Călinescu, Gruia; Fernandes, Cristina G.; Kaul, Hemanshu; Zelikovsky, Alexander Maximum series-parallel subgraph. (English) Zbl 1236.68293 Algorithmica 63, No. 1-2, 137-157 (2012). MSC: 68W25 68Q17 05C85 PDFBibTeX XMLCite \textit{G. Călinescu} et al., Algorithmica 63, No. 1--2, 137--157 (2012; Zbl 1236.68293) Full Text: DOI
Cheng, Christine; McDermid, Eric; Suzuki, Ichiro Planarization and acyclic colorings of subcubic claw-free graphs. (English) Zbl 1341.05068 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 107-118 (2011). MSC: 05C15 05C85 05C10 05C69 05C76 68W25 68Q25 PDFBibTeX XMLCite \textit{C. Cheng} et al., Lect. Notes Comput. Sci. 6986, 107--118 (2011; Zbl 1341.05068) Full Text: DOI
Chimani, Markus; Gutwenger, Carsten Non-planar core reduction of graphs. (English) Zbl 1176.05077 Discrete Math. 309, No. 7, 1838-1855 (2009). Reviewer: Robert Jajcay (Terre Haute) MSC: 05C85 05C10 PDFBibTeX XMLCite \textit{M. Chimani} and \textit{C. Gutwenger}, Discrete Math. 309, No. 7, 1838--1855 (2009; Zbl 1176.05077) Full Text: DOI
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
Faria, Luerbio; Herrera de Figueiredo, Celina M.; Gravier, Sylvain; de Mendonça, Candido F. X.; Stolfi, Jorge On maximum planar induced subgraphs. (English) Zbl 1107.68063 Discrete Appl. Math. 154, No. 13, 1774-1782 (2006). MSC: 68R10 05C10 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{L. Faria} et al., Discrete Appl. Math. 154, No. 13, 1774--1782 (2006; Zbl 1107.68063) Full Text: DOI
Kühn, Daniela; Osthus, Deryk; Taraz, Anusch Large planar subgraphs in dense graphs. (English) Zbl 1075.05045 J. Comb. Theory, Ser. B 95, No. 2, 263-282 (2005). MSC: 05C35 PDFBibTeX XMLCite \textit{D. Kühn} et al., J. Comb. Theory, Ser. B 95, No. 2, 263--282 (2005; Zbl 1075.05045) Full Text: DOI
Poranen, Timo Heuristics for the maximum outerplanar subgraph problem. (English) Zbl 1122.90416 J. Heuristics 11, No. 1, 59-88 (2005). MSC: 90C35 68R10 90C59 PDFBibTeX XMLCite \textit{T. Poranen}, J. Heuristics 11, No. 1, 59--88 (2005; Zbl 1122.90416) Full Text: DOI
Faria, Luerbio; Herrera de Figueiredo, Celina M.; Gravier, Sylvain; Mendonça, Candido F. X.; Stolfi, Jorge Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a \(\frac 34\)-approximation for finding maximum planar induced subgraphs. (English) Zbl 1075.05602 Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 121-126 (2004). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{L. Faria} et al., Electron. Notes Discrete Math. 18, 121--126 (2004; Zbl 1075.05602) Full Text: Link
Poranen, Timo A simulated annealing algorithm for the maximum planar subgraph problem. (English) Zbl 1055.05144 Int. J. Comput. Math. 81, No. 5, 555-568 (2004). Reviewer: Ján Plesník (Bratislava) MSC: 05C85 05C10 68R10 90C59 PDFBibTeX XMLCite \textit{T. Poranen}, Int. J. Comput. Math. 81, No. 5, 555--568 (2004; Zbl 1055.05144) Full Text: DOI
Faria, Luerbio; de Figueiredo, Celina M. Herrera; Mendonça, Candido F. X. On the complexity of the approximation of nonplanarity parameters for cubic graphs. (English) Zbl 1042.05092 Discrete Appl. Math. 141, No. 1-3, 119-134 (2004). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{L. Faria} et al., Discrete Appl. Math. 141, No. 1--3, 119--134 (2004; Zbl 1042.05092) Full Text: DOI