CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil†

Source URL: www.cccg.ca

• Spanning tree
• Tree
• Planar separator theorem
• Steiner tree problem
• Graph theory
• Theoretical computer science
• Mathematics

Curriculum Vitae Stephen G. Kobourov Department of Computer Science University of Arizona, Tucson AZWeb: http://www.cs.arizona.edu/˜kobourov Email:

Source URL: www.cs.arizona.edu

• Topological graph theory
• Graph drawing
• NP-complete problems
• Geometric graph theory
• Graph embedding
• Planar graph
• Graph coloring
• Force-based algorithms
• Graph
• Graph theory
• Mathematics
• Theoretical computer science

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Parallel Morphing of Trees and Cycles∗ Therese Biedl† Anna Lubiw†

Source URL: www.cccg.ca

• Graph drawing
• Graph
• Planar graph
• Polyhedron
• Tree
• Graph theory
• Geometric graph theory
• Topological graph theory

Property Testing and Its Connection to Learning and Approximation ODED GOLDREICH Weizmann Institute of Science, Rehovot, Israel SHAFI GOLDWASSER

Source URL: www.cs.iastate.edu

• Graph coloring
• Aanderaa–Karp–Rosenberg conjecture
• Property testing
• Planar graph
• Clique
• Graph property
• Path decomposition
• Line graph
• Graph theory
• Mathematics
• Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Source URL: www.cccg.ca

• Mathematics
• Dominating set
• Unit disk graph
• Independent set
• APX
• Approximation algorithm
• Vertex cover
• Planar separator theorem
• Theoretical computer science
• Graph theory
• NP-complete problems

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Decontaminating planar regions by sweeping with barrier curves Borislav Karaivanov∗, Minko Markov†, Jack Snoeyink‡, Tzvetalin S. Vassilev§ Abstract

Source URL: www.cccg.ca

• Metric geometry
• Topology
• Euclidean plane geometry
• Simple polygon
• Circle
• Sweep line algorithm
• Canonical bundle
• Area
• Geometry
• Polygons
• Curves

Local Orthotropic，Planar Elasticity Computer Program一一一一一Lang．N。 Numano・O．Abe LOCAL ORTHOTROPIC， PLANAR ELAS TICITY COMPUTER PROGRAM

Source URL: dil-opac.bosai.go.jp

CCCG 2009, Vancouver, BC, August 17–19, 2009 Planar Packing of Diameter-Four Trees Fabrizio Frati Dipartimento di Informatica e Automazione, Universit`a Roma Tre, Italy

Source URL: cccg.ca

• B-tree
• Tree
• Rope
• R-tree
• AVL tree
• Tango tree
• Binary trees
• Graph theory
• Data management

Thematic Network – A European collaboration on development, quality assessment, and standardization of Particle Image Velocimetry for industrial applications Coordinator: Dr. Andreas Schröder Deutsches Zentrum für Lu

Source URL: pivnet.dlr.de

• Fluid mechanics
• Physics
• Particle image velocimetry
• Velocimetry
• Planar Doppler velocimetry
• Seeding
• Flow visualization
• Von Karman Institute for Fluid Dynamics
• Flow measurement
• Fluid dynamics
• Measurement
• Dynamics

Name: ID: ICS 163 — Graph Algorithms — Winter 1994 — Final

Source URL: www.ics.uci.edu

• Planar graphs
• Eulerian path
• Clique
• Tree
• Connectivity
• Graph
• Edge coloring
• Hamiltonian path
• Graph theory
• Graph coloring
• NP-complete problems