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
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; 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
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
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
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; 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
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
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
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
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
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
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
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
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)
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
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
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
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
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
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. An algorithm for finding clique cut-sets. (English) Zbl 0454.68078 Inf. Process. Lett. 12, 31-32 (1981). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{S. H. Whitesides}, Inf. Process. Lett. 12, 31--32 (1981; Zbl 0454.68078) Full Text: DOI