Sue Whitesides

186 papers A* 8A 26B 13C 8Misc 5Journal 82Unranked 41

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	On 3-layered Cornerhedra: Optimum Box Partitions for Niches. CCCG Ulrike Stege, Sue Whitesides, Laurie J. Heyer, William J. Lenhart
2024	J	`jnl`	The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. J. Comb. Optim. Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2023	J	`jnl`	1-Complex J. Graph Algorithms Appl. Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2023	J	`jnl`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2023	J	`jnl`	Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs. Int. J. Found. Comput. Sci. Rahnuma Islam Nishat, Sue Whitesides
2022	B	`conf`	1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. WALCOM Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2022	J	`jnl`	Closed space-filling curves with controlled orientation for 3D printing. Comput. Graph. Forum A. Bedel, Yoann Coudert-Osmont, Jonàs Martínez, Rahnuma Islam Nishat, Sue Whitesides, Sylvain Lefebvre
2022	Misc	`conf`	The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. COCOON Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2022	J	`jnl`	The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. CoRR Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
2021	C	`conf`	Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. IWOCA Rahnuma Islam Nishat, Srinivasan Venkatesh, Sue Whitesides
2019	J	`jnl`	Kinetic Comput. Geom. Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
2019	B	`conf`	Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. WG Rahnuma Islam Nishat, Sue Whitesides
2018	J	`jnl`	Connecting a set of circles with minimum sum of radii. Comput. Geom. Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2018	J	`jnl`	Monotone Simultaneous Paths Embeddings in ℝ Discret. Math. Theor. Comput. Sci. David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath
2018	J	`jnl`	On the Planar Split Thickness of Graphs. Algorithmica David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2018	J	`jnl`	Visibility representations of boxes in 2.5 dimensions. Comput. Geom. Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2017	Misc	`conf`	Bend Complexity and Hamiltonian Cycles in Grid Graphs. COCOON Rahnuma Islam Nishat, Sue Whitesides
2017	B	`conf`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2017	J	`jnl`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2017	J	`jnl`	Connectivity Graphs of Uncertainty Regions. Algorithmica Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
2017	—	`conf`	Sliding Local Planners for Sampling-Based Path Planning. IRC S. M. Rayhan Rahman, Sue Whitesides
2016	C	`conf`	Constrained Light Deployment for Reducing Energy Consumption in Buildings. COCOA Huamei Tian, Kui Wu, Sue Whitesides, Cuiying Feng
2016	J	`jnl`	Monotone Simultaneous Embeddings of Paths in R^d. CoRR David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
2016	A	`conf`	Monotone Simultaneous Embeddings of Paths in d Dimensions. GD David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
2016	B	`conf`	On the Planar Split Thickness of Graphs. LATIN David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2016	A	`conf`	Visibility Representations of Boxes in 2.5 Dimensions. GD Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2016	J	`jnl`	Visibility Representations of Boxes in 2.5 Dimensions. CoRR Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2015	J	`jnl`	A simple, faster method for kinetic proximity problems. Comput. Geom. Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei
2015	J	`jnl`	Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis, Sue Whitesides
2015	—	`conf`	Open Problems from CCCG 2014. CCCG Sue Whitesides
2015	—	`conf`	Reconfiguring a Chain of Cubes. CCCG Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides
2014	C	`conf`	(Reverse) MIG Zahed Rahmati, Valerie King, Sue Whitesides
2014	J	`jnl`	Computing k-Regret Minimizing Sets. Proc. VLDB Endow. Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides
2014	J	`jnl`	Kinetic $k$-Semi-Yao Graph and its Applications. CoRR Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
2014	—	`conf`	Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. CCCG Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
2014	J	`jnl`	Kinetic Reverse $k$-Nearest Neighbor Problem. CoRR Zahed Rahmati, Valerie King, Sue Whitesides
2014	C	`conf`	Kinetic Reverse k-Nearest Neighbor Problem. IWOCA Zahed Rahmati, Valerie King, Sue Whitesides
2014	—	`conf`	The Range Beacon Placement Problem for Robot Navigation. CRV River Allen, Neil Macmillan, Dimitri Marinakis, Rahnuma Islam Nishat, Rayhan Rahman, Sue Whitesides
2013	J	`jnl`	A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides
2013	J	`jnl`	A Simple, Faster Method for Kinetic Proximity Problems. CoRR Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei
2013	J	`jnl`	Acyclic coloring with few division vertices. J. Discrete Algorithms Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2013	—	`conf`	Grid Proximity Graphs: LOGs, GIGs and GIRLs. CCCG River Allen, Laurie J. Heyer, Rahnuma Islam Nishat, Sue Whitesides
2013	—	`conf`	Indexing Reverse Top-k Queries in Two Dimensions. DASFAA (1) Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides
2013	—	`conf`	Kinetic Data Structures on The Move. CCCG Sue Whitesides
2013	A*	`conf`	Kinetic data structures for all nearest neighbors and closest pair in the plane. SoCG Zahed Rahmati, Valerie King, Sue Whitesides
2013	—	`conf`	Map Folding. CCCG Rahnuma Islam Nishat, Sue Whitesides
2012	C	`conf`	Acyclic Coloring with Few Division Vertices. IWOCA Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2012	J	`jnl`	Acyclic colorings of graph subdivisions revisited. J. Discrete Algorithms Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman
2012	J	`jnl`	Computing optimal k-regret minimizing sets with top-k depth contours CoRR Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides
2012	J	`jnl`	Indexing Reverse Top-k Queries CoRR Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides
2012	A	`conf`	Kinetic and Stationary Point-Set Embeddability for Plane Graphs. GD Zahed Rahmati, Sue Whitesides, Valerie King
2012	J	`jnl`	Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks. IEEE Trans. Wirel. Commun. Dimitri Marinakis, Kui Wu, Ning Ye, Sue Whitesides
2012	A	`conf`	On Representing Graphs by Touching Cuboids. GD David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides
2012	B	`conf`	On Three-Dimensional Graph Drawing and Embedding. WALCOM Sue Whitesides
2012	—	`ed.`	Proceedings of the 28th ACM Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012 SCG Tamal K. Dey, Sue Whitesides
2012	J	`jnl`	The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2011	—	`conf`	A Note on Minimum-Segment Drawings of Planar Graphs. CCCG Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides
2011	C	`conf`	Acyclic Colorings of Graph Subdivisions. IWOCA Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman
2011	—	`conf`	Approximating the Medial Axis by Shooting Rays: 3D Case. CCCG Svetlana Stolpner, Kaleem Siddiqi, Sue Whitesides
2011	J	`jnl`	Connecting a Set of Circles with Minimum Sum of Radii CoRR Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2011	B	`conf`	Connecting a Set of Circles with Minimum Sum of Radii. WADS Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2011	A	`conf`	Embedding Plane 3-Trees in ℝ2 and ℝ3. GD Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2011	—	`conf`	Indexing for Vector Projections. DASFAA (2) Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides
2011	—	`conf`	Range-based Navigation System for a Mobile Robot. CRV Neil Macmillan, River Allen, Dimitri Marinakis, Sue Whitesides
2011	J	`jnl`	Sampled medial loci for 3D shape representation. Comput. Vis. Image Underst. Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
2011	A*	`conf`	Simultaneous localization and environmental mapping with a sensor network. ICRA Dimitri Marinakis, Neil Macmillan, River Allen, Sue Whitesides
2011	B	`conf`	Stochastic Scheduling for Underwater Sensor Networks. Networking (1) Dimitri Marinakis, Kui Wu, Sue Whitesides
2010	J	`jnl`	A Succinct 3D Visibility Skeleton. Discret. Math. Algorithms Appl. Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang
2010	—	`conf`	Collaborative problem solving: integrating theory and practice in the classroom. WCCCE Mantis Cheng, Erin Delisle, Alejandro Erickson, Sudhakar Ganti, Fieran Mason, Nicholas Vining, Sue Whitesides
2010	—	`conf`	Connectivity Graphs of Uncertainty Regions. ISAAC (2) Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
2010	J	`jnl`	Connectivity graphs of uncertainty regions CoRR Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
2010	B	`conf`	Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2010	Misc	`conf`	On the Computation of 3D Visibility Skeletons. COCOON Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang
2010	—	`conf`	The Sentinel Problem for a Multi-hop Sensor Network. CRV Dimitri Marinakis, Sue Whitesides
2009	J	`jnl`	Abstract Milling with Turn Costs CoRR Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009	J	`jnl`	Depth potential function for folding pattern representation, registration and analysis. Medical Image Anal. Maxime Boucher, Sue Whitesides, Alan C. Evans
2009	C	`conf`	Intractability in Graph Drawing and Geometry: FPT Approaches. IWOCA Sue Whitesides
2009	—	`conf`	Medial Axis Approximation with Bounded Error. ISVD Svetlana Stolpner, Sue Whitesides
2009	—	`conf`	Sampled medial loci and boundary differential geometry. ICCV Workshops Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
2008	A	`conf`	Embeddability Problems for Upward Planar Digraphs. GD Francesco Giordano, Giuseppe Liotta, Sue Whitesides
2008	J	`jnl`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2008	J	`jnl`	On the Parameterized Complexity of Layered Graph Drawing. Algorithmica Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008	A	`conf`	On the Size of the 3D Visibility Skeleton: Experimental Results. ESA Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
2008	J	`jnl`	Parameterized Complexity of Geometric Problems. Comput. J. Panos Giannopoulos, Christian Knauer, Sue Whitesides
2008	J	`jnl`	Realizing partitions respecting full and partial order information. J. Discrete Algorithms Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
2007	A*	`conf`	A Discrete Differential Operator for Direction-based Surface Morphometry. ICCV Maxime Boucher, Sue Whitesides, Oliver Lyttleton, Alan C. Evans
2007	—	`conf`	A Note on Drawing Direction-constrained Paths in 3D. CCCG Ethan Kim, Sue Whitesides, Giuseppe Liotta
2007	J	`jnl`	Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2007	J	`jnl`	Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geom. Appl. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath
2007	—	`conf`	On Bus Graph Realizability. CCCG Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu
2007	J	`jnl`	Randomized Algorithms for Minimum Distance Localization. Int. J. Robotics Res. Malvika Rao, Gregory Dudek, Sue Whitesides
2007	—	`conf`	Towards an implementation of the 3D visibility skeleton. SCG Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
2006	J	`jnl`	A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2006	—	`book`	Discrete mathematics for computer science. Gary Haggard, John S. Schlipf, Sue Whitesides
2006	J	`jnl`	On Bus Graph Realizability CoRR Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu
2006	—	`conf`	On Computing Shortest External Watchman Routes for Convex Polygons. CCCG Rafa Absar, Sue Whitesides
2006	J	`jnl`	The strength of weak proximity. J. Discrete Algorithms Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
2005	A	`conf`	05191 Open Problem Session Report. Graph Drawing Sue Whitesides
2005	J	`jnl`	Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. J. Graph Algorithms Appl. Matthew Suderman, Sue Whitesides
2005	—	`conf`	Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath
2005	A*	`conf`	Minimum Distance Localization for a Robot with Limited Visibility. ICRA Malvika Rao, Gregory Dudek, Sue Whitesides
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2005	J	`jnl`	Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2004	J	`jnl`	An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica Vida Dujmovic, Sue Whitesides
2004	A	`conf`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2004	C	`conf`	Randomized Algorithms for Minimum Distance Localization. WAFR Malvika Rao, Gregory Dudek, Sue Whitesides
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	A	`conf`	The Three Dimensional Logic Engine. GD Matthew Kitching, Sue Whitesides
2004	—	`conf`	The number of lines tangent to arbitrary convex polyhedra in 3D. SCG Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2004	J	`jnl`	Tuning and comparing spatial normalization methods. Medical Image Anal. Steven M. Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides
2003	B	`conf`	A complete and effective move set for simplified protein folding. RECOMB Neal Lesh, Michael Mitzenmacher, Sue Whitesides
2003	A	`conf`	Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. GD Matthew Suderman, Sue Whitesides
2003	—	`conf`	On the Reliability of Triangle Intersection in 3D. ICCSA (3) Steven M. Robbins, Sue Whitesides
2003	A	`conf`	Rectangle Visibility Graphs: Characterization, Construction, and Compaction. STACS Ileana Streinu, Sue Whitesides
2003	—	`conf`	The complexity of (un)folding. SCG Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
2003	J	`jnl`	The number of transversals to line segments in R^3 CoRR Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2003	—	`conf`	Transversals to line segments in R CCCG Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2003	—	`conf`	Tuning and Comparing Spatial Normalization Methods. MICCAI (2) Steven M. Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides
2002	J	`jnl`	A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
2002	A	`conf`	An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. GD Vida Dujmovic, Sue Whitesides
2002	J	`jnl`	Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
2002	J	`jnl`	Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2002	—	`conf`	On the number of lines tangent to four convex polyhedra. CCCG Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
2001	A	`conf`	A Fixed-Parameter Approach to Two-Layer Planarization. GD Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2001	B	`conf`	Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. ISAAC Sue Whitesides
2001	J	`jnl`	Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
2001	A	`conf`	On the Parameterized Complexity of Layered Graph Drawing. ESA Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2001	A*	`conf`	On validating planar worlds. SODA Vida Dujmovic, Sue Whitesides
2000	Misc	`conf`	Embedding Problems for Paths with Direction Constrained Edges. COCOON Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2000	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Giuseppe Liotta, Sue Whitesides
2000	A	`conf`	Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2000	J	`jnl`	Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. Peter Eades, Antonios Symvonis, Sue Whitesides
1999	J	`jnl`	Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1999	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1999	A*	`conf`	Locked and Unlocked Polygonal Chains in 3D. SODA Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1999	J	`jnl`	On Reconfiguring Tree Linkages: Trees can Lock CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	J	`jnl`	A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle
1998	—	`conf`	Convexifying star-shaped polygons. CCCG Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
1998	—	`conf`	Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
1998	A	`ed.`	Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings GD Sue Whitesides
1998	A	`conf`	Graph Multidrawing: Finding Nice Drawings Without Defining Nice. GD Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides
1998	J	`jnl`	Localizing a Robot with Minimum Travel. SIAM J. Comput. Gregory Dudek, Kathleen Romanik, Sue Whitesides
1998	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	—	`conf`	On reconfiguring tree linkages: Trees can lock. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	J	`jnl`	The largest k-ball in a d-dimensional box. Comput. Geom. Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
1998	J	`jnl`	The rectangle of influence drawability problem. Comput. Geom. Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
1998	—	`conf`	Unfolding some classes of orthogonal polyhedra. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
1998	J	`jnl`	Universal 3-dimensional visibility representations for graphs. Comput. Geom. Helmut Alt, Michael Godau, Sue Whitesides
1997	—	`conf`	On folding rulers in regular polygons. CCCG Naixun Pei, Sue Whitesides
1997	A	`conf`	Orthogonal 3-D Graph Drawing. GD Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1997	A	`conf`	The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. GD Sándor P. Fekete, Michael E. Houle, Sue Whitesides
1996	J	`jnl`	Folding Rulers Inside Triangles. Discret. Comput. Geom. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
1996	—	`conf`	On the Reachable Regions of Chains. CCCG Naixun Pei, Sue Whitesides
1996	Misc	`conf`	On the Reconfiguration of Chains (Extended Abstract). COCOON Sue Whitesides, Naixun Pei
1996	—	`ed.`	Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996 SCG Sue Whitesides
1996	J	`jnl`	The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. Peter Eades, Sue Whitesides
1996	J	`jnl`	The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica Peter Eades, Sue Whitesides
1996	J	`jnl`	The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. Peter Eades, Charles Stirk, Sue Whitesides
1996	A	`conf`	Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD Peter Eades, Antonios Symvonis, Sue Whitesides
1995	A*	`conf`	Localizing a Robot with Minimum Travel. SODA Gregory Dudek, Kathleen Romanik, Sue Whitesides
1995	B	`conf`	Nearest Neighbour Graph Realizability is NP-hard. LATIN Peter Eades, Sue Whitesides
1995	A	`conf`	New Results on a Visibility Representation of Graphs in 3D. GD Sándor P. Fekete, Michael E. Houle, Sue Whitesides
1995	J	`jnl`	Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discret. Comput. Geom. William J. Lenhart, Sue Whitesides
1995	A	`conf`	The Strength of Weak Proximity. GD Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
1995	A	`conf`	Universal 3-Dimensional Visibility Representations for Graphs. GD Helmut Alt, Michael Godau, Sue Whitesides
1994	J	`jnl`	Drawing Graphs in Two Layers. Theor. Comput. Sci. Peter Eades, Sue Whitesides
1994	A	`conf`	Poster Gallery Report. GD Sue Whitesides
1994	A	`conf`	Recognizing Rectangle of Influence Drawable Graphs. GD Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
1994	—	`conf`	The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. SCG Peter Eades, Sue Whitesides
1993	B	`ed.`	Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides
1993	—	`conf`	Dominance Drawings of Bipartite Graphs. CCCG Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
1993	—	`conf`	Folding Rulers inside Triangles. CCCG Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
1993	J	`jnl`	Grid intersection graphs and boxicity. Discret. Math. S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides
1992	J	`jnl`	Algorithmic Issues in the Geometry of Planar Linkage Movement. Aust. Comput. J. Sue Whitesides
1992	B	`conf`	Algorithmic and Complexity Results for Drawing Euclidian Trees. Advanced Visual Interfaces Sue Whitesides, Rongyao Zhao
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1985	J	`jnl`	On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. John E. Hopcroft, Deborah Joseph, Sue Whitesides
1984	J	`jnl`	Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. John E. Hopcroft, Deborah Joseph, Sue Whitesides
1983	J	`jnl`	Edge-colored complete graphs with alternating cycles. Discret. Math. Sue Whitesides
1982	J	`jnl`	A classification of certain graphs with minimal imperfection properties. Discret. Math. Sue Whitesides
1982	A*	`conf`	On the Movement of Robot Arms in 2-Dimensional Bounded Regions FOCS John E. Hopcroft, Deborah Joseph, Sue Whitesides
1981	J	`jnl`	An Algorithm for Finding Clique Cut-Sets. Inf. Process. Lett. Sue Whitesides
1979	J	`jnl`	Collineations of Projective Planes of Order 10, Part I. J. Comb. Theory A Sue Whitesides
1979	J	`jnl`	Collineations of Projective Planes of Order 10, Part II. J. Comb. Theory A Sue Whitesides
1979	J	`jnl`	Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides