×

Found 486 Documents (Results 1–100)

Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. (English) Zbl 07727763

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, 219-231 (2023).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bounded VC-dimension implies the Schur-Erdős conjecture. (English) Zbl 07760175

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 46, 8 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

On the chromatic number of disjointness graphs of curves. (English) Zbl 07559254

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 54, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Semi-algebraic colorings of complete graphs. (English) Zbl 07559236

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 36, 12 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the number of edges of separated multigraphs. (English) Zbl 07551745

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, 223-227 (2021).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Coloring Hasse diagrams and disjointness graphs of curves. (English) Zbl 07266120

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, 244-250 (2019).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Planar point sets determine many pairwise crossing segments. (English) Zbl 1433.68500

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1158-1166 (2019).
MSC:  68U05 52C10 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Almost all string graphs are intersection graphs of plane convex sets. (English) Zbl 1489.05120

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 68, 14 p. (2018).
MSC:  05C76 05C10 05C62
PDFBibTeX XMLCite
Full Text: DOI

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

Sphere-of-influence graphs in normed spaces. (English) Zbl 1409.05171

Conder, Marston D. E. (ed.) et al., Discrete geometry and symmetry. Dedicated to Károly Bezdek and Egon Schulte on the occasion of their 60th birthdays. Selected papers based on the presentations at the conference ‘Geometry and symmetry’, Veszprém, Hungary, June 29 – July 3, 2015. Cham: Springer. Springer Proc. Math. Stat. 234, 293-296 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The number of crossings in multigraphs with no empty lens. (English) Zbl 1519.68194

Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 242-254 (2018).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Borsuk and Ramsey type questions in Euclidean space. (English) Zbl 1400.05257

Butler, Steve (ed.) et al., Connections in discrete mathematics. A celebration of the work of Ron Graham. Cambridge: Cambridge University Press (ISBN 978-1-316-60788-6/pbk; 978-1-107-15398-1/hbk; 978-131-665029-5/ebook). 259-277 (2018).
MSC:  05D10 05C55 05C12
PDFBibTeX XMLCite
Full Text: DOI arXiv

New trends in intuitive geometry. (English) Zbl 1411.52002

Bolyai Society Mathematical Studies 27. Berlin: Springer; Budapest: János Bolyai Mathematical Society (ISBN 978-3-662-57412-6/hbk; 978-3-662-57413-3/ebook). x, 458, c1 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Disjointness graphs of segments. (English) Zbl 1432.68365

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 59, 15 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Erdős-Hajnal conjecture for graphs with bounded VC-dimension. (English) Zbl 1432.05065

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 43, 15 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems. (English) Zbl 1425.68434

Loebl, Martin (ed.) et al., A journey through discrete mathematics. A tribute to Jiří Matoušek. Cham: Springer. 527-541 (2017).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software