Kratsch, Dieter; Müller, Haiko Colouring AT-free graphs. (English) Zbl 1365.68287 Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 707-718 (2012). MSC: 68Q25 05C15 05C85 PDFBibTeX XMLCite \textit{D. Kratsch} and \textit{H. Müller}, Lect. Notes Comput. Sci. 7501, 707--718 (2012; Zbl 1365.68287) Full Text: DOI
Kratsch, Dieter; Müller, Haiko On a property of minimal triangulations. (English) Zbl 1205.05122 Discrete Math. 309, No. 6, 1724-1729 (2009). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{D. Kratsch} and \textit{H. Müller}, Discrete Math. 309, No. 6, 1724--1729 (2009; Zbl 1205.05122) Full Text: DOI
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan Feedback vertex set on AT-free graphs. (English) Zbl 1152.68044 Discrete Appl. Math. 156, No. 10, 1936-1947 (2008). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{D. Kratsch} et al., Discrete Appl. Math. 156, No. 10, 1936--1947 (2008; Zbl 1152.68044) Full Text: DOI
Brandstädt, Andreas (ed.); Kratsch, Dieter (ed.); Müller, Haiko (ed.) 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 \textit{A. Brandstädt} (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21--23, 2007. Revised papers. Berlin: Springer (2007; Zbl 1138.68002) Full Text: DOI
Bouchitté, V.; Kratsch, D.; Müller, H.; Todinca, I. On treewidth approximations. (English) Zbl 1035.05087 Discrete Appl. Math. 136, No. 2-3, 183-196 (2004). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{V. Bouchitté} et al., Discrete Appl. Math. 136, No. 2--3, 183--196 (2004; Zbl 1035.05087) Full Text: DOI
Fomin, Fedor V.; Kratsch, Dieter; Müller, Haiko Algorithms for graphs with small octopus. (English) Zbl 1032.05123 Discrete Appl. Math. 134, No. 1-3, 105-128 (2004). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 134, No. 1--3, 105--128 (2004; Zbl 1032.05123) Full Text: DOI
Kratsch, Dieter; Müller, Haiko; Todinca, Ioan 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 \textit{D. Kratsch} et al., Lect. Notes Comput. Sci. 2880, 309--321 (2003; Zbl 1255.05188) Full Text: DOI
Kratsch, Dieter; Le, Hoàng-Oanh; Müller, Haiko; Prisner, Erich; Wagner, Dorothea Additive tree spanners. (English) Zbl 1041.05024 SIAM J. Discrete Math. 17, No. 2, 332-340 (2003). MSC: 05C12 05C85 68R10 68Q20 90B80 PDFBibTeX XMLCite \textit{D. Kratsch} et al., SIAM J. Discrete Math. 17, No. 2, 332--340 (2003; Zbl 1041.05024) Full Text: DOI
Fomin, Fedor V.; Kratsch, Dieter; Müller, Haiko On the domination search number. (English) Zbl 1019.68076 Discrete Appl. Math. 127, No. 3, 565-580 (2003). MSC: 68R10 05C69 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 127, No. 3, 565--580 (2003; Zbl 1019.68076) Full Text: DOI
Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. (English) Zbl 1009.68099 Algorithmica 32, No. 4, 594-610 (2002). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Algorithmica 32, No. 4, 594--610 (2002; Zbl 1009.68099) Full Text: DOI
Bouchitté, Vincent; Kratsch, Dieter; Müller, Haiko; Todinca, Ioan 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 \textit{V. Bouchitté} et al., Electron. Notes Discrete Math. 8, 98--101 (2001; Zbl 1412.05055) Full Text: Link
Kloks, Ton; Kratsch, Dieter; Müller, Haiko On the structure of graphs with bounded asteroidal number. (English) Zbl 0989.05059 Graphs Comb. 17, No. 2, 295-306 (2001). Reviewer: Ortrud R.Oellermann (Winnipeg) MSC: 05C35 05C69 PDFBibTeX XMLCite \textit{T. Kloks} et al., Graphs Comb. 17, No. 2, 295--306 (2001; Zbl 0989.05059) Full Text: DOI
Babel, Luitpold; Kloks, Ton; Kratochvil, Jan; Kratsch, Dieter; Müller, Haiko; Olariu, Stephan Efficient algorithms for graphs with few \(P_4\)’s. (English) Zbl 0980.05045 Discrete Math. 235, No. 1-3, 29-51 (2001). Reviewer: Zhi-Hong Chen (Indianapolis) MSC: 05C85 05C70 05C69 05C15 68R10 PDFBibTeX XMLCite \textit{L. Babel} et al., Discrete Math. 235, No. 1--3, 29--51 (2001; Zbl 0980.05045) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko Finding and counting small induced subgraphs efficiently. (English) Zbl 1339.05394 Inf. Process. Lett. 74, No. 3-4, 115-121 (2000). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Inf. Process. Lett. 74, No. 3--4, 115--121 (2000; Zbl 1339.05394) Full Text: DOI Link
Kloks, Ton; Kratsch, Dieter; Le Borgne, Yvan; Müller, Haiko Bandwidth of split and circular permutation graphs. (English) Zbl 0988.68125 Brandes, Ulrik (ed.) et al., Graph-theoretic concepts in computer science. 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1928, 243-254 (2000). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 1928, 243--254 (2000; Zbl 0988.68125)
Fomin, Fedor; Kratsch, Dieter; Müller, Haiko On the domination search number. (English) Zbl 0989.05083 Brandes, Ulrik (ed.) et al., Graph-theoretic concepts in computer science. 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1928, 161-171 (2000). MSC: 05C69 91A43 PDFBibTeX XMLCite \textit{F. Fomin} et al., Lect. Notes Comput. Sci. 1928, 161--171 (2000; Zbl 0989.05083)
Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Kratsch, Dieter; Müller, Haiko Degree-preserving trees. (English) Zbl 0938.90065 Networks 35, No. 1, 26-39 (2000). MSC: 90C35 05C85 05C05 90C60 PDFBibTeX XMLCite \textit{H. Broersma} et al., Networks 35, No. 1, 26--39 (2000; Zbl 0938.90065) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko 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 \textit{T. Kloks} et al., Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1039.05534) Full Text: Link
Deogun, Jitender S.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko On the vertex ranking problem for trapezoid, circular-arc and other graphs. (English) Zbl 0937.68093 Discrete Appl. Math. 98, No. 1-2, 39-63 (1999). MSC: 68R10 PDFBibTeX XMLCite \textit{J. S. Deogun} et al., Discrete Appl. Math. 98, No. 1--2, 39--63 (1999; Zbl 0937.68093) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko Approximating the bandwidth for asteroidal triple-free graphs. (English) Zbl 0951.68113 J. Algorithms 32, No. 1, 41-57 (1999). MSC: 68R10 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{T. Kloks} et al., J. Algorithms 32, No. 1, 41--57 (1999; Zbl 0951.68113) Full Text: DOI
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko Independent sets in asteroidal triple-free graphs. (English) Zbl 0918.68072 SIAM J. Discrete Math. 12, No. 2, 276-287 (1999). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{H. Broersma} et al., SIAM J. Discrete Math. 12, No. 2, 276--287 (1999; Zbl 0918.68072) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko Bandwidth of chain graphs. (English) Zbl 1339.05393 Inf. Process. Lett. 68, No. 6, 313-315 (1998). MSC: 05C85 05C78 PDFBibTeX XMLCite \textit{T. Kloks} et al., Inf. Process. Lett. 68, No. 6, 313--315 (1998; Zbl 1339.05393) Full Text: DOI Link
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko 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 \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 1517, 88--99 (1998; Zbl 0928.68086)
Broersma, Hajo; Huck, Andreas; Kloks, Ton; Koppius, Otto; Kratsch, Dieter; Müller, Haiko; Tuinstra, Hilde 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). Reviewer: H.Bodlaender (Utrecht) MSC: 05C05 05C85 68R10 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 1450, 713--721 (1998; Zbl 0916.05019)
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko Treewidth and minimum fill-in on \(d\)-trapezoid graphs. (English) Zbl 0905.68101 J. Graph Algorithms Appl. 2, Paper No. 5, 1-23 (1998). MSC: 68R10 68Q25 68W10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., J. Graph Algorithms Appl. 2, Paper No. 5, 1--23 (1998; Zbl 0905.68101) Full Text: DOI EuDML
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt Rankings of graphs. (English) Zbl 0907.68137 SIAM J. Discrete Math. 11, No. 1, 168-181 (1998). MSC: 68R10 05C15 05C78 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., SIAM J. Discrete Math. 11, No. 1, 168--181 (1998; Zbl 0907.68137) Full Text: DOI
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko 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). MSC: 05C85 05C69 68R10 68W40 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 1256, 760--770 (1997; Zbl 1401.05278) Full Text: DOI
Kloks, Ton; Kratsch, Dieter; Müller, Haiko Asteroidal sets in graphs. (English) Zbl 0897.05076 Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 229-241 (1997). MSC: 05C85 68Q25 05C75 68R10 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 1335, 229--241 (1997; Zbl 0897.05076)
Kratsch, Dieter; Kloks, Ton; Müller, Haiko Measuring the vulnerability for classes of intersection graphs. (English) Zbl 0881.05118 Discrete Appl. Math. 77, No. 3, 259-270 (1997). Reviewer: J.Pallo (Dijon) MSC: 05C85 05C35 PDFBibTeX XMLCite \textit{D. Kratsch} et al., Discrete Appl. Math. 77, No. 3, 259--270 (1997; Zbl 0881.05118) Full Text: DOI Link
Kratsch, Dieter; Lehel, Jenö; Müller, Haiko Toughness, hamiltonicity and split graphs. (English) Zbl 0855.05079 Discrete Math. 150, No. 1-3, 231-245 (1996). Reviewer: A.Brandstädt (Rostock) MSC: 05C45 68R10 PDFBibTeX XMLCite \textit{D. Kratsch} et al., Discrete Math. 150, No. 1--3, 231--245 (1996; Zbl 0855.05079) Full Text: DOI
Kloks, T.; Kratsch, D.; Müller, H. Finding and counting small induced subgraphs efficiently. (English) Zbl 07810353 Nagl, Manfred (ed.), Graph-theoretic concepts in computer science. 21st international workshop, WG ’95, Aachen, Germany, June 20–22, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1017, 14-23 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 1017, 14--23 (1995; Zbl 07810353) Full Text: DOI
Bodlaender, H. L.; Deogun, J. S.; Jansen, K.; Kloks, T.; Kratsch, D.; Müller, H.; Tuza, Zs. 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 \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 903, 292--304 (1995; Zbl 1528.68274) Full Text: DOI
Kloks, T.; Kratsch, D.; Müller, H. 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). MSC: 05C75 05C85 05C76 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 903, 106--120 (1995; Zbl 07784119) Full Text: DOI
Kloks, T.; Kratsch, D.; Müller, H. Approximating the bandwidth for asteroidal triple-free graphs. (English) Zbl 1512.68235 Spirakis, Paul (ed.), Algorithms – ESA ’95. 3rd annual European symposium, Corfu, Greece, September 25–27, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 979, 434-447 (1995). MSC: 68R10 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 979, 434--447 (1995; Zbl 1512.68235) Full Text: DOI
Deogun, J. S.; Kloks, T.; Kratsch, D.; Müller, H. On vertex ranking for permutation and other graphs. (English) Zbl 0941.05516 Enjalbert, Patrice (ed.) et al., STACS 94. 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 775, 747-758 (1994). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{J. S. Deogun} et al., Lect. Notes Comput. Sci. 775, 747--758 (1994; Zbl 0941.05516)
Damaschke, Peter; Müller, Haiko; Kratsch, Dieter Domination in convex and chordal bipartite graphs. (English) Zbl 0706.68055 Inf. Process. Lett. 36, No. 5, 231-236 (1990). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{P. Damaschke} et al., Inf. Process. Lett. 36, No. 5, 231--236 (1990; Zbl 0706.68055) Full Text: DOI