Eppstein, David; Lincoln, Andrea; Williams, Virginia Vassilevska Quasipolynomiality of the smallest missing induced subgraph. (English) Zbl 1522.05313 J. Graph Algorithms Appl. 27, No. 5, 329-339 (2023). MSC: 05C60 05C85 05C10 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., J. Graph Algorithms Appl. 27, No. 5, 329--339 (2023; Zbl 1522.05313) Full Text: DOI arXiv
Dujmović, Vida; Eppstein, David; Hickingbotham, Robert; Morin, Pat; Wood, David R. Stack-number is not bounded by queue-number. (English) Zbl 1524.05076 Combinatorica 42, No. 2, 151-164 (2022). MSC: 05C10 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Combinatorica 42, No. 2, 151--164 (2022; Zbl 1524.05076) Full Text: DOI arXiv
Dujmović, Vida; Eppstein, David; Joret, Gwenaël; Morin, Pat; Wood, David R. Minor-closed graph classes with bounded layered pathwidth. (English) Zbl 1450.05086 SIAM J. Discrete Math. 34, No. 3, 1693-1709 (2020). MSC: 05C83 05C38 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 34, No. 3, 1693--1709 (2020; Zbl 1450.05086) Full Text: DOI arXiv
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
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
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
Dujmović, Vida; Eppstein, David; Wood, David R. Structure of graphs with locally restricted crossings. (English) Zbl 1362.05121 SIAM J. Discrete Math. 31, No. 2, 805-824 (2017). MSC: 05C83 05C62 05C10 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 31, No. 2, 805--824 (2017; Zbl 1362.05121) 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; 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. 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; Wortman, Kevin A. Minimum dilation stars. (English) Zbl 1130.05023 Comput. Geom. 37, No. 1, 27-37 (2007). MSC: 05C12 05C85 90B80 PDFBibTeX XMLCite \textit{D. Eppstein} and \textit{K. A. Wortman}, Comput. Geom. 37, No. 1, 27--37 (2007; Zbl 1130.05023) Full Text: DOI