Demaine - PDFSEARCH.IO - Document Search Engine

Demaine
Results: 226

#	Item
91	CCCG 2010, Winnipeg MB, August 9–11, 2010 Ghost Chimneys David Charlton∗† Erik D. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:15
92	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:59 Operations research Convex optimization Linear programming Regression analysis NP-complete problems 2-satisfiability Dynamic programming Mathematics Mathematical optimization Theoretical computer science
93	CCCG 2012, Charlottetown, P.E.I., August 8–10, 2012 Open Problems from CCCG 2011 Erik D. Demaine∗ The following is a description of the problems presented on August 10, 2011 at the open-problem session Add to Reading List Source URL: 2012.cccg.ca Language: English - Date: 2012-09-13 19:23:16 Differential geometry Polygons Differential topology Algebraic topology Geodesic Simple polygon Triangle Polygon triangulation Polygon Geometry Topology Triangulation
94	Tight Bounds for Dynamic Convex Hull Queries (Again) Erik D. Demaine Mihai Pˇatra¸scu Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2012-05-25 15:32:41 Van Leeuwen Mathematical analysis Geometry Mathematics Dynamic convex hull LG Corp Convex hull
95	CCCG 2010, Winnipeg MB, August 9–11, 2010 Any Monotone Boolean Function Can Be Realized by Interlocked Polygons Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:17 Mathematics 3D computer graphics Euclidean plane geometry Polygon Simple polygon Monotonic function Mathematical analysis Geometry Polygons
96	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
97	CCCG 2009, Vancouver, BC, August 17–19, 2009 Open Problems from CCCG 2008 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:31:48 Computational geometry Euclidean plane geometry Convex polytope Polygon Simple polygon Star-shaped polygon Convex hull Monotone polygon Geometry Polygons Triangulation
98	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:35 Polytopes Euclidean plane geometry Polyhedra Rectilinear polygon Vertex Polyhedron Simple polygon Steiner tree problem Dual polyhedron Geometry Graph theory Polygons
99	16th Canadian Conference on Computational Geometry, 2004 Continuous Foldability of Polygonal Paper Erik D. Demaine Satyan L. Devadoss Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Visual arts Recreational mathematics Origami Differential geometry Mathematics of paper folding Metric geometry Frenet–Serret formulas Curve Geodesic Geometry Mathematics Paper folding
100	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Open Problems from CCCG 2005 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:54 Discrete geometry Euclidean plane geometry Computational geometry NP-complete problems K-set 3SUM Pseudotriangle Planar graph Dominating set Graph theory Mathematics Geometry

UPDATE