Document Search Results

Dewar, Megan (ed.) et al., Algorithms and models for the web graph. 18th international workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13894, 68-82 (2023).

Reviewer: Yilun Shang (Newcastle upon Tyne)

MSC: 92D30 91D30 05C90

Cite Review PDF

Full Text: DOI arXiv

Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi; Simonov, Kirill

Lossy kernelization of same-size clustering. (English) Zbl 07729118

Theory Comput. Syst. 67, No. 4, 785-824 (2023).

MSC: 68Wxx 68Qxx 05Cxx

Cite Review PDF

Full Text: DOI

OA License

Keiler, Lucas; Gomes Costa Lima, Carlos Vinicius; Maia, Ana Karolinna; Sampaio, Rudini; Sau, Ignasi

Target set selection with maximum activation time. (English) Zbl 1522.68409

Discrete Appl. Math. 338, 199-217 (2023).

MSC: 68R10 05C10 05C75 68Q27

Cite Review PDF

Full Text: DOI arXiv

Bliznets, Ivan; Sagunov, Danil

Solving target set selection with bounded thresholds faster than \(2^n\). (English) Zbl 1507.68223

Algorithmica 85, No. 2, 384-405 (2023).

MSC: 68R10 05C85 68Q25 68Q27

Cite Review PDF

Full Text: DOI

Hanaka, Tesshu; Kawai, Kazuma; Ono, Hirotaka

Computing \(L(p, 1)\)-labeling with combined parameters. (English) Zbl 1498.05233

J. Graph Algorithms Appl. 26, No. 2, 241-255 (2022).

MSC: 05C78 05C85 68Q27

Cite Review PDF

Full Text: DOI

OA License

Banerjee, Suman; Mathew, Rogers; Panolan, Fahad

Target set selection parameterized by vertex cover and more. (English) Zbl 1524.90325

Theory Comput. Syst. 66, No. 5, 996-1018 (2022).

MSC: 90C35 90C10 91D30 76R50 05C82

Cite Review PDF

Full Text: DOI arXiv

Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota

Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601

SIAM J. Discrete Math. 36, No. 3, 1761-1787 (2022).

MSC: 68R10 05C15 68Q17 68Q25 68Q27

Cite Review PDF

Full Text: DOI arXiv

Gavenčiak, Tomáš; Koutecký, Martin; Knop, Dušan

Integer programming in parameterized complexity: five miniatures. (English) Zbl 1510.90185

Discrete Optim. 44, Part 1, Article ID 100596, 33 p. (2022).

MSC: 90C10 05C15 05C85 68Q27 68R10

Cite Review PDF

Full Text: DOI

OA License

Luo, Junjie; Molter, Hendrik; Suchý, Ondřej

A parameterized complexity view on collapsing \(k\)-cores. (English) Zbl 1508.68269

Theory Comput. Syst. 65, No. 8, 1243-1282 (2021).

MSC: 68R10 05C85 68Q27 91D30

Cite Review PDF

Full Text: DOI

OA License

Knop, Dušan

Local linear set on graphs with bounded twin cover number. (English) Zbl 1516.68066

Inf. Process. Lett. 170, Article ID 106118, 4 p. (2021).

MSC: 68R10 05C70 05C85 68Q27 90C10

Cite Review PDF

Full Text: DOI

Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota

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).

MSC: 68R10 05C15 68Q17 68Q25 68Q27

Cite Review PDF

Full Text: DOI

Masařík, Tomáš; Toufar, Tomáš

Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227

Discrete Appl. Math. 278, 51-61 (2020).

MSC: 05C99 68Q27

Cite Review PDF

Full Text: DOI arXiv

Chitnis, Rajesh H.; Feldmann, Andreas E.; HajiAghayi, MohammadTaghi; Marx, Daniel

Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). (English) Zbl 1437.05220

SIAM J. Comput. 49, No. 2, 318-364 (2020).

Reviewer: Xueliang Li (Tianjin)

MSC: 05C85 68W40 05C10 05C40 05C20

Cite Review PDF

Full Text: DOI

Knop, Dušan

Partitioning graphs into induced subgraphs. (English) Zbl 1429.05166

Discrete Appl. Math. 272, 31-42 (2020).

MSC: 05C70 05C42 05C85

Cite Review PDF

Full Text: DOI arXiv

Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš

Parameterized complexity of fair vertex evaluation problems. (English) Zbl 1541.68292

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 33, 16 p. (2019).

MSC: 68R10 03B70 05C70 68Q27

Cite Review PDF

Full Text: DOI arXiv

Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin

Integer programming in parameterized complexity: three miniatures. (English) Zbl 1520.68049

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 21, 16 p. (2019).

MSC: 68Q27 05C15 05C85 68R10 90C10

Cite Review PDF

Full Text: DOI arXiv

Koutecký, Martin; Lee, Jon; Nagarajan, Viswanath; Shen, Xiangkun

Approximating max-cut under graph-MSO constraints. (English) Zbl 1476.90340

Oper. Res. Lett. 46, No. 6, 592-598 (2018).

MSC: 90C35 05C85 90C39

Cite Review PDF

Full Text: DOI arXiv

Found 22 Documents (Results 1–22)

Algorithmic meta-theorems for combinatorial reconfiguration revisited. (English) Zbl 07931157

On the complexity of target set selection in simple geometric networks. (English) Zbl 07914881

Parameterized complexity for iterated type partitions and modular-width. (English) Zbl 07829715

Extended MSO model checking via small vertex integrity. (English) Zbl 07785278

Immunization in the threshold model: a parameterized complexity study. (English) Zbl 07767694

Establishing herd immunity is hard even in simple geometric networks. (English) Zbl 1536.92118

Lossy kernelization of same-size clustering. (English) Zbl 07729118

Target set selection with maximum activation time. (English) Zbl 1522.68409

Solving target set selection with bounded thresholds faster than \(2^n\). (English) Zbl 1507.68223

Computing \(L(p, 1)\)-labeling with combined parameters. (English) Zbl 1498.05233

Target set selection parameterized by vertex cover and more. (English) Zbl 1524.90325

Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601

Integer programming in parameterized complexity: five miniatures. (English) Zbl 1510.90185

A parameterized complexity view on collapsing \(k\)-cores. (English) Zbl 1508.68269

Local linear set on graphs with bounded twin cover number. (English) Zbl 1516.68066

Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153

Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227

Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). (English) Zbl 1437.05220

Partitioning graphs into induced subgraphs. (English) Zbl 1429.05166

Parameterized complexity of fair vertex evaluation problems. (English) Zbl 1541.68292

Integer programming in parameterized complexity: three miniatures. (English) Zbl 1520.68049

Approximating max-cut under graph-MSO constraints. (English) Zbl 1476.90340

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field

Software