Document Search Results

Polynomial Turing compressions for some graph problems parameterized by modular-width. (English) Zbl 07900289

Wu, Weili (ed.) et al., Computing and combinatorics. 29th international conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14422, 127-140 (2024).

MSC: 68Rxx

Cite Review PDF

Full Text: DOI arXiv

Donkers, Huib; Jansen, Bart M. P.

Preprocessing to reduce the search space: antler structures for feedback vertex set. (English) Zbl 07873726

J. Comput. Syst. Sci. 144, Article ID 103532, 26 p. (2024).

MSC: 68-XX

Cite Review PDF

Full Text: DOI

Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav

Polynomial kernel for interval vertex deletion. (English) Zbl 07753162

ACM Trans. Algorithms 19, No. 2, Article No. 11, 68 p. (2023).

MSC: 68-XX

Cite Review PDF

Full Text: DOI

Eiben, Eduard; Majumdar, Diptapriyo; Ramanujan, M. S.

On the lossy kernelization for connected treedepth deletion set. (English) Zbl 07682411

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 201-214 (2022).

MSC: 68R10

Cite Review PDF

Full Text: DOI

Derbisz, Jan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily

A polynomial kernel for bipartite permutation vertex deletion. (English) Zbl 07608290

Algorithmica 84, No. 11, 3246-3275 (2022).

MSC: 68Q27 68R10

Cite Review PDF

Full Text: DOI

Bentert, Matthias; van Bevern, René; Nichterlein, André; Niedermeier, Rolf; Smirnov, Pavel V.

Parameterized algorithms for power-efficiently connecting wireless sensor networks: theory and experiments. (English) Zbl 1492.90031

INFORMS J. Comput. 34, No. 1, 55-75 (2022).

MSC: 90B18

Cite Review PDF

Full Text: DOI arXiv

Luo, Weidong

On some FPT problems without polynomial Turing compressions. (English) Zbl 1533.68115

Theor. Comput. Sci. 905, 87-98 (2022).

MSC: 68Q27

Cite Review PDF

Full Text: DOI

Jain, Pallavi; Kanesh, Lawqueen; Roy, Shivesh Kumar; Saurabh, Saket; Sharma, Roohani

Circumventing connectivity for kernelization. (English) Zbl 07667138

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 300-313 (2021).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Donkers, Huib; Jansen, Bart M. P.

Preprocessing to reduce the search space: antler structures for feedback vertex set. (English) Zbl 07538563

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, 1-14 (2021).

MSC: 68R10

Cite Review PDF

Full Text: DOI arXiv

OA License

Donkers, Huib; Jansen, Bart M. P.

A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion. (English) Zbl 1482.68110

J. Comput. Syst. Sci. 119, 164-182 (2021).

Reviewer: K. Subramani (Morgantown)

MSC: 68Q27 05C35 68R10

Cite Review PDF

Full Text: DOI

OA License

van Bevern, René; Fluschnik, Till; Tsidulko, Oxana Yu.

On approximate data reduction for the rural postman problem: theory and experiments. (English) Zbl 07769699

Networks 76, No. 4, 485-508 (2020).

MSC: 90Cxx

Cite Review PDF

Full Text: DOI arXiv

van Bevern, René; Fluschnik, Till; Tsidulko, Oxana Yu.

Parameterized algorithms and data reduction for the short secluded \(s\)-\(t\)-path problem. (English) Zbl 1533.68116

Networks 75, No. 1, 34-63 (2020).

MSC: 68Q27 05C38 05C85 68Q17 68R10

Cite Review PDF

Full Text: DOI arXiv

Hols, Eva-Maria C.; Kratsch, Stefan; Pieterse, Astrid

Approximate Turing kernelization for problems parameterized by treewidth. (English) Zbl 07651199

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 60, 23 p. (2020).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI arXiv

Hermelin, Danny

Hans Bodlaender and the theory of kernelization lower bounds. (English) Zbl 07604202

Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 18-21 (2020).

MSC: 68-XX

Cite Review PDF

Full Text: DOI

Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket

On the approximate compressibility of connected vertex cover. (English) Zbl 1455.68144

Algorithmica 82, No. 10, 2902-2926 (2020).

MSC: 68R10 05C70 68Q27

Cite Review PDF

Full Text: DOI arXiv

Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus

Alternative parameterizations of Metric Dimension. (English) Zbl 1436.68146

Theor. Comput. Sci. 806, 133-143 (2020).

