Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman

Source URL: www.computational-geometry.org

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Source URL: www.dcg.ethz.ch

• Graph theory
• Mathematics
• Network theory
• Routing algorithms
• Edsger W. Dijkstra
• Spanning tree
• Bipartite graphs
• Shortest path problem
• Tree
• Graph
• Geographic routing
• Routing

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Statistics
• Applied mathematics
• Data mining
• Search algorithms
• Approximation algorithms
• Discrete geometry
• Nearest neighbor search
• Numerical analysis
• Hierarchical clustering
• Cluster analysis
• K-means clustering

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Geometry
• Computer science
• Search algorithms
• Discrete geometry
• Computational geometry
• Mathematical optimization
• Closest pair of points problem
• Nearest neighbor search
• Nearest neighbor graph
• K-nearest neighbors algorithm
• Euclidean minimum spanning tree

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Source URL: www.cs.siu.edu

• NP-complete problems
• Theoretical computer science
• Analysis of algorithms
• Parameterized complexity
• Independent set
• Algorithm
• Kernelization
• Book:Graph Theory
• Book:Graph Algorithms

On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000

Source URL: www.ics.uci.edu

Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman

Source URL: computational-geometry.org

Parametric and Kinetic Minimum Spanning Trees Pankaj K. Agarwal  David Eppstein y Abstract

Source URL: www.cs.duke.edu

Spanning Trees and Spanners David Eppstein∗ Dept. Information and Computer Science University of California, Irvine, CAhttp://www.ics.uci.edu/∼eppstein/ Tech. Report 96-16

Source URL: www.cs.duke.edu

Deterministic Sampling and Range Counting in Geometric Data Streams Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, and Michael T. Goodrich School of Information and Computer Science, University of California, Irvine

Source URL: www.cs.duke.edu