×

Found 26 Documents (Results 1–26)

The minimum moving spanning tree problem. (English) Zbl 07498665

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 15-28 (2021).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On the minimum consistent subset problem. (English) Zbl 1498.68356

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 155-167 (2019).
MSC:  68U05 68P05 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the spanning and routing ratio of Theta-Four. (English) Zbl 1432.68588

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2361-2370 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved routing on the Delaunay triangulation. (English) Zbl 1522.68633

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 22, 13 p. (2018).
MSC:  68U05 68R10 68W40
PDFBibTeX XMLCite
Full Text: DOI

Minimizing the continuous diameter when augmenting a tree with a shortcut. (English) Zbl 1491.68142

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 301-312 (2017).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI

Maximum plane trees in multipartite geometric graphs. (English) Zbl 1491.68137

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 193-204 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Towards plane spanners of degree 3. (English) Zbl 1398.05140

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 19, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. (English) Zbl 1378.68169

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 27, 14 p. (2016).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

A plane 1.88-spanner for points in convex position. (English) Zbl 1378.68147

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 25, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Essential constraints of edge-constrained proximity graphs. (English) Zbl 1478.05037

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, 55-67 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field

Software