Back to Results
First PageMeta Content
Tree / Directed acyclic graph / Planar graph / Degree / Path decomposition / Graph coloring / Graph theory / Graph / Vertex


CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Grid Proximity Graphs: LOGs, GIGs and GIRLs River Allen∗ Laurie Heyer†
Add to Reading List

Document Date: 2013-08-11 21:51:57

Open Document

File Size: 335,99 KB

Share Result on Facebook

City

Waterloo / /

Company

SIAM Journal / Cambridge University Press / MIT Press / Israel Journal / /

Country

United States / Canada / /

Currency

pence / /

/

Facility

University of Victoria / Davidson College / /

IndustryTerm

hill-climbing algorithm / output sensitive algorithm / polynomial time algorithm / simpler recursive algorithm / search space / /

Organization

Cambridge University / Davidson College / University of Victoria / Department of Computer Science / Mathematics Department / MIT / /

Person

Laurie J. Heyer / Jack Edmonds / Bradley Isom / Clifford Stein / Todd T. Eckdahl / Linnea Edlin / Andrew Lantz / Sue Whitesides / Ronald L. Rivest / Frank Ruskey / A. Malcolm Campbell / Laurie Heyer† Rahnuma Islam / Howard Trickey / Danny Dolev / E. Tucker Whitesides / Joshua Chester / Alexander Moore / Virginia Perkins / Tom Leighton / Charles E. Leiserson / Thomas H. Cormen / Gara Pruesse / Jonah GaleotaSprung / Erik D. Demaine / /

/

Position

Jeffrey L. Poet / /

ProvinceOrState

British Columbia / Ontario / Victoria / /

PublishedMedium

SIAM Journal on Computing / /

Technology

simpler recursive algorithm / hill-climbing algorithm / polynomial time algorithm / Geometric Folding Algorithms / /

SocialTag