×

Found 36 Documents (Results 1–36)

Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. (English) Zbl 1138.68002

Lecture Notes in Computer Science 4769. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). xiii, 341 p. (2007).
MSC:  68-06 68R10 00B25
PDFBibTeX XMLCite
Full Text: DOI

Feedback vertex set and longest induced path on AT-free graphs. (English) Zbl 1255.05188

Bodlaender, Hans L. (ed.), Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19–21, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20452-0/pbk). Lect. Notes Comput. Sci. 2880, 309-321 (2003).
MSC:  05C85 05C38 68R10
PDFBibTeX XMLCite
Full Text: DOI

On treewidth approximations. (English) Zbl 1412.05055

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 98-101 (2001).
MSC:  05C12 05C70
PDFBibTeX XMLCite
Full Text: Link

On the structure of graphs with bounded asteroidal number. (English) Zbl 1039.05534

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  05C85 90C35
PDFBibTeX XMLCite
Full Text: Link

A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking. (English) Zbl 0928.68086

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 88-99 (1998).
MSC:  68R10
PDFBibTeX XMLCite

Degree-preserving forests. (English) Zbl 0916.05019

Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 713-721 (1998).
MSC:  05C05 05C85 68R10
PDFBibTeX XMLCite

Independent sets in asteroidal triple-free graphs. (English) Zbl 1401.05278

Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 760-770 (1997).
PDFBibTeX XMLCite
Full Text: DOI

Rankings of graphs. (English) Zbl 1528.68274

Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 292-304 (1995).
MSC:  68R10 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Dominoes. (English) Zbl 07784119

Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 106-120 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field