×

Found 26 Documents (Results 1–26)

Packing short plane spanning trees in complete geometric graphs. (English) Zbl 1398.05139

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 9, 12 p. (2016).
MSC:  05C62 05C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

An improved lower bound on the minimum number of triangulations. (English) Zbl 1387.68228

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 7, 6 p. (2016).
MSC:  68U05 05C10
PDFBibTeX XMLCite
Full Text: DOI

Representing directed trees as straight skeletons. (English) Zbl 1471.68288

Di Giacomo, Emilio (ed.) et al., Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9411, 335-347 (2015).
MSC:  68U05 05C05 05C62
PDFBibTeX XMLCite
Full Text: DOI arXiv

Linear transformation distance for bichromatic matchings. (English) Zbl 1395.05131

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 154-162 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Embedding four-directional paths on convex point sets. (English) Zbl 1427.05147

Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8871, 355-366 (2014).
MSC:  05C62 68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Coloring hypergraphs induced by dynamic point sets and bottomless rectangles. (English) Zbl 1391.68104

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 73-84 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Flip graphs of bounded-degree triangulations. (English) Zbl 1273.05044

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 509-513 (2009).
MSC:  05C10 05C85
PDFBibTeX XMLCite
Full Text: DOI

On the number of plane graphs. (English) Zbl 1192.05069

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 504-513 (2006).
MSC:  05C30 05C10
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software