MSC: 68Q27 05C12 68R10 68W20

Cite Review PDF

Full Text: DOI arXiv

Ramanujan, M. S.

An approximate kernel for connected feedback vertex set. (English) Zbl 07525514

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 77, 14 p. (2019).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin

Turing kernelization for finding long paths in graph classes excluding a topological minor. (English) Zbl 1430.68219

Algorithmica 81, No. 10, 3936-3967 (2019).

MSC: 68R10 05C83 68Q27

Cite Review PDF

Full Text: DOI arXiv

OA License

Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin

Turing kernelization for finding long paths in graphs excluding a topological minor. (English) Zbl 1443.68133

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 23, 13 p. (2018).

MSC: 68R10 05C38 05C83 68Q27

Cite Review PDF

Full Text: DOI

Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo; Mouawad, Amer E.; Saurabh, Saket

Kernelization of cycle packing with relaxed disjointness constraints. (English) Zbl 1397.68088

SIAM J. Discrete Math. 32, No. 3, 1619-1643 (2018).

MSC: 68Q25 05C38 05C70 68Q17 68R10

Cite Review PDF

Full Text: DOI

Kratsch, Stefan; Sorge, Manuel

On kernelization and approximation for the vector connectivity problem. (English) Zbl 1372.68138

Algorithmica 79, No. 1, 96-138 (2017).

MSC: 68Q25 05C40 05C85 68W25 90B80

Cite Review PDF

Full Text: DOI arXiv Link

Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket

Lossy kernelization. (English) Zbl 1370.68136

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 224-237 (2017).

MSC: 68Q25 68Q17 68W25

Cite Review PDF

Full Text: DOI arXiv Link

Jansen, Bart M. P.

Turing kernelization for finding long paths and cycles in restricted graph classes. (English) Zbl 1356.68099

J. Comput. Syst. Sci. 85, 18-37 (2017).

MSC: 68Q25 05C38

Cite Review PDF

Full Text: DOI arXiv

Garnero, Valentin; Weller, Mathias

Parameterized certificate dispersal and its variants. (English) Zbl 1335.68104

Theor. Comput. Sci. 622, 66-78 (2016).

MSC: 68Q25 05C85 94A60

Cite Review PDF

Full Text: DOI

Found 24 Documents (Results 1–24)

Polynomial Turing compressions for some graph problems parameterized by modular-width. (English) Zbl 07900289

Preprocessing to reduce the search space: antler structures for feedback vertex set. (English) Zbl 07873726

Polynomial kernel for interval vertex deletion. (English) Zbl 07753162

On the lossy kernelization for connected treedepth deletion set. (English) Zbl 07682411

A polynomial kernel for bipartite permutation vertex deletion. (English) Zbl 07608290

Parameterized algorithms for power-efficiently connecting wireless sensor networks: theory and experiments. (English) Zbl 1492.90031

On some FPT problems without polynomial Turing compressions. (English) Zbl 1533.68115

Circumventing connectivity for kernelization. (English) Zbl 07667138

Preprocessing to reduce the search space: antler structures for feedback vertex set. (English) Zbl 07538563

A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion. (English) Zbl 1482.68110

On approximate data reduction for the rural postman problem: theory and experiments. (English) Zbl 07769699

Parameterized algorithms and data reduction for the short secluded \(s\)-\(t\)-path problem. (English) Zbl 1533.68116

Approximate Turing kernelization for problems parameterized by treewidth. (English) Zbl 07651199

Hans Bodlaender and the theory of kernelization lower bounds. (English) Zbl 07604202

On the approximate compressibility of connected vertex cover. (English) Zbl 1455.68144

Alternative parameterizations of Metric Dimension. (English) Zbl 1436.68146

An approximate kernel for connected feedback vertex set. (English) Zbl 07525514

Turing kernelization for finding long paths in graph classes excluding a topological minor. (English) Zbl 1430.68219

Turing kernelization for finding long paths in graphs excluding a topological minor. (English) Zbl 1443.68133

Kernelization of cycle packing with relaxed disjointness constraints. (English) Zbl 1397.68088

On kernelization and approximation for the vector connectivity problem. (English) Zbl 1372.68138

Lossy kernelization. (English) Zbl 1370.68136

Turing kernelization for finding long paths and cycles in restricted graph classes. (English) Zbl 1356.68099

Parameterized certificate dispersal and its variants. (English) Zbl 1335.68104

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field

Software