咨询与建议

限定检索结果

文献类型

  • 164 篇 期刊文献
  • 71 篇 会议
  • 5 篇 学位论文

馆藏范围

  • 240 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 195 篇 工学
    • 185 篇 计算机科学与技术...
    • 46 篇 软件工程
    • 5 篇 电气工程
    • 3 篇 控制科学与工程
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 120 篇 理学
    • 119 篇 数学
    • 3 篇 统计学(可授理学、...
    • 2 篇 生物学
  • 15 篇 管理学
    • 15 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 4 篇 经济学
    • 4 篇 应用经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 240 篇 parameterized al...
  • 29 篇 graph algorithms
  • 24 篇 kernelization
  • 22 篇 treewidth
  • 20 篇 approximation al...
  • 14 篇 exact algorithms
  • 14 篇 parameterized co...
  • 10 篇 dynamic programm...
  • 7 篇 planar graphs
  • 6 篇 tree decompositi...
  • 6 篇 vertex cover
  • 6 篇 steiner tree
  • 5 篇 graphs
  • 5 篇 tournaments
  • 5 篇 exponential time...
  • 5 篇 branchwidth
  • 5 篇 chordal graphs
  • 5 篇 minimum fill-in
  • 5 篇 graph minors
  • 5 篇 feedback vertex ...

机构

  • 16 篇 univ elect sci &...
  • 16 篇 univ bergen dept...
  • 13 篇 univ bergen berg...
  • 9 篇 univ bergen dept...
  • 9 篇 univ trier fb ab...
  • 8 篇 univ montpellier...
  • 8 篇 inst math sci ma...
  • 6 篇 inst math sci ch...
  • 6 篇 ben gurion univ ...
  • 5 篇 univ warsaw inst...
  • 5 篇 hbni inst math s...
  • 4 篇 texas a&m univ d...
  • 4 篇 ben gurion univ ...
  • 4 篇 tu wien algorith...
  • 4 篇 univ bergen dept...
  • 4 篇 texas a&m univ d...
  • 3 篇 indian inst tech...
  • 3 篇 univ bergen n-50...
  • 3 篇 depaul univ sch ...
  • 3 篇 univ saarland d-...

作者

  • 25 篇 saurabh saket
  • 21 篇 thilikos dimitri...
  • 19 篇 xiao mingyu
  • 16 篇 fernau henning
  • 15 篇 fomin fedor v.
  • 15 篇 lokshtanov danie...
  • 8 篇 raman venkatesh
  • 8 篇 zehavi meirav
  • 7 篇 knop dusan
  • 7 篇 sau ignasi
  • 6 篇 pilipczuk marcin
  • 6 篇 hecher markus
  • 6 篇 panolan fahad
  • 6 篇 golovach petr a.
  • 6 篇 ramanujan m. s.
  • 6 篇 gaspers serge
  • 6 篇 fichte johannes ...
  • 6 篇 stamoulis gianno...
  • 5 篇 ordyniak sebasti...
  • 5 篇 pilipczuk michal

语言

  • 225 篇 英文
  • 13 篇 其他
检索条件"主题词=Parameterized Algorithms"
240 条 记 录,以下是191-200 订阅
Fast Sub-exponential algorithms and Compactness in Planar Graphs
收藏 引用
19th Annual European Symposium on algorithms (ESA)
作者: Thilikos, Dimitrios M. Univ Athens Dept Math Athens 15784 Greece
We provide a new theory, alternative to bidimensionality, of sub-exponential parameterized algorithms on planar graphs, which is based on the notion of compactness. Roughly speaking, a parameterized problem is (r, q)-... 详细信息
来源: 评论
A Fast Algorithm for SAT in Terms of Formula Length  24th
A Fast Algorithm for SAT in Terms of Formula Length
收藏 引用
24th International Conference on Theory and Applications of Satisfiability Testing (SAT)
作者: Peng, Junqiang Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China
In this paper, we prove that the general CNF satisfiability problem can be solved in O*(1.0646(L)) time, where L is the length of the input CNF-formula (i.e., the total number of literals in the formula), which improv... 详细信息
来源: 评论
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem  35
On Structural Parameterizations of the Bounded-Degree Vertex...
收藏 引用
35th Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Ganian, Robert Klute, Fabian Ordyniak, Sebastian TU Wien Algorithms & Complex Grp Vienna Austria FI MU Brno Czech Republic
We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on para... 详细信息
来源: 评论
Generalizations of Comparability Graphs
Generalizations of Comparability Graphs
收藏 引用
作者: Xu, Zhisheng Colorado State University
学位级别:Ph.D., Doctor of Philosophy
In rational decision-making models, transitivity of preferences is an important principle. In a transitive preference, one who prefers x to y and y to z must prefer x to z. Many preference relations, including total o... 详细信息
来源: 评论
Speeding up Exact algorithms With High Probability
收藏 引用
Electronic Notes in Discrete Mathematics 2006年 第SPEC. ISS.期25卷 57-59页
作者: Fernau, Henning Theoretische Informatik Universität Trier Germany
来源: 评论
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
Surface Split Decompositions and Subgraph Isomorphism in Gra...
收藏 引用
29th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Bonsma, Paul Humboldt Univ Dept Comp Sci Unter Linden 6 D-10099 Berlin Germany
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often ... 详细信息
来源: 评论
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs  41
FPT Approximation of Generalised Hypertree Width for Bounded...
收藏 引用
41st International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Lanzinger, Matthias Razgon, Igor TU Wien Vienna Austria Univ Oxford Oxford England Birkbeck Univ London London England
Generalised hypertree width (ghw) is a hypergraph parameter that is central to the tractability of many prominent problems with natural hypergraph structure. Computing ghw of a hypergraph is notoriously hard. The deci... 详细信息
来源: 评论
Mining Maximal Induced Bicliques using Odd Cycle Transversals  19
Mining Maximal Induced Bicliques using Odd Cycle Transversal...
收藏 引用
SIAM International Conference on Data Mining (SDM)
作者: Kloster, Kyle Sullivan, Blair D. Van der Poel, Andrew North Carolina State Univ Raleigh NC 27695 USA
Many common graph data mining tasks take the form of identifying dense subgraphs (e.g. clustering, clique-finding, etc). In biological applications, the natural model for these dense substructures is often a complete ... 详细信息
来源: 评论
Degreewidth: A New Parameter for Solving Problems on Tournaments  1
收藏 引用
49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
作者: Davot, Tom Isenmann, Lucas Roy, Sanjukta Thiebaut, Jocelyn Univ Technol Compiegne CNRS Heudiasyc Compiegne France Univ Montpellier Montpellier France Penn State Univ State Coll PA USA Czech Tech Univ Fac Informat Technol Prague Czech Republic
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a measure of how far is the tournament from being acyclic. The degreewidth of a tournament T denoted by Delta(T) is the m... 详细信息
来源: 评论
Computing Fragmentation Trees from Metabolite Multiple Mass Spectrometry Data  15th
Computing Fragmentation Trees from Metabolite Multiple Mass ...
收藏 引用
RECOMB - 15th Annual International Conference on Research in Computational Molecular Biology
作者: Scheubert, Kerstin Hufsky, Franziska Rasche, Florian Boecker, Sebastian Univ Jena Lehrstuhl Bioinformat D-07743 Jena Germany Max Planck Inst Chem Ecol Jena Germany
Since metabolites cannot be predicted from the genome sequence, high-throughput de novo identification of small molecules is highly sought. Mass spectrometry (MS) in combination with a fragmentation technique is commo... 详细信息
来源: 评论