Kernelization Complexity of Solution Discovery Problems

被引:0
|
作者
Grobler, Mario [1 ]
Maaz, Stephanie [2 ]
Mouawad, Amer E. [3 ]
Nishimura, Naomi [2 ]
Ramamoorthi, Vijayaragunathan [1 ]
Siebertz, Sebastian [1 ]
机构
[1] University of Bremen, Germany
[2] University of Waterloo, Canada
[3] American University of Beirut, Lebanon
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Kernelization and Parameterized Complexity of Star Editing and Union Editing
    Guo, Jiang
    Shrestha, Yash Raj
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 126 - 135
  • [22] The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    ALGORITHMICA, 2014, 68 (02) : 504 - 530
  • [23] Agreement forests of caterpillar trees: Complexity, kernelization and branching *
    Kelk, S.
    Meuwese, R.
    THEORETICAL COMPUTER SCIENCE, 2024, 1003
  • [24] The effect of girth on the kernelization complexity of Connected Dominating Set
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 96 - 107
  • [25] Lossy Kernelization for (Implicit) Hitting Set Problems
    Fomin, Fedor V.
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomassé, Stéphan
    Zehavi, Meirav
    arXiv, 2023,
  • [26] Kernelization Algorithms for Packing Problems Allowing Overlaps
    Fernau, Henning
    Lopez-Ortiz, Alejandro
    Romero, Jazmin
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 415 - 427
  • [27] Diminishable parameterized problems and strict polynomial kernelization
    Fernau, Henning
    Fluschnik, Till
    Hermelin, Danny
    Krebs, Andreas
    Molter, Hendrik
    Niedermeier, Rolf
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2020, 9 (01): : 1 - 24
  • [28] Lossy Kernelization for (Implicit) Hitting Set Problems
    Fomin, Fedor V.
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomassé, Stéphan
    Zehavi, Meirav
    Leibniz International Proceedings in Informatics, LIPIcs, 2023, 274
  • [29] Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
    Guilherme C. M. Gomes
    Matheus R. Guedes
    Vinicius F. dos Santos
    Algorithmica, 2023, 85 : 1912 - 1947
  • [30] Diminishable Parameterized Problems and Strict Polynomial Kernelization
    Fernau, Henning
    Fluschnik, Till
    Hermelin, Danny
    Krebs, Andreas
    Molter, Hendrik
    Niedermeier, Rolf
    SAILING ROUTES IN THE WORLD OF COMPUTATION, 2018, 10936 : 161 - 171