×

Found 7 Documents (Results 1–7)

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

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

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).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field