The impact of parameterized complexity to interdisciplinary problem solving

被引：3
|
作者：
机构：
[1] Stege, Ulrike
来源：
Stege, U. (stege@cs.uvic.ca) | 1600年 / Springer Verlag卷 / 7370期
关键词：
Computers;
D O I：
10.1007/978-3-642-30891-8_5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We discuss interdisciplinary parameterized complexity research in biology and cognitive science. © 2012 Springer-Verlag Berlin Heidelberg.
引用
收藏
相关论文
共 50 条
  • [1] Parameterized Complexity of the Firefighter Problem
    Bazgan, Cristina
    Chopin, Morgan
    Fellows, Michael R.
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 643 - +
  • [2] The Parameterized Complexity of the Equidomination Problem
    Schaudt, Oliver
    Senger, Fabian
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 412 - 424
  • [3] On the parameterized complexity of the Maximum Exposure Problem
    Raman, Remi
    John, J. S. Shahin
    Subashini, R.
    Methirumangalath, Subhasree
    INFORMATION PROCESSING LETTERS, 2023, 180
  • [4] On the Parameterized Complexity of the Perfect Phylogeny Problem
    de Vlas, Jorke M.
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 169 - 182
  • [5] The Parameterized Complexity of the Shared Center Problem
    Chen, Zhi-Zhong
    Ma, Wenji
    Wang, Lusheng
    ALGORITHMICA, 2014, 69 (02) : 269 - 293
  • [6] The parameterized complexity of the unique coverage problem
    Moser, Hannes
    Raman, Venkatesh
    Sikdar, Somnath
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 621 - +
  • [7] On the Parameterized Complexity of the Expected Coverage Problem
    Fomin, Fedor, V
    Ramamoorthi, Vijayaragunathan
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (02) : 432 - 453
  • [8] The Parameterized Complexity of the Rainbow Subgraph Problem
    Hueffner, Falk
    Komusiewicz, Christian
    Niedermeier, Rolf
    Roetzschke, Martin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 287 - 298
  • [9] On the Parameterized Complexity of the Expected Coverage Problem
    Fedor V. Fomin
    Vijayaragunathan Ramamoorthi
    Theory of Computing Systems, 2022, 66 : 432 - 453
  • [10] Parameterized complexity and approximability of the SLCS problem
    Guillemot, S.
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2008, 5018 : 115 - 128
12345