×

Found 57 Documents (Results 1–57)

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software