咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是361-370 订阅
排序:
The Small Set Vertex Expansion Problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 886卷 84-93页
作者: Agrawal, Garima Maity, Soumen Indian Inst Sci Educ & Res Pune Maharashtra India
In the SMALL SET VERTEX EXPANSION (SSVE) problem, we are given a graph G = (V, E) and a positive integer k <= vertical bar V(G)vertical bar/2, the goal is to return a set S subset of V (G) of k nodes minimizing the... 详细信息
来源: 评论
A parameterized perspective on protecting elections
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 874卷 15-31页
作者: Dey, Palash Misra, Neeldhara Nath, Swaprava Shakya, Garima Indian Inst Technol Kharagpur W Bengal India Indian Inst Technol Gandhinagar India Indian Inst Technol Kanpur Uttar Pradesh India
We study the parameterized complexity of the OPTIMAL DEFENSE and OPTIMAL ATTACK problems in voting. In both the problems, the input is a set of voter groups (every voter group is a district consisting of a set of vote... 详细信息
来源: 评论
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 290卷 1-6页
作者: Alix, Munier Kordon Sorbonne Univ LIP6 CNRS F-75005 Paris France
This paper proves that the existence of a feasible schedule for a set of dependent tasks of unit execution times with release dates and deadlines on a limited number of processors is a fixed-parameter tractable proble... 详细信息
来源: 评论
Distance from Triviality 2.0: Hybrid Parameterizations  33rd
Distance from Triviality 2.0: Hybrid Parameterizations
收藏 引用
33rd International Workshop on Combinatorial Algorithms (IWOCA)
作者: Agrawal, Akanksha Ramanujan, M. S. Indian Inst Technol Madras Chennai Tamil Nadu India Univ Warwick Coventry W Midlands England
Vertex deletion problems have been at the heart of numerous major advances in Algorithms and Combinatorial Optimization, and especially so in the area of parameterized complexity. For a family of graphs H, the input t... 详细信息
来源: 评论
An improved kernel for the flip distance problem on simple convex polygons
收藏 引用
INFORMATION PROCESSING LETTERS 2023年 182卷
作者: Bosch-Calvo, Miguel Kelk, Steven USI SUPSI IDSIA Lugano Switzerland Maastricht Univ Dept Data Sci & Engn Maastricht Netherlands
The complexity of computing the flip distance between two triangulations of a simple convex polygon is unknown. Here we approach the problem from a parameterized complexity perspective and improve upon the 2k kernel o... 详细信息
来源: 评论
Subexponential parameterized Algorithms and Kernelization on Almost Chordal Graphs
收藏 引用
ALGORITHMICA 2021年 第7期83卷 2170-2214页
作者: Fomin, Fedor, V Golovach, Petr A. Univ Bergen Dept Informat PB 7803 N-5020 Bergen Norway
We study algorithmic properties of the graph class CHORDAL-ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fill-in at most k. It appears t... 详细信息
来源: 评论
Faster parameterized Algorithm for Cluster Vertex Deletion
收藏 引用
THEORY OF COMPUTING SYSTEMS 2021年 第2期65卷 323-343页
作者: Tsur, Dekel Ben Gurion Univ Negev Beer Sheva Israel
In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results i... 详细信息
来源: 评论
parameterized Intractability of Even Set and Shortest Vector Problem
收藏 引用
JOURNAL OF THE ACM 2021年 第3期68卷 1–40页
作者: Bhattacharyya, Arnab Bonnet, Edouard Egri, Laszlo Ghoshal, Suprovat Karthik, C. S. Lin, Bingkai Manurangsi, Pasin Marx, Daniel Natl Univ Singapore NUS Sch Comp COM2-03-4413 Comp Dr Singapore 117417 Singapore Univ Claude Bernard Lyon 1 LIP UMR5668 ENS Lyon CNRS Villeurbanne France Hungarian Acad Sci Inst Comp Sci & Control Kende U 13 H-1111 Budapest Hungary Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India Weizmann Inst Sci Jacob Ziskind Bldg IL-76100 Rehovot Israel Nanjing Univ Nanjing Peoples R China Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA CISPA Helmholtz Ctr Informat Secur Campus E1 4Room 304 Saarland Informat Campus D-66123 Saarbrucken Germany
The k-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over F-2, which can be stated as follows: given a generator matrix A and an integer k, determine whether the code gener... 详细信息
来源: 评论
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
收藏 引用
ALGORITHMICA 2021年 第7期83卷 2096-2141页
作者: Kim, Eun Jung Kwon, O-joung Univ Paris 09 CNRS Pl Marechal Lattre Tassigny F-75775 Paris 16 France Incheon Natl Univ Dept Math Incheon South Korea Inst Basic Sci IBS Discrete Math Grp Daejeon South Korea
A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. The DISTANCE-HEREDITARY VERT... 详细信息
来源: 评论
Towards Better Understanding of User Authorization Query Problem via Multi-variable complexity Analysis
收藏 引用
ACM TRANSACTIONS ON PRIVACY AND SECURITY 2021年 第3期24卷 1–22页
作者: Crampton, Jason Gutin, Gregory Z. Majumdar, Diptapriyo Royal Holloway Univ London Dept Informat Secur Egham TW20 0EX Surrey England Royal Holloway Univ London Dept Comp Sci Egham TW20 0EX Surrey England
User authorization queries in the context of role-based access control have attracted considerable interest in the past 15 years. Such queries are used to determine whether it is possible to allocate a set of roles to... 详细信息
来源: 评论