×

Found 44 Documents (Results 1–44)

Parameterized complexity of bandwidth of caterpillars and weighted path emulation. (English) Zbl 07538564

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 15-27 (2021).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fixed-parameter tractability of treewidth and pathwidth. (English) Zbl 1358.68119

Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 196-227 (2012).
MSC:  68Q25 05C85
PDFBibTeX XMLCite
Full Text: DOI

Kernelization: new upper and lower bound techniques. (English) Zbl 1273.68158

Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 17-37 (2009).
MSC:  68Q25 68R05
PDFBibTeX XMLCite
Full Text: DOI

Treewidth: structure and algorithms. (English) Zbl 1201.05076

Prencipe, Giuseppe (ed.) et al., Structural information and communication complexity. 14th international colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5–8, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72918-1/pbk). Lecture Notes in Computer Science 4474, 11-25 (2007).
PDFBibTeX XMLCite
Full Text: DOI

A cubic kernel for feedback vertex set. (English) Zbl 1186.68217

Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 320-331 (2007).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Treewidth: Characterizations, applications, and computations. (English) Zbl 1167.68404

Fomin, Fedor V. (ed.), Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22–24, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48381-6/pbk). Lecture Notes in Computer Science 4271, 1-14 (2006).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI

Discovering treewidth. (English) Zbl 1117.68451

Vojtáš, Peter (ed.) et al., SOFSEM 2005: Theory and practice of computer science. 31st conference on current trends in theory and practice of computer science, Liptovský Ján, Slovakia, January 22–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24302-X/pbk). Lecture Notes in Computer Science 3381, 1-16 (2005).
MSC:  68R10 68T20 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19–21, 2003. Revised papers. (English) Zbl 1029.00043

Lecture Notes in Computer Science. 2880. Berlin: Springer. xi, 386 p. (2003).
PDFBibTeX XMLCite
Full Text: DOI Link

A linear time algorithm for finding tree-decompositions of small treewidth. (English) Zbl 1310.05194

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 226-234 (1993).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Author

all top 5

Year of Publication

all top 3

Main Field

Software