咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是271-280 订阅
排序:
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees  35
A Polynomial Kernel for Deletion to the Scattered Class of C...
收藏 引用
35th International Symposium on Algorithms and Computation, ISAAC 2024
作者: Jacob, Ashwin Majumdar, Diptapriyo Zehavi, Meirav National Institute of Technology Calicut Kozhikode India Indraprastha Institute of Information Technology Delhi New Delhi India Ben-Gurion University of The Negev Beersheba Israel
The class of graph deletion problems has been extensively studied in theoretical computer science, particularly in the field of parameterized complexity. Recently, a new notion of graph deletion problems was introduce... 详细信息
来源: 评论
Counting Induced Subgraphs: An Algebraic Approach to #W-Hardness
收藏 引用
ALGORITHMICA 2022年 第2期84卷 379-404页
作者: Doerfler, Julian Roth, Marc Schmitt, Johannes Wellnitz, Philip Saarland Informat Campus Grad Sch Comp Sci Saarbrucken Germany Univ Oxford Dept Comp Sci Oxford England Univ Oxford Merton Coll Oxford England Saarland Informat Campus Cluster Excellence MMCI Saarbrucken Germany Swiss Fed Inst Technol Zurich Switzerland Univ Bonn Math Inst Bonn Germany Saarland Informat Campus Max Planck Inst Informat Saarbrucken Germany
We study the problem #INDSuB(Phi) of counting all induced subgraphs of size k in a graph G that satisfy the property Phi. It is shown that, given any graph property Phi that distinguishes independent sets from bicliqu... 详细信息
来源: 评论
ON TREEWIDTH AND STABLE MARRIAGE: parameterized ALGORITHMS AND HARDNESS RESULTS (COMPLETE CHARACTERIZATION)
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2022年 第1期36卷 596-681页
作者: Gupta, Sushmita Saurabh, Saket Zehavi, Meirav HBNI Inst Math Sci Chennai Tamil Nadu India Ben Gurion Univ Negev Beer Sheva Israel
STABLE MARRIAGE is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the SEX-EQUAL STABLE MARRIAGE (SESMI), BALANCED STABLE MARRIAGE (BSMI)... 详细信息
来源: 评论
Is FFT Fast Enough for Beyond 5G Communications? A Throughput-complexity Analysis for OFDM Signals
收藏 引用
IEEE ACCESS 2022年 10卷 104436-104448页
作者: Queiroz, Saulo Vilela, Joao P. Monteiro, Edmundo Fed Univ Technol UTFPR Acad Dept Informat BR-84017220 Ponta Grossa PR Brazil Univ Porto Fac Sci Dept Comp Sci CRACS INESCTECCISUC P-4169007 Porto Portugal Univ Coimbra Ctr Informat & Syst Univ Coimbra CISUC Dept Informat Engn P-3030290 Coimbra Portugal
In this paper, we study the impact of computational complexity on the throughput limits of the fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) waveforms. Based on the spect... 详细信息
来源: 评论
On the threshold of intractability
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2022年 124卷 1-25页
作者: Drange, Pal Gronas Dregi, Markus Sortland Lokshtanov, Daniel Sullivan, Blair D. Univ Bergen Bergen Norway Univ Calif Santa Barbara Santa Barbara CA 93106 USA Univ Utah Salt Lake City UT 84112 USA
The computational complexity of the graph modification problems THRESHOLD EDITING and CHAIN EDITING has been an important open question in computational graph theory for more than 15 years. These problems consist of a... 详细信息
来源: 评论
Faster algorithm for pathwidth one vertex deletion
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 921卷 63-74页
作者: Tsur, Dekel Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
In the PATHWIDTH ONE VERTEX DELETION (POVD) 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 with pathwidt... 详细信息
来源: 评论
Revising Johnson's table for the 21st century
收藏 引用
DISCRETE APPLIED MATHEMATICS 2022年 323卷 184-200页
作者: de Figueiredo, Celina M. H. de Melo, Alexsander A. Sasaki, Diana Silva, Ana Univ Fed Rio de Janeiro Rio De Janeiro Brazil Univ Estado Rio De Janeiro Rio De Janeiro Brazil Univ Fed Ceara Fortaleza Ceara Brazil
What does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 "Graph Restrictions and Their Effect"of D.S. Johnson's Ongoing guide, ... 详细信息
来源: 评论
Fast Exact Algorithms Using Hadamard Product of Polynomials
收藏 引用
ALGORITHMICA 2022年 第2期84卷 436-463页
作者: Arvind, V Chatterjee, Abhranil Datta, Rajit Mukhopadhyay, Partha Inst Math Sci HBNI Chennai Tamil Nadu India Chennai Math Inst Chennai Tamil Nadu India
Let C be an arithmetic circuit of size s, given as input that computes a polynomial f is an element of F[x(1), x(2), ..., x(n)], where F is a finite field or the field of rationals. Using the Hadamard product of polyn... 详细信息
来源: 评论
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
收藏 引用
JOURNAL OF SCHEDULING 2022年 第5期25卷 577-587页
作者: Mosheiov, Gur Oron, Daniel Shabtay, Dvir Hebrew Univ Jerusalem Sch Business Adm Jerusalem Israel Univ Sydney Sch Business Sydney NSW 2006 Australia Ben Gurion Univ Negev Dept Ind Engn & Management Beer Sheva Israel
We study two NP-hard single-machine scheduling problems with generalized due-dates. In such problems, due-dates are associated with positions in the job sequence rather than with jobs. Accordingly, the job that is ass... 详细信息
来源: 评论
W-hardness of the k-center problem parameterized by the skeleton dimension
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第4期44卷 2762-2781页
作者: Blum, Johannes Univ Konstanz Univ Str 10 D-78457 Constance Germany
We study the k-CENTER problem, where the input is a graph G = ( V, E) with positive edge weights and an integer k, and the goal is to select k center vertices C subset of V such that the maximum distance from any vert... 详细信息
来源: 评论