Found 10 Documents (Results 1–10)
Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem. (English) Zbl 07856021
Fernau, Henning (ed.) et al., Fundamentals of computation theory. 24th international symposium, FCT 2023, Trier, Germany, September 18–21, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14292, 221-233 (2023).
MSC:
68Qxx
Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153
Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020).
Parameterized complexity of fair feedback vertex set problem. (English) Zbl 07603926
Fernau, Henning (ed.), Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 250-262 (2020).
MSC:
68Qxx
Filter Results by …
Document Type
- Journal Articles (7)
- Collection Articles (3)
all
top 5
Author
- Knop, Dušan (3)
- Maity, Soumen (3)
- Otachi, Yota (3)
- Belmonte, Rémy (2)
- Kanesh, Lawqueen (2)
- Kim, Eun Jung (2)
- Koutecký, Martin (2)
- Lampis, Michael (2)
- Mitsou, Valia (2)
- Muluk, Komal (2)
- Saurabh, Saket (2)
- Gaikwad, Ajinkya (1)
- Gavenčiak, Tomáš (1)
- Gima, Tatsuya (1)
- Hanaka, Tesshu (1)
- Kawai, Kazuma (1)
- Masařík, Tomáš (1)
- Ono, Hirotaka (1)
- Toufar, Tomáš (1)
Software
- AIMMS (1)
