Eppstein, David Lower bounds for non-adaptive shortest path relaxation. (English) Zbl 07789718 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 416-429 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 14079, 416--429 (2023; Zbl 07789718) Full Text: DOI arXiv
Eppstein, David Locked and unlocked smooth embeddings of surfaces. (English) Zbl 07779753 CGT, Comput. Geom. Topol. 2, No. 2, Paper No. 5, 20 p. (2023). MSC: 68U03 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, CGT, Comput. Geom. Topol. 2, No. 2, Paper No. 5, 20 p. (2023; Zbl 07779753) 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
Eppstein, David A stronger lower bound on parametric minimum spanning trees. (English) Zbl 07691820 Algorithmica 85, No. 6, 1738-1753 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{D. Eppstein}, Algorithmica 85, No. 6, 1738--1753 (2023; Zbl 07691820) Full Text: DOI
Eppstein, David The graphs of stably matchable pairs. (English) Zbl 07538589 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 349-360 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 12911, 349--360 (2021; Zbl 07538589) Full Text: DOI arXiv
Eppstein, David Cubic planar graphs that cannot be drawn on few lines. (English) Zbl 1522.68401 J. Comput. Geom. 12, No. 1, 178-197 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, J. Comput. Geom. 12, No. 1, 178--197 (2021; Zbl 1522.68401) Full Text: DOI arXiv
Eppstein, David A stronger lower bound on parametric minimum spanning trees. (English) Zbl 07498688 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, 343-356 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 12808, 343--356 (2021; Zbl 07498688) Full Text: DOI arXiv
Da Lozzo, Giordano; Eppstein, David; Goodrich, Michael T.; Gupta, Siddharth C-planarity testing of embedded clustered graphs with bounded dual carving-width. (English) Zbl 1515.68235 Algorithmica 83, No. 8, 2471-2502 (2021). MSC: 68R10 05C10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{G. Da Lozzo} et al., Algorithmica 83, No. 8, 2471--2502 (2021; Zbl 1515.68235) Full Text: DOI arXiv
Eppstein, David; Vazirani, Vijay V. NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs. (English) Zbl 1466.05179 SIAM J. Comput. 50, No. 3, 1014-1033 (2021). MSC: 05C70 05C83 05C21 68W10 68R10 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{V. V. Vazirani}, SIAM J. Comput. 50, No. 3, 1014--1033 (2021; Zbl 1466.05179) Full Text: DOI arXiv
Eppstein, David; Frishberg, Daniel; Havvaei, Elham Simplifying activity-on-edge graphs. (English) Zbl 07759292 Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 24, 14 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{D. Eppstein} et al., LIPIcs -- Leibniz Int. Proc. Inform. 162, Article 24, 14 p. (2020; Zbl 07759292) Full Text: DOI arXiv
Borradaile, Glencora; Chambers, Erin Wolf; Eppstein, David; Maxwell, William; Nayyeri, Amir Low-stretch spanning trees of graphs with bounded width. (English) Zbl 07759283 Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 15, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{G. Borradaile} et al., LIPIcs -- Leibniz Int. Proc. Inform. 162, Article 15, 19 p. (2020; Zbl 07759283) Full Text: DOI arXiv
Eppstein, David; Har-Peled, Sariel; Nivasch, Gabriel Grid peeling and the affine curve-shortening flow. (English) Zbl 1461.53073 Exp. Math. 29, No. 3, 306-316 (2020). MSC: 53E99 68U05 52A10 11H06 11P21 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Exp. Math. 29, No. 3, 306--316 (2020; Zbl 1461.53073) Full Text: DOI arXiv
Eppstein, David Counting polygon triangulations is hard. (English) Zbl 1460.52022 Discrete Comput. Geom. 64, No. 4, 1210-1234 (2020). Reviewer: Agnieszka Lisowska (Sosnowiec) MSC: 52C45 68U05 68Q17 05C10 PDFBibTeX XMLCite \textit{D. Eppstein}, Discrete Comput. Geom. 64, No. 4, 1210--1234 (2020; Zbl 1460.52022) Full Text: DOI arXiv Link
Akitaya, Hugo A.; Dujmović, Vida; Eppstein, David; Hull, Thomas C.; Jain, Kshitij; Lubiw, Anna Face flips in origami tessellations. (English) Zbl 1492.68128 J. Comput. Geom. 11, No. 1, 397-417 (2020). MSC: 68U05 68Q25 68R10 PDFBibTeX XMLCite \textit{H. A. Akitaya} et al., J. Comput. Geom. 11, No. 1, 397--417 (2020; Zbl 1492.68128) Full Text: DOI arXiv
Eppstein, David; Havvaei, Elham Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1452.68135 Algorithmica 82, No. 8, 2337-2359 (2020). MSC: 68R10 03B70 05C05 05C76 05C85 68Q27 92D15 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{E. Havvaei}, Algorithmica 82, No. 8, 2337--2359 (2020; Zbl 1452.68135) Full Text: DOI Link
Barequet, Gill; Eppstein, David; Goodrich, Michael; Mamano, Nil Stable-matching Voronoi diagrams: combinatorial complexity and algorithms. (English) Zbl 1473.68199 J. Comput. Geom. 11, No. 1, 26-59 (2020). MSC: 68U05 68W05 90C27 PDFBibTeX XMLCite \textit{G. Barequet} et al., J. Comput. Geom. 11, No. 1, 26--59 (2020; Zbl 1473.68199) Full Text: DOI arXiv
Cardinal, Jean; Demaine, Erik D.; Eppstein, David; Hearn, Robert A.; Winslow, Andrew Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect. (English) Zbl 1436.68133 Theor. Comput. Sci. 806, 332-343 (2020). MSC: 68Q25 68Q17 68R05 68R07 PDFBibTeX XMLCite \textit{J. Cardinal} et al., Theor. Comput. Sci. 806, 332--343 (2020; Zbl 1436.68133) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T.; Liu, James A.; Matias, Pedro Tracking paths in planar graphs. (English) Zbl 07650287 Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 54, 17 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{D. Eppstein} et al., LIPIcs -- Leibniz Int. Proc. Inform. 149, Article 54, 17 p. (2019; Zbl 07650287) Full Text: DOI arXiv
Mamano, Nil; Efrat, Alon; Eppstein, David; Frishberg, Daniel; Goodrich, Michael T.; Kobourov, Stephen; Matias, Pedro; Polishchuk, Valentin New applications of nearest-neighbor chains: Euclidean TSP and motorcycle graphs. (English) Zbl 07650284 Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 51, 21 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{N. Mamano} et al., LIPIcs -- Leibniz Int. Proc. Inform. 149, Article 51, 21 p. (2019; Zbl 07650284) Full Text: DOI
Da Lozzo, Giordano; Eppstein, David; Goodrich, Michael T.; Gupta, Siddharth C-planarity testing of embedded clustered graphs with bounded dual carving-width. (English) Zbl 1515.68236 Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 9, 17 p. (2019). MSC: 68R10 05C10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{G. Da Lozzo} et al., LIPIcs -- Leibniz Int. Proc. Inform. 148, Article 9, 17 p. (2019; Zbl 1515.68236) Full Text: DOI
Eppstein, David Counting polygon triangulations is hard. (English) Zbl 07559233 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 33, 17 p. (2019). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 33, 17 p. (2019; Zbl 07559233) Full Text: DOI
Eppstein, David Cubic planar graphs that cannot be drawn on few lines. (English) Zbl 07559232 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 32, 15 p. (2019). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 32, 15 p. (2019; Zbl 07559232) Full Text: DOI
Eppstein, David Limitations on realistic hyperbolic graph drawing. (English) Zbl 07551754 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, 343-357 (2021). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 12868, 343--357 (2019; Zbl 07551754) Full Text: DOI arXiv
Eppstein, David; Havvaei, Elham Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1520.68121 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 16, 14 p. (2019). MSC: 68R10 03B70 05C05 05C76 05C85 68Q27 92D15 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{E. Havvaei}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 16, 14 p. (2019; Zbl 1520.68121) Full Text: DOI arXiv
Eppstein, David; Lokshtanov, Daniel The parameterized complexity of finding point sets with hereditary properties. (English) Zbl 1520.68048 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 11, 14 p. (2019). MSC: 68Q27 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{D. Lokshtanov}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 11, 14 p. (2019; Zbl 1520.68048) Full Text: DOI arXiv
Biedl, Therese; Chambers, Erin Wolf; Eppstein, David; De Mesmay, Arnaud; Ophelders, Tim Homotopy height, grid-major height and graph-drawing height. (English) Zbl 07266137 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, 468-481 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., Lect. Notes Comput. Sci. 11904, 468--481 (2019; Zbl 07266137) Full Text: DOI arXiv
Demaine, Erik D.; Eppstein, David; Hesterberg, Adam; Jain, Kshitij; Lubiw, Anna; Uehara, Ryuhei; Uno, Yushi Reconfiguring undirected paths. (English) Zbl 07152221 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, 353-365 (2019). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 11646, 353--365 (2019; Zbl 07152221) Full Text: DOI arXiv Link
Eppstein, David; Reed, Bruce Finding maximal sets of laminar 3-separators in planar graphs in linear time. (English) Zbl 1431.68092 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). 589-605 (2019). MSC: 68R10 05C40 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{B. Reed}, in: 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). 589--605 (2019; Zbl 1431.68092) Full Text: DOI arXiv
de Berg, Mark; Cabello, Sergio; Cheong, Otfried; Eppstein, David; Knauer, Christian Covering many points with a small-area box. (English) Zbl 1418.68225 J. Comput. Geom. 10, No. 1, 207-222 (2019). MSC: 68U05 68W40 PDFBibTeX XMLCite \textit{M. de Berg} et al., J. Comput. Geom. 10, No. 1, 207--222 (2019; Zbl 1418.68225) Full Text: DOI arXiv
Bannister, Michael J.; Devanny, William E.; Dujmović, Vida; Eppstein, David; Wood, David R. Track layouts, layered path decompositions, and leveled planarity. (English) Zbl 1421.68105 Algorithmica 81, No. 4, 1561-1583 (2019). MSC: 68R10 05C10 68Q25 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Algorithmica 81, No. 4, 1561--1583 (2019; Zbl 1421.68105) Full Text: DOI arXiv
Biniaz, Ahmad; Bose, Prosenjit; Crosbie, Kimberly; De Carufel, Jean-Lou; Eppstein, David; Maheshwari, Anil; Smid, Michiel Maximum plane trees in multipartite geometric graphs. (English) Zbl 1422.68182 Algorithmica 81, No. 4, 1512-1534 (2019). MSC: 68R10 05C62 68U05 68W25 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Algorithmica 81, No. 4, 1512--1534 (2019; Zbl 1422.68182) Full Text: DOI
Barequet, Gill; Eppstein, David; Goodrich, Michael T.; Mamano, Nil Stable-matching Voronoi diagrams: combinatorial complexity and algorithms. (English) Zbl 1473.68200 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 89, 14 p. (2018). MSC: 68U05 68W05 90C27 PDFBibTeX XMLCite \textit{G. Barequet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 89, 14 p. (2018; Zbl 1473.68200) Full Text: DOI
Eppstein, David; Kurz, Denis \(k\)-best solutions of MSO problems on tree-decomposable graphs. (English) Zbl 1443.68127 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 16, 13 p. (2018). MSC: 68R10 03B70 05C85 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{D. Kurz}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 16, 13 p. (2018; Zbl 1443.68127) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T.; Mamano, Nil Reactive proximity data structures for graphs. (English) Zbl 1504.68046 Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 777-789 (2018). MSC: 68P05 68R10 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 10807, 777--789 (2018; Zbl 1504.68046) Full Text: DOI arXiv
Eppstein, David; Har-Peled, Sariel; Nivasch, Gabriel Grid peeling and the affine curve-shortening flow. (English) Zbl 1430.68368 Pagh, Rasmus (ed.) et al., Proceedings of the 20th workshop on algorithm engineering and experiments, ALENEX ’18, New Orleans, LA, January 7–8, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 109-116 (2018). MSC: 68U05 52C05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., in: Proceedings of the 20th workshop on algorithm engineering and experiments, ALENEX '18, New Orleans, LA, January 7--8, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 109--116 (2018; Zbl 1430.68368) Full Text: DOI arXiv
Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Löffler, Maarten; Nöllenburg, Martin Planar and poly-arc Lombardi drawings. (English) Zbl 1417.68237 J. Comput. Geom. 9, No. 1, 328-355 (2018). MSC: 68U05 05C10 68R10 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., J. Comput. Geom. 9, No. 1, 328--355 (2018; Zbl 1417.68237) Full Text: DOI
Abel, Zachary; Demaine, Erik D.; Demaine, Martin L.; Eppstein, David; Lubiw, Anna; Uehara, Ryuhei Flat foldings of plane graphs with prescribed angles and edge lengths. (English) Zbl 1417.68220 J. Comput. Geom. 9, No. 1, 74-93 (2018). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{Z. Abel} et al., J. Comput. Geom. 9, No. 1, 74--93 (2018; Zbl 1417.68220) Full Text: DOI arXiv
Biniaz, Ahmad; Bose, Prosenjit; Eppstein, David; Maheshwari, Anil; Morin, Pat; Smid, Michiel Spanning trees in multipartite geometric graphs. (English) Zbl 1410.68280 Algorithmica 80, No. 11, 3177-3191 (2018). MSC: 68R10 05C85 68U05 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Algorithmica 80, No. 11, 3177--3191 (2018; Zbl 1410.68280) Full Text: DOI arXiv
Aichholzer, Oswin; Biro, Michael; Demaine, Erik D.; Demaine, Martin L.; Eppstein, David; Fekete, Sándor P.; Hesterberg, Adam; Kostitsyna, Irina; Schmidt, Christiane Folding polyominoes into (poly)cubes. (English) Zbl 1403.05026 Int. J. Comput. Geom. Appl. 28, No. 3, 197-226 (2018). MSC: 05B50 68U05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Int. J. Comput. Geom. Appl. 28, No. 3, 197--226 (2018; Zbl 1403.05026) Full Text: DOI arXiv
Da Lozzo, Giordano; Eppstein, David; Goodrich, Michael T.; Gupta, Siddharth Subexponential-time and FPT algorithms for embedded flat clustered planarity. (English) Zbl 1517.68287 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 111-124 (2018). MSC: 68R10 68Q27 68W05 68W40 PDFBibTeX XMLCite \textit{G. Da Lozzo} et al., Lect. Notes Comput. Sci. 11159, 111--124 (2018; Zbl 1517.68287) Full Text: DOI arXiv
Cardinal, Jean; Demaine, Erik D.; Eppstein, David; Hearn, Robert A.; Winslow, Andrew Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect. (English) Zbl 1436.68132 Wang, Lusheng (ed.) et al., Computing and combinatorics. 24th international conference, COCOON 2018, Qing Dao, China, July 2–4, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10976, 365-377 (2018). MSC: 68Q25 68Q17 68R05 68R07 PDFBibTeX XMLCite \textit{J. Cardinal} et al., Lect. Notes Comput. Sci. 10976, 365--377 (2018; Zbl 1436.68132) Full Text: DOI arXiv
Eppstein, David (ed.) 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. (English) Zbl 1390.68019 LIPIcs – Leibniz International Proceedings in Informatics 101. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-068-2). vii, 33 articles, not consecutively paged, electronic only, open access (2018). MSC: 68-06 05-06 00B25 68Rxx 68Wxx 05Cxx PDFBibTeX XMLCite \textit{D. Eppstein} (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18--20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl -- Leibniz Zentrum für Informatik (2018; Zbl 1390.68019) Full Text: DOI Link
Eppstein, David; Hirschberg, Daniel S. From discrepancy to majority. (English) Zbl 1387.68174 Algorithmica 80, No. 4, 1278-1297 (2018). MSC: 68R05 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{D. S. Hirschberg}, Algorithmica 80, No. 4, 1278--1297 (2018; Zbl 1387.68174) Full Text: DOI arXiv
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1390.68498 Algorithmica 80, No. 3, 977-994 (2018). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Algorithmica 80, No. 3, 977--994 (2018; Zbl 1390.68498) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T.; Mamano, Nil Algorithms for stable matching and clustering in a grid. (English) Zbl 1486.68211 Brimkov, Valentin E. (ed.) et al., Combinatorial image analysis. 18th international workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19–21, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10256, 117-131 (2017). MSC: 68U05 62H30 68W40 91B68 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 10256, 117--131 (2017; Zbl 1486.68211) Full Text: DOI arXiv
Eppstein, David Maximizing the sum of radii of disjoint balls or disks. (English) Zbl 1393.68173 J. Comput. Geom. 8, No. 1, 316-339 (2017). MSC: 68U05 68R10 68W40 PDFBibTeX XMLCite \textit{D. Eppstein}, J. Comput. Geom. 8, No. 1, 316--339 (2017; Zbl 1393.68173) Full Text: DOI arXiv
Biniaz, Ahmad; Bose, Prosenjit; Crosbie, Kimberly; De Carufel, Jean-Lou; Eppstein, David; Maheshwari, Anil; Smid, Michiel 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). MSC: 68R10 68U05 68W25 68W40 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Lect. Notes Comput. Sci. 10389, 193--204 (2017; Zbl 1491.68137) Full Text: DOI
Eppstein, David; Goodrich, Michael T.; Lam, Jenny; Mamano, Nil; Mitzenmacher, Michael; Torres, Manuel Models and algorithms for graph watermarking. (English) Zbl 1397.68060 Bishop, Matt (ed.) et al., Information security. 19th international conference, ISC 2016, Honolulu, HI, USA, September 3–6, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-45870-0/pbk; 978-3-319-45871-7/ebook). Lecture Notes in Computer Science 9866, 283-301 (2016). MSC: 68P25 68R10 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 9866, 283--301 (2016; Zbl 1397.68060) Full Text: DOI arXiv
Eppstein, David Treetopes and their graphs. (English) Zbl 1410.68368 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 969-984 (2016). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 969--984 (2016; Zbl 1410.68368) Full Text: DOI arXiv
Buchin, Kevin; Eppstein, David; Löffler, Maarten; Nöllenburg, Martin; Silveira, Rodrigo Adjacency-preserving spatial treemaps. (English) Zbl 1405.68407 J. Comput. Geom. 7, No. 1, 100-122 (2016). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Buchin} et al., J. Comput. Geom. 7, No. 1, 100--122 (2016; Zbl 1405.68407) Full Text: DOI
Eppstein, David; Holten, Danny; Löffler, Maarten; Nöllenburg, Martin; Speckmann, Bettina; Verbeek, Kevin Strict confluent drawing. (English) Zbl 1405.68245 J. Comput. Geom. 7, No. 1, 22-46 (2016). MSC: 68R10 05C62 68Q25 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., J. Comput. Geom. 7, No. 1, 22--46 (2016; Zbl 1405.68245) Full Text: DOI arXiv
Bannister, Michael J.; Devanny, William E.; Dujmović, Vida; Eppstein, David; Wood, David R. Track layout is hard. (English) Zbl 1478.68214 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, 499-510 (2016). MSC: 68R10 05C10 68Q17 68Q27 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 9801, 499--510 (2016; Zbl 1478.68214) Full Text: DOI
Aronov, Boris; de Berg, Mark; Eppstein, David; Roeloffzen, Marcel; Speckmann, Bettina Distance-sensitive planar point location. (English) Zbl 1344.65023 Comput. Geom. 54, 17-31 (2016). Reviewer: Krzystof Gdawiec (Sosnowiec) MSC: 65D18 PDFBibTeX XMLCite \textit{B. Aronov} et al., Comput. Geom. 54, 17--31 (2016; Zbl 1344.65023) Full Text: DOI
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1383.68060 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 403-415 (2016). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 9644, 403--415 (2016; Zbl 1383.68060) Full Text: DOI arXiv
Eppstein, David; Hirschberg, Daniel S. From discrepancy to majority. (English) Zbl 1386.68112 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 390-402 (2016). MSC: 68R05 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{D. S. Hirschberg}, Lect. Notes Comput. Sci. 9644, 390--402 (2016; Zbl 1386.68112) Full Text: DOI
Demaine, Erik D.; Eppstein, David; Hesterberg, Adam; Ito, Hiro; Lubiw, Anna; Uehara, Ryuhei; Uno, Yushi Folding a paper strip to minimize thickness. (English) Zbl 1351.68298 J. Discrete Algorithms 36, 18-26 (2016). MSC: 68U05 52B70 68Q17 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., J. Discrete Algorithms 36, 18--26 (2016; Zbl 1351.68298) Full Text: DOI
Eppstein, David \(k\)-best enumeration. (English) Zbl 1409.68212 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 115, 20-43 (2015). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{D. Eppstein}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 115, 20--43 (2015; Zbl 1409.68212) Full Text: arXiv Link
Bokal, Drago; Cabello, Sergio; Eppstein, David Finding all maximal subsequences with hereditary properties. (English) Zbl 1378.68154 Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 240-254 (2015). MSC: 68U05 05C10 68Q25 PDFBibTeX XMLCite \textit{D. Bokal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 34, 240--254 (2015; Zbl 1378.68154) Full Text: DOI
Ballinger, Brad; Damian, Mirela; Eppstein, David; Flatland, Robin; Ginepro, Jessica; Hull, Thomas Minimum forcing sets for Miura folding patterns. (English) Zbl 1371.52012 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 136-147 (2015). MSC: 52B70 68U05 PDFBibTeX XMLCite \textit{B. Ballinger} et al., in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 136--147 (2015; Zbl 1371.52012) Full Text: DOI arXiv
Bannister, Michael J.; Brown, David A.; Eppstein, David Confluent orthogonal drawings of syntax diagrams. (English) Zbl 1471.68182 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, 260-271 (2015). MSC: 68R10 68Q42 68Q45 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 9411, 260--271 (2015; Zbl 1471.68182) Full Text: DOI arXiv
Dujmović, Vida; Eppstein, David; Wood, David R. Genus, treewidth, and local crossing number. (English) Zbl 1471.68192 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, 87-98 (2015). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Lect. Notes Comput. Sci. 9411, 87--98 (2015; Zbl 1471.68192) Full Text: DOI
Eppstein, David; van Kreveld, Marc; Speckmann, Bettina; Staals, Frank Improved grid map layout by point set matching. (English) Zbl 1343.68261 Int. J. Comput. Geom. Appl. 25, No. 2, Article ID 101 (2015). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Int. J. Comput. Geom. Appl. 25, No. 2, Article ID 101 (2015; Zbl 1343.68261) Full Text: DOI
Alam, Md. Jawaherul; Eppstein, David; Kaufmann, Michael; Kobourov, Stephen G.; Pupyrev, Sergey; Schulz, André; Ueckerdt, Torsten Contact graphs of circular arcs. (English) Zbl 1444.68131 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 1-13 (2015). MSC: 68R10 05C62 05C85 68Q17 68U05 PDFBibTeX XMLCite \textit{Md. J. Alam} et al., Lect. Notes Comput. Sci. 9214, 1--13 (2015; Zbl 1444.68131) Full Text: DOI
Brandes, Ulrik (ed.); Eppstein, David (ed.) Proceedings of the 17th workshop on algorithm engineering and experiments (ALENEX ’15), San Diego, CA, USA, January 5, 2015. (English) Zbl 1308.68016 Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-375-4/ebook). 187 p., electronic only (2015). MSC: 68-06 00B25 PDFBibTeX XMLCite \textit{U. Brandes} (ed.) and \textit{D. Eppstein} (ed.), Proceedings of the 17th workshop on algorithm engineering and experiments (ALENEX '15), San Diego, CA, USA, January 5, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (2015; Zbl 1308.68016) Full Text: DOI
Demaine, Erik D.; Eppstein, David; Hesterberg, Adam; Ito, Hiro; Lubiw, Anna; Uehara, Ryuhei; Uno, Yushi Folding a paper strip to minimize thickness. (English) Zbl 1350.68262 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-15611-8/pbk). Lecture Notes in Computer Science 8973, 113-124 (2015). MSC: 68U05 52B70 68Q17 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 8973, 113--124 (2015; Zbl 1350.68262) Full Text: DOI arXiv
Bannister, Michael J.; Devanny, William E.; Eppstein, David Small superpatterns for dominance drawing. (English) Zbl 1429.68169 Drmota, Michael (ed.) et al., Proceedings of the 11th workshop on analytic algorithmics and combinatorics (ANALCO ’14), Portland, OR, USA, January 6, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 92-103 (2014). MSC: 68R10 05A05 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., in: Proceedings of the 11th workshop on analytic algorithmics and combinatorics (ANALCO '14), Portland, OR, USA, January 6, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 92--103 (2014; Zbl 1429.68169) Full Text: DOI arXiv
Abel, Zachary; Demaine, Erik D.; Demaine, Martin L.; Eppstein, David; Lubiw, Anna; Uehara, Ryuhei Flat foldings of plane graphs with prescribed angles and edge lengths. (English) Zbl 1417.68219 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, 272-283 (2014). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{Z. Abel} et al., Lect. Notes Comput. Sci. 8871, 272--283 (2014; Zbl 1417.68219) Full Text: DOI
Bannister, Michael J.; Eppstein, David Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. (English) Zbl 1426.68199 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, 210-221 (2014). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{M. J. Bannister} and \textit{D. Eppstein}, Lect. Notes Comput. Sci. 8871, 210--221 (2014; Zbl 1426.68199) Full Text: DOI arXiv
Bannister, Michael J.; Devanny, William E.; Eppstein, David; Goodrich, Michael T. The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings. (English) Zbl 1426.68198 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, 149-161 (2014). MSC: 68R10 12F10 68Q25 68U05 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 8871, 149--161 (2014; Zbl 1426.68198) Full Text: DOI arXiv
Eppstein, David The graphs of planar soap bubbles. (English) Zbl 1305.68229 Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 27-36 (2013). MSC: 68U05 05C10 05C40 05C62 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, in: Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17--20, 2013. New York, NY: Association for Computing Machinery (ACM). 27--36 (2013; Zbl 1305.68229) Full Text: DOI arXiv
Barequet, Gill; Dickerson, Matthew; Eppstein, David; Hodorkovsky, David; Vyatkina, Kira On 2-site Voronoi diagrams under geometric distance functions. (English) Zbl 1280.68276 J. Comput. Sci. Technol. 28, No. 2, 267-277 (2013). MSC: 68U05 PDFBibTeX XMLCite \textit{G. Barequet} et al., J. Comput. Sci. Technol. 28, No. 2, 267--277 (2013; Zbl 1280.68276) Full Text: DOI arXiv
Eppstein, David Drawing arrangement graphs in small grids, or how to play planarity. (English) Zbl 1406.68074 Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 436-447 (2013). MSC: 68R10 05C85 52C30 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 8242, 436--447 (2013; Zbl 1406.68074) Full Text: DOI arXiv
Eppstein, David; Holten, Danny; Löffler, Maarten; Nöllenburg, Martin; Speckmann, Bettina; Verbeek, Kevin Strict confluent drawing. (English) Zbl 1405.68244 Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 352-363 (2013). MSC: 68R10 05C62 68Q25 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 8242, 352--363 (2013; Zbl 1405.68244) Full Text: DOI
Bannister, Michael J.; Eppstein, David; Simons, Joseph A. Fixed parameter tractability of crossing minimization of almost-trees. (English) Zbl 1406.68061 Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 340-351 (2013). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 8242, 340--351 (2013; Zbl 1406.68061) Full Text: DOI arXiv
Bannister, Michael J.; Cheng, Zhanpeng; Devanny, William E.; Eppstein, David Superpatterns and universal point sets. (English) Zbl 1406.68060 Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 208-219 (2013). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 8242, 208--219 (2013; Zbl 1406.68060) Full Text: DOI
Eppstein, David; Goodrich, Michael T.; Löffler, Maarten; Strash, Darren; Trott, Lowell Category-based routing in social networks: membership dimension and the small-world phenomenon. (English) Zbl 1278.91121 Theor. Comput. Sci. 514, 96-104 (2013). MSC: 91D30 05C82 68M10 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Theor. Comput. Sci. 514, 96--104 (2013; Zbl 1278.91121) Full Text: DOI arXiv Link
Eppstein, David; Goodrich, Michael T.; Hirschberg, Daniel S. Combinatorial pair testing: distinguishing workers from slackers. (English) Zbl 1390.68493 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, 316-327 (2013). MSC: 68R05 68W05 68W20 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 8037, 316--327 (2013; Zbl 1390.68493) Full Text: DOI arXiv
Bannister, Michael J.; Cabello, Sergio; Eppstein, David Parameterized complexity of 1-planarity. (English) Zbl 1390.68329 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, 97-108 (2013). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 8037, 97--108 (2013; Zbl 1390.68329) Full Text: DOI arXiv
Eppstein, David; Löffler, Maarten Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. (English) Zbl 1279.52022 Discrete Comput. Geom. 50, No. 1, 1-21 (2013). MSC: 52C45 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{M. Löffler}, Discrete Comput. Geom. 50, No. 1, 1--21 (2013; Zbl 1279.52022) Full Text: DOI
Falmagne, Jean-Claude (ed.); Albert, Dietrich (ed.); Doble, Christopher (ed.); Eppstein, David (ed.); Hu, Xiangen (ed.) Knowledge spaces. Applications in education. (English) Zbl 1276.68015 Berlin: Springer (ISBN 978-3-642-35328-4/hbk; 978-3-642-35329-1/ebook). xii, 354 p. (2013). MSC: 68-06 97-06 68T30 68P20 00B15 PDFBibTeX XMLCite \textit{J.-C. Falmagne} (ed.) et al., Knowledge spaces. Applications in education. Berlin: Springer (2013; Zbl 1276.68015) Full Text: DOI
Bannister, Michael J.; Eppstein, David; Goodrich, Michael T.; Trott, Lowell Force-directed graph drawing using social gravity and scaling. (English) Zbl 1377.68162 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 414-425 (2013). MSC: 68R10 05C82 05C85 68U05 PDFBibTeX XMLCite \textit{M. J. Bannister} et al., Lect. Notes Comput. Sci. 7704, 414--425 (2013; Zbl 1377.68162) Full Text: DOI arXiv
Brandenburg, Franz J.; Eppstein, David; Gleißner, Andreas; Goodrich, Michael T.; Hanauer, Kathrin; Reislhuber, Josef On the density of maximal 1-planar graphs. (English) Zbl 1377.68165 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 327-338 (2013). MSC: 68R10 05C62 PDFBibTeX XMLCite \textit{F. J. Brandenburg} et al., Lect. Notes Comput. Sci. 7704, 327--338 (2013; Zbl 1377.68165) Full Text: DOI
Eppstein, David Planar Lombardi drawings for subcubic graphs. (English) Zbl 1377.68173 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 126-137 (2013). MSC: 68R10 05C62 05C85 68U05 PDFBibTeX XMLCite \textit{D. Eppstein}, Lect. Notes Comput. Sci. 7704, 126--137 (2013; Zbl 1377.68173) Full Text: DOI arXiv
Bannister, Michael J.; Eppstein, David Randomized speedup of the Bellman-Ford algorithm. (English) Zbl 1429.68170 Hwang, Hsien-Kuei (ed.) et al., Proceedings of the 9th workshop on analytic algorithmics and combinatorics (ANALCO ’12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 41-47 (2012). MSC: 68R10 05C38 68W20 PDFBibTeX XMLCite \textit{M. J. Bannister} and \textit{D. Eppstein}, in: Proceedings of the 9th workshop on analytic algorithmics and combinatorics (ANALCO '12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 41--47 (2012; Zbl 1429.68170) Full Text: DOI arXiv
Eppstein, David; Spiro, Emma S. The \(h\)-index of a graph and its application to dynamic subgraph statistics. (English) Zbl 1254.68098 J. Graph Algorithms Appl. 16, No. 2, 543-567 (2012). MSC: 68P05 68R10 05C07 91D30 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{E. S. Spiro}, J. Graph Algorithms Appl. 16, No. 2, 543--567 (2012; Zbl 1254.68098) Full Text: DOI
Eppstein, David; Mumford, Elena; Speckmann, Bettina; Verbeek, Kevin Area-universal and constrained rectangular layouts. (English) Zbl 1251.68287 SIAM J. Comput. 41, No. 3, 537-564 (2012). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., SIAM J. Comput. 41, No. 3, 537--564 (2012; Zbl 1251.68287) Full Text: DOI
Eppstein, David; Goodrich, Michael T.; Strash, Darren; Trott, Lowell Extended dynamic subgraph statistics using \(h\)-index parameterized data structures. (English) Zbl 1246.68170 Theor. Comput. Sci. 447, 44-52 (2012). MSC: 68R10 05C85 68P05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Theor. Comput. Sci. 447, 44--52 (2012; Zbl 1246.68170) Full Text: DOI arXiv
Bannister, Michael J.; Eppstein, David Hardness of approximate compaction for nonplanar orthogonal graph drawings. (English) Zbl 1311.68103 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 367-378 (2012). MSC: 68R10 68Q17 68U05 PDFBibTeX XMLCite \textit{M. J. Bannister} and \textit{D. Eppstein}, Lect. Notes Comput. Sci. 7034, 367--378 (2012; Zbl 1311.68103) Full Text: DOI
Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Löffler, Maarten Planar and poly-arc Lombardi drawings. (English) Zbl 1311.68168 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 308-319 (2012). MSC: 68U05 05C10 68R10 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., Lect. Notes Comput. Sci. 7034, 308--319 (2012; Zbl 1311.68168) Full Text: DOI arXiv
Eppstein, David; Simons, Joseph A. Confluent Hasse diagrams. (English) Zbl 1311.68116 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 2-13 (2012). MSC: 68R10 05C20 05C62 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{J. A. Simons}, Lect. Notes Comput. Sci. 7034, 2--13 (2012; Zbl 1311.68116) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T. Succinct greedy geometric routing using hyperbolic geometry. (English) Zbl 1368.68122 IEEE Trans. Comput. 60, No. 11, 1571-1580 (2011). MSC: 68M20 51M10 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{M. T. Goodrich}, IEEE Trans. Comput. 60, No. 11, 1571--1580 (2011; Zbl 1368.68122) Full Text: DOI
Eppstein, David Optimally fast incremental Manhattan plane embedding and planar tight span construction. (English) Zbl 1404.68189 J. Comput. Geom. 2, No. 1, 144-182 (2011). MSC: 68U05 68P05 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, J. Comput. Geom. 2, No. 1, 144--182 (2011; Zbl 1404.68189)
Eppstein, David; Löffler, Maarten Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. (English) Zbl 1283.52033 Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13–15, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0682-9). 361-369 (2011). MSC: 52C45 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{M. Löffler}, in: Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13--15, 2011. New York, NY: Association for Computing Machinery (ACM). 361--369 (2011; Zbl 1283.52033) Full Text: DOI arXiv
Eppstein, David; Goodrich, Michael T.; Löffler, Maarten Tracking moving objects with few handovers. (English) Zbl 1342.68334 Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 362-373 (2011). MSC: 68U05 68Q17 68W20 68W27 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 6844, 362--373 (2011; Zbl 1342.68334) Full Text: DOI arXiv
Buchin, Kevin; Eppstein, David; Löffler, Maarten; Nöllenburg, Martin; Silveira, Rodrigo I. Adjacency-preserving spatial treemaps. (English) Zbl 1342.68330 Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 159-170 (2011). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{K. Buchin} et al., Lect. Notes Comput. Sci. 6844, 159--170 (2011; Zbl 1342.68330) Full Text: DOI Link
Eppstein, David; Löffler, Maarten; Mumford, Elena; Nöllenburg, Martin Optimal 3D angular resolution for low-degree graphs. (English) Zbl 1314.68228 Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 208-219 (2011). MSC: 68R10 05C62 68U05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 6502, 208--219 (2011; Zbl 1314.68228) Full Text: DOI
Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin Lombardi drawings of graphs. (English) Zbl 1314.68227 Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 195-207 (2011). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., Lect. Notes Comput. Sci. 6502, 195--207 (2011; Zbl 1314.68227) Full Text: DOI arXiv
Duncan, Christian A.; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Nöllenburg, Martin Drawing trees with perfect angular resolution and polynomial area. (English) Zbl 1311.68113 Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 183-194 (2011). MSC: 68R10 05C05 05C62 68U05 PDFBibTeX XMLCite \textit{C. A. Duncan} et al., Lect. Notes Comput. Sci. 6502, 183--194 (2011; Zbl 1311.68113) Full Text: DOI arXiv
Chambers, Erin W.; Eppstein, David; Goodrich, Michael T.; Löffler, Maarten Drawing graphs in the plane with a prescribed outer face and polynomial area. (English) Zbl 1314.68221 Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 129-140 (2011). MSC: 68R10 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{E. W. Chambers} et al., Lect. Notes Comput. Sci. 6502, 129--140 (2011; Zbl 1314.68221) Full Text: DOI arXiv
Eppstein, David Paired approximation problems and incompatible inapproximabilities. (English) Zbl 1288.68263 Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1076-1086 (2010). MSC: 68W25 68Q25 90C27 05C85 68R10 PDFBibTeX XMLCite \textit{D. Eppstein}, in: Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17--19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1076--1086 (2010; Zbl 1288.68263)