dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

David Eppstein Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
368Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Solving Single-digit Sudoku Subproblems CoRR abs/1202.5074: (2012)
367Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012)
2011
366Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107
365Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph A. Simons: Confluent Hasse Diagrams. Graph Drawing 2011: 2-13
364Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-arc Lombardi Drawings. Graph Drawing 2011: 308-319
363Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Bannister, David Eppstein: Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. Graph Drawing 2011: 367-378
362Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Darren Strash: Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA 2011: 364-375
361Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese: What's the difference?: efficient set reconciliation without prior context. SIGCOMM 2011: 218-229
360Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler: Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. Symposium on Computational Geometry 2011: 361-369
359Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170
358Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. WADS 2011: 362-373
357Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Darren Strash: Listing All Maximal Cliques in Large Sparse Real-World Graphs CoRR abs/1103.0318: (2011)
356Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler: Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension CoRR abs/1103.2575: (2011)
355Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers CoRR abs/1105.0392: (2011)
354Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps CoRR abs/1105.0398: (2011)
353Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina: On 2-Site Voronoi Diagrams under Geometric Distance Functions CoRR abs/1105.4130: (2011)
352Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Pierre Baldi: Privacy-Enhanced Methods for Comparing Compressed DNA Sequences CoRR abs/1107.3593: (2011)
351Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) CoRR abs/1108.4675: (2011)
350Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Bannister, David Eppstein: Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings CoRR abs/1108.4705: (2011)
349Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph A. Simons: Confluent Hasse diagrams CoRR abs/1108.5361: (2011)
348Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-Arc Lombardi Drawings CoRR abs/1109.0345: (2011)
347Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) CoRR abs/1110.4499: (2011)
346Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael J. Bannister, David Eppstein: Randomized Speedup of the Bellman-Ford Algorithm CoRR abs/1111.5414: (2011)
345Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci Dimension of a Graph. Electr. J. Comb. 18(1): (2011)
344Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers 60(11): 1571-1580 (2011)
343Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. 23(2): 297-306 (2011)
342Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Emden R. Gansner: Guest Editor's Foreword. J. Graph Algorithms Appl. 15(1): 3-5 (2011)
341Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Recognizing Partial Cubes in Quadratic Time. J. Graph Algorithms Appl. 15(2): 269-293 (2011)
340Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Optimal Angular Resolution for Face-Symmetric Drawings. J. Graph Algorithms Appl. 15(4): 551-564 (2011)
339Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. JoCG 2(1): 144-182 (2011)
2010
338Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Emden R. Gansner: Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers Springer 2010
337Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Regular labelings and geometric structures. CCCG 2010: 125-130
336Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141
335Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn Augustine, David Eppstein, Kevin A. Wortman: Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. COCOON 2010: 90-99
334Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373
333Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22
332Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Graph Drawing 2010: 129-140
331Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Graph Drawing 2010: 183-194
330Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. Graph Drawing 2010: 195-207
329Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. Graph Drawing 2010: 208-219
328Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Regular Labelings and Geometric Structures. ISAAC (1) 2010: 1
327Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) 2010: 241-252
326Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414
325Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein, Kevin A. Wortman: Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22
324Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Paired Approximation Problems and Incompatible Inapproximabilities. SODA 2010: 1076-1086
323Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Steinitz theorems for orthogonal polyhedra. Symposium on Computational Geometry 2010: 429-438
322Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures CoRR abs/1006.1921: (2010)
321Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time CoRR abs/1006.5440: (2010)
320Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Regular Labelings and Geometric Structures CoRR abs/1007.0221: (2010)
319Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs CoRR abs/1007.1484: (2010)
318Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs CoRR abs/1009.0045: (2010)
317Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area CoRR abs/1009.0088: (2010)
316Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs CoRR abs/1009.0579: (2010)
315Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area CoRR abs/1009.0581: (2010)
314Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics CoRR abs/1009.0783: (2010)
313Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data CoRR abs/1009.1904: (2010)
312Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Densities of Minor-Closed Graph Families. Electr. J. Comb. 17(1): (2010)
311Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Happy Endings for Flip Graphs. JoCG 1(1): 3-28 (2010)
310Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010)
309Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Jürgen Bandelt, Victor Chepoi, David Eppstein: Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discrete Math. 24(4): 1399-1440 (2010)
308Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian: Questions answered. in theory.: http: //cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010)
2009
307Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Lowell Trott: Going off-road: transversal complexity in road networks. GIS 2009: 23-32
306Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Darren Strash: Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159
305Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Self-overlapping curves revisited. SODA 2009: 160-169
304Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek: Area-universal rectangular layouts. Symposium on Computational Geometry 2009: 267-276
303Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew T. Dickerson, David Eppstein: Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). Symposium on Computational Geometry 2009: 92-93
302Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS 2009: 242-253
301Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Orientation-Constrained Rectangular Layouts. WADS 2009: 266-277
300Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Emma S. Spiro: The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. WADS 2009: 278-289
299Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Optimal Embedding into Star Metrics. WADS 2009: 290-301
298Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Graph-Theoretic Solutions to Computational Geometry Problems. WG 2009: 1-16
297Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Testing bipartiteness of geometric intersection graphs. ACM Transactions on Algorithms 5(2): (2009)
296Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Transactions on Algorithms 5(3): (2009)
295Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: All maximal independent sets and dynamic dominance for sparse graphs. ACM Transactions on Algorithms 5(4): (2009)
294Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek: Area-Universal Rectangular Layouts CoRR abs/0901.3924: (2009)
293Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci dimension of a graph CoRR abs/0903.2507: (2009)
292Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Emma S. Spiro: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics CoRR abs/0904.3741: (2009)
291Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem CoRR abs/0904.3756: (2009)
290Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Orientation-Constrained Rectangular Layouts CoRR abs/0904.4312: (2009)
289Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Optimal Embedding Into Star Metrics CoRR abs/0905.0283: (2009)
288Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Optimal Angular Resolution for Face-Symmetric Drawings CoRR abs/0907.5474: (2009)
287Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Graph-Theoretic Solutions to Computational Geometry Problems CoRR abs/0908.3916: (2009)
286Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Optimally fast incremental Manhattan plane embedding and planar tight span construction CoRR abs/0909.1866: (2009)
285Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Paired approximation problems and incompatible inapproximabilities CoRR abs/0909.1870: (2009)
284Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Lowell Trott: Going Off-road: Transversal Complexity in Road Networks CoRR abs/0909.2891: (2009)
283Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Steinitz Theorems for Orthogonal Polyhedra CoRR abs/0912.0537: (2009)
282Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and switches, tunnels and bridges. Comput. Geom. 42(8): 790-802 (2009)
281Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPablo Diaz-Gutierrez, David Eppstein, Meenakshisundaram Gopi: Curvature Aware Fundamental Cycles. Comput. Graph. Forum 28(7): 2015-2024 (2009)
280Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding Large Clique Minors is Hard. J. Graph Algorithms Appl. 13(2): 197-204 (2009)
279Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quad meshes. The Visual Computer 25(8): 771-783 (2009)
2008
278no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jean-Claude Falmagne, Sergei Ovchinnikov: Media theory - interdisciplinary applied mathematics. Springer 2008: I-X, 1-328
277Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160
276Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16
275Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. Graph Drawing 2008: 14-25
274Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Isometric Diamond Subgraphs. Graph Drawing 2008: 384-389
273Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 2008: 78-89
272Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Recognizing partial cubes in quadratic time. SODA 2008: 1258-1266
271Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92
270Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Learning Sequences CoRR abs/0803.4030: (2008)
269Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra CoRR abs/0805.0022: (2008)
268Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane CoRR abs/0806.0341: (2008)
267Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Elena Mumford: Self-overlapping Curves Revisited CoRR abs/0806.1724: (2008)
266Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding Large Clique Minors is Hard CoRR abs/0807.0007: (2008)
265Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Isometric Diamond Subgraphs CoRR abs/0807.2218: (2008)
264Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Studying (Non-Planar) Road Networks Through an Algorithmic Lens CoRR abs/0808.3694: (2008)
263Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein, Kevin A. Wortman: Dilation, smoothed distance, and minimization diagrams of convex functions CoRR abs/0812.0607: (2008)
262Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings CoRR abs/0812.0893: (2008)
261Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008)
260Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jean-Claude Falmagne: Algorithms for media. Discrete Applied Mathematics 156(8): 1308-1320 (2008)
259Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jonathan Z. Sun: Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geometry Appl. 18(1/2): 131-160 (2008)
258Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Upright-Quad Drawing of st-Planar Learning Spaces. J. Graph Algorithms Appl. 12(1): 51-72 (2008)
2007
257Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. SODA 2007: 29-38
256Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard placement for efficient point-in-polygon proofs. Symposium on Computational Geometry 2007: 27-36
255Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Happy endings for flip graphs. Symposium on Computational Geometry 2007: 92-101
254Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS 2007: 637-648
253Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges. WADS 2007: 77-88
252Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Foreword to special issue on SODA 2002. ACM Transactions on Algorithms 3(1): (2007)
251Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms 3(2): (2007)
250Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007)
249Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jean-Claude Falmagne, Hasan Uzun: On Verifying and Engineering the Well-gradedness of a Union-closed Family CoRR abs/0704.2919: (2007)
248Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters CoRR abs/0704.3313: (2007)
247Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges CoRR abs/0705.0413: (2007)
246Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Recognizing Partial Cubes in Quadratic Time CoRR abs/0705.1025: (2007)
245Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing CoRR abs/0709.4087: (2007)
244Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Minimum dilation stars. Comput. Geom. 37(1): 27-37 (2007)
243Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007)
242Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLove Singhal, Elaheh Bozorgzadeh, David Eppstein: Interconnect Criticality-Driven Delay Relaxation. IEEE Trans. on CAD of Integrated Circuits and Systems 26(10): 1803-1817 (2007)
241Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The Traveling Salesman Problem for Cubic Graphs. J. Graph Algorithms Appl. 11(1): 61-81 (2007)
240Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36(5): 1360-1375 (2007)
2006
239Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Upright-Quad Drawing of st -Planar Learning Spaces. Graph Drawing 2006: 282-293
238Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing 2006: 294-305
237Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosiah Carlson, David Eppstein: Trees with Convex Faces and Optimal Angles. Graph Drawing 2006: 77-88
236Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPablo Diaz-Gutierrez, David Eppstein, M. Gopi: Single Triangle Strip and Loop on Manifolds with Boundaries. SIBGRAPI 2006: 221-228
235Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosiah Carlson, David Eppstein: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. SWAT 2006: 400-410
234Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Transactions on Algorithms 2(4): 492-509 (2006)
233Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn Augustine, David Eppstein, Kevin A. Wortman: Approximate Weighted Farthest Neighbors and Minimum Dilation Stars CoRR abs/cs/0602029: (2006)
232Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard Placement For Wireless Localization CoRR abs/cs/0603057: (2006)
231Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition CoRR abs/cs/0604034: (2006)
230Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Upright-Quad Drawing of st-Planar Learning Spaces CoRR abs/cs/0607094: (2006)
229Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosiah Carlson, David Eppstein: Trees with Convex Faces and Optimal Angles CoRR abs/cs/0607113: (2006)
228Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs via Color Space Embeddings CoRR abs/cs/0609033: (2006)
227Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Happy endings for flip graphs CoRR abs/cs/0610092: (2006)
226Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Cubic Partial Cubes from Simplicial Arrangements. Electr. J. Comb. 13(1): (2006)
225Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion. Theory Comput. Syst. 39(6): 903-928 (2006)
2005
224Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-Confluent Drawings. Graph Drawing 2005: 165-176
223Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76
222Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: All maximal independent sets and dynamic dominance for sparse graphs. SODA 2005: 451-459
221Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The skip quadtree: a simple dynamic data structure for multidimensional data. Symposium on Computational Geometry 2005: 296-305
220Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Minimum dilation stars. Symposium on Computational Geometry 2005: 321-326
219Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98
218Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosiah Carlson, David Eppstein: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems CoRR abs/cs/0503023: (2005)
217Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR abs/cs/0505048: (2005)
216Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data CoRR abs/cs/0507049: (2005)
215Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR abs/cs/0507050: (2005)
214Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings CoRR abs/cs/0507051: (2005)
213Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku CoRR abs/cs/0507053: (2005)
212Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-confluent Drawings CoRR abs/cs/0510024: (2005)
211Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Cubic Partial Cubes from Simplicial Arrangements CoRR abs/math/0510263: (2005)
210Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged dissection of polyominoes and polyforms. Comput. Geom. 31(3): 237-262 (2005)
209Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The lattice dimension of a graph. Eur. J. Comb. 26(5): 585-592 (2005)
208Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, David Eppstein: 3-coloring in time O(1.3289n). J. Algorithms 54(2): 168-204 (2005)
207Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9(1): 31-52 (2005)
206Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTony Givargis, David Eppstein: Memory reference caching for activity reduction on address buses. Microprocessors and Microsystems 29(4): 145-153 (2005)
2004
205no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean Cardinal, David Eppstein: Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119
204Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Algorithms for Drawing Media. Graph Drawing 2004: 173-183
203Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Graph Drawing 2004: 184-194
202Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Quasiconvex analysis of backtracking algorithms. SODA 2004: 788-797
201Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Testing bipartiteness of geometric intersection graphs. SODA 2004: 860-868
200Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The effect of faults on network expansion. SPAA 2004: 286-293
199Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. Symposium on Computational Geometry 2004: 144-151
198Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Stephen G. Kobourov: The geometric thickness of low degree graphs. Symposium on Computational Geometry 2004: 340-346
197Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, M. Gopi: Single-strip triangulation of manifolds with arbitrary topology. Symposium on Computational Geometry 2004: 455-456
196Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Kevin A. Wortman: Minimum Dilation Stars CoRR abs/cs/0412025: (2004)
195Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Quasiconvex Programming CoRR abs/cs/0412046: (2004)
194Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Gopi, David Eppstein: Single-Strip Triangulation of Manifolds with Arbitrary Topology CoRR cs.CG/0405036: (2004)
193Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion CoRR cs.DC/0404029: (2004)
192Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The lattice dimension of a graph CoRR cs.DS/0402028: (2004)
191Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Algorithms for Drawing Media CoRR cs.DS/0406020: (2004)
190Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs CoRR cs.DS/0407036: (2004)
189Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, John M. Sullivan, Alper Üngör: Tiling space and slabs with acute tetrahedra. Comput. Geom. 27(3): 237-255 (2004)
188Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Gopi, David Eppstein: Single-Strip Triangulation of Manifolds with Arbitrary Topology. Comput. Graph. Forum 23(3): 371-380 (2004)
187Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph Wang: Fast Approximation of Centrality. J. Graph Algorithms Appl. 8: 39-45 (2004)
2003
186Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing 2003: 1-12
185Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539
184Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Möbius-invariant natural neighbor interpolation. SODA 2003: 128-129
183Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic generators of topologically embedded graphs. SODA 2003: 599-608
182Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimized color gamuts for tiled displays. Symposium on Computational Geometry 2003: 274-281
181Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The Traveling Salesman Problem for Cubic Graphs. WADS 2003: 307-318
180Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, John M. Sullivan, Alper Üngör: Tiling space and slabs with acute tetrahedra CoRR cs.CG/0302027: (2003)
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Testing Bipartiteness of Geometric Intersection Graphs CoRR cs.CG/0307023: (2003)
178Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic Sampling and Range Counting in Geometric Data Streams CoRR cs.CG/0307027: (2003)
177Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian A. Duncan, David Eppstein, Stephen G. Kobourov: The Geometric Thickness of Low Degree Graphs CoRR cs.CG/0312056: (2003)
176Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The traveling salesman problem for cubic graphs CoRR cs.DS/0302030: (2003)
175Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Quasiconvex Analysis of Backtracking Algorithms CoRR cs.DS/0304018: (2003)
174Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003)
173Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Guest Editor's Foreword. Discrete & Computational Geometry 30(1): 1-2 (2003)
172Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl. 7(2): 131-140 (2003)
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Setting Parameters by Example. SIAM J. Comput. 32(3): 643-653 (2003)
2002
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA. ACM/SIAM 2002
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Separating Thickness from Geometric Thickness. Graph Drawing 2002: 150-161
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-unfoldings of simplicial manifolds. Symposium on Computational Geometry 2002: 237-243
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Marshall W. Bern, Brad L. Hutchings: Algorithms for Coloring Quadtrees. Algorithmica 32(1): 87-94 (2002)
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Moebius-Invariant Natural Neighbor Interpolation CoRR cs.CG/0207081: (2002)
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimized Color Gamuts for Tiled Displays CoRR cs.CG/0212007: (2002)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way CoRR cs.CG/0212046: (2002)
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph Wang: A steady state model for graph power laws CoRR cs.DM/0204001: (2002)
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jean-Claude Falmagne: Algorithms for Media CoRR cs.DS/0206033: (2002)
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic Generators of Topologically Embedded Graphs CoRR cs.DS/0207082: (2002)
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Separating Thickness from Geometric Thickness CoRR math.CO/0204252: (2002)
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Beta-skeletons have unbounded dilation. Comput. Geom. 23(1): 43-52 (2002)
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Multivariate Regression Depth. Discrete & Computational Geometry 28(1): 1-17 (2002)
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. Eng. Comput. (Lond.) 18(3): 173-187 (2002)
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, George S. Lueker: The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002)
2001
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph Wang: Fast approximation of centrality. SODA 2001: 228-229
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. SODA 2001: 329-337
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, S. Muthukrishnan: Internet packet filter management and rectangle geometry. SODA 2001: 827-835
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimization over Zonotopes and Training Support Vector Machines. WADS 2001: 111-121
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimal Möbius Transformations for Information Visualization and Meshing. WADS 2001: 14-25
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring. WADS 2001: 462-470
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimal Moebius Transformations for Information Visualization and Meshing CoRR cs.CG/0101006: (2001)
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Optimization Over Zonotopes and Training Support Vector Machines CoRR cs.CG/0105017: (2001)
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Hinged Kite Mirror Dissection CoRR cs.CG/0106032: (2001)
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Polyhedra CoRR cs.CG/0107023: (2001)
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes CoRR cs.CG/0108020: (2001)
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Manifolds CoRR cs.CG/0110054: (2001)
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, George S. Lueker: The Minimum Expectation Selection Problem CoRR cs.DS/0110011: (2001)
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Separating Geometric Thickness from Book Thickness CoRR math.CO/0109195: (2001)
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXianping Ge, David Eppstein, Padhraic Smyth: The distribution of loop lengths in graphical models for turbo decoding. IEEE Transactions on Information Theory 47(6): 2549-2553 (2001)
2000
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Multivariate regression depth. Symposium on Computational Geometry 2000: 315-321
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. ACM Journal of Experimental Algorithmics 5: 1 (2000)
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica 27(3): 275-291 (2000)
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Searching for Spaceships CoRR cs.AI/0004003: (2000)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, David Eppstein: Phutball Endgames are Hard CoRR cs.CC/0008025: (2000)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Computing the Depth of a Flat CoRR cs.CG/0009024: (2000)
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, S. Muthukrishnan: Internet Packet Filter Management and Rectangle Geometry CoRR cs.CG/0010018: (2000)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, David Eppstein: 3-Coloring in Time O(1.3289^n) CoRR cs.DS/0006046: (2000)
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joseph Wang: Fast Approximation of Centrality CoRR cs.DS/0009005: (2000)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction CoRR cs.DS/0009006: (2000)
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring CoRR cs.DS/0011009: (2000)
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristopher Moore, David Eppstein: One-Dimensional Peg Solitaire CoRR math.CO/0006067: (2000)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristopher Moore, David Eppstein: One-Dimensional Peg Solitaire, and Duotaire CoRR math.CO/0008172: (2000)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points. Discrete & Computational Geometry 23(3): 305-323 (2000)
126no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geometry Appl. 10(4): 347-360 (2000)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Incremental and Decremental Maintenance of Planar Width. J. Algorithms 37(2): 570-577 (2000)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000)
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Clustering for faster network simplex pivots. Networks 35(3): 173-180 (2000)
1999
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman: Hinged dissections of polyominoes and polyforms. CCCG 1999
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo: Ununfoldable polyhedra. CCCG 1999
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Setting Parameters by Example. FOCS 1999: 309-318
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, David Hart: Shortest Paths in an Arrangement with k Line Orientations. SODA 1999: 310-316
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Incremental and Decremental Maintenance of Planar Width. SODA 1999: 899-900
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged Dissection of Polyominoes and Polyforms CoRR cs.CG/9907018: (1999)
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Marshall W. Bern, Brad L. Hutchings: Algorithms for Coloring Quadtrees CoRR cs.CG/9907030: (1999)
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Beta-Skeletons have Unbounded Dilation CoRR cs.CG/9907031: (1999)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable Polyhedra with Convex Faces CoRR cs.CG/9908003: (1999)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Quadrilateral Meshing by Circle Packing CoRR cs.CG/9908016: (1999)
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin: Emerging Challenges in Computational Topology CoRR cs.CG/9909001: (1999)
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Multivariate Regression Depth CoRR cs.CG/9912013: (1999)
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXianping Ge, David Eppstein, Padhraic Smyth: The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding CoRR cs.DM/9907002: (1999)
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Setting Parameters by Example CoRR cs.DS/9907001: (1999)
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems CoRR cs.DS/9911003: (1999)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs CoRR cs.DS/9912014: (1999)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs CoRR math.CO/9910185: (1999)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Linear complexity hexahedral mesh generation. Comput. Geom. 12(1-2): 3-16 (1999)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete & Computational Geometry 22(4): 569-592 (1999)
103no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Shang-Hua Teng: Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geometry Appl. 9(6): 517-532 (1999)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. J. Algorithms 30(2): 302-322 (1999)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Giuseppe F. Italiano: PREFACE: Festschrift for Zvi Galil. J. Complexity 15(1): 1-3 (1999)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems. J. Graph Algorithms Appl. 3(3): (1999)
1998
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. Graph Drawing 1998: 101-110
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. SODA 1998: 619-628
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Symposium on Computational Geometry 1998: 58-67
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points CoRR cs.CG/9809037: (1998)
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Incremental and Decremental Maintenance of Planar Width CoRR cs.CG/9809038: (1998)
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing CoRR cs.CG/9809081: (1998)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Linear Complexity Hexahedral Mesh Generation CoRR cs.CG/9809109: (1998)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGill Barequet, Matthew Dickerson, David Eppstein: On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Geometric Lower Bounds for Parametric Matroid Optimization. Discrete & Computational Geometry 20(4): 463-476 (1998)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein: The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Graphical Models and Image Processing 60(2): 125-135 (1998)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. 28(1): 341-381 (1998)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding the k Shortest Paths. SIAM J. Comput. 28(2): 652-673 (1998)
1997
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Faster Construction of Planar Two-Centers. SODA 1997: 131-138
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. SODA 1997: 528-537
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, David Hart: An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. WADS 1997: 234-247
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Faster Geometric K-point MST Approximation. Comput. Geom. 8: 231-240 (1997)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic Connectivity in Digital Images. Inf. Process. Lett. 62(3): 121-126 (1997)
80no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Faster Circle Packing with Application to Non-Obtuse Triangulation. Int. J. Comput. Geometry Appl. 7(5): 485-492 (1997)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5): 669-696 (1997)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Minimum Range Balanced Cuts via Dynamic Subset Sums. J. Algorithms 23(2): 375-385 (1997)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Daniel S. Hirschberg: Choosing Subsets with Maximum Weighted Average. J. Algorithms 24(1): 177-193 (1997)
1996
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGill Barequet, Matthew Dickerson, David Eppstein: On Triangulating Three-Dimensional Polygons. Symposium on Computational Geometry 1996: 38-47
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Linear Complexity Hexahedral Mesh Generation. Symposium on Computational Geometry 1996: 58-67
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Dobkin, David Eppstein, Don P. Mitchell: Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. 15(4): 354-376 (1996)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Average Case Analysis of Dynamic Geometric Optimization. Comput. Geom. 6: 45-68 (1996)
71no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating center points with iterative Radon points. Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. 52(1): 3-27 (1996)
69no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996)
1995
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter: The Centroid of Points with Approximate Weights. ESA 1995: 460-472
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, David Eppstein: 3-Coloring in Time O(1.3446n): A No-MIS Algorithm. FOCS 1995: 444-452
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert: Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems. SODA 1995: 632-640
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Geometric lower bounds for parametric matroid optimization. STOC 1995: 662-671
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Asymptotic Speed-Ups in Constructive Solid Geometry. Algorithmica 13(5): 462-471 (1995)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew Dickerson, David Eppstein: Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5: 277-291 (1995)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. Discrete & Computational Geometry 13: 111-122 (1995)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, David Eppstein: 3-Coloring in time O(1.3446n): A no-MIS Algorithm Electronic Colloquium on Computational Complexity (ECCC) 2(33): (1995)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Gary L. Miller, Shang-Hua Teng: A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Inform. 22(4): 309-329 (1995)
58no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David P. Dobkin, David Eppstein: Triangulating polygons without large angles. Int. J. Comput. Geometry Appl. 5: 171-192 (1995)
1994
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding the k Shortest Paths FOCS 1994: 154-165
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Clustering for Faster Network Simplex Pivots. SODA 1994: 160-166
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Average Case Analysis of Dynamic Geometric Optimization. SODA 1994: 77-86
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman: Visibility with a Moving Point of View. Algorithmica 11(4): 360-378 (1994)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Approximating the Minimum Weight Steiner Triangulation. Discrete & Computational Geometry 11: 163-191 (1994)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. Discrete & Computational Geometry 11: 321-350 (1994)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Marshall W. Bern, David Eppstein: On the Number of Minimal 1-Steiner Trees. Discrete & Computational Geometry 12: 29-34 (1994)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Arboricity and Bipartite Subgraph Listing Algorithms. Inf. Process. Lett. 51(4): 207-211 (1994)
49no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Tree-weighted neighbors and geometric k smallest spanning trees. Int. J. Comput. Geometry Appl. 4(2): 229-238 (1994)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Offline Algorithms for Dynamic Minimum Spanning Tree Problems. J. Algorithms 17(2): 237-250 (1994)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, John R. Gilbert: Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994)
1993
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993: 64-73
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Worst-Case Bounds for Subadditive Geometric Graphs. Symposium on Computational Geometry 1993: 183-188
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Dobkin, David Eppstein: Computing the Discrepancy. Symposium on Computational Geometry 1993: 47-52
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating Center Points with Iterated Radon Points. Symposium on Computational Geometry 1993: 91-98
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Gary L. Miller, Shang-Hua Teng: A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Symposium on Computational Geometry 1993: 99-108
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, Shang-Hua Teng: Parallel Construction of Quadtrees and Quality Triangulations. WADS 1993: 188-199
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan: Edge Insertion for Optimal Triangulations. Discrete & Computational Geometry 10: 47-65 (1993)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993)
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Improved Bounds for Intersecting Triangles and Halving Planes. J. Comb. Theory, Ser. A 62(1): 176-182 (1993)
1992
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig: Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) FOCS 1992: 60-69
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, David Eppstein, Jirí Matousek: Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees FOCS 1992: 80-89
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan: Edge Insertion for Optional Triangulations. LATIN 1992: 46-60
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Approximating the Minimum Weight Triangulation. SODA 1992: 48-57
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: New Algorithms for Minimum Area k-gons. SODA 1992: 83-88
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David P. Dobkin, David Eppstein: Triangulating Polygons without Large Angles. Symposium on Computational Geometry 1992: 222-231
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding the k Smallest Spanning Trees. BIT 32(2): 237-248 (1992)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger: Finding Minimum Area k-gons. Discrete & Computational Geometry 7: 45-58 (1992)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic Three-Dimensional Linear Programming. INFORMS Journal on Computing 4(4): 360-368 (1992)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Parallel Recognition of Series-Parallel Graphs Inf. Comput. 98(1): 41-55 (1992)
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geometry Appl. 2(3): 241-255 (1992)
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Erratum: Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geometry Appl. 2(4): 449-450 (1992)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39(3): 546-567 (1992)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener: Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Mathematical Systems Theory 25(1): 23-36 (1992)
1991
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Dynamic Three-Dimensional Linear Programming FOCS 1991: 488-494
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, F. Frances Yao: The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung: Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA 1991: 158-167
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein: Polynomial-Size Nonobtuse Triangulation of Polygons. Symposium on Computational Geometry 1991: 342-350
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Offline Algorithms for Dynamic Minimum Spanning Tree Problems. WADS 1991: 392-399
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: The Farthest Point Delaunay Triangulation Minimizes Angles. Comput. Geom. 1: 143-148 (1991)
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, F. Frances Yao: The expected extremes in a Delaunay triangulation. Int. J. Comput. Geometry Appl. 1(1): 79-91 (1991)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Chrobak, David Eppstein: Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci. 86(2): 243-266 (1991)
1990
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David Eppstein, John R. Gilbert: Provably Good Mesh Generation FOCS 1990: 231-241
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman: Visibility with a Moving Point of View. SODA 1990: 107-117
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano: Sparse Dynamic Programming. SODA 1990: 513-522
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Finding the k Smallest Spanning Trees. SWAT 1990: 38-47
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Joan Feigenbaum, Chung-Lun Li: Equipartitions of graphs. Discrete Mathematics 91(3): 239-248 (1990)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Sequence Comparison with Mixed Convex and Concave Costs. J. Algorithms 11(1): 85-101 (1990)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Reset Sequences for Monotonic Automata. SIAM J. Comput. 19(3): 500-510 (1990)
1989
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil: Parallel Algorithmic Techniques for Combinatorial Computation. ICALP 1989: 304-318
1988
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein, Zvi Galil, Raffaele Giancarlo: Speeding up Dynamic Programming FOCS 1988: 488-496
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: Reset Sequences for Finite Automata with Application to Design of Parts Orienters. ICALP 1988: 230-238
1985
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Eppstein: A Heuristic Approach to Program Inversion. IJCAI 1985: 219-221

