Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. (English) Zbl 1421.68082 Algorithmica 81, No. 7, 2795-2828 (2019). MSC: 68Q25 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 81, No. 7, 2795--2828 (2019; Zbl 1421.68082) Full Text: DOI arXiv Link
Kammer, Frank; Kratsch, Dieter; Laudahn, Moritz Space-efficient biconnected components and recognition of outerplanar graphs. (English) Zbl 1444.68077 Algorithmica 81, No. 3, 1180-1204 (2019). MSC: 68Q25 05C10 05C40 05C85 PDFBibTeX XMLCite \textit{F. Kammer} et al., Algorithmica 81, No. 3, 1180--1204 (2019; Zbl 1444.68077) Full Text: DOI Link
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. (English) Zbl 1383.05162 Algorithmica 80, No. 2, 714-741 (2018). MSC: 05C30 05C69 05C85 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 80, No. 2, 714--741 (2018; Zbl 1383.05162) Full Text: DOI arXiv
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël Finding shortest paths between graph colourings. (English) Zbl 1350.68148 Algorithmica 75, No. 2, 295-321 (2016). MSC: 68Q25 05C15 05C85 PDFBibTeX XMLCite \textit{M. Johnson} et al., Algorithmica 75, No. 2, 295--321 (2016; Zbl 1350.68148) Full Text: DOI Link
Kratsch, Dieter (ed.); Todinca, Ioan (ed.) Guest editorial: Selected papers from WG 2014. (English) Zbl 1339.00039 Algorithmica 75, No. 1, 186-186 (2016). MSC: 00B25 68-06 68R10 PDFBibTeX XMLCite \textit{D. Kratsch} (ed.) and \textit{I. Todinca} (ed.), Algorithmica 75, No. 1, 186--186 (2016; Zbl 1339.00039) Full Text: DOI
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël Parameterized algorithms for finding square roots. (English) Zbl 1332.05136 Algorithmica 74, No. 2, 602-629 (2016). MSC: 05C85 05C76 68W40 PDFBibTeX XMLCite \textit{M. Cochefert} et al., Algorithmica 74, No. 2, 602--629 (2016; Zbl 1332.05136) Full Text: DOI arXiv Link
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. (English) Zbl 1330.05118 Algorithmica 72, No. 3, 836-859 (2015). Reviewer: Nasrin Dehgardi (Sirjan) MSC: 05C69 05C76 05C30 05C85 05D15 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 72, No. 3, 836--859 (2015; Zbl 1330.05118) Full Text: DOI
Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël List coloring in the absence of a linear forest. (English) Zbl 1307.05068 Algorithmica 71, No. 1, 21-35 (2015). MSC: 05C15 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{J.-F. Couturier} et al., Algorithmica 71, No. 1, 21--35 (2015; Zbl 1307.05068) Full Text: DOI Link
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve Enumerating minimal subset feedback vertex sets. (English) Zbl 1303.05189 Algorithmica 69, No. 1, 216-231 (2014). MSC: 05C85 05C30 68Q17 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 69, No. 1, 216--231 (2014; Zbl 1303.05189) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049 Algorithmica 65, No. 3, 584-604 (2013). MSC: 05C22 05C35 05C05 05C85 90C39 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 65, No. 3, 584--604 (2013; Zbl 1269.05049) Full Text: DOI
Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu On independent sets and bicliques in graphs. (English) Zbl 1239.05101 Algorithmica 62, No. 3-4, 637-658 (2012). MSC: 05C35 05C69 05C85 05C30 PDFBibTeX XMLCite \textit{S. Gaspers} et al., Algorithmica 62, No. 3--4, 637--658 (2012; Zbl 1239.05101) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Branch and recharge: exact algorithms for generalized domination. (English) Zbl 1244.68082 Algorithmica 61, No. 2, 252-273 (2011). Reviewer: Ludovit Niepel (Safat) MSC: 68W05 05C85 05C69 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 61, No. 2, 252--273 (2011; Zbl 1244.68082) Full Text: DOI
Havet, Frédéric; Klazar, Martin; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Exact algorithms for \(L(2,1)\)-labeling of graphs. (English) Zbl 1213.68455 Algorithmica 59, No. 2, 169-194 (2011). MSC: 68R10 05C78 PDFBibTeX XMLCite \textit{F. Havet} et al., Algorithmica 59, No. 2, 169--194 (2011; Zbl 1213.68455) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter Solving connected dominating set faster than \(2^n\). (English) Zbl 1170.68030 Algorithmica 52, No. 2, 153-166 (2008). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 52, No. 2, 153--166 (2008; Zbl 1170.68030) 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