咨询与建议

限定检索结果

文献类型

  • 820 篇 期刊文献
  • 305 篇 会议
  • 11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,136 篇 parameterized co...
  • 126 篇 kernelization
  • 98 篇 treewidth
  • 58 篇 computational co...
  • 56 篇 graph algorithms
  • 44 篇 vertex cover
  • 42 篇 algorithms
  • 41 篇 fixed-parameter ...
  • 34 篇 dynamic programm...
  • 27 篇 approximation al...
  • 24 篇 planar graphs
  • 22 篇 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 篇 ben gurion univ ...
  • 17 篇 tu berlin inst s...
  • 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...
  • 23 篇 tsur dekel
  • 22 篇 hermelin danny
  • 20 篇 marx daniel
  • 18 篇 panolan fahad
  • 18 篇 fomin fedor v
  • 18 篇 yang yongjie
  • 17 篇 paul christophe

语言

  • 1,070 篇 英文
  • 63 篇 其他
检索条件"主题词=parameterized complexity"
1136 条 记 录,以下是251-260 订阅
排序:
A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines  8th
A New Structural Parameter on Single Machine Scheduling with...
收藏 引用
8th International Symposium on Combinatorial Optimization (ISCO)
作者: Mallem, Maher Hanen, Claire Munier-Kordon, Alix Sorbonne Univ LIP6 CNRS F-75005 Paris France Univ Paris Nanterre UPL F-92000 Nanterre France
In this paper we study the single machine scheduling problem with release dates, deadlines and precedence relations where the objective is to minimize the makespan. This is a well-known strongly NP-hard scheduling pro... 详细信息
来源: 评论
Computing Twin-Width parameterized by the Feedback Edge Number  41
Computing Twin-Width Parameterized by the Feedback Edge Numb...
收藏 引用
41st International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Balaban, Jakub Ganian, Robert Rocton, Mathis Masaryk Univ Fac Informat Brno Czech Republic TU Wien Algorithms & Complex Grp Vienna Austria
The problem of whether and how one can compute the twin-width of a graph - along with an accompanying contraction sequence - lies at the forefront of the area of algorithmic model theory. While significant effort has ... 详细信息
来源: 评论
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. ... 详细信息
来源: 评论
On the complexity of solution extension of optimization problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 904卷 48-65页
作者: Casel, Katrin Fernau, Henning Ghadikolaei, Mehdi Khosravian Monnot, Jerome Sikora, Florian Univ Potsdam Hasso Plattner Inst D-14482 Potsdam Germany Univ Trier Informat wissensch Theoret Informat Fachbereich 4 D-54286 Trier Germany Univ Paris 09 PSL Univ LAMSADE CNRS F-75016 Paris France
The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal vertex covers of a graph G = (V,... 详细信息
来源: 评论
Faster deterministic algorithms for CO-PATH PACKING and CO-PATH/CYCLE PACKING
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第5期44卷 3701-3710页
作者: Tsur, Dekel Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
In the CO-PATH PACKING (resp., CO-PATH/CYCLE PACKING) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph wh... 详细信息
来源: 评论
Almost-Linear Time parameterized Algorithm for Rankwidth via Dynamic Rankwidth  2024
Almost-Linear Time Parameterized Algorithm for Rankwidth via...
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Korhonen, Tuukka Sokolowski, Marek Univ Bergen Bergen Norway Univ Warsaw Warsaw Poland
We give an algorithm that given a graph G with n vertices and m edges and an integer k, in time O-k(n(1+o(1))) + O(m) either outputs a rank decomposition of G of width at most k or determines that the rankwidth of G i... 详细信息
来源: 评论
Structural Parameterizations of Vertex Integrity [Best Paper]  18th
Structural Parameterizations of Vertex Integrity [Best Paper...
收藏 引用
18th International Conference and Workshops on Algorithms and Computation (WALCOM)
作者: Gima, Tatsuya Hanaka, Tesshu Kobayashi, Yasuaki Murai, Ryota Ono, Hirotaka Otachi, Yota Nagoya Univ Nagoya Aichi Japan Kyushu Univ Fukuoka Japan Hokkaido Univ Sapporo Hokkaido Japan
The graph parameter vertex integrity measures how vulnerable a graph is to a removal of a small number of vertices. More precisely, a graph with small vertex integrity admits a small number of vertex removals to make ... 详细信息
来源: 评论
Counting Vanishing Matrix-Vector Products  18th
Counting Vanishing Matrix-Vector Products
收藏 引用
18th International Conference and Workshops on Algorithms and Computation (WALCOM)
作者: Brand, Cornelius Korchemna, Viktoriia Simonov, Kirill Skotnica, Michael Univ Regensburg Algorithms & Complex Theory Grp Regensburg Germany TU Wien Algorithms & Complex Grp Vienna Austria Univ Potsdam Hasso Plattner Inst Potsdam Germany Charles Univ Prague Dept Appl Math Prague Czech Republic
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let v is an element of Q(d) be a rational... 详细信息
来源: 评论
Univariate Ideal Membership parameterized by Rank, Degree, and Number of Generators
收藏 引用
THEORY OF COMPUTING SYSTEMS 2022年 第1期66卷 56-88页
作者: Arvind, V Chatterjee, Abhranil Datta, Rajit Mukhopadhyay, Partha Inst Math Sci HBNI Chennai Tamil Nadu India Chennai Math Inst Chennai Tamil Nadu India
Let F[X] be the polynomial ring in the variables X = {x(1), x(2), ..., x(n)} over a field F. An ideal I = generated by univariate polynomials {p(i)(x(i))}(i=1)(n) is a univariate ideal. Motivated by Alon's Combin... 详细信息
来源: 评论
TARGET SET SELECTION IN DENSE GRAPH CLASSES
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2022年 第1期36卷 536-572页
作者: Dvorak, Pavel Knop, Dusan Toufar, Tomas Charles Univ Prague Inst Comp Sci Prague 11636 Czech Republic Czech Tech Univ Fac Informat Technol Prague 16000 Czech Republic Charles Univ Prague Fac Math & Phys Prague 11636 Czech Republic
In this paper, we study the TARGET SET SELECTION problem from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex, the task is to find a set of vertices (called a target set)... 详细信息
来源: 评论