Coauthor Index

1Pankaj K. Agarwal [35] [99] [112]
2Nina Amenta [85] [89] [93] [95] [102] [112] [127]
3Lars Arge [215] [223]
4Boris Aronov [51]
5John Augustine [233] [335]
6Amitabha Bagchi [178] [193] [199] [200] [225] [251]
7Pierre Baldi [352]
8Hans-Jürgen Bandelt [309]
9Michael J. Bannister [346] [350] [363]
10Gill Barequet [75] [91] [269] [277] [353]
11Richard Beigel [60] [67] [133] [208]
12Marshall W. Bern [10] [12] [14] [17] [19] [25] [26] [31] [34] [39] [40] [44] [47] [51] [54] [58] [66] [68] [85] [89] [93] [95] [102] [103] [111] [112] [113] [114] [116] [121] [126] [127] [135] [140] [145] [148] [149] [151] [152] [157] [158] [165] [166] [167] [174] [182] [184]
13Ankur Bhargava [193] [200] [225]
14Elaheh Bozorgzadeh (Eli Bozorgzadeh) [242]
15Franz-Josef Brandenburg [185]
16Kevin Buchin [354] [359]
17Sergio Cabello [293] [345]
18Jean Cardinal [205]
19Josiah Carlson [218] [229] [235] [237]
20Erin W. Chambers [317] [319] [327] [332]
21Amitabh Chaudhary [178] [193] [199] [200] [225] [251]
22Victor Chepoi [309]
23L. Paul Chew [66] [112]
24Marek Chrobak [13] [18]
25Dave Clarke (David G. Clarke) [308]
26Kenneth L. Clarkson [42] [71]
27Erik D. Demaine [114] [117] [121] [122] [136] [144] [146] [168] [174] [210]
28Martin L. Demaine [117] [122] [136] [210]
29Tamal K. Dey [112]
30Pablo Diaz-Gutierrez [236] [281]
31Matthew Dickerson (Matthew T. Dickerson) [62] [75] [91] [164] [186] [207] [263] [303] [322] [325] [334] [353]
32Michael B. Dillencourt [98] [106] [124] [228] [238]
33David P. Dobkin [10] [31] [43] [54] [58] [73] [112]
34Wenliang Du [291] [302]
35Vida Dujmovic [243]
36Christian A. Duncan [177] [198] [315] [316] [330] [331] [348] [364] [367]
37Herbert Edelsbrunner [34] [39] [112]
38Jeff Erickson [46] [52] [96] [104] [144] [145] [146] [157] [168]
39Jean-Claude Falmagne [162] [249] [260] [278]
40Joan Feigenbaum [7]
41David Fernández-Baca [69] [76]
42Greg N. Frederickson [117] [210]
43Erich Friedman [117] [122] [210]
44Zvi Galil [3] [4] [9] [23] [24] [36] [45] [70] [79] [88]
45Emden R. Gansner [338] [342]
46Xianping Ge [110] [141]
47Kaveh Ghasemloo [308]
48Raffaele Giancarlo [3] [9] [23] [24]
49John R. Gilbert [12] [47]
50Tony Givargis [206]
51Michael T. Goodrich [164] [178] [185] [186] [199] [203] [207] [212] [214] [215] [216] [217] [219] [221] [223] [224] [228] [232] [238] [240] [248] [250] [251] [254] [256] [259] [261] [262] [264] [268] [269] [271] [275] [276] [277] [279] [284] [291] [302] [306] [307] [310] [313] [314] [315] [316] [317] [322] [330] [331] [332] [333] [334] [336] [343] [344] [347] [348] [351] [352] [355] [358] [361] [364] [366] [367]
52Meenakshisundaram Gopi (M. Gopi) [188] [194] [197] [236] [281]
53Cindy Grimm (Cindy M. Grimm) [112]
54Robert L. Grossman [10] [54]
55Leonidas J. Guibas [68] [99] [112]
56John Harer [112]
57David Hart [84] [119]
58George W. Hart [144] [146] [168]
59Joel Hass [112]
60Sandra Mitchell Hedetniemi (Sandra L. Mitchell) [34] [39]
61Lane A. Hemaspaandra (Lane A. Hemachandra) [21]
62Monika Rauch Henzinger (Monika Henzinger, Monika Rauch) [99]
63John Hershberger [68]
64Andrew Hicks [112]
65Daniel S. Hirschberg [77] [98] [106] [124] [217] [219] [240]
66David Hodorkovsky [353]
67Brad L. Hutchings [116] [167]
68Giuseppe F. Italiano [9] [11] [18] [22] [23] [24] [36] [38] [45] [70] [79] [88] [101]
69Carroll K. Johnson [112]
70Ethan Kim [261] [271] [279]
71Sandi Klavzar [293] [345]
72Stephen G. Kobourov [177] [185] [198] [315] [316] [330] [331] [348] [364] [367]
73Marc J. van Kreveld [247] [253] [282]
74Eric Kuo [114] [121] [174]
75Gilad Lerman [112]
76David Letscher [112]
77Chung-Lun Li [7]
78Giuseppe Liotta [185]
79Maarten Löffler [317] [318] [321] [326] [329] [332] [347] [348] [351] [354] [355] [356] [358] [359] [360] [364] [366]
80George S. Lueker [143] [156] [291] [302]
81Andrea Mantler [114] [174]
82Jirí Matousek [35]
83Jeremy Yu Meng [164] [186] [203] [207] [212] [214] [224] [250]
84Gary L. Miller [41] [42] [59] [71]
85Don P. Mitchell [73]
86Cristopher Moore [128] [129]
87Elena Mumford [247] [253] [267] [282] [283] [290] [294] [301] [304] [305] [318] [323] [329]
88S. Muthukrishnan (S. Muthu Muthukrishnan) [134] [153]
89Petra Mutzel [185]
90Amnon Nissenzweig [36] [79]
91Martin Nöllenburg [315] [316] [318] [329] [330] [331] [354] [359] [367]
92Joseph O'Rourke [144] [146] [168]
93Sergei Ovchinnikov [278]
94Mark H. Overmars [29]
95Mike Paterson [82]
96Paul E. Plassmann [112]
97Lev Reyzin [308]
98Günter Rote [29]
99Jim Ruppert [66]
100András Z. Salamon [308]
101Christian Scheideler [193] [200] [225]
102Eric Sedgwick [112]
103Peter W. Shor [308]
104Rodrigo I. Silveira [354] [359]
105Joseph A. Simons [349] [365]
106Love Singhal [242]
107Nodari Sitchinava [232] [256]
108Giora Slutzki [69] [76]
109Padhraic Smyth [110] [141]
110Jack Snoeyink [112] [114] [174]
111Bettina Speckmann [247] [253] [282] [294] [304]
112Thomas H. Spencer [45] [70] [88]
113Emma S. Spiro [292] [300]
114Aaron Sterling [308]
115Darren Strash [262] [306] [310] [314] [321] [326] [336] [347] [351] [357] [362] [366]
116Carl Sturtivant [42] [71]
117Matthew Suderman (Matthew J. Suderman) [243]
118John M. Sullivan [180] [189]
119Jonathan Z. Sun [216] [221] [259]
120Subhash Suri [68]
121Roberto Tamassia [11] [22] [38] [313] [333]
122Rasmus Tamstorf [261] [271] [279]
123Tiow Seng Tan [34] [39]
124Robert Endre Tarjan [11] [22] [38]
125Shang-Hua Teng [40] [41] [42] [59] [71] [95] [103] [127]
126James Tisdall [21]
127Lowell Trott [284] [307] [314] [336] [347] [351] [366]
128Alper Üngör [180] [189]
129Frank Uyeda [361]
130Hasan Uzun [249]
131George Varghese [361]
132Amir Vaxman [269] [277]
133Suresh Venkatasubramanian [308]
134Kevin Verbeek [294] [304]
135Kira Vyatkina [353]
136Joseph Wang [132] [155] [163] [187]
137Jeff Weeks [112]
138Jeffery Westbrook [11] [22] [38]
139Gerhard J. Woeginger [29]
140Jan Wolter [68]
141David R. Wood [243]
142Kevin A. Wortman [196] [220] [233] [244] [263] [288] [289] [299] [325] [335] [340]
143F. Frances Yao (Frances F. Yao, Foong Frances Yao) [14] [19] [82]
144Chee-Keng Yap (Chee Yap) [112]
145Bülent Yener [21]
146Moti Yung (Mordechai M. Yung) [11] [18] [22] [38]
147Denis Zorin [112]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page