咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Another disjoint compression algorithm for odd cycle transversal
收藏 引用
INFORMATION PROCESSING LETTERS 2013年 第22-24期113卷 849-851页
作者: Krithika, R. Narayanaswamy, N. S. Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India
Given a graph G and an odd cycle transversal T, we describe an elegant 0*(2(vertical bar T vertical bar)) algorithm for determining whether G has a smaller odd cycle transversal that is disjoint from T. We believe tha... 详细信息
来源: 评论
Imbalance is fixed parameter tractable
收藏 引用
INFORMATION PROCESSING LETTERS 2013年 第19-21期113卷 714-718页
作者: Lokshtanov, Daniel Misra, Neeldhara Saurabh, Saket Univ Calif San Diego San Diego CA 92103 USA Inst Math Sci Chennai 600113 Tamil Nadu India
In the IMBALANCE MINIMIZATION problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v(1) ... v(n) of V such that the sum of the imbalance of all the vertices is at most b. The... 详细信息
来源: 评论
An FPT algorithm for the vertex cover P4 problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2016年 200卷 186-190页
作者: Tu, Jianhua Jin, Zemin Beijing Univ Chem Technol Sch Sci Beijing 100029 Peoples R China Zhejiang Normal Univ Dept Math Jinhua 321004 Peoples R China
A subset F of vertices of a graph G is called a vertex cover P-t (VCPt) set if every path of order t in G contains at least one vertex from F. The vertex cover P-t (VCPt) problem is to find a minimum VCPt set in a gra... 详细信息
来源: 评论
On the Tractability of Covering a Graph with 2-Clubs
收藏 引用
ALGORITHMICA 2023年 第4期85卷 992-1028页
作者: Dondi, Riccardo Lafond, Manuel Univ Bergamo Bergamo Italy Univ Sherbrooke Sherbrooke PQ Canada
Covering a graph with cohesive subgraphs is a classical problem in theoretical computer science, for example when the cohesive subgraph model considered is a clique. In this paper, we consider as a model of cohesive s... 详细信息
来源: 评论
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
收藏 引用
ALGORITHMICA 2021年 第2期83卷 726-752页
作者: Ganian, Robert Ordyniak, Sebastian Vienna Univ Technol Algorithms & Complex Grp Vienna Austria Univ Sheffield Algorithms Grp Sheffield S Yorkshire England
This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graphGand a set of terminal pairsPand asks whetherGcontains a set of pairwise edge-disjoint paths connecting every ... 详细信息
来源: 评论
parameterized Hardness of Art Gallery Problems
收藏 引用
ACM TRANSACTIONS ON ALGORITHMS 2020年 第4期16卷 1–23页
作者: Bonnet, Edouard Miltzow, Tillmann Univ Claude Bernard Lyon 1 Univ Lyon CNRS ENS LyonLab Informat Parallelisme 46 Allee Italie F-69007 Lyon France Univ Utrecht Princetonpl 5 NL-3584 CC Utrecht Netherlands
Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The POINT GUARD ART GALLERY problem asks for a minimum set S suc... 详细信息
来源: 评论
A linear-time kernelization for the Rooted k-Leaf Outbranching Problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 193卷 126-138页
作者: Kammer, Frank Univ Augsburg Inst Informat D-86135 Augsburg Germany
In the ROOTED k-LEAF OUTBRANCHING PROBLEM, a digraph G = (V, E), a vertex r of G, and an integer k are given, and the goal is to find an r-rooted spanning outtree of G with >= k leaves (a subtree of G with vertex s... 详细信息
来源: 评论
Solving MIN ONES 2-SAT as fast as VERTEX COVER
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 506卷 115-121页
作者: Misra, Neeldhara Narayanaswamy, N. S. Raman, Venkatesh Shankar, Bal Sri Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India Inst Math Sci Madras 600113 Tamil Nadu India Indian Inst Technol Madras 600036 Tamil Nadu India
The problem of finding a satisfying assignment that minimizes the number of variables that are set to 1 is NP-complete even for a satisfiable 2-SAT formula. We call this problem MIN ONES 2-SAT. It generalizes the well... 详细信息
来源: 评论
Reducing rank of the adjacency matrix by graph modification
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 654卷 70-79页
作者: Meesum, S. M. Misra, Pranabendu Saurabh, Saket Inst Math Sci Madras Tamil Nadu India Univ Bergen N-5020 Bergen Norway
The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices (edg... 详细信息
来源: 评论
Color spanning objects: Algorithms and hardness results
收藏 引用
DISCRETE APPLIED MATHEMATICS 2020年 280卷 14-22页
作者: Banerjee, Sandip Misra, Neeldhara Nandy, Subhas C. Indian Stat Inst Kolkata India Indian Inst Technol Gandhinagar India
In this paper, we study the SHORTEST COLOR SPANNING t- INTERVALS problem, and related generalizations, namely SMALLEST COLOR SPANNING t- SQUARES and SMALLEST COLOR SPANNING t- CIRCLES. The generic setting is the follo... 详细信息
来源: 评论