default search action
Sue Whitesides
Person information
- affiliation: University of Victoria, Canada
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j65]Rahnuma Islam Nishat
, Venkatesh Srinivasan, Sue Whitesides:
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. J. Comb. Optim. 48(4): 31 (2024) - 2023
- [j64]Katrin Casel
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69(4): 937-980 (2023) - [j63]Rahnuma Islam Nishat
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs. Int. J. Found. Comput. Sci. 34(7): 773-793 (2023) - [j62]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. J. Graph Algorithms Appl. 27(4): 281-327 (2023) - 2022
- [j61]A. Bedel, Yoann Coudert-Osmont, Jonàs Martínez
Closed space-filling curves with controlled orientation for 3D printing. Comput. Graph. Forum 41(2): 473-492 (2022) - [c97]Rahnuma Islam Nishat
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. COCOON 2022: 463-475 - [c96]Rahnuma Islam Nishat
1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. WALCOM 2022: 59-70 - [i18]Rahnuma Islam Nishat
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. CoRR abs/2205.08025 (2022) - 2021
- [c95]Rahnuma Islam Nishat
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. IWOCA 2021: 501-515
2010 – 2019
- 2019
- [j60]Zahed Rahmati
Kinetic k-Semi-Yao graph and its applications. Comput. Geom. 77: 10-26 (2019) - [c94]Rahnuma Islam Nishat
Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. WG 2019: 325-337 - 2018
- [j59]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j58]Erin W. Chambers
Connecting a set of circles with minimum sum of radii. Comput. Geom. 68: 62-76 (2018) - [j57]Alessio Arleo
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j56]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2017
- [j55]Erin W. Chambers
Connectivity Graphs of Uncertainty Regions. Algorithmica 78(3): 990-1019 (2017) - [c93]Rahnuma Islam Nishat
Bend Complexity and Hamiltonian Cycles in Grid Graphs. COCOON 2017: 445-456 - [c92]S. M. Rayhan Rahman, Sue Whitesides:
Sliding Local Planners for Sampling-Based Path Planning. IRC 2017: 271-276 - [c91]Katrin Casel, Henning Fernau
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS 2017: 30:1-30:15 - [i17]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR abs/1706.05906 (2017) - 2016
- [c90]Huamei Tian, Kui Wu, Sue Whitesides, Cuiying Feng:
Constrained Light Deployment for Reducing Energy Consumption in Buildings. COCOA 2016: 350-364 - [c89]Alessio Arleo
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [c88]David Bremner, Olivier Devillers
Monotone Simultaneous Embeddings of Paths in d Dimensions. GD 2016: 546-553 - [c87]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415 - [i16]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - [i15]Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. CoRR abs/1608.08899 (2016) - 2015
- [j54]Zahed Rahmati
A simple, faster method for kinetic proximity problems. Comput. Geom. 48(4): 342-359 (2015) - [j53]Francesco Giordano, Giuseppe Liotta
Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms 30: 45-69 (2015) - [c86]Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides:
Reconfiguring a Chain of Cubes. CCCG 2015 - [c85]Sue Whitesides:
Open Problems from CCCG 2014. CCCG 2015 - 2014
- [j52]Sean Chester
Computing k-Regret Minimizing Sets. Proc. VLDB Endow. 7(5): 389-400 (2014) - [c84]Zahed Rahmati
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. CCCG 2014 - [c83]River Allen, Neil MacMillan, Dimitri Marinakis, Rahnuma Islam Nishat
The Range Beacon Placement Problem for Robot Navigation. CRV 2014: 151-158 - [c82]Zahed Rahmati
Kinetic Reverse k-Nearest Neighbor Problem. IWOCA 2014: 307-317 - [c81]Zahed Rahmati
(Reverse) k-nearest neighbors for moving objects. MIG 2014: 187 - [i14]Zahed Rahmati, Valerie King, Sue Whitesides:
Kinetic Reverse $k$-Nearest Neighbor Problem. CoRR abs/1406.5554 (2014) - [i13]Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides:
Kinetic $k$-Semi-Yao Graph and its Applications. CoRR abs/1412.5697 (2014) - 2013
- [j51]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic coloring with few division vertices. J. Discrete Algorithms 23: 42-53 (2013) - [j50]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(3): 301-328 (2013) - [c80]River Allen, Laurie J. Heyer, Rahnuma Islam Nishat, Sue Whitesides:
Grid Proximity Graphs: LOGs, GIGs and GIRLs. CCCG 2013 - [c79]Rahnuma Islam Nishat, Sue Whitesides:
Map Folding. CCCG 2013 - [c78]Sue Whitesides:
Kinetic Data Structures on The Move. CCCG 2013 - [c77]Zahed Rahmati
Kinetic data structures for all nearest neighbors and closest pair in the plane. SoCG 2013: 137-144 - [c76]Sean Chester
Indexing Reverse Top-k Queries in Two Dimensions. DASFAA (1) 2013: 201-208 - [i12]Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei:
A Simple, Faster Method for Kinetic Proximity Problems. CoRR abs/1311.2032 (2013) - 2012
- [j49]Giuseppe Di Battista
The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. 47(3): 461-491 (2012) - [j48]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic colorings of graph subdivisions revisited. J. Discrete Algorithms 16: 90-103 (2012) - [j47]Dimitri Marinakis, Kui Wu, Ning Ye, Sue Whitesides:
Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks. IEEE Trans. Wirel. Commun. 11(8): 2786-2795 (2012) - [c75]David Bremner, William S. Evans, Fabrizio Frati
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [c74]Zahed Rahmati
Kinetic and Stationary Point-Set Embeddability for Plane Graphs. GD 2012: 279-290 - [c73]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic Coloring with Few Division Vertices. IWOCA 2012: 86-99 - [c72]Sue Whitesides:
On Three-Dimensional Graph Drawing and Embedding. WALCOM 2012: 3-4 - [e4]Tamal K. Dey, Sue Whitesides:
Proceedings of the 28th ACM Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012. ACM 2012, ISBN 978-1-4503-1299-8 [contents] - [i11]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Indexing Reverse Top-k Queries. CoRR abs/1205.0837 (2012) - [i10]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Computing optimal k-regret minimizing sets with top-k depth contours. CoRR abs/1207.6329 (2012) - 2011
- [j46]Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
Sampled medial loci for 3D shape representation. Comput. Vis. Image Underst. 115(5): 695-706 (2011) - [c71]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. CCCG 2011 - [c70]Svetlana Stolpner, Kaleem Siddiqi, Sue Whitesides:
Approximating the Medial Axis by Shooting Rays: 3D Case. CCCG 2011 - [c69]Neil MacMillan, River Allen, Dimitri Marinakis, Sue Whitesides:
Range-based Navigation System for a Mobile Robot. CRV 2011: 16-23 - [c68]Sean Chester
Indexing for Vector Projections. DASFAA (2) 2011: 367-376 - [c67]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
Embedding Plane 3-Trees in ℝ2 and ℝ3. GD 2011: 39-51 - [c66]Dimitri Marinakis, Neil MacMillan, River Allen, Sue Whitesides:
Simultaneous localization and environmental mapping with a sensor network. ICRA 2011: 5881-5886 - [c65]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic Colorings of Graph Subdivisions. IWOCA 2011: 247-260 - [c64]Dimitri Marinakis, Kui Wu, Sue Whitesides:
Stochastic Scheduling for Underwater Sensor Networks. Networking (1) 2011: 134-146 - [c63]Erin W. Chambers
Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 - [i9]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) - 2010
- [j45]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
A Succinct 3D Visibility Skeleton. Discret. Math. Algorithms Appl. 2(4): 567-590 (2010) - [c62]Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
On the Computation of 3D Visibility Skeletons. COCOON 2010: 469-478 - [c61]Dimitri Marinakis, Sue Whitesides:
The Sentinel Problem for a Multi-hop Sensor Network. CRV 2010: 253-260 - [c60]Erin W. Chambers
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - [c59]Mantis Cheng, Erin Delisle, Alejandro Erickson, Sudhakar Ganti, Fieran Mason, Nicholas Vining, Sue Whitesides:
Collaborative problem solving: integrating theory and practice in the classroom. WCCCE 2010: 15:1-15:5 - [c58]Mike Fellows
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134 - [i8]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)
2000 – 2009
- 2009
- [j44]Maxime Boucher, Sue Whitesides, Alan C. Evans
Depth potential function for folding pattern representation, registration and analysis. Medical Image Anal. 13(2): 203-214 (2009) - [c57]Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
Sampled medial loci and boundary differential geometry. ICCV Workshops 2009: 1855-1862 - [c56]Svetlana Stolpner, Sue Whitesides:
Medial Axis Approximation with Bounded Error. ISVD 2009: 171-180 - [c55]Sue Whitesides:
Intractability in Graph Drawing and Geometry: FPT Approaches. IWOCA 2009: 20-23 - [i7]Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009) - 2008
- [j43]Michael R. Fellows
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008) - [j42]Vida Dujmovic, Michael R. Fellows
On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008) - [j41]Panos Giannopoulos, Christian Knauer, Sue Whitesides:
Parameterized Complexity of Geometric Problems. Comput. J. 51(3): 372-384 (2008) - [j40]Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008) - [c54]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816 - [c53]Francesco Giordano, Giuseppe Liotta, Sue Whitesides:
Embeddability Problems for Upward Planar Digraphs. GD 2008: 242-253 - 2007
- [j39]Olivier Devillers
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geom. Appl. 17(4): 297-304 (2007) - [j38]Malvika Rao, Gregory Dudek, Sue Whitesides:
Randomized Algorithms for Minimum Distance Localization. Int. J. Robotics Res. 26(9): 917-933 (2007) - [j37]Hervé Brönnimann, Olivier Devillers
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) - [c52]Ethan Kim, Sue Whitesides, Giuseppe Liotta:
A Note on Drawing Direction-constrained Paths in 3D. CCCG 2007: 193-196 - [c51]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:
On Bus Graph Realizability. CCCG 2007: 229-232 - [c50]Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides:
Towards an implementation of the 3D visibility skeleton. SCG 2007: 131-132 - [c49]Maxime Boucher, Sue Whitesides, Oliver Lyttleton, Alan C. Evans:
A Discrete Differential Operator for Direction-based Surface Morphometry. ICCV 2007: 1-8 - 2006
- [b1]Gary Haggard, John S. Schlipf, Sue Whitesides:
Discrete mathematics for computer science. Thomson Brooks/Cole 2006, ISBN 978-0-534-49501-5, pp. I-XXXIII, 1-600 - [j36]Vida Dujmovic, Michael R. Fellows
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - [j35]Giuseppe Di Battista
The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006) - [c48]Rafa Absar, Sue Whitesides:
On Computing Shortest External Watchman Routes for Convex Polygons. CCCG 2006 - [i6]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:
On Bus Graph Realizability. CoRR abs/cs/0609127 (2006) - 2005
- [j34]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34(3): 381-390 (2005) - [j33]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15(4): 403-420 (2005) - [j32]Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. J. Graph Algorithms Appl. 9(1): 149-163 (2005) - [c47]Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305 - [c46]Malvika Rao, Gregory Dudek, Sue Whitesides:
Minimum Distance Localization for a Robot with Limited Visibility. ICRA 2005: 2438-2445 - [i5]Sue Whitesides:
05191 Open Problem Session Report. Graph Drawing 2005 - 2004
- [j31]Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica 40(1): 15-31 (2004) - [j30]Steven M. Robbins, Alan C. Evans
Tuning and comparing spatial normalization methods. Medical Image Anal. 8(3): 311-323 (2004) - [c45]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. SCG 2004: 10-16 - [c44]Hervé Brönnimann, Olivier Devillers
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - [c43]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322 - [c42]Matthew Kitching, Sue Whitesides:
The Three Dimensional Logic Engine. GD 2004: 329-339 - [c41]Malvika Rao, Gregory Dudek, Sue Whitesides:
Randomized Algorithms for Minimum Distance Localization. WAFR 2004: 393-408 - 2003
- [c40]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3. CCCG 2003: 174-177 - [c39]Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides:
The complexity of (un)folding. SCG 2003: 164-170 - [c38]Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. GD 2003: 345-356 - [c37]Steven M. Robbins, Sue Whitesides:
On the Reliability of Triangle Intersection in 3D. ICCSA (3) 2003: 923-930 - [c36]Steven M. Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides:
Tuning and Comparing Spatial Normalization Methods. MICCAI (2) 2003: 910-917 - [c35]Neal Lesh, Michael Mitzenmacher, Sue Whitesides:
A complete and effective move set for simplified protein folding. RECOMB 2003: 188-195 - [c34]Ileana Streinu, Sue Whitesides:
Rectangle Visibility Graphs: Characterization, Construction, and Compaction. STACS 2003: 26-37 - [i4]Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
The number of transversals to line segments in R^3. CoRR math.MG/0306401 (2003) - 2002
- [j29]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j28]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002) - [j27]Giuseppe Di Battista, Giuseppe Liotta
Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002) - [c33]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 - [c32]Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. GD 2002: 118-129 - 2001
- [j26]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:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [c31]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c30]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett
A Fixed-Parameter Approach to Two-Layer Planarization. GD 2001: 1-15 - [c29]Sue Whitesides:
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. ISAAC 2001: 1-13 - [c28]Vida Dujmovic, Sue Whitesides:
On validating planar worlds. SODA 2001: 791-792 - 2000
- [j25]Peter Eades, Antonios Symvonis
Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1-3): 55-87 (2000) - [j24]Giuseppe Liotta, Sue Whitesides:
Guest Editors' Foreword. J. Graph Algorithms Appl. 4(3): 1-3 (2000) - [c27]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 - [c26]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD 2000: 272-283
1990 – 1999
- 1999
- [j23]Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath:
Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3(4): 63-79 (1999) - [c25]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:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [i3]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - [i2]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999) - 1998
- [j22]Helmut Alt, Michael Godau, Sue Whitesides:
Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9(1-2): 111-125 (1998) - [j21]Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) - [j20]Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides:
The largest k-ball in a d-dimensional box. Comput. Geom. 11(2): 59-67 (1998) - [j19]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:
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(3): 1-16 (1998) - [j18]Gregory Dudek, Kathleen Romanik, Sue Whitesides:
Localizing a Robot with Minimum Travel. SIAM J. Comput. 27(2): 583-604 (1998) - [c24]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On reconfiguring tree linkages: Trees can lock. CCCG 1998 - [c23]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides:
Unfolding some classes of orthogonal polyhedra. CCCG 1998 - [c22]Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides:
Convexifying star-shaped polygons. CCCG 1998 - [c21]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG 1998: 392-401 - [c20]Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides:
Graph Multidrawing: Finding Nice Drawings Without Defining Nice. GD 1998: 347-355 - [e3]Sue Whitesides:
Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings. Lecture Notes in Computer Science 1547, Springer 1998, ISBN 3-540-65473-9 [contents] - [i1]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1997
- [c19]Naixun Pei, Sue Whitesides:
On folding rulers in regular polygons. CCCG 1997 - [c18]Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath:
Orthogonal 3-D Graph Drawing. GD 1997: 76-86 - [c17]Sándor P. Fekete, Michael E. Houle, Sue Whitesides:
The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. GD 1997: 272-283 - 1996
- [j17]Peter Eades, Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996) - [j16]Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers Inside Triangles. Discret. Comput. Geom. 15(3): 265-285 (1996) - [j15]Peter Eades, Charles Stirk, Sue Whitesides:
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. 60(2): 97-103 (1996) - [j14]Peter Eades, Sue Whitesides:
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996) - [c16]Naixun Pei, Sue Whitesides:
On the Reachable Regions of Chains. CCCG 1996: 161-166 - [c15]Sue Whitesides, Naixun Pei:
On the Reconfiguration of Chains (Extended Abstract). COCOON 1996: 381-390 - [c14]Peter Eades, Antonios Symvonis
Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD 1996: 139-154 - [e2]Sue Whitesides:
Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996. ACM 1996, ISBN 0-89791-804-5 [contents] - 1995
- [j13]William J. Lenhart, Sue Whitesides:
Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discret. Comput. Geom. 13: 123-140 (1995) - [c13]Helmut Alt, Michael Godau, Sue Whitesides:
Universal 3-Dimensional Visibility Representations for Graphs. GD 1995: 8-19 - [c12]Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The Strength of Weak Proximity. GD 1995: 178-189 - [c11]Sándor P. Fekete, Michael E. Houle, Sue Whitesides:
New Results on a Visibility Representation of Graphs in 3D. GD 1995: 234-241 - [c10]Peter Eades, Sue Whitesides:
Nearest Neighbour Graph Realizability is NP-hard. LATIN 1995: 245-256 - [c9]Gregory Dudek, Kathleen Romanik, Sue Whitesides:
Localizing a Robot with Minimum Travel. SODA 1995: 437-446 - 1994
- [j12]Peter Eades, Sue Whitesides:
Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994) - [c8]Peter Eades, Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. SCG 1994: 49-56 - [c7]Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs. GD 1994: 352-363 - [c6]Sue Whitesides:
Poster Gallery Report. GD 1994: 461-469 - 1993
- [j11]S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides:
Grid intersection graphs and boxicity. Discret. Math. 114(1-3): 41-49 (1993) - [c5]Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers inside Triangles. CCCG 1993: 1-6 - [c4]Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides:
Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 - [e1]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8 [contents] - 1992
- [j10]Sue Whitesides:
Algorithmic Issues in the Geometry of Planar Linkage Movement. Aust. Comput. J. 24(2): 42-50 (1992) - [c3]Sue Whitesides, Rongyao Zhao:
Algorithmic and Complexity Results for Drawing Euclidian Trees. Advanced Visual Interfaces 1992: 395-408
1980 – 1989
- 1988
- [j9]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - 1987
- [c2]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - 1985
- [j8]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. 14(2): 315-333 (1985) - 1984
- [j7]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13(3): 610-629 (1984) - 1983
- [j6]Sue Whitesides:
Edge-colored complete graphs with alternating cycles. Discret. Math. 46(3): 299-304 (1983) - 1982
- [j5]Sue Whitesides:
A classification of certain graphs with minimal imperfection properties. Discret. Math. 38(2-3): 303-310 (1982) - [c1]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions. FOCS 1982: 280-289 - 1981
- [j4]Sue Whitesides:
An Algorithm for Finding Clique Cut-Sets. Inf. Process. Lett. 12(1): 31-32 (1981)
1970 – 1979
- 1979
- [j3]Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides:
Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. 26(2): 83-92 (1979) - [j2]Sue Whitesides:
Collineations of Projective Planes of Order 10, Part I. J. Comb. Theory A 26(3): 249-268 (1979) - [j1]Sue Whitesides:
Collineations of Projective Planes of Order 10, Part II. J. Comb. Theory A 26(3): 269-277 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: