×

Found 5 Documents (Results 1–5)

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field