咨询与建议

限定检索结果

文献类型

  • 821 篇 期刊文献
  • 306 篇 会议
  • 11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

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

语言

  • 1,071 篇 英文
  • 65 篇 其他
检索条件"主题词=parameterized complexity"
1138 条 记 录,以下是301-310 订阅
排序:
Fixed-Parameter Tractability of (n - k) List Coloring
收藏 引用
THEORY OF COMPUTING SYSTEMS 2020年 第7期64卷 1307-1316页
作者: Banik, Aritra Jacob, Ashwin Paliwal, Vijay Kumar Raman, Venkatesh Natl Inst Sci Educ & Res HBNI Bhubaneswar India Inst Math Sci Theoret Comp Sci GB-09CIT Campus Chennai 600113 Tamil Nadu India DE Shaw India Private Ltd Hyderabad India HBNI Inst Math Sci Chennai Tamil Nadu India
We consider the list-coloring problem from the perspective of parameterized complexity. In the classical graph coloring problem we are given an undirected graph and the goal is to color the vertices of the graph with ... 详细信息
来源: 评论
Chain Minors are FPT
收藏 引用
ALGORITHMICA 2017年 第3期79卷 698-707页
作者: Blasiok, Jaroslaw Kaminski, Marcin Uniwersytet Warszawski Inst Informatyki Warsaw Poland
Given two finite partially ordered sets P and Q, we say that P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C-Q... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Finding Disjoint Paths in Split Graphs
收藏 引用
THEORY OF COMPUTING SYSTEMS 2015年 第1期57卷 140-159页
作者: Heggernes, Pinar Van't Hof, Pim van Leeuwen, Erik Jan Saei, Reza Univ Bergen Dept Informat N-5020 Bergen Norway MPI Informat D-66123 Saarbrucken Germany
The well-known DISJOINT PATHS problem takes as input a graph G and a set of k pairs of terminals in G, and the task is to decide whether there exists a collection of k pairwise vertex-disjoint paths in G such that the... 详细信息
来源: 评论
Deciding first-order properties of locally tree-decomposable structures
收藏 引用
JOURNAL OF THE ACM 2001年 第6期48卷 1184-1206页
作者: Frick, M Grohe, M Univ Freiburg Inst Math Logik D-79104 Freiburg Germany Univ Edinburgh Lab Fdn Comp Sci Edinburgh EH9 3JZ Midlothian Scotland
We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of plana... 详细信息
来源: 评论
Recognizing k-Clique Extendible Orderings
收藏 引用
ALGORITHMICA 2021年 第11期83卷 3338-3362页
作者: Francis, Mathew Neogi, Rian Raman, Venkatesh Chennai Ctr Indian Stat Inst Chennai Tamil Nadu India HBNI Inst Math Sci Chennai Tamil Nadu India
We consider the complexity of recognizing k-clique-extendible graphs (k-C-E graphs) introduced by Spinrad (Efficient Graph Representations, AMS 2003), which are generalizations of comparability graphs. A graph is k-cl... 详细信息
来源: 评论
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
收藏 引用
ALGORITHMICA 2021年 第8期83卷 2503-2520页
作者: Iwata, Yoichi Kobayashi, Yusuke Natl Inst Informat Tokyo Japan Kyoto Univ Kyoto Japan
Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning. In this paper, we prove that this empirica... 详细信息
来源: 评论
Defensive alliances in graphs of bounded treewidth
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 251卷 334-339页
作者: Bliem, Bernhard Woltran, Stefan TU Wien Vienna Austria
The DEFENSIVE ALLIANCE problem has been studied extensively during the last fifteen years, but the question whether it is FPT when parameterized by treewidth has still remained open. We show that this problem is W[1]-... 详细信息
来源: 评论
Enumerate and expand:: Improved algorithms for connected Vertex Cover and Tree Cover
收藏 引用
THEORY OF COMPUTING SYSTEMS 2008年 第2期43卷 234-253页
作者: Moelle, Daniel Richter, Stefan Rossmanith, Peter Univ Aachen Rhein Westfal TH Aachen Dept Comp Sci D-5100 Aachen Germany
We present a new method of solving graph problems related to VERTEX COVER by enumerating and expanding appropriate sets of nodes. As an application, we obtain dramatically improved runtime bounds for two variants of t... 详细信息
来源: 评论
Grundy Coloring and Friends, Half-Graphs, Bicliques
收藏 引用
ALGORITHMICA 2023年 第1期85卷 1-28页
作者: Aboulker, Pierre Bonnet, Edouard Kim, Eun Jung Sikora, Florian PSL Univ DI ENS Paris France Univ Claude Bernard Lyon 1 Univ Lyon CNRS ENS LyonLIP UMR5668 Lyon France PSL Univ Univ Paris Dauphine LAMSADE CNRSUMR7243 Lyon France
The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order sigma, the smallest available color. The problem GRUNDY COLORING asks how many colors are needed for the most adversaria... 详细信息
来源: 评论