咨询与建议

限定检索结果

文献类型

  • 821 篇 期刊文献
  • 306 篇 会议
  • 11 篇 学位论文

馆藏范围

  • 1,138 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 943 篇 工学
    • 921 篇 计算机科学与技术...
    • 236 篇 软件工程
    • 40 篇 控制科学与工程
    • 34 篇 电气工程
    • 8 篇 信息与通信工程
    • 6 篇 机械工程
    • 2 篇 生物工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 石油与天然气工程
  • 594 篇 理学
    • 588 篇 数学
    • 9 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 化学
  • 104 篇 管理学
    • 104 篇 管理科学与工程(可...
    • 19 篇 工商管理
  • 19 篇 经济学
    • 19 篇 应用经济学
  • 7 篇 法学
    • 7 篇 法学
  • 2 篇 文学
    • 2 篇 外国语言文学
  • 2 篇 农学
    • 1 篇 水产
  • 2 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学
  • 1 篇 哲学
    • 1 篇 哲学

主题

  • 1,138 篇 parameterized co...
  • 127 篇 kernelization
  • 97 篇 treewidth
  • 58 篇 computational co...
  • 56 篇 graph algorithms
  • 44 篇 vertex cover
  • 42 篇 algorithms
  • 41 篇 fixed-parameter ...
  • 34 篇 dynamic programm...
  • 27 篇 approximation al...
  • 24 篇 planar graphs
  • 21 篇 fpt
  • 20 篇 exponential time...
  • 20 篇 graph minors
  • 19 篇 theory
  • 19 篇 feedback vertex ...
  • 18 篇 exact algorithms
  • 18 篇 dominating set
  • 18 篇 approximation
  • 17 篇 fixed parameter ...

机构

  • 46 篇 ben gurion univ ...
  • 42 篇 univ bergen berg...
  • 39 篇 univ bergen dept...
  • 38 篇 inst math sci ma...
  • 35 篇 univ bergen dept...
  • 30 篇 hbni inst math s...
  • 20 篇 tu wien algorith...
  • 17 篇 tu berlin inst s...
  • 16 篇 ben gurion univ ...
  • 16 篇 univ montpellier...
  • 14 篇 univ montpellier...
  • 12 篇 tu wien austria
  • 12 篇 univ utrecht utr...
  • 12 篇 univ durham sch ...
  • 12 篇 univ tubingen wi...
  • 11 篇 hbni inst math s...
  • 11 篇 inst math sci ch...
  • 10 篇 max planck inst ...
  • 10 篇 univ calif santa...
  • 10 篇 depaul univ sch ...

作者

  • 93 篇 saurabh saket
  • 59 篇 sau ignasi
  • 47 篇 golovach petr a.
  • 46 篇 lokshtanov danie...
  • 43 篇 zehavi meirav
  • 40 篇 fomin fedor v.
  • 39 篇 niedermeier rolf
  • 35 篇 szeider stefan
  • 32 篇 kratsch stefan
  • 31 篇 ganian robert
  • 29 篇 thilikos dimitri...
  • 26 篇 raman venkatesh
  • 23 篇 ordyniak sebasti...
  • 22 篇 tsur dekel
  • 22 篇 hermelin danny
  • 20 篇 marx daniel
  • 19 篇 panolan fahad
  • 18 篇 fomin fedor v
  • 18 篇 yang yongjie
  • 17 篇 paul christophe

语言

  • 1,071 篇 英文
  • 65 篇 其他
检索条件"主题词=parameterized complexity"
1138 条 记 录,以下是251-260 订阅
排序:
XNLP-Hardness of parameterized Problems on Planar Graphs  50th
XNLP-Hardness of Parameterized Problems on Planar Graphs
收藏 引用
50th International Workshop on Graph-Theoretic Concepts in Computer Science
作者: Bodlaender, Hans L. Szilagyi, Krisztina Univ Utrecht Utrecht Netherlands
The class XNLP consists of (parameterized) problems that can be solved nondeterministically in f(k)n(O(1)) time and g(k) log n space, where n is the size of the input instance and k the parameter. The class XALP consi... 详细信息
来源: 评论
On Polynomial Kernelization for Stable Cutset  50th
On Polynomial Kernelization for Stable Cutset
收藏 引用
50th International Workshop on Graph-Theoretic Concepts in Computer Science
作者: Kratsch, Stefan Le, Van Bang Humboldt Univ Inst Informat Berlin Germany Univ Rostock Inst Informatik Rostock Germany
A stable cutset in a graph G is a set S subset of V (G) such that vertices of S are pairwise non-adjacent and such that G - S is disconnected, i.e., it is both stable (or independent) set and a cutset (or separator). ... 详细信息
来源: 评论
Fast Winning Strategies for the Attacker in Eternal Domination  50th
Fast Winning Strategies for the Attacker in Eternal Dominati...
收藏 引用
50th International Workshop on Graph-Theoretic Concepts in Computer Science
作者: Bagan, Guillaume Bousquet, Nicolas Oijid, Nacim Pierron, Theo Univ Claude Bernard Lyon 1 CNRS INSA Lyon LIRISUMR5205 F-69622 Villeurbanne France
Dominating sets in graphs are often used to model monitoring problems, by posting guards on the vertices of the dominating set. If an (unguarded) vertex is attacked, at least one guard can then react by moving there. ... 详细信息
来源: 评论
Extension Perfect Roman Domination  11th
Extension Perfect Roman Domination
收藏 引用
11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025
作者: Mann, Kevin Fernau, Henning Universität Trier Fachbereich 4 – Abteilung Informatikwissenschaften Trier54286 Germany
For an introductory single lecture into parameterized complexity classes, it appears to be necessary to introduce different problems to capture the (most important) different levels of the W-hierarchy. This puts an ad... 详细信息
来源: 评论
Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids  7th
Games That Cannot Go on Forever! Active Participation in Res...
收藏 引用
7th International Conference on Creative Mathematical Sciences Communication, CMSC 2024
作者: Fellows, Michael R. Rosamond, Frances A. Lebanese American University Beirut Lebanon
It is entirely interesting, and profoundly important to science, that efforts to communicate science have often led scientists to new perspectives on their own work and their scientific fields and specialties. This tw... 详细信息
来源: 评论
Distance Vector Domination  50th
Distance Vector Domination
收藏 引用
50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025
作者: Cordasco, Gennaro Gargano, Luisa Rescigno, Adele A. Department of Psychology University of Campania "L.Vanvitelli" Caserta Italy Department of Computer Science University of Salerno Fisciano Italy
Identifying and mitigating the spread of fake information is a challenging issue that has become dominant with the rise of social media. We consider a generalization of the Domination problem that can be used to detec... 详细信息
来源: 评论
FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds
收藏 引用
Proceedings of the ACM on Management of Data 2025年 第1期3卷 1-25页
作者: Aaron Huber Oliver Kennedy Atri Rudra Zhuoyue Zhao Su Feng Boris Glavic University at Buffalo Buffalo USA Nanjing Tech University Nanjing China University of Illinois Chicago Illinois USA
Probabilistic databases (PDBs) provide users with a principled way to query data that is incomplete or imprecise. In this work, we study computing expected multiplicities of query results over probabilistic databases ... 详细信息
来源: 评论
Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism  17th
Kernel for Proper Helly Circular-Arc Vertex Deletion: Small...
收藏 引用
17th International Conference on Combinatorial Optimization and Applications, COCOA 2024
作者: Yuan, Hanchun Zhang, Zhen School of Computer Science and Technology Zhejiang Normal University Jinhua 321004 China School of Advanced Interdisciplinary Studies Hunan University of Technology and Business Changsha 410205 China
The modification problems toward subclasses of claw-free graphs have been investigated a lot in recent years. Proper Helly circular-arc graph is an important subclass of claw-free graphs. In this paper, we give an O(k... 详细信息
来源: 评论
An FPT algorithm for timeline cover
收藏 引用
Journal of Computer and System Sciences 2025年 154卷
作者: Riccardo Dondi Manuel Lafond Dipartimento di Lettere Filosofia Comunicazione Università degli Studi di Bergamo Bergamo Italy Department of Computer Science Université de Sherbrooke Street Sherbrooke Canada
One of the most studied problem in theoretical computer science, Vertex Cover , has been recently considered in the temporal graph framework. Here we study a Vertex Cover variant, called k- TimelineCover . Given a tem... 详细信息
来源: 评论
Possible winner problems on partial tournaments: a parameterized study
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年 第3期33卷 882-896页
作者: Yang, Yongjie Guo, Jiong Univ Saarland Saarbrucken Germany Shandong Univ Sch Comp Sci & Technol Jinan Peoples R China
We study possible winner problems related to the uncovered set and the Banks set on partial tournaments from the viewpoint of parameterized complexity. We first study a problem where given a partial tournament D and a... 详细信息
来源: 评论