×

Found 179 Documents (Results 1–100)

Newest Citations Relevance
Eppstein, David

On the biplanarity of blowups. (English) Zbl 07869491

Bekos, Michael A. (ed.) et al., Graph drawing and network visualization. 31st international symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023. Revised selected papers. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14465, 3-17 (2023).
MSC:  68R10 68U05
PDFBibTeX XMLCite
\textit{D. Eppstein}, Lect. Notes Comput. Sci. 14465, 3--17 (2023; Zbl 07869491)
Full Text: DOI arXiv
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; 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 05C10 68U05
PDFBibTeX XMLCite
\textit{T. Biedl} et al., Lect. Notes Comput. Sci. 11904, 468--481 (2019; Zbl 07266137)
Full Text: DOI arXiv
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; 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
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
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

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
Borradaile, Glencora; Eppstein, David; Nayyeri, Amir; Wulff-Nilsen, Christian

All-pairs minimum cuts in near-linear time for surface-embedded graphs. (English) Zbl 1387.05054

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 22, 16 p. (2016).
MSC:  05C10 05C22 05C85 68P05 68Q25
PDFBibTeX XMLCite
\textit{G. Borradaile} et al., LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 22, 16 p. (2016; Zbl 1387.05054)
Full Text: DOI arXiv
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
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 Link
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 Link
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.; 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
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.; 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
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
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; 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; Mumford, Elena

Steinitz theorems for orthogonal polyhedra. (English) Zbl 1284.68596

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 429-438 (2010).
MSC:  68U05 05C30 05C10 05C85
PDFBibTeX XMLCite
\textit{D. Eppstein} and \textit{E. Mumford}, in: Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13--16, 2010. New York, NY: Association for Computing Machinery (ACM). 429--438 (2010; Zbl 1284.68596)
Full Text: DOI arXiv
Dickerson, Matthew T.; Eppstein, David; Goodrich, Michael T.

Cloning Voronoi diagrams via retroactive data structures. (English) Zbl 1287.68173

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 362-373 (2010).
MSC:  68U05 68P05
PDFBibTeX XMLCite
\textit{M. T. Dickerson} et al., Lect. Notes Comput. Sci. 6346, 362--373 (2010; Zbl 1287.68173)
Full Text: DOI arXiv
Augustine, John; Eppstein, David; Wortman, Kevin A.

Approximate weighted farthest neighbors and minimum dilation stars. (English) Zbl 1286.68494

Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 90-99 (2010).
MSC:  68W25 68U05
PDFBibTeX XMLCite
\textit{J. Augustine} et al., Lect. Notes Comput. Sci. 6196, 90--99 (2010; Zbl 1286.68494)
Full Text: DOI arXiv
Eppstein, David (ed.); Gansner, Emden R. (ed.)

Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22–25, 2009. Revised papers. (English) Zbl 1185.68005

Lecture Notes in Computer Science 5849. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). xiv, 454 p. (2010).
MSC:  68-06 68R10 68U05 00B25
PDFBibTeX XMLCite
\textit{D. Eppstein} (ed.) and \textit{E. R. Gansner} (ed.), Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22--25, 2009. Revised papers. Berlin: Springer (2010; Zbl 1185.68005)
Full Text: DOI
Eppstein, David

Graph-theoretic solutions to computational geometry problems. (English) Zbl 1273.68391

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 1-16 (2010).
MSC:  68U05 68R10
PDFBibTeX XMLCite
\textit{D. Eppstein}, Lect. Notes Comput. Sci. 5911, 1--16 (2010; Zbl 1273.68391)
Full Text: DOI arXiv
Eppstein, David; Mumford, Elena

Self-overlapping curves revisited. (English) Zbl 1421.68172

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 160-169 (2009).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
\textit{D. Eppstein} and \textit{E. Mumford}, in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 160--169 (2009; Zbl 1421.68172)
Full Text: Link
Eppstein, David; Goodrich, Michael T.; Strash, Darren

Linear-time algorithms for geometric graphs with sublinearly many crossings. (English) Zbl 1421.68124

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 150-159 (2009).
MSC:  68R10 05C10 05C85 52C30 68U05 68W40
PDFBibTeX XMLCite
\textit{D. Eppstein} et al., in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 150--159 (2009; Zbl 1421.68124)
Full Text: Link
Eppstein, David; Mumford, Elena; Speckmann, Bettina; Verbeek, Kevin

Area-universal rectangular layouts. (English) Zbl 1380.68394

Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 267-276 (2009).
MSC:  68U05
PDFBibTeX XMLCite
\textit{D. Eppstein} et al., in: Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8--10, 2009. New York, NY: Association for Computing Machinery (ACM). 267--276 (2009; Zbl 1380.68394)
Full Text: DOI arXiv
Eppstein, David; Mumford, Elena

Orientation-constrained rectangular layouts. (English) Zbl 1253.68335

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 266-277 (2009).
MSC:  68U05
PDFBibTeX XMLCite
\textit{D. Eppstein} and \textit{E. Mumford}, Lect. Notes Comput. Sci. 5664, 266--277 (2009; Zbl 1253.68335)
Full Text: DOI arXiv
Eppstein, David

The topology of bendless three-dimensional orthogonal graph drawing. (English) Zbl 1213.05052

Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 78-89 (2009).
MSC:  05C10 05C62 05C85 68Q25 68U05
PDFBibTeX XMLCite
\textit{D. Eppstein}, Lect. Notes Comput. Sci. 5417, 78--89 (2009; Zbl 1213.05052)
Full Text: DOI
Eppstein, David; Goodrich, Michael T.

Succinct greedy graph drawing in the hyperbolic plane. (English) Zbl 1213.68444

Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 14-25 (2009).
MSC:  68R10 68U05 05C10 05C62 05C85
PDFBibTeX XMLCite
\textit{D. Eppstein} and \textit{M. T. Goodrich}, Lect. Notes Comput. Sci. 5417, 14--25 (2009; Zbl 1213.68444)
Full Text: DOI
Eppstein, David

Recognizing partial cubes in quadratic time. (English) Zbl 1192.05157

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 1258-1266 (2008).
MSC:  05C85 05C10 68U05
PDFBibTeX XMLCite
\textit{D. Eppstein}, in: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2008, San Francisco, CA, January 20--22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 1258--1266 (2008; Zbl 1192.05157)
Barequet, Gill; Eppstein, David; Goodrich, Michael T.; Vaxman, Amir

Straight skeletons of three-dimensional polyhedra. (English) Zbl 1158.68525

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 148-160 (2008).
MSC:  68U05
PDFBibTeX XMLCite
\textit{G. Barequet} et al., Lect. Notes Comput. Sci. 5193, 148--160 (2008; Zbl 1158.68525)
Full Text: DOI
Eppstein, David

Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. (English) Zbl 1302.68284

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 29-38 (2007).
MSC:  68U05 68W25
PDFBibTeX XMLCite
\textit{D. Eppstein}, in: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7--9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 29--38 (2007; Zbl 1302.68284)
Eppstein, David

Happy endings for flip graphs. (English) Zbl 1221.05292

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 92-101 (2007).
MSC:  05C85 05C75
PDFBibTeX XMLCite
\textit{D. Eppstein}, in: Proceedings of the 23rd annual symposium on computational geometry, SCG'07, Gyeongiu, South Korea, June 6--8, 2007. New York, NY: Association for Computing Machinery (ACM). 92--101 (2007; Zbl 1221.05292)
Full Text: DOI arXiv Link
Eppstein, David; Goodrich, Michael T.; Sitchinava, Nodari

Guard placement for efficient point-in-polygon proofs. (English) Zbl 1221.68267

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 27-36 (2007).
MSC:  68U05 52B55 65D18
PDFBibTeX XMLCite
\textit{D. Eppstein} et al., in: Proceedings of the 23rd annual symposium on computational geometry, SCG'07, Gyeongiu, South Korea, June 6--8, 2007. New York, NY: Association for Computing Machinery (ACM). 27--36 (2007; Zbl 1221.68267)
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software