Searching for authors named "Mark Keil" – sorted by Relevance.
-
Bridging the Digital Divide: The Story of the Free Internet Initiative in LaGrange, Georgia
- Bridging the Digital Divide: The Story of the Free Internet Initiative in LaGrange, Georgia Mark
- Cited by 2 (0 self) – Add To MetaCart
-
Computing The Visibility Polygons Of The Endpoints Of A Set Of Line Segments In Output Sensitive Time
- TIME 3 MARK KEIL y AND STEPHEN WISMATH z Abstract. Given a set S of n non-intersecting line
- Add To MetaCart
-
On the Time Bound for Convex Decomposition of Simple Polygons
- Company ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS MARK KEIL Department of Computer
- Cited by 19 (1 self) – Add To MetaCart
-
On the Time Bound for Convex Decomposition of Simple Polygons
- On the time bound for convex decomposition of simple polygons Mark Keil Department of Computer
- Add To MetaCart
-
On Computing Edges That Are In All Minimum-Weight Triangulations
- Vancouver patrice@(email omitted); Mark Keil CS U. Saskatchewan keil@(email omitted); Michael McAllister CS UBC
- Cited by 15 (0 self) – Add To MetaCart
-
Information Systems Project Continuation in Escalation Situations: A Real Options Model
- , IA, 50011, e-mail: tiwana@(email omitted); Mark Keil † Department of Computer Information Systems, J. Mack
- Add To MetaCart
-
Two Minimum Dominating Sets With Minimum Intersection In Chordal Graphs
- Two Minimum Dominating Sets With Minimum Intersection In Chordal Graphs Peter Eades Mark Keil
- Cited by 1 (0 self) – Add To MetaCart
-
Computing a (1 + ffl)-Approximate Geometric Minimum-Diameter Spanning Tree
- *, J. Mark Keil#, Sergei Bespamyatnikh##, Michael Segal$, Jack Snoeyink|| July 26, 2003 Abstract
- Add To MetaCart
-
Computing a (1+ɛ)-approximate geometric minimum-diameter spanning tree. Private communication
- . Mark Keil † , Sergei Bespamyatnikh ‡ , Michael Segal § , Jack Snoeyink ¶ July 26, 2003 Abstract Given a
- Cited by 1 (0 self) – Add To MetaCart

