Nishat, Rahnuma Islam; Whitesides, Sue Reconfiguration of Hamiltonian cycles in rectangular grid graphs. (English) Zbl 07766092 Int. J. Found. Comput. Sci. 34, No. 7, 773-793 (2023). Reviewer: Mikhail Kabenyuk (Kemerovo) MSC: 05C45 05C76 68R10 PDFBibTeX XMLCite \textit{R. I. Nishat} and \textit{S. Whitesides}, Int. J. Found. Comput. Sci. 34, No. 7, 773--793 (2023; Zbl 07766092) Full Text: DOI
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs. (English) Zbl 07724768 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 463-475 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{R. I. Nishat} et al., Lect. Notes Comput. Sci. 13595, 463--475 (2023; Zbl 07724768) Full Text: DOI arXiv
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue 1-complex \(s, t\) Hamiltonian paths: structure and reconfiguration in rectangular grids. (English) Zbl 1518.05102 J. Graph Algorithms Appl. 27, No. 4, 281-327 (2023). Reviewer: Hang Lau (Montréal) MSC: 05C45 PDFBibTeX XMLCite \textit{R. I. Nishat} et al., J. Graph Algorithms Appl. 27, No. 4, 281--327 (2023; Zbl 1518.05102) Full Text: DOI
Casel, Katrin; Fernau, Henning; Grigoriev, Alexander; Schmid, Markus L.; Whitesides, Sue Combinatorial properties and recognition of unit square visibility graphs. (English) Zbl 07685731 Discrete Comput. Geom. 69, No. 4, 937-980 (2023). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{K. Casel} et al., Discrete Comput. Geom. 69, No. 4, 937--980 (2023; Zbl 07685731) Full Text: DOI
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids. (English) Zbl 07556561 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 59-70 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. I. Nishat} et al., Lect. Notes Comput. Sci. 13174, 59--70 (2022; Zbl 07556561) Full Text: DOI
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs. (English) Zbl 07495044 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 501-515 (2021). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{R. I. Nishat} et al., Lect. Notes Comput. Sci. 12757, 501--515 (2021; Zbl 07495044) Full Text: DOI
Nishat, Rahnuma Islam; Whitesides, Sue Reconfiguring Hamiltonian cycles in L-shaped grid graphs. (English) Zbl 07173310 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 325-337 (2019). MSC: 68R10 PDFBibTeX XMLCite \textit{R. I. Nishat} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 11789, 325--337 (2019; Zbl 07173310) Full Text: DOI
Rahmati, Zahed; Abam, Mohammad Ali; King, Valerie; Whitesides, Sue Kinetic \(k\)-semi-Yao graph and its applications. (English) Zbl 1506.68018 Comput. Geom. 77, 10-26 (2019). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{Z. Rahmati} et al., Comput. Geom. 77, 10--26 (2019; Zbl 1506.68018) Full Text: DOI arXiv
Bremner, David; Devillers, Olivier; Glisse, Marc; Lazard, Sylvain; Liotta, Giuseppe; Mchedlidze, Tamara; Moroz, Guillaume; Whitesides, Sue; Wismath, Stephen Monotone simultaneous paths embeddings in \(\mathbb{R}^d\). (English) Zbl 1401.05198 Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 1, 11 p. (2018). MSC: 05C62 05C38 05C10 PDFBibTeX XMLCite \textit{D. Bremner} et al., Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 1, 11 p. (2018; Zbl 1401.05198) Full Text: Link
Arleo, Alessio; Binucci, Carla; Di Giacomo, Emilio; Evans, William S.; Grilli, Luca; Liotta, Giuseppe; Meijer, Henk; Montecchiani, Fabrizio; Whitesides, Sue; Wismath, Stephen Visibility representations of boxes in 2.5 dimensions. (English) Zbl 1443.68195 Comput. Geom. 72, 19-33 (2018). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{A. Arleo} et al., Comput. Geom. 72, 19--33 (2018; Zbl 1443.68195) Full Text: DOI arXiv
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1390.68498 Algorithmica 80, No. 3, 977-994 (2018). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Algorithmica 80, No. 3, 977--994 (2018; Zbl 1390.68498) Full Text: DOI arXiv
Chambers, Erin W.; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue Connecting a set of circles with minimum sum of radii. (English) Zbl 1380.05113 Comput. Geom. 68, 62-76 (2018). MSC: 05C40 05C10 05C22 68Q25 PDFBibTeX XMLCite \textit{E. W. Chambers} et al., Comput. Geom. 68, 62--76 (2018; Zbl 1380.05113) Full Text: DOI arXiv
Casel, Katrin; Fernau, Henning; Grigoriev, Alexander; Schmid, Markus L.; Whitesides, Sue Combinatorial properties and recognition of unit square visibility graphs. (English) Zbl 1441.68169 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 30, 15 p. (2017). MSC: 68R10 05C85 68Q17 68U05 PDFBibTeX XMLCite \textit{K. Casel} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 30, 15 p. (2017; Zbl 1441.68169) Full Text: DOI arXiv
Nishat, Rahnuma Islam; Whitesides, Sue Bend complexity and Hamiltonian cycles in grid graphs. (English) Zbl 1434.05086 Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 445-456 (2017). MSC: 05C45 68R10 PDFBibTeX XMLCite \textit{R. I. Nishat} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 10392, 445--456 (2017; Zbl 1434.05086) Full Text: DOI
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor P.; Lenchner, Jonathan; Sember, Jeff; Srinivasan, Venkatesh; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue Connectivity graphs of uncertainty regions. (English) Zbl 1372.68205 Algorithmica 78, No. 3, 990-1019 (2017). MSC: 68R10 68Q17 68Q25 68U05 68W25 90C35 PDFBibTeX XMLCite \textit{E. Chambers} et al., Algorithmica 78, No. 3, 990--1019 (2017; Zbl 1372.68205) Full Text: DOI arXiv
Bremner, David; Devillers, Olivier; Glisse, Marc; Lazard, Sylvain; Liotta, Giuseppe; Mchedlidze, Tamara; Whitesides, Sue; Wismath, Stephen Monotone simultaneous embeddings of paths in \(d\) dimensions. (English) Zbl 1478.68220 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 546-553 (2016). MSC: 68R10 05C62 68U05 PDFBibTeX XMLCite \textit{D. Bremner} et al., Lect. Notes Comput. Sci. 9801, 546--553 (2016; Zbl 1478.68220) Full Text: DOI arXiv
Arleo, Alessio; Binucci, Carla; Di Giacomo, Emilio; Evans, William S.; Grilli, Luca; Liotta, Giuseppe; Meijer, Henk; Montecchiani, Fabrizio; Whitesides, Sue; Wismath, Stephen Visibility representations of boxes in 2.5 dimensions. (English) Zbl 1478.68213 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 251-265 (2016). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{A. Arleo} et al., Lect. Notes Comput. Sci. 9801, 251--265 (2016; Zbl 1478.68213) Full Text: DOI arXiv
Tian, Huamei; Wu, Kui; Whitesides, Sue; Feng, Cuiying Constrained light deployment for reducing energy consumption in buildings. (English) Zbl 1483.68471 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 350-364 (2016). MSC: 68U05 68T20 90B80 90C59 PDFBibTeX XMLCite \textit{H. Tian} et al., Lect. Notes Comput. Sci. 10043, 350--364 (2016; Zbl 1483.68471) Full Text: DOI
Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen On the planar split thickness of graphs. (English) Zbl 1383.68060 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 403-415 (2016). MSC: 68R10 05C10 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 9644, 403--415 (2016; Zbl 1383.68060) Full Text: DOI arXiv
Rahmati, Zahed; King, Valerie; Whitesides, Sue Kinetic reverse \(k\)-nearest neighbor problem. (English) Zbl 1401.68352 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 307-317 (2015). MSC: 68U05 68U10 68W05 PDFBibTeX XMLCite \textit{Z. Rahmati} et al., Lect. Notes Comput. Sci. 8986, 307--317 (2015; Zbl 1401.68352) Full Text: DOI arXiv
Rahmati, Zahed; Abam, Mohammad Ali; King, Valerie; Whitesides, Sue; Zarei, Alireza A simple, faster method for kinetic proximity problems. (English) Zbl 1314.65032 Comput. Geom. 48, No. 4, 342-359 (2015). MSC: 65D18 68U05 68P05 68R10 05C05 PDFBibTeX XMLCite \textit{Z. Rahmati} et al., Comput. Geom. 48, No. 4, 342--359 (2015; Zbl 1314.65032) Full Text: DOI arXiv
Giordano, F.; Liotta, G.; Mchedlidze, T.; Symvonis, A.; Whitesides, S. H. Computing upward topological book embeddings of upward planar digraphs. (English) Zbl 1320.68129 J. Discrete Algorithms 30, 45-69 (2015). MSC: 68R10 05C10 05C20 05C62 68U05 PDFBibTeX XMLCite \textit{F. Giordano} et al., J. Discrete Algorithms 30, 45--69 (2015; Zbl 1320.68129) Full Text: DOI
Rahmati, Zahed; King, Valerie; Whitesides, Sue Kinetic data structures for all nearest neighbors and closest pair in the plane. (English) Zbl 1305.68070 Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 137-144 (2013). MSC: 68P05 68Q25 68U05 PDFBibTeX XMLCite \textit{Z. Rahmati} et al., in: Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17--20, 2013. New York, NY: Association for Computing Machinery (ACM). 137--144 (2013; Zbl 1305.68070) Full Text: DOI
Mondal, Debajyoti; Nishat, Rahnuma Islam; Rahman, Md. Saidur; Whitesides, Sue Acyclic coloring with few division vertices. (English) Zbl 1334.05041 J. Discrete Algorithms 23, 42-53 (2013). MSC: 05C15 05C85 05C38 68Q17 PDFBibTeX XMLCite \textit{D. Mondal} et al., J. Discrete Algorithms 23, 42--53 (2013; Zbl 1334.05041) Full Text: DOI
Durocher, Stephane; Mondal, Debajyoti; Nishat, Rahnuma Islam; Whitesides, Sue A note on minimum-segment drawings of planar graphs. (English) Zbl 1267.05256 J. Graph Algorithms Appl. 17, No. 3, 301-328 (2013). MSC: 05C85 05C62 05C10 PDFBibTeX XMLCite \textit{S. Durocher} et al., J. Graph Algorithms Appl. 17, No. 3, 301--328 (2013; Zbl 1267.05256) Full Text: DOI
Rahmati, Zahed; Whitesides, Sue H.; King, Valerie Kinetic and stationary point-set embeddability for plane graphs. (English) Zbl 1377.68186 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 279-290 (2013). MSC: 68R10 05C62 05C85 68U05 68W40 PDFBibTeX XMLCite \textit{Z. Rahmati} et al., Lect. Notes Comput. Sci. 7704, 279--290 (2013; Zbl 1377.68186) Full Text: DOI
Bremner, David; Evans, William; Frati, Fabrizio; Heyer, Laurie; Kobourov, Stephen G.; Lenhart, William J.; Liotta, Giuseppe; Rappaport, David; Whitesides, Sue H. On representing graphs by touching cuboids. (English) Zbl 1377.68166 Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 187-198 (2013). MSC: 68R10 05B50 05C62 68U05 PDFBibTeX XMLCite \textit{D. Bremner} et al., Lect. Notes Comput. Sci. 7704, 187--198 (2013; Zbl 1377.68166) Full Text: DOI
Mondal, Debajyoti; Nishat, Rahnuma Islam; Rahman, Md. Saidur; Whitesides, Sue Acyclic coloring with few division vertices. (English) Zbl 1293.05372 Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 86-99 (2012). MSC: 05C85 05C15 68Q17 PDFBibTeX XMLCite \textit{D. Mondal} et al., Lect. Notes Comput. Sci. 7643, 86--99 (2012; Zbl 1293.05372) Full Text: DOI
Mondal, Debajyoti; Nishat, Rahnuma Islam; Whitesides, Sue; Rahman, Md. Saidur Acyclic colorings of graph subdivisions revisited. (English) Zbl 1257.05045 J. Discrete Algorithms 16, 90-103 (2012). MSC: 05C15 05C10 68Q17 PDFBibTeX XMLCite \textit{D. Mondal} et al., J. Discrete Algorithms 16, 90--103 (2012; Zbl 1257.05045) Full Text: DOI
Whitesides, Sue On three-dimensional graph drawing and embedding. (English) Zbl 1350.68214 Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 3-4 (2012). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{S. Whitesides}, Lect. Notes Comput. Sci. 7157, 3--4 (2012; Zbl 1350.68214) Full Text: DOI
Di Battista, Giuseppe; Kim, Ethan; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue The shape of orthogonal cycles in three dimensions. (English) Zbl 1238.68106 Discrete Comput. Geom. 47, No. 3, 461-491 (2012). MSC: 68R10 05C38 05C62 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Discrete Comput. Geom. 47, No. 3, 461--491 (2012; Zbl 1238.68106) Full Text: DOI
Durocher, Stephane; Mondal, Debajyoti; Nishat, Rahnuma Islam; Rahman, Md. Saidur; Whitesides, Sue Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\). (English) Zbl 1311.68114 van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 39-51 (2012). MSC: 68R10 05C05 05C10 05C85 68Q17 68U05 PDFBibTeX XMLCite \textit{S. Durocher} et al., Lect. Notes Comput. Sci. 7034, 39--51 (2012; Zbl 1311.68114) Full Text: DOI
Mondal, Debajyoti; Nishat, Rahnuma Islam; Whitesides, Sue; Rahman, Md. Saidur Acyclic colorings of graph subdivisions. (English) Zbl 1314.05075 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 247-260 (2011). MSC: 05C15 05C10 05C85 68Q17 PDFBibTeX XMLCite \textit{D. Mondal} et al., Lect. Notes Comput. Sci. 7056, 247--260 (2011; Zbl 1314.05075) Full Text: DOI
Chambers, Erin Wolf; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue Connecting a set of circles with minimum sum of radii. (English) Zbl 1342.68355 Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 183-194 (2011). MSC: 68W25 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. W. Chambers} et al., Lect. Notes Comput. Sci. 6844, 183--194 (2011; Zbl 1342.68355) Full Text: DOI arXiv
Lazard, Sylvain; Weibel, Christophe; Whitesides, Sue; Zhang, Linqiao A succinct 3D visibility skeleton. (English) Zbl 1211.68472 Discrete Math. Algorithms Appl. 2, No. 4, 567-589 (2010). MSC: 68U05 PDFBibTeX XMLCite \textit{S. Lazard} et al., Discrete Math. Algorithms Appl. 2, No. 4, 567--589 (2010; Zbl 1211.68472) Full Text: DOI
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor; Lenchner, Jonathan; Sember, Jeff; Venkatesh, Srinivasan; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue Connectivity graphs of uncertainty regions. (English) Zbl 1310.68157 Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 434-445 (2010). MSC: 68R10 68Q17 68Q25 68U05 PDFBibTeX XMLCite \textit{E. Chambers} et al., Lect. Notes Comput. Sci. 6507, 434--445 (2010; Zbl 1310.68157) Full Text: DOI arXiv
Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan Milling a graph with turn costs: a parameterized complexity perspective. (English) Zbl 1309.68093 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 123-134 (2010). MSC: 68Q25 05C12 05C85 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 6410, 123--134 (2010; Zbl 1309.68093) Full Text: DOI
Lazard, Sylvain; Weibel, Christophe; Whitesides, Sue; Zhang, Linqiao On the computation of 3D visibility skeletons. (English) Zbl 1286.68105 Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 469-478 (2010). MSC: 68P05 68U05 PDFBibTeX XMLCite \textit{S. Lazard} et al., Lect. Notes Comput. Sci. 6196, 469--478 (2010; Zbl 1286.68105) Full Text: DOI
Whitesides, Sue Intractability in graph drawing and geometry: FPT approaches. (English) Zbl 1267.68123 Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 20-23 (2009). MSC: 68Q25 05C62 05C85 68U05 68Q01 PDFBibTeX XMLCite \textit{S. Whitesides}, Lect. Notes Comput. Sci. 5874, 20--23 (2009; Zbl 1267.68123) Full Text: DOI
Giordano, Francesco; Liotta, Giuseppe; Whitesides, Sue H. Embeddability problems for upward planar digraphs. (English) Zbl 1213.68450 Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 242-253 (2009). MSC: 68R10 68U05 05C10 05C20 05C62 05C85 PDFBibTeX XMLCite \textit{F. Giordano} et al., Lect. Notes Comput. Sci. 5417, 242--253 (2009; Zbl 1213.68450) Full Text: DOI
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R. On the parameterized complexity of layered graph drawing. (English) Zbl 1170.68028 Algorithmica 52, No. 2, 267-292 (2008). MSC: 68R10 05C62 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Algorithmica 52, No. 2, 267--292 (2008; Zbl 1170.68028) Full Text: DOI
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. (English) Zbl 1170.68047 Algorithmica 52, No. 2, 167-176 (2008). MSC: 68W05 05C70 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Algorithmica 52, No. 2, 167--176 (2008; Zbl 1170.68047) Full Text: DOI
Demaine, Erik D.; Erickson, Jeff; Kriząnc, Danny; Meijer, Henk; Morin, Pat; Overmars, Mark; Whitesides, Sue Realizing partitions respecting full and partial order information. (English) Zbl 1156.68025 J. Discrete Algorithms 6, No. 1, 51-58 (2008). MSC: 68Q25 05A17 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., J. Discrete Algorithms 6, No. 1, 51--58 (2008; Zbl 1156.68025) Full Text: DOI
Devillers, Olivier; Dujmović, Vida; Everett, Hazel; Hornus, Samuel; Whitesides, Sue; Wismath, Steve Maintaining visibility information of planar point sets with a moving viewpoint. (English) Zbl 1145.65011 Int. J. Comput. Geom. Appl. 17, No. 4, 297-304 (2007). Reviewer: Sonia Pérez Díaz (Madrid) MSC: 65D18 PDFBibTeX XMLCite \textit{O. Devillers} et al., Int. J. Comput. Geom. Appl. 17, No. 4, 297--304 (2007; Zbl 1145.65011) Full Text: DOI
Brönnimann, Hervé; Devillers, Olivier; Dujmović, Vida; Everett, Hazel; Glisse, Marc; Goaoc, Xavier; Lazard, Sylvain; Na, Hyeon-Suk; Whitesides, Sue Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. (English) Zbl 1138.65019 SIAM J. Comput. 37, No. 2, 522-551 (2007). MSC: 65D18 52B55 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., SIAM J. Comput. 37, No. 2, 522--551 (2007; Zbl 1138.65019) Full Text: DOI
Haggard, Gary; Schlipf, John; Whitesides, Sue Discrete mathematics for computer science. With CD-ROM. (English) Zbl 1329.00014 Belmont, CA : Thomson Brooks/Cole; Cengage Learning (ISBN 978-0-534-49501-5). xxiii, 600 p. (2006). MSC: 00A06 00A05 05-01 68-01 00A69 PDFBibTeX XMLCite \textit{G. Haggard} et al., Discrete mathematics for computer science. With CD-ROM. Belmont, CA : Thomson Brooks/Cole; Cengage Learning (2006; Zbl 1329.00014)
Di Battista, Giuseppe; Liotta, Giuseppe; Whitesides, Sue H. The strength of weak proximity. (English) Zbl 1102.65022 J. Discrete Algorithms 4, No. 3, 384-400 (2006). MSC: 65D18 68U05 PDFBibTeX XMLCite \textit{G. Di Battista} et al., J. Discrete Algorithms 4, No. 3, 384--400 (2006; Zbl 1102.65022) Full Text: DOI
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R. A fixed-parameter approach to 2-layer planarization. (English) Zbl 1095.68081 Algorithmica 45, No. 2, 159-182 (2006). MSC: 68R10 05C10 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Algorithmica 45, No. 2, 159--182 (2006; Zbl 1095.68081) Full Text: DOI
Suderman, Matthew; Whitesides, Sue Experiments with the fixed-parameter approach for two-layer planarization. (English) Zbl 1089.05068 J. Graph Algorithms Appl. 9, No. 1, 149-163 (2005). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Suderman} and \textit{S. Whitesides}, J. Graph Algorithms Appl. 9, No. 1, 149--163 (2005; Zbl 1089.05068) Full Text: DOI EuDML
Kitching, Matthew; Whitesides, Sue The three dimensional logic engine. (English) Zbl 1111.68588 Pach, János (ed.), Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29–October 2, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24528-6/pbk). Lecture Notes in Computer Science 3383, 329-339 (2005). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{M. Kitching} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 3383, 329--339 (2005; Zbl 1111.68588) Full Text: DOI
Brönnimann, H.; Everett, H.; Lazard, S.; Sottile, F.; Whitesides, S. Transversals to line segments in three-dimensional space. (English) Zbl 1083.52003 Discrete Comput. Geom. 34, No. 3, 381-390 (2005). Reviewer: Marek Lassak (Bydgoszcz) MSC: 52A15 52A20 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., Discrete Comput. Geom. 34, No. 3, 381--390 (2005; Zbl 1083.52003) Full Text: DOI
Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; Iacono, John; Langerman, Stefan; Meijer, Henk; Overmars, Mark; Whitesides, Sue Separating point sets in polygonal environments. (English) Zbl 1104.68116 Int. J. Comput. Geom. Appl. 15, No. 4, 403-419 (2005). MSC: 68U05 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Int. J. Comput. Geom. Appl. 15, No. 4, 403--419 (2005; Zbl 1104.68116) Full Text: DOI
Brönnimann, H.; Devillers, O.; Dujmović, V.; Everett, H.; Glisse, M.; Goaoc, X.; Lazard, S.; Na, H.-S.; Whitesides, S. The number of lines tangent to arbitrary convex polyhedra in 3D. (English) Zbl 1374.68645 Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 46-55 (2004). MSC: 68U05 52B05 52B55 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., in: Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8--11, 2004. New York, NY: Association for Computing Machinery (ACM). 46--55 (2004; Zbl 1374.68645) Full Text: DOI Link
Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; Iacono, John; Langerman, Stefan; Meijer, Henk; Overmars, Mark; Whitesides, Sue Separating point sets in polygonal environments. (English) Zbl 1374.68656 Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 10-16 (2004). MSC: 68U05 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., in: Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8--11, 2004. New York, NY: Association for Computing Machinery (ACM). 10--16 (2004; Zbl 1374.68656) Full Text: DOI
Suderman, Matthew; Whitesides, Sue Experiments with the fixed-parameter approach for two-layer planarization. (English) Zbl 1215.05191 Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21–24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 345-356 (2004). MSC: 05C85 05C10 05C62 68Q25 PDFBibTeX XMLCite \textit{M. Suderman} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 2912, 345--356 (2004; Zbl 1215.05191) Full Text: DOI
Fellows, Michael R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, Dimitrios M.; Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. (English) Zbl 1111.68794 Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 311-322 (2004). MSC: 68W40 05C70 05C85 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 3221, 311--322 (2004; Zbl 1111.68794) Full Text: DOI
Alt, Helmut; Knauer, Christian; Rote, Günter; Whitesides, Sue On the complexity of the linkage reconfiguration problem. (English) Zbl 1088.68809 Pach, János (ed.), Towards a theory of geometric graphs. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3484-3/pbk). Contemporary Mathematics 342, 1-13 (2004). MSC: 68U05 68Q17 68W40 PDFBibTeX XMLCite \textit{H. Alt} et al., Contemp. Math. 342, 1--13 (2004; Zbl 1088.68809)
Dujmović, Vida; Whitesides, Sue A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation. (English) Zbl 1082.68589 Algorithmica 40, No. 1, 15-31 (2004). MSC: 68R10 68Q25 52B55 PDFBibTeX XMLCite \textit{V. Dujmović} and \textit{S. Whitesides}, Algorithmica 40, No. 1, 15--31 (2004; Zbl 1082.68589) Full Text: DOI
Alt, Helmut; Knauer, Christian; Rote, Günter; Whitesides, Sue The complexity of (un)folding. (English) Zbl 1374.68634 Proceedings of the 19th annual symposium on computational geometry, SCG/SoCG 2003, San Diego, CA, USA, June 8–10, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-663-3). 164-170 (2003). MSC: 68U05 68Q17 PDFBibTeX XMLCite \textit{H. Alt} et al., in: Proceedings of the 19th annual symposium on computational geometry, SCG/SoCG 2003, San Diego, CA, USA, June 8--10, 2003. New York, NY: Association for Computing Machinery (ACM). 164--170 (2003; Zbl 1374.68634) Full Text: DOI
Streinu, Ileana; Whitesides, Sue Rectangle visibility graphs: Characterization, construction, and compaction. (English) Zbl 1035.68088 Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 26-37 (2003). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{I. Streinu} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 2607, 26--37 (2003; Zbl 1035.68088) Full Text: Link
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, Giuseppe; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, David R. A fixed-parameter approach to two-layer planarization. (English) Zbl 1054.68576 Mutzel, Petra (ed.) et al., Graph drawing. 9th international symposium, GD 2001, Vienna, Austria, September 23–26, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43309-0). Lect. Notes Comput. Sci. 2265, 1-15 (2002). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Lect. Notes Comput. Sci. 2265, 1--15 (2002; Zbl 1054.68576) Full Text: Link
Dujmović, Vida; Whitesides, Sue An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. (English) Zbl 1037.68581 Goodrich, Michael T. (ed.) et al., Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002. Revised papers. Berlin: Springer (ISBN 3-540-00158-1/pbk). Lect. Notes Comput. Sci. 2528, 118-129 (2002). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{V. Dujmović} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 2528, 118--129 (2002; Zbl 1037.68581) Full Text: Link
Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue Embedding problems for paths with direction constrained edges. (English) Zbl 1061.68120 Theor. Comput. Sci. 289, No. 2, 897-917 (2002). MSC: 68R10 68W35 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Theor. Comput. Sci. 289, No. 2, 897--917 (2002; Zbl 1061.68120) Full Text: DOI
Agarwal, Pankaj K.; Biedl, Therese; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue Curvature-constrained shortest paths in a convex polygon. (English) Zbl 1008.68143 SIAM J. Comput. 31, No. 6, 1814-1851 (2002). MSC: 68U05 PDFBibTeX XMLCite \textit{P. K. Agarwal} et al., SIAM J. Comput. 31, No. 6, 1814--1851 (2002; Zbl 1008.68143) Full Text: DOI
Biedl, Therese; Demaine, Erik; Demaine, Martin; Lazard, Sylvain; Lubiw, Anna; O’Rourke, Joseph; Robbins, Steve; Streinu, Ileana; Toussaint, Godfried; Whitesides, Sue A note on reconfiguring tree linkages: Trees can lock. (English) Zbl 0993.52003 Discrete Appl. Math. 117, No. 1-3, 293-297 (2002). MSC: 52C25 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Appl. Math. 117, No. 1--3, 293--297 (2002; Zbl 0993.52003) Full Text: DOI
Whitesides, Sue Chain reconfiguration. (English) Zbl 1077.68919 Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 1-13 (2001). MSC: 68U05 68T40 70B15 PDFBibTeX XMLCite \textit{S. Whitesides}, Lect. Notes Comput. Sci. 2223, 1--13 (2001; Zbl 1077.68919) Full Text: Link
Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue Orthogonal drawings of cycles in 3D space (extended abstract). (English) Zbl 1043.68616 Marks, Joe (ed.), Graph drawing. 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20–23, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41554-8). Lect. Notes Comput. Sci. 1984, 272-283 (2001). MSC: 68R10 68U05 05C85 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Lect. Notes Comput. Sci. 1984, 272--283 (2001; Zbl 1043.68616) Full Text: Link
Dujmović, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, D. R. On the parameterized complexity of layered graph drawing. (English) Zbl 1006.68544 Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 488-499 (2001). MSC: 68R10 05C62 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Lect. Notes Comput. Sci. 2161, 488--499 (2001; Zbl 1006.68544) Full Text: Link
Dujmović, Vida; Whitesides, Sue On validating planar worlds. (English) Zbl 0988.05085 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 791-792 (2001). MSC: 05C85 05C10 05C90 68R10 PDFBibTeX XMLCite \textit{V. Dujmović} and \textit{S. Whitesides}, in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 791--792 (2001; Zbl 0988.05085)
Biedl, T.; Demaine, E.; Demaine, M.; Lazard, S.; Lubiw, A.; O’Rourke, J.; Overmars, M.; Robbins, S.; Streinu, I.; Toussaint, G.; Whitesides, S. Locked and unlocked polygonal chains in three dimensions. (English) Zbl 0988.68202 Discrete Comput. Geom. 26, No. 3, 269-281 (2001). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Comput. Geom. 26, No. 3, 269--281 (2001; Zbl 0988.68202) Full Text: DOI
Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue Embedding problems for paths with direction constrained edges. (English) Zbl 0988.68633 Du, D.-Z. (ed.) et al., Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26-28, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1858, 64-73 (2000). MSC: 68U05 05C85 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Lect. Notes Comput. Sci. 1858, 64--73 (2000; Zbl 0988.68633)
Lotta, Giuseppe (ed.); Whitesides, Sue H. (ed.) Advances in graph drawing. Special issue on selected papers from the 6th international symposium on graph drawing, GD ’98, Montréal, Canada, August 13–15, 1998. (English) Zbl 0948.00044 J. Graph Algorithms Appl. 4, No. 3, 9 papers (2000). MSC: 00B25 68-06 PDFBibTeX XMLCite \textit{G. Lotta} (ed.) and \textit{S. H. Whitesides} (ed.), J. Graph Algorithms Appl. 4, No. 3, 191 p., 9~papers (electronic) (2000; Zbl 0948.00044) Full Text: DOI
Eades, Peter; Symvonis, Antonios; Whitesides, Sue Three-dimensional orthogonal graph drawing algorithms. (English) Zbl 0958.68135 Discrete Appl. Math. 103, No. 1-3, 55-87 (2000). MSC: 68R10 68U05 05C15 PDFBibTeX XMLCite \textit{P. Eades} et al., Discrete Appl. Math. 103, No. 1--3, 55--87 (2000; Zbl 0958.68135) Full Text: DOI
Biedl, T.; Shermer, T.; Whitesides, S.; Wismath, S. Bounds for orthogonal 3-D graph drawing. (English) Zbl 0946.05033 J. Graph Algorithms Appl. 3, No. 4, 63-79 (1999). MSC: 05C10 68U05 05C85 68R10 PDFBibTeX XMLCite \textit{T. Biedl} et al., J. Graph Algorithms Appl. 3, No. 4, 63--79 (1999; Zbl 0946.05033) Full Text: DOI EuDML
Biedl, T.; Demaine, E.; Demaine, M.; Lazard, S.; Lubiw, A.; O’Rourke, J.; Overmars, M.; Robbins, S.; Streinu, I.; Toussaint, G.; Whitesides, S. Locked and unlocked polygonal chains in 3D. (English) Zbl 1052.68759 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM (ISBN 0-89871-434-6). 866-867 (1999). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 866--867 (1999; Zbl 1052.68759)
Everett, Hazel; Stojmenovic, Ivan; Valtr, Pavel; Whitesides, Sue The largest \(k\)-ball in a \(d\)-dimensional box. (English) Zbl 0911.68198 Comput. Geom. 11, No. 2, 59-67 (1998). MSC: 68U05 PDFBibTeX XMLCite \textit{H. Everett} et al., Comput. Geom. 11, No. 2, 59--67 (1998; Zbl 0911.68198) Full Text: DOI
Bose, Prosenjit; Everett, Hazel; Fekete, Sándor P.; Houle, Michael E.; Lubiw, Anna; Meijer, Henk; Romanik, Kathleen; Rote, Günter; Shermer, Thomas C.; Whitesides, Sue; Zelle, Christian A visibility representation for graphs in three dimensions. (English) Zbl 0895.68111 J. Graph Algorithms Appl. 2, Paper No. 3, 16 p. (1998). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{P. Bose} et al., J. Graph Algorithms Appl. 2, Paper No. 3, 16 p. (1998; Zbl 0895.68111) Full Text: DOI EuDML
Liotta, G.; Lubiw, A.; Meijer, H.; Whitesides, S. H. The rectangle of influence drawability problem. (English) Zbl 0896.68139 Comput. Geom. 10, No. 1, 1-22 (1998). MSC: 68U05 PDFBibTeX XMLCite \textit{G. Liotta} et al., Comput. Geom. 10, No. 1, 1--22 (1998; Zbl 0896.68139) Full Text: DOI
Dudek, Gregory; Romanik, Kathleen; Whitesides, Sue Localizing a robot with minimum travel. (English) Zbl 0907.68109 SIAM J. Comput. 27, No. 2, 583-604 (1998). MSC: 68Q25 68U05 68U99 68T99 PDFBibTeX XMLCite \textit{G. Dudek} et al., SIAM J. Comput. 27, No. 2, 583--604 (1998; Zbl 0907.68109) Full Text: DOI
Alt, Helmut; Godau, Michael; Whitesides, Sue Universal 3-dimensional visibility representations for graphs. (English) Zbl 0894.68103 Comput. Geom. 9, No. 1-2, 111-125 (1998). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Alt} et al., Comput. Geom. 9, No. 1--2, 111--125 (1998; Zbl 0894.68103) Full Text: DOI
Eades, Peter; Stirk, Charles; Whitesides, Sue The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings. (English) Zbl 1022.68625 Inf. Process. Lett. 60, No. 2, 97-103 (1996). MSC: 68U05 PDFBibTeX XMLCite \textit{P. Eades} et al., Inf. Process. Lett. 60, No. 2, 97--103 (1996; Zbl 1022.68625) Full Text: DOI
Eades, Peter; Whitesides, Sue The logic engine and the realization problem for nearest neighbor graphs. (English) Zbl 0874.68235 Theor. Comput. Sci. 169, No. 1, 23-37 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Theor. Comput. Sci. 169, No. 1, 23--37 (1996; Zbl 0874.68235) Full Text: DOI
Eades, Peter; Whitesides, Sue The realization problem for Euclidean minimum spanning trees is NP-hard. (English) Zbl 0851.68084 Algorithmica 16, No. 1, 60-82 (1996). MSC: 68R10 68Q15 68W10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Algorithmica 16, No. 1, 60--82 (1996; Zbl 0851.68084) Full Text: DOI
van Kreveld, Marc; Snoeyink, J.; Whitesides, S. Folding rulers inside triangles. (English) Zbl 0846.68103 Discrete Comput. Geom. 15, No. 3, 265-285 (1996). MSC: 68U05 PDFBibTeX XMLCite \textit{M. van Kreveld} et al., Discrete Comput. Geom. 15, No. 3, 265--285 (1996; Zbl 0846.68103) Full Text: DOI
Whitesides, Sue; Pei, Naixun On the reconfiguration of chains. (English) Zbl 07796054 Cai, Jin-Yi (ed.) et al., Computing and combinatorics. Second annual international conference, COCOON ’96, Hong Kong, June 17–19, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1090, 381-390 (1996). MSC: 68T40 68Q25 68U05 70B15 PDFBibTeX XMLCite \textit{S. Whitesides} and \textit{N. Pei}, Lect. Notes Comput. Sci. 1090, 381--390 (1996; Zbl 07796054) Full Text: DOI
Tanenbaum, Paul J.; Whitesides, Sue Simultaneous dominance representation of multiple posets. (English) Zbl 0873.06003 Order 13, No. 4, 351-364 (1996). MSC: 06A07 68U05 68Q25 PDFBibTeX XMLCite \textit{P. J. Tanenbaum} and \textit{S. Whitesides}, Order 13, No. 4, 351--364 (1996; Zbl 0873.06003) Full Text: DOI
Dudek, Gregory; Romanik, Kathleen; Whitesides, Sue Localizing a robot with minimum travel. (English) Zbl 0849.68134 Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 437-446 (1995). MSC: 68U99 68U05 PDFBibTeX XMLCite \textit{G. Dudek} et al., in: Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, SODA '95, San Francisco, CA, USA, January 22--24, 1995. Philadelphia, PA: SIAM; New York, NY: ACM. 437--446 (1995; Zbl 0849.68134)
Eades, Peter; Whitesides, Sue Nearest neighbour graph realizability is NP-hard. (English) Zbl 1495.68166 Baeza-Yates, Ricardo (ed.) et al., LATIN ’95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 911, 245-256 (1995). MSC: 68R10 05C62 68Q17 68U05 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 911, 245--256 (1995; Zbl 1495.68166) Full Text: DOI
Lenhart, W. J.; Whitesides, S. H. Reconfiguring closed polygonal chains in Euclidean \(d\)-space. (English) Zbl 0815.68120 Discrete Comput. Geom. 13, No. 1, 123-140 (1995). MSC: 68U05 68W10 PDFBibTeX XMLCite \textit{W. J. Lenhart} and \textit{S. H. Whitesides}, Discrete Comput. Geom. 13, No. 1, 123--140 (1995; Zbl 0815.68120) Full Text: DOI EuDML
Eades, Peter; Whitesides, Sue Drawing graphs in two layers. (English) Zbl 0819.68086 Theor. Comput. Sci. 131, No. 2, 361-374 (1994). MSC: 68R10 68Q25 05C10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Theor. Comput. Sci. 131, No. 2, 361--374 (1994; Zbl 0819.68086) Full Text: DOI
Dehne, Frank (ed.); Sack, Jörg-Rüdiger (ed.); Santoro, Nicola (ed.); Whitesides, Sue (ed.) Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. (English) Zbl 0825.00122 Lecture Notes in Computer Science 709. Berlin: Springer-Verlag. xii, 635 p. (1993). MSC: 00B25 68-06 68P05 68Wxx PDFBibTeX XMLCite \textit{F. Dehne} (ed.) et al., Algorithms and data structures. 3rd workshop, WADS '93. Montréal, Canada 11--13, 1993. Proceedings. Berlin: Springer-Verlag (1993; Zbl 0825.00122) Full Text: DOI
Bellantoni, S.; Hartman, I. Ben-Arroyo; Przytycka, T.; Whitesides, S. Grid intersection graphs and boxicity. (English) Zbl 0784.05031 Discrete Math. 114, No. 1-3, 41-49 (1993). Reviewer: V.D.Tonchev (Houghton) MSC: 05C35 05C99 05C50 PDFBibTeX XMLCite \textit{S. Bellantoni} et al., Discrete Math. 114, No. 1--3, 41--49 (1993; Zbl 0784.05031) Full Text: DOI
Lenhart, W.; Pollack, R.; Sack, J.; Seidel, R.; Sharir, M.; Suri, S.; Toussaint, G.; Whitesides, S.; Yap, C. Computing the link center of a simple polygon. (English) Zbl 0646.68056 Discrete Comput. Geom. 3, No. 3, 281-293 (1988). MSC: 68Q25 PDFBibTeX XMLCite \textit{W. Lenhart} et al., Discrete Comput. Geom. 3, No. 3, 281--293 (1988; Zbl 0646.68056) Full Text: DOI EuDML
Whitesides, S. H. Fixed point free collineations of order 7 in projective planes of order 9. (English) Zbl 0599.51009 Algebras Groups Geom. 2, 564-578 (1985). MSC: 51E15 PDFBibTeX XMLCite \textit{S. H. Whitesides}, Algebras Groups Geom. 2, 564--578 (1985; Zbl 0599.51009)
Hopcroft, John; Joseph, Deborah; Whitesides, Sue On the movement of robot arms in 2-dimensional bounded regions. (English) Zbl 0597.68040 SIAM J. Comput. 14, 315-333 (1985). Reviewer: L.Dorst MSC: 68Q25 70B15 68U99 PDFBibTeX XMLCite \textit{J. Hopcroft} et al., SIAM J. Comput. 14, 315--333 (1985; Zbl 0597.68040) Full Text: DOI
Whitesides, S. H. Computational geometry and motion planning. (English) Zbl 0588.68055 Computational geometry, Mach. Intell. Pattern Recognition 2, 377-427 (1985). MSC: 68U99 68-02 68T99 PDFBibTeX XML
Hopcroft, John; Joseph, Deborah; Whitesides, Sue Movement problems for 2-dimensional linkages. (English) Zbl 0588.68054 SIAM J. Comput. 13, 610-629 (1984). MSC: 68U99 68Q25 68T99 PDFBibTeX XMLCite \textit{J. Hopcroft} et al., SIAM J. Comput. 13, 610--629 (1984; Zbl 0588.68054) Full Text: DOI Link
Whitesides, Sue H. A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. (English) Zbl 0569.05043 Perfect graphs, Ann. Discrete Math. 21, 281-297 (1984). Reviewer: M.M.Sysło MSC: 05C70 05C75 68R10 68Q25 PDFBibTeX XML
Whitesides, S. H. A classification of certain graphs with minimal imperfection properties. (English) Zbl 0561.05025 Perfect graphs, Ann. Discrete Math. 21, 207-218 (1984). Reviewer: A.Tucker MSC: 05C15 05C35 PDFBibTeX XML
Chvátal, V.; Graham, R. L.; Perold, A. F.; Whitesides, S. H. Combinatorial designs related to the perfect graph conjecture. (English) Zbl 0556.05012 Perfect graphs, Ann. Discrete Math. 21, 197-206 (1984). MSC: 05B20 05C15 05C99 PDFBibTeX XML