Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Eppstein, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flat foldings of plane graphs with prescribed angles and edge lengths
Zachary Abel
,
Erik D. Demaine
,
Martin L. Demaine
,
David Eppstein
,
Anna Lubiw
,
Ryuhei Uehara
Lecture Notes in Computer Science
8871
, 2014, pp. 272-283
Balanced circle packings for planar graphs
Md. Jawaherul Alam
,
David Eppstein
,
Michael T. Goodrich
,
Stephen G. Kobourov
,
Sergey Pupyrev
Lecture Notes in Computer Science
8871
, 2014, pp. 125-136
The Galois complexity of graph drawing: Why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
Michael J. Bannister
,
William E. Devanny
,
David Eppstein
,
Michael T. Goodrich
Lecture Notes in Computer Science
8871
, 2014, pp. 149-161
Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Michael J. Bannister
,
David Eppstein
Lecture Notes in Computer Science
8871
, 2014, pp. 210-221
Planar induced subgraphs of sparse graphs
Glencora Borradaile
,
David Eppstein
,
Pingan Zhu
Lecture Notes in Computer Science
8871
, 2014, pp. 1-12
Linear-time algorithms for proportional apportionment
Zhanpeng Cheng
,
David Eppstein
Lecture Notes in Computer Science
8889
, 2014, pp. 581-592
Parameterized complexity of 1-planarity
Michael J. Bannister
,
Sergio Cabello
,
David Eppstein
Lecture Notes in Computer Science
8037
, 2013, pp. 97-108
Superpatterns and universal point sets
Michael J. Bannister
,
Zhanpeng Cheng
,
William E. Devanny
,
David Eppstein
Lecture Notes in Computer Science
8242
, 2013, pp. 208-219
Force-directed graph drawing using social gravity and scaling
Michael J. Bannister
,
David Eppstein
,
Michael T. Goodrich
,
Lowell Trott
Lecture Notes in Computer Science
7704
, 2013, pp. 414-425
Fixed parameter tractability of crossing minimization of almost-trees
Michael J. Bannister
,
David Eppstein
,
Joseph A. Simons
Lecture Notes in Computer Science
8242
, 2013, pp. 340-351
On the density of maximal 1-planar graphs
Franz J. Brandenburg
,
David Eppstein
,
Andreas Gleißner
,
Michael T. Goodrich
,
Kathrin Hanauer
,
Josef Reislhuber
Lecture Notes in Computer Science
7704
, 2013, pp. 327-338
Combinatorial pair testing: Distinguishing workers from slackers
David Eppstein
,
Michael T. Goodrich
,
Daniel S. Hirschberg
Lecture Notes in Computer Science
8037
, 2013, pp. 316-327
Category-based routing in social networks: Membership dimension and the small-world phenomenon
David Eppstein
,
Michael T. Goodrich
,
Maarten Löffler
,
Darren Strash
,
Lowell Trott
Theoretical Computer Science
514
, 2013, pp. 96-104
Strict confluent drawing
David Eppstein
,
Danny Holten
,
Maarten Löffler
,
Martin Nöllenburg
,
Bettina Speckmann
,
Kevin Verbeek
Lecture Notes in Computer Science
8242
, 2013, pp. 352-363
Planar Lombardi drawings for subcubic graphs
David Eppstein
Lecture Notes in Computer Science
7704
, 2013, pp. 126-137
Drawing arrangement graphs in small grids, or how to play planarity
David Eppstein
Lecture Notes in Computer Science
8242
, 2013, pp. 436-447
The graphs of planar soap bubbles
David Eppstein
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 27-36
Hardness of approximate compaction for nonplanar orthogonal graph drawings
Michael J. Bannister
,
David Eppstein
Lecture Notes in Computer Science
7034
, 2012, pp. 367-378
Planar and poly-arc Lombardi drawings
Christian A. Duncan
,
David Eppstein
,
Michael T. Goodrich
,
Stephen G. Kobourov
,
Maarten Löffler
Lecture Notes in Computer Science
7034
, 2012, pp. 308-319
Extended dynamic subgraph statistics using
h
-index parameterized data structures
David Eppstein
,
Michael T. Goodrich
,
Darren Strash
,
Lowell Trott
Theoretical Computer Science
447
, 2012, pp. 44-52
Area-universal and constrained rectangular layouts
David Eppstein
,
Elena Mumford
,
Bettina Speckmann
,
Kevin Verbeek
SIAM Journal on Computing
41
(3), 2012, pp. 537-564
Confluent Hasse diagrams
David Eppstein
,
Joseph A. Simons
Lecture Notes in Computer Science
7034
, 2012, pp. 2-13
Adjacency-preserving spatial treemaps
Kevin Buchin
,
David Eppstein
,
Maarten Löffler
,
Martin Nöllenburg
,
Rodrigo I. Silveira
Lecture Notes in Computer Science
6844
, 2011, pp. 159-170
Drawing graphs in the plane with a prescribed outer face and polynomial area
Erin W. Chambers
,
David Eppstein
,
Michael T. Goodrich
,
Maarten Löffler
Lecture Notes in Computer Science
6502
, 2011, pp. 129-140
Drawing trees with perfect angular resolution and polynomial area
Christian A. Duncan
,
David Eppstein
,
Michael T. Goodrich
,
Stephen G. Kobourov
,
Martin Nöllenburg
Lecture Notes in Computer Science
6502
, 2011, pp. 183-194
Seiten 1
2
3
4
5
6
7
>