咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,133 篇 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,067 篇 英文
  • 63 篇 其他
检索条件"主题词=parameterized complexity"
1133 条 记 录,以下是381-390 订阅
排序:
On the complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
收藏 引用
ALGORITHMICA 2021年 第8期83卷 2351-2373页
作者: Belmonte, Remy Sau, Ignasi Univ Electrocommun Chofu Tokyo Japan Univ Montpellier CNRS LIRMM Montpellier France
We study the complexity of the problems of finding, given a graph G, a largest induced subgraph of G with all degrees odd (called an odd subgraph), and the smallest number of odd subgraphs that partition V(G). We call... 详细信息
来源: 评论
Balanced stable marriage: How close is close enough?
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 883卷 19-43页
作者: Gupta, Sushmita Roy, Sanjukta Saurabh, Saket Zehavi, Meirav HBNI Inst Math Sci Chennai Tamil Nadu India Univ Bergen Bergen Norway Ben Gurion Univ Negev Beer Sheva Israel
BALANCED STABLE MARRIAGE (BSM) is a central optimization version of the classic STABLE Marriage (SM) problem. We study BSM from the viewpoint of parameterized complexity. Informally, the input of BSM consists of n men... 详细信息
来源: 评论
Incidence, a scoring positional game on graphs
收藏 引用
DISCRETE MATHEMATICS 2024年 第8期347卷
作者: Bagan, Guillaume Deschamps, Quentin Duchene, Eric Durain, Bastien Effantin, Brice Gledel, Valentin Oijid, Nacim Parreau, Aline Univ Lyon 1 Univ Lyon LIRIS CNRS 5205UMR F-69621 Lyon France Ecole Normale Super Lyon F-69364 Lyon 07 France Umea Univ Dept Math & Math Stat Umea Sweden
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where two players alternately select an unc... 详细信息
来源: 评论
Streaming deletion problems parameterized by vertex cover
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 979卷
作者: Oostveen, Jelle J. van Leeuwen, Erik Jan Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands
Streaming is a model where an input graph is provided one edge at a time, instead of being able to inspect it at will. In this work, we take a parameterized approach by assuming a vertex cover of the graph is given, b... 详细信息
来源: 评论
Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 953卷
作者: Tsur, Dekel Ben Gurion Univ Negev Beer Sheva Israel
In the BICLUSTER EDITING (resp., FLIP CONSENSUS TREE) problem the input is a bipartite graph G = (V1, V2, E) and an integer k, and the goal is to decide whether there is a set F c V1 X V2 such that the graph (V1, V2, ... 详细信息
来源: 评论
Deletion to scattered graph classes I-Case of finite number of graph classes
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2023年 第1期138卷
作者: Jacob, Ashwin de Kroon, Jari J. H. Majumdar, Diptapriyo Raman, Venkatesh Ben Gurion Univ Negev Beer Sheva Israel Eindhoven Univ Technol Eindhoven Netherlands Indraprastha Inst Informat Technol Delhi New Delhi India HBNI Inst Math Sci Chennai India
Graph-deletion problems involve deleting a small number of vertices so that the resulting graph belong to a given hereditary graph class. We initiate a study of a natural variation of the problem of deletion to scatte... 详细信息
来源: 评论
Faster deterministic algorithm for Cactus Vertex Deletion
收藏 引用
INFORMATION PROCESSING LETTERS 2023年 179卷
作者: Tsur, Dekel Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) 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 ... 详细信息
来源: 评论
On the Computational Difficulty of the Terminal Connection Problem*
收藏 引用
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2023年 第1期57卷 3-3页
作者: de Melo, Alexsander A. de Figueiredo, Celina M. H. Souza, Ueverton S. Fed Univ Rio Janeiro Rio De Janeiro Brazil Fluminense Fed Univ Niteroi Brazil
A connection tree of a graph G for a terminal set W is a tree subgraph T of G such that leaves(T) subset of W subset of V(T). A non-terminal vertex is called linker if its degree in T is exactly 2, and it is called ro... 详细信息
来源: 评论
Interference-free walks in time: temporally disjoint paths
收藏 引用
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2023年 第1期37卷 1-1页
作者: Klobas, Nina Mertzios, George B. Molter, Hendrik Niedermeier, Rolf Zschoche, Philipp Univ Durham Dept Comp Sci Upper Mountjoy CampusStockton Rd Durham DH1 3LE England Ben Gurion Univ Negev Dept Ind Engn & Management David Ben Gurion Blvd IL-84105 Beer Sheva Israel TU Berlin Fac 4 Algorithm & Computat Complex Ernst Reuter Pl 7 D-10587 Berlin Germany
We investigate the computational complexity of finding temporally disjoint paths and walks in temporal graphs. There, the edge set changes over discrete time steps. Temporal paths and walks use edges that appear at mo... 详细信息
来源: 评论
Detecting maximum k-durable structures on temporal graphs
收藏 引用
KNOWLEDGE-BASED SYSTEMS 2023年 第1期271卷
作者: Li, Faming Zou, Zhaonian Liu, Xianmin Li, Jianzhong Yang, Xiaochun Wang, Bin Northeastern Univ Sch Comp Sci & Engn Shenyang Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Natl Frontiers Sci Ctr Ind Intelligence & Syst Opt Shenyang Peoples R China Northeastern Univ Key Lab Data Analyt & Optimizat Smart Ind Minist Educ Shenyang Peoples R China
In this paper, we study the problem of detecting maximum k-durable structures on temporal graphs, which can be used to mine and analyze more knowledge behind the temporal graphs. We first prove that this problem is NP... 详细信息
来源: 评论