Document Search Results

Mohanapriya, A.; Renjith, P.; Sadagopan, N.

Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs. (English) Zbl 07728665

Bagchi, Amitabha (ed.) et al., Algorithms and discrete applied mathematics. 9th international conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13947, 219-230 (2023).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Bhore, Sujoy; Carmi, Paz; Kolay, Sudeshna; Zehavi, Meirav

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079

Algorithmica 85, No. 1, 133-152 (2023).

MSC: 68Wxx 05Cxx

Cite Review PDF

Full Text: DOI arXiv

Fioravantes, Foivos; Melissinos, Nikolaos; Triommatis, Theofilos

Complexity of finding maximum locally irregular induced subgraphs. (English) Zbl 07853696

Czumaj, Artur (ed.) et al., 18th Scandinavian symposium and workshops on algorithm theory, SWAT 2022, Tórshavn, Faroe Islands, June 27–29, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 227, Article 24, 20 p. (2022).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Papadopoulos, Charis; Tzimas, Spyridon

Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage. (English) Zbl 07577719

Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 466-479 (2022).

MSC: 68Rxx 68Wxx

Cite Review PDF

Full Text: DOI arXiv

Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav

Resolute control: forbidding candidates from winning an election is hard. (English) Zbl 1536.91151

Theor. Comput. Sci. 915, 74-89 (2022).

MSC: 91B12 68Q17 68Q27

Cite Review PDF

Full Text: DOI

OA License

Eppstein, David; Gupta, Siddharth; Havvaei, Elham

Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes. (English) Zbl 07530235

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 217-229 (2021).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI arXiv

Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh

Parameterized complexity of conflict-free set cover. (English) Zbl 1517.68146

Theory Comput. Syst. 65, No. 3, 515-540 (2021).

MSC: 68Q27 68R10

Cite Review PDF

Full Text: DOI

Bhore, Sujoy; Carmi, Paz; Kolay, Sudeshna; Zehavi, Meirav

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07759281

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 13, 18 p. (2020).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Gutin, Gregory; Majumdar, Diptapriyo; Ordyniak, Sebastian; Wahlström, Magnus

Parameterized pre-coloring extension and list coloring problems. (English) Zbl 07650904

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 19, 18 p. (2020).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI

Gowda, Kishen N.; Misra, Neeldhara; Patel, Vraj

A parameterized perspective on attacking and defending elections. (English) Zbl 07601014

Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 277-288 (2020).

MSC: 68Rxx 68Wxx

Cite Review PDF

Full Text: DOI arXiv

Jacob, Ashwin; Raman, Venkatesh; Sahlot, Vibha

Deconstructing parameterized hardness of fair vertex deletion problems. (English) Zbl 1534.68175

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11653, 325-337 (2019).

MSC: 68R10 03B70 68Q17 68Q25 68Q27

Cite Review PDF

Full Text: DOI

Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Vaishali, S.

Tractability of König edge deletion problems. (English) Zbl 1435.68125

Theor. Comput. Sci. 796, 207-215 (2019).

MSC: 68Q27 05C70 68Q17

Cite Review PDF

Full Text: DOI arXiv

Misra, Neeldhara; Rathi, Piyush

The parameterized complexity of dominating set and friends revisited for structured graphs. (English) Zbl 1533.68260

van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11532, 299-310 (2019).

MSC: 68R10 05C69 68Q27

Cite Review PDF

Full Text: DOI

Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf; Sorge, Manuel

The parameterized complexity of the minimum shared edges problem. (English) Zbl 1431.68052

J. Comput. Syst. Sci. 106, 23-48 (2019).

Reviewer: Xueliang Li (Tianjin)

MSC: 68Q27 68Q17 68R10

Cite Review PDF

Full Text: DOI Link

Krithika, R.; Majumdar, Diptapriyo; Raman, Venkatesh

Revisiting connected vertex cover: FPT algorithms and lossy kernels. (English) Zbl 1430.68225

Theory Comput. Syst. 62, No. 8, 1690-1714 (2018).

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

Cite Review PDF

Full Text: DOI arXiv

Majumdar, Diptapriyo; Raman, Venkatesh

Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization. (English) Zbl 1397.68106

Algorithmica 80, No. 9, 2683-2724 (2018).

MSC: 68Q25 05C85 68R10 68Q17

Cite Review PDF

Full Text: DOI

Ashok, Pradeesha; Kolay, Sudeshna; Saurabh, Saket

Multivariate complexity analysis of geometric Red Blue Set Cover. (English) Zbl 1380.68212

Algorithmica 79, No. 3, 667-697 (2017).

MSC: 68Q25 68Q17 68U05 90C27

Cite Review PDF

Full Text: DOI arXiv

Bredereck, Robert; Chen, Jiehua; Faliszewski, Piotr; Nichterlein, André; Niedermeier, Rolf

Prices matter for the parameterized complexity of shift bribery. (English) Zbl 1354.91052

Inf. Comput. 251, 140-164 (2016).

MSC: 91B12 91B14 68Q17 68Q25 68W25

Cite Review PDF

Full Text: DOI arXiv

Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.

Finding large degree-anonymous subgraphs is hard. (English) Zbl 1335.68095

Theor. Comput. Sci. 622, 90-110 (2016).

MSC: 68Q17 05C85

Cite Review PDF

Full Text: DOI

Froese, Vincent; van Bevern, René; Niedermeier, Rolf; Sorge, Manuel

Exploiting hidden structure in selecting dimensions that distinguish vectors. (English) Zbl 1333.68143

J. Comput. Syst. Sci. 82, No. 3, 521-535 (2016).

MSC: 68Q25 68Q17

Cite Review PDF

Full Text: DOI arXiv

Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane

Upper and lower bounds for finding connected motifs in vertex-colored graphs. (English) Zbl 1210.68060

J. Comput. Syst. Sci. 77, No. 4, 799-811 (2011).

MSC: 68Q25 05C15

Cite Review PDF

Full Text: DOI

Fellows, Michael R.; Guo, Jiong; Kanj, Iyad

The parameterized complexity of some minimum label problems. (English) Zbl 1214.05150

J. Comput. Syst. Sci. 76, No. 8, 727-740 (2010).

MSC: 05C78 05C35 68R10

Cite Review PDF

Full Text: DOI

Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane

On the parameterized complexity of multiple-interval graph problems. (English) Zbl 1161.68038

Theor. Comput. Sci. 410, No. 1, 53-61 (2009).

MSC: 68R10 05C69 05C70 05C85 68Q17

Cite Review PDF

Full Text: DOI

Found 23 Documents (Results 1–23)

Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs. (English) Zbl 07728665

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079

Complexity of finding maximum locally irregular induced subgraphs. (English) Zbl 07853696

Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage. (English) Zbl 07577719

Resolute control: forbidding candidates from winning an election is hard. (English) Zbl 1536.91151

Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes. (English) Zbl 07530235

Parameterized complexity of conflict-free set cover. (English) Zbl 1517.68146

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07759281

Parameterized pre-coloring extension and list coloring problems. (English) Zbl 07650904

A parameterized perspective on attacking and defending elections. (English) Zbl 07601014

Deconstructing parameterized hardness of fair vertex deletion problems. (English) Zbl 1534.68175

Tractability of König edge deletion problems. (English) Zbl 1435.68125

The parameterized complexity of dominating set and friends revisited for structured graphs. (English) Zbl 1533.68260

The parameterized complexity of the minimum shared edges problem. (English) Zbl 1431.68052

Revisiting connected vertex cover: FPT algorithms and lossy kernels. (English) Zbl 1430.68225

Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization. (English) Zbl 1397.68106

Multivariate complexity analysis of geometric Red Blue Set Cover. (English) Zbl 1380.68212

Prices matter for the parameterized complexity of shift bribery. (English) Zbl 1354.91052

Finding large degree-anonymous subgraphs is hard. (English) Zbl 1335.68095

Exploiting hidden structure in selecting dimensions that distinguish vectors. (English) Zbl 1333.68143

Upper and lower bounds for finding connected motifs in vertex-colored graphs. (English) Zbl 1210.68060

The parameterized complexity of some minimum label problems. (English) Zbl 1214.05150

On the parameterized complexity of multiple-interval graph problems. (English) Zbl 1161.68038

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field