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