Articles with public access mandates - David EppsteinLearn more
Available somewhere: 53
Lombardi drawings of graphs
C Duncan, D Eppstein, M Goodrich, S Kobourov, M Nöllenburg
Journal of Graph Algorithms and Applications 16 (1), 85–108, 2012
Mandates: German Research Foundation
Structure of graphs with locally restricted crossings
V Dujmovic, D Eppstein, DR Wood
SIAM Journal on Discrete Mathematics 31 (2), 805-824, 2017
Mandates: US National Science Foundation, Australian Research Council, Natural …
Drawing trees with perfect angular resolution and polynomial area
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Discrete & Computational Geometry 49, 157-182, 2013
Mandates: German Research Foundation
Track layouts, layered path decompositions, and leveled planarity
MJ Bannister, WE Devanny, V Dujmović, D Eppstein, DR Wood
Algorithmica 81 (4), 1561–1583, 2019
Mandates: US National Science Foundation, Australian Research Council, Natural …
Crossing patterns in nonplanar road networks
D Eppstein, S Gupta
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances …, 2017
Mandates: US National Science Foundation
Adjacency-preserving spatial treemaps
K Buchin, D Eppstein, M Löffler, M Nöllenburg, RI Silveira
Journal of Computational Geometry 7 (1), 100–122, 2011
Mandates: German Research Foundation
2-3 cuckoo filters for faster triangle listing and set intersection
D Eppstein, MT Goodrich, M Mitzenmacher, MR Torres
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017
Mandates: US National Science Foundation, US Department of Defense
On the planar split thickness of graphs
D Eppstein, P Kindermann, S Kobourov, G Liotta, A Lubiw, A Maignan, ...
Algorithmica 80, 977-994, 2018
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Stack-number is not bounded by queue-number
V Dujmović, D Eppstein, R Hickingbotham, P Morin, DR Wood
Combinatorica 42, 151–164, 2022
Mandates: Australian Research Council, Natural Sciences and Engineering Research …
Strict Confluent Drawing.
D Eppstein, D Holten, M Löffler, M Nöllenburg, B Speckmann, K Verbeek
Journal of Computational Geometry 7 (1), 22–46, 2016
Mandates: US National Science Foundation, Netherlands Organisation for Scientific Research
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs
D Eppstein, VV Vazirani
SIAM J. Comput. 50 (3), 1014–1033, 2021
Mandates: US National Science Foundation
Parameterized leaf power recognition via embedding into graph products
D Eppstein, E Havvaei
Algorithmica 82 (8), 2337-2359, 2020
Mandates: US National Science Foundation
Contact graphs of circular arcs
MJ Alam, D Eppstein, M Kaufmann, SG Kobourov, S Pupyrev, A Schulz, ...
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
Mandates: German Research Foundation
Universal point sets for planar graph drawings with circular arcs
P Angelini, D Eppstein, F Frati, M Kaufmann, S Lazard, T Mchedlidze, ...
Journal of Graph Algorithms and Applications 18 (3), 313–324, 2014
Mandates: German Research Foundation
From discrepancy to majority
D Eppstein, DS Hirschberg
Algorithmica 80, 1278-1297, 2018
Mandates: US National Science Foundation
Subexponential-time and FPT algorithms for embedded flat clustered planarity
G Da Lozzo, D Eppstein, MT Goodrich, S Gupta
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
Mandates: US National Science Foundation, US Department of Defense, European …
Folding a paper strip to minimize thickness
ED Demaine, D Eppstein, A Hesterberg, H Ito, A Lubiw, R Uehara, Y Uno
Journal of Discrete Algorithms 36, 18–26, 2016
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Counting Polygon Triangulations is Hard
D Eppstein
Discrete Comput. Geom. 64 (4), 1210-1234, 2020
Mandates: US National Science Foundation
Reconfiguring undirected paths
ED Demaine, D Eppstein, A Hesterberg, K Jain, A Lubiw, R Uehara, ...
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
Mandates: US National Science Foundation
Spanning trees in multipartite geometric graphs
A Biniaz, P Bose, D Eppstein, A Maheshwari, P Morin, M Smid
Algorithmica 80, 3177-3191, 2018
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Publication and funding information is determined automatically by a computer program