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 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
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
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
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
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
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
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
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
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
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)
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
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
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 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)
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)
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
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
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
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
Whitesides, S. H. Edge-colored complete graphs with alternating cycles. (English) Zbl 0532.05030 Discrete Math. 46, 299-304 (1983). Reviewer: B.Toft MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{S. H. Whitesides}, Discrete Math. 46, 299--304 (1983; Zbl 0532.05030) Full Text: DOI
Whitesides, S. H. A classification of certain graphs with minimal imperfection properties. (English) Zbl 0478.05055 Discrete Math. 38, 303-310 (1982). MSC: 05C35 05C15 05C70 PDFBibTeX XMLCite \textit{S. H. Whitesides}, Discrete Math. 38, 303--310 (1982; Zbl 0478.05055) Full Text: DOI
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
Whitesides, S. H. Collineations of projective planes of order 10, part II. (English) Zbl 0444.51007 J. Comb. Theory, Ser. A 26, 269-277 (1979). MSC: 51E15 20B25 05B25 PDFBibTeX XMLCite \textit{S. H. Whitesides}, J. Comb. Theory, Ser. A 26, 269--277 (1979; Zbl 0444.51007) Full Text: DOI
Whitesides, S. H. Collineations of projective planes of order 10. Part I. (English) Zbl 0422.51006 J. Comb. Theory, Ser. A 26, 249-268 (1979). MSC: 51E15 05B25 20B25 PDFBibTeX XMLCite \textit{S. H. Whitesides}, J. Comb. Theory, Ser. A 26, 249--268 (1979; Zbl 0422.51006) Full Text: DOI
Chvatal, V.; Graham, R. L.; Perold, A. F.; Whitesides, S. H. Combinatorial designs related to the strong perfect graph conjecture. (English) Zbl 0403.05017 Discrete Math. 26, 83-92 (1979). MSC: 05B20 05C15 05C99 PDFBibTeX XMLCite \textit{V. Chvatal} et al., Discrete Math. 26, 83--92 (1979; Zbl 0403.05017) Full Text: DOI
Hutchinson, Joan P.; Whitesides, Sue H. A note on a generalized regularity condition. (English) Zbl 0371.05023 Theor. Appl. Graphs, Proc. Kalamazoo 1976, Lect. Notes Math. 642, 304-308 (1978). MSC: 05C99 PDFBibTeX XML Full Text: DOI
Whitesides, S. H. Projective planes of order 10 have no collineations of order 11. (English) Zbl 0338.05015 Proc. 7th southeast. Conf. Comb., Graph Theory, Comput.; Baton Rouge 1976, 515-526 (1976). MSC: 05B25 51E20 PDFBibTeX XML