咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是311-320 订阅
排序:
Polynomial Kernelization for Removing Induced Claws and Diamonds
收藏 引用
THEORY OF COMPUTING SYSTEMS 2017年 第4期60卷 615-636页
作者: Cygan, Marek Pilipczuk, Marcin Pilipczuk, Michal van Leeuwen, Erik Jan Wrochna, Marcin Univ Warsaw Inst Informat Warsaw Poland Max Planck Inst Informat Saarbrucken Germany
A graph is called {claw,diamond}-free if it contains neither a claw (a K (1,3)) nor a diamond (a K (4) with an edge removed) as an induced subgraph. Equivalently, {claw,diamond}-free graphs are characterized as line g... 详细信息
来源: 评论
Lower Bounds for Kernelizations and Other Preprocessing Procedures
收藏 引用
THEORY OF COMPUTING SYSTEMS 2011年 第4期48卷 803-839页
作者: Chen, Yijia Flum, Joerg Mueller, Moritz Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Univ Freiburg Abt Math Log D-79104 Freiburg Germany Ctr Recerca Matemat Barcelona Bellaterra 08193 Spain
We first present a method to rule out the existence of parameter non-increasing polynomial kernelizations of parameterized problems under the hypothesis P not equal NP. This method is applicable, for example, to the p... 详细信息
来源: 评论
Paradigms for parameterized Enumeration
收藏 引用
THEORY OF COMPUTING SYSTEMS 2017年 第4期60卷 737-758页
作者: Creignou, Nadia Meier, Arne Mueller, Julian-Steffen Schmidt, Johannes Vollmer, Heribert Aix Marseille Univ CNRS LIF UMR 7279 163 Av Luminy F-13288 Marseille 9 France Leibniz Univ Hannover Inst Theoret Informat Appelstr 4 D-30167 Hannover Germany Linkoping Univ Dept Comp & Informat Sci SE-58183 Linkoping Sweden
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First, we defin... 详细信息
来源: 评论
Fixed-parameter tractability, definability, and model-checking
收藏 引用
SIAM JOURNAL ON COMPUTING 2001年 第1期31卷 113-145页
作者: Flum, J Grohe, M Inst Math Log D-79104 Freiburg Germany Univ Illinois Dept Math Stat & Comp Sci Chicago IL 60607 USA
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fr... 详细信息
来源: 评论
The parameterized Hardness of the k-Center Problem in Transportation Networks
收藏 引用
ALGORITHMICA 2020年 第7期82卷 1989-2005页
作者: Feldmann, Andreas Emil Marx, Daniel Charles Univ Prague Dept Appl Math Prague Czech Republic Hungarian Acad Sci MTA SZTAKI Inst Comp Sci & Control Budapest Hungary
In this paper we study the hardness of the k-Center problem on inputs that model transportation networks. For the problem, a graph G = (V, E) with edge lengths and an integer k are given and a center set C subset of V... 详细信息
来源: 评论
parameterized maximum path coloring
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 511卷 42-53页
作者: Lampis, Michael CUNY Grad Ctr New York NY 10016 USA
We study the well-known MAX PATH COLORING problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such ... 详细信息
来源: 评论
The complexity of homomorphism and constraint satisfaction problems seen from the other side
收藏 引用
JOURNAL OF THE ACM 2007年 第1期54卷 1-1-1-24页
作者: Grohe, Martin Humboldt Univ Inst Informat D-10099 Berlin Germany
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure in a homomorphism. For every class C of... 详细信息
来源: 评论
Collapsing the Tower-On the complexity of Multistage Stochastic IPs
收藏 引用
ACM TRANSACTIONS ON ALGORITHMS 2024年 第3期20卷 1-21页
作者: Klein, Kim-manuel Reuter, Janina Univ Kiel Christian Albrechts Pl 4 D-24118 Kiel Germany
In this article, we study the computational complexity of solving a class of block structured integer programs (IPs), the so-called multistage stochastic IPs. A multistage stochastic IP is an IP of the form min { cTx ... 详细信息
来源: 评论
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第1期45卷 1-15页
作者: Tsur, Dekel Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
In the vertex cover problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of vertices S of size at most k such that every edge of G is incident on at least one vertex in S. ... 详细信息
来源: 评论
Faster algorithms for vertex partitioning problems parameterized by clique-width
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 535卷 16-24页
作者: Oum, Sang-il Saether, Sigve Hortemo Vatshelle, Martin Korea Adv Inst Sci & Technol Dept Math Sci Taejon 305701 South Korea Univ Bergen Dept Informat N-5020 Bergen Norway
Many NP-hard problems, such as DOMINATING SET, are FPT parameterized by clique-width. For graphs of clique-width k given with a k-expression, DOMINATING SET can be solved in 4(k)n(O(1)) time. However, no FPT algorithm... 详细信息
来源: 评论