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; 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
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
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
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
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