Bodlaender, Hans L. From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability. (English) Zbl 07556557 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 15-25 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 13174, 15--25 (2022; Zbl 07556557) Full Text: DOI
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 12911, 15--27 (2021; Zbl 07538564) Full Text: DOI arXiv
Bodlaender, Hans L. How connected is your network. (Dutch) Zbl 1386.90021 Nieuw Arch. Wiskd. (5) 18, No. 1, 40-46 (2017). MSC: 90B10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Nieuw Arch. Wiskd. (5) 18, No. 1, 40--46 (2017; Zbl 1386.90021) Full Text: Link
Bodlaender, Hans L. Lower bounds for kernelization. (English) Zbl 1456.68063 Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 1-14 (2014). MSC: 68Q27 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 8894, 1--14 (2014; Zbl 1456.68063) Full Text: DOI
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 7370, 196--227 (2012; Zbl 1358.68119) Full Text: DOI
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 5917, 17--37 (2009; Zbl 1273.68158) Full Text: DOI
Bodlaender, Hans L. 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). MSC: 05C75 05C05 05C85 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 4474, 11--25 (2007; Zbl 1201.05076) Full Text: DOI
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 4393, 320--331 (2007; Zbl 1186.68217) Full Text: DOI Link
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 4271, 1--14 (2006; Zbl 1167.68404) Full Text: DOI
Bodlaender, Hans L. 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 \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 3381, 1--16 (2005; Zbl 1117.68451) Full Text: DOI
Bodlaender, Hans L. (ed.) 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). MSC: 00B25 68-06 05-06 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} (ed.), Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19--21, 2003. Revised papers. Berlin: Springer (2003; Zbl 1029.00043) Full Text: DOI Link
Bodlaender, Hans L. Necessary edges in \(k\)-chordalisations of graphs. (English) Zbl 1031.05120 J. Comb. Optim. 7, No. 3, 283-290 (2003). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Comb. Optim. 7, No. 3, 283--290 (2003; Zbl 1031.05120) Full Text: DOI
Bodlaender, Hans L. The algorithmic theory of treewidth. (English) Zbl 1412.05183 Rusu, Irena (ed.), Proceedings of the 6th international conference on graph theory, Marseille-Luminy, France, August 28–September 2, 2000. Amsterdam: Elsevier. Electron. Notes Discrete Math. 5, 27-30 (2000). MSC: 05C85 05C12 05C10 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Electron. Notes Discrete Math. 5, 27--30 (2000; Zbl 1412.05183) Full Text: Link
Bodlaender, H. L. (ed.) Special issue: Treewidth. (English) Zbl 0955.00018 Algorithmica 27, No. 3-4, 209-430 (2000). MSC: 00B15 68-06 05-06 PDFBibTeX XMLCite \textit{H. L. Bodlaender} (ed.), Algorithmica 27, No. 3--4, 209--430 (2000; Zbl 0955.00018) Full Text: DOI
Bodlaender, Hans L. A note on domino treewidth. (English) Zbl 0930.05054 Discrete Math. Theor. Comput. Sci. 3, No. 4, 141-150 (1999). MSC: 05C35 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Discrete Math. Theor. Comput. Sci. 3, No. 4, 141--150 (1999; Zbl 0930.05054) Full Text: EuDML EMIS
Bodlaender, Hans L. A partial k-arboretum of graphs with bounded treewidth. (English) Zbl 0912.68148 Theor. Comput. Sci. 209, No. 1-2, 1-45 (1998). MSC: 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Theor. Comput. Sci. 209, No. 1--2, 1--45 (1998; Zbl 0912.68148) Full Text: DOI
Bodlaender, Hans L. Treewidth: Algorithmic techniques and results. (English) Zbl 0941.05057 Privara, L. (ed.) et al., Mathematical foundations of computer science 1997. 22nd international symposium, MFCS ’97, Bratislava, Slovakia, August 25-29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1295, 19-36 (1997). Reviewer: G.Gutin (Odense) MSC: 05C85 05C83 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 1295, 19--36 (1997; Zbl 0941.05057)
Bodlaender, Hans L. A linear-time algorithm for finding tree-decompositions of small treewidth. (English) Zbl 0864.68074 SIAM J. Comput. 25, No. 6, 1305-1317 (1996). MSC: 68R10 05C85 05C05 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, SIAM J. Comput. 25, No. 6, 1305--1317 (1996; Zbl 0864.68074) Full Text: DOI
Bodlaender, Hans L. Dynamic algorithms for graphs with treewidth 2. (English) Zbl 1528.68271 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 112-124 (1994). MSC: 68R10 05C05 05C85 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 790, 112--124 (1994; Zbl 1528.68271) Full Text: DOI
Bodlaender, Hans L. On reduction algorithms for graphs with small treewidth. (English) Zbl 1528.68270 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 45-56 (1994). MSC: 68R10 05C85 68W10 68W20 68W40 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 790, 45--56 (1994; Zbl 1528.68270) Full Text: DOI
Bodlaender, Hans L. Improved self-reduction algorithms for graphs with bounded treewidth. (English) Zbl 0941.68652 Discrete Appl. Math. 54, No. 2-3, 101-115 (1994). MSC: 68R10 68Q25 05C35 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Discrete Appl. Math. 54, No. 2--3, 101--115 (1994; Zbl 0941.68652) Full Text: DOI
Bodlaender, Hans L. On disjoint cycles. (English) Zbl 0803.05030 Int. J. Found. Comput. Sci. 5, No. 1, 59-68 (1994). Reviewer: H.Müller (Jena) MSC: 05C38 68R10 05C85 68Q25 68W10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Int. J. Found. Comput. Sci. 5, No. 1, 59--68 (1994; Zbl 0803.05030) Full Text: DOI
Bodlaender, Hans L. 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). MSC: 05C85 05C05 05C83 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, in: 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). 226--234 (1993; Zbl 1310.05194) Full Text: DOI Link
Bodlaender, Hans L. A tourist guide through treewidth. (English) Zbl 0804.68101 Acta Cybern. 11, No. 1-2, 1-21 (1993). MSC: 68R10 05C85 00A15 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Acta Cybern. 11, No. 1--2, 1--21 (1993; Zbl 0804.68101)
Bodlaender, Hans L. Kayles on special classes of graphs – An application of Sprague-Grundy theory. (English) Zbl 0789.68104 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 18th international workshop, WG ’92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 657, 90-102 (1993). MSC: 68R10 68W15 91A43 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 657, 90--102 (1993; Zbl 0789.68104)
Bodlaender, Hans L. Complexity of path-forming games. (English) Zbl 0776.90100 Theor. Comput. Sci. 110, No. 1, 215-245 (1993). Reviewer: H.L.Bodlaender (Utrecht) MSC: 91A43 68Q25 90C39 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Theor. Comput. Sci. 110, No. 1, 215--245 (1993; Zbl 0776.90100) Full Text: DOI
Bodlaender, Hans L. On linear time minor tests with depth-first search. (English) Zbl 0764.68107 J. Algorithms 14, No. 1, 1-23 (1993). MSC: 68R10 68Q25 90C35 05C38 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Algorithms 14, No. 1, 1--23 (1993; Zbl 0764.68107) Full Text: DOI
Bodlaender, Hans L. On disjoint cycles. (English) Zbl 0815.05040 Graph-theoretic concepts in computer science, Proc. 17th Int. Workshop, Fischbachau/Ger. 1991, Lect. Notes Comput. Sci. 570, 230-238 (1992). MSC: 05C38 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 570, 230--238 (1992; Zbl 0815.05040)
Bodlaender, Hans L. On the complexity of some coloring games. (English) Zbl 0770.90098 Graph-theoretic concepts in computer science, Proc. Int. Workshop, Berlin/ Germany 1990, Lect. Notes Comput. Sci. 484, 30-40 (1992). MSC: 91A43 68Q25 90C60 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 484, 30--40 (1992; Zbl 0770.90098)
Bodlaender, Hans L. New lower bound techniques for distributed leader finding and other problems on rings of processors. (English) Zbl 0732.68048 Theor. Comput. Sci. 81, No. 2, 237-256 (1991). MSC: 68Q25 68M10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Theor. Comput. Sci. 81, No. 2, 237--256 (1991; Zbl 0732.68048) Full Text: DOI Link
Bodlaender, Hans L. Some lower bound results for decentralized extrema-finding in rings of processors. (English) Zbl 0719.68029 J. Comput. Syst. Sci. 42, No. 1, 97-118 (1991). Reviewer: C.H.Cap (Zürich) MSC: 68W15 68M10 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Comput. Syst. Sci. 42, No. 1, 97--118 (1991; Zbl 0719.68029) Full Text: DOI Link
Bodlaender, Hans L. On the complexity of some coloring games. (English) Zbl 0753.05061 Int. J. Found. Comput. Sci. 2, No. 2, 133-147 (1991). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Int. J. Found. Comput. Sci. 2, No. 2, 133--147 (1991; Zbl 0753.05061) Full Text: DOI
Bodlaender, Hans L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. (English) Zbl 0716.68042 J. Algorithms 11, No. 4, 631-643 (1990). Reviewer: J.Vyskoc MSC: 68Q25 68R10 90C39 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, J. Algorithms 11, No. 4, 631--643 (1990; Zbl 0716.68042) Full Text: DOI
Bodlaender, Hans L. The complexity of finding uniform emulations on paths and ring networks. (English) Zbl 0705.68062 Inf. Comput. 86, No. 1, 87-106 (1990). MSC: 68Q25 68R10 03D15 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Inf. Comput. 86, No. 1, 87--106 (1990; Zbl 0705.68062) Full Text: DOI
Bodlaender, Hans L. Improved self-reduction algorithms for graphs with bounded treewidth. (English) Zbl 0768.68033 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 232-244 (1990). MSC: 68Q25 68R10 05C70 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 411, 232--244 (1990; Zbl 0768.68033)
Bodlaender, Hans L. NC-algorithms for graphs with small treewidth. (English) Zbl 07810416 Van Leeuwen, Jan (ed.), Graph-theoretic concepts in computer sciences. 14th international workshop, WG ’88, Amsterdam, The Netherlands, June 15–17, 1988. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 344, 1-10 (1989). MSC: 68R10 05C05 05C85 68Q25 68W10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 344, 1--10 (1989; Zbl 07810416) Full Text: DOI
Bodlaender, Hans L. Achromatic number is NP-complete for cographs and interval graphs. (English) Zbl 0684.68046 Inf. Process. Lett. 31, No. 3, 135-138 (1989). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Inf. Process. Lett. 31, No. 3, 135--138 (1989; Zbl 0684.68046) Full Text: DOI Link
Bodlaender, Hans L. On linear time minor tests and depth first search. (English) Zbl 0766.68102 Algorithms and data structures, Proc. workshop WADS ’89, Ottawa/Canada 1989, Lect. Notes Comput. Sci. 382, 577-590 (1989). MSC: 68R10 68Q25 68P10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 382, 577--590 (1989; Zbl 0766.68102)
Bodlaender, H. L. Some classes of graphs with bounded treewidth. (English) Zbl 0684.68047 Bull. EATCS 36, 116-126 (1988). Reviewer: R.Klette MSC: 68Q25 05C38 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Bull. EATCS 36, 116--126 (1988; Zbl 0684.68047)
Bodlaender, Hans L. The complexity of finding uniform emulations on fixed graphs. (English) Zbl 0656.68045 Inf. Process. Lett. 29, No. 3, 137-141 (1988). MSC: 68Q25 68R10 68N25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Inf. Process. Lett. 29, No. 3, 137--141 (1988; Zbl 0656.68045) Full Text: DOI Link
Bodlaender, Hans L. A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. (English) Zbl 0652.68052 Inf. Process. Lett. 27, No. 6, 287-290 (1988). MSC: 68Q25 68N25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Inf. Process. Lett. 27, No. 6, 287--290 (1988; Zbl 0652.68052) Full Text: DOI Link
Bodlaender, Hans L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. (English) Zbl 0651.68079 Algorithm theory, Proc. 1st Scand. Workshop, Halmstad/Sweden 1988, Lect. Notes Comput. Sci. 318, 223-232 (1988). MSC: 68R10 68Q25 PDFBibTeX XML
Bodlaender, Hans L. Dynamic programming on graphs with bounded treewidth. (English) Zbl 0649.68039 Automata, languages and programming, Proc. 15th Int. Colloq., Tampere/Finn. 1988, Lect. Notes Comput. Sci. 317, 105-118 (1988). MSC: 68Q25 68R10 68T20 PDFBibTeX XML
Bodlaender, H. L. Distributed computing: structure and complexity. (English) Zbl 0632.68002 CWI Tracts, 43. Centrum voor Wiskunde en Informatica. Amsterdam: Stichting Mathematisch Centrum. VI, 294 p.; Dfl. 45.40 (1987). Reviewer: R.Janicki MSC: 68-02 68N25 68W99 PDFBibTeX XML