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