Andrew Winslow
Computer Science Postdoc
About
 I am a postdoc at ULB in the Algorithms and Computation group.
 My CV and resume, last updated September 18, 2014.
 In spring 2014 I finished my Ph.D. at Tufts, coadvised by Diane Souvaine and Erik Demaine.
Research
 My primary interests are algorithmic selfassembly and computational geometry.
 I am part of the VirtualGlass project.
 My coauthors are: Zachary Abel, Oswin Aichholzer, Greg Aloupis, Marwan AlJubeh, Arnon Amir, Gill Barequet, Kobus Barnard, Nadia Benbernou, Sarah Cannon, Remco Chang, David Charlton, Jordan Crouser, Erik Demaine, Martin Demaine, Vida Dujmović, Alon Efrat, Sarah Eisenstat, Quanfu Fan, Sándor Fekete, Eli FoxEpstein, Jeremy Freeman, Michael Hoffman, Ferran Hurtado, Benjamin Hescott, Mashhood Ishaque, Anna Lubiw, Caleb Malchik, PierreEtienne Meunier, Matthew Patitz, Günter Rote, André Schulz, Robert Schweller, Jack Snoeyink, Diane Souvaine, Scott Summers, Ranjini Swaminathan, Guillaume Theyssier, Godfried Toussaint, Csaba Tóth, Juhani Torkkola, Qiyam Tung, Raoul Veroy, Giovanni Viglietta, Damien Woods.
 A metaphorical description of my research in algorithmic selfassembly in the style of the wellknown xkcd up goer five comic.
Papers on Algorithmic SelfAssembly

Tight bounds for active selfassembly using an insertion primitive, with Caleb Malchik.
 to appear in Proceedings of European Symposium on Algorithms (ESA), 2014.
 A full version on arXiv.
 Slides of a talk at ESA 2014.
 One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile, with Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, and Damien Woods.
 SizeSeparable Tile SelfAssembly: A Tight Bound for Temperature1 MismatchFree Systems.
 Staged SelfAssembly and Polyomino ContextFree Grammars (Ph.D. thesis).
 The uptodate version with some revisions.
 The Tufts Computer Science Department Technical Report.
 Prerecorded video of my defense talk.
 Slides of my defense talk.
 Intrinsic Universality in Tile SelfAssembly Requires Cooperation, with PierreEtienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, and Damien Woods.
 Proceedings of the 25th Symposium on Discrete Algorithms (SODA), 752771, 2014.
 A full version on arXiv.
 Prerecorded video of a talk at SODA 2014.
 Slides of a talk at SODA 2014.
 Staged SelfAssembly and Polyomino ContextFree Grammars.
 D. Soloveichik and B. Yurke (eds.): DNA 19, LNCS 8141, 174188, 2013.
 to appear in Natural Computing, 2014.
 A full version on arXiv.
 Prerecorded video of a talk at DNA 19.
 Slides of a talk at DNA 19.
 Two Hands are Better than One (up to constant factors): SelfAssembly in the 2HAM vs. aTAM, with Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, and Scott M. Summers.
 N. Portier and T. Wilke (eds.): STACS 2013, LIPIcs 20, 172184, 2013.
 A full version on arXiv.
 Slides of a talk at Caltech on some of the results.
 OneDimensional Staged SelfAssembly, with Erik D. Demaine, Sarah Eisenstat, and Mashhood Ishaque.
 Natural Computing 12(2), 247258, 2013.
 L. Cardelli and W. Shih (eds.): DNA 17, LNCS 6937, 100114, 2011.
 Slides of a talk at DNA 17.
 Slides of my qualifying exams talk on the results.
Papers on Computational Geometry
 Covering Folded Shapes, with Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffman, Anna Lubiw, and Jack Snoeyink.
 Diffuse Reflection Radius in a Simple Polygon, with Eli FoxEpstein and Csaba D. Tóth.
 Diffuse Reflections in Simple Polygons, with Gill Barequet, Sarah M. Cannon, Eli FoxEpstein, Benjamin Hescott, Diane L. Souvaine, and Csaba D. Tóth.
 Algorithms for Designing Popup Cards, with Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Diane L. Souvaine, and Giovanni Viglietta.
 Inapproximability of the Smallest Superpolyomino Problem.
 22nd Fall Workshop on Computational Geometry (FWCG), College Park, Maryland, USA, 2012.
 A full version on arXiv.
 Slides of a talk at FWCG 2012.
 Hidden Mobile Guards in Simple Polygons, with Sarah Cannon and Diane L. Souvaine.
 Algorithms for Solving Rubik's Cubes, with Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, and Anna Lubiw.
 C. Demetrescu and M. M. Halldórsson (eds.): ESA 2011, LNCS 6942, 689700, 2011.
 A full version on arXiv.
 MIT News, Tufts Now, and New Scientist coverage.
 Open Guard Edges and Edge Guards in Simple Polygons, with Csaba Tóth and Godfried T. Toussaint.
 Convexifying Polygons while Maintaining Internal Visibility, with Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, and Diane L. Souvaine.
 Simultaneously Flippable Edges in Triangulations, with Diane L. Souvaine and Csaba Tóth.
 Face Guards for Art Galleries, with Diane L. Souvaine and Raoul Veroy.
 Constrained TriConnected Planar Straight Line Graphs, with Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth.
 BoundedDegree Polyhedronization of Point Sets, with Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, and Godfried T. Toussaint.
 Connecting Obstacles in VertexDisjoint Paths, with Marwan AlJubeh, Gill Barequet, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth.
Papers on Other Things
 Exploring AgentBased Simulations in Political Science Using Aggregate Temporal Graphs, with R. Jordan Crouser, Jeremy G. Freeman, and Remco Chang.
 Studying on the Move: Enriched Presentation Video for Mobile Devices, with Qiyam Tung, Quanfu Fan, Juhani Torkkola, Ranjini Swaminathan, Kobus Barnard, Arnon Amir, and Alon Efrat.
Fun
 Brewing and drinking Barismo coffee.
 Listening to Future Islands.
 Cycling on a Surly.
 Reading posts on the Theory of Computing Blog Aggregator.
Page last updated: