咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 942 篇 工学
    • 920 篇 计算机科学与技术...
    • 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 条 记 录,以下是301-310 订阅
排序:
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs  48th
Multi-Parameter Analysis of Finding Minors and Subgraphs in ...
收藏 引用
48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)
作者: Arrighi, Emmanuel Gruttemeier, Niels Morawietz, Nils Sommer, Frank Wolf, Petra Univ Bergen Bergen Norway Philipps Univ Marburg Marburg Germany
We study the computational complexity of determining structural properties of edge-periodic temporal graphs (EPGs). EPGs are time-varying graphs that compactly represent periodic behavior of components of a dynamic ne... 详细信息
来源: 评论
The Parametrized complexity of the Segment Number  31st
The Parametrized Complexity of the Segment Number
收藏 引用
31st International Symposium on Graph Drawing and Network Visualization (GD)
作者: Cornelsen, Sabine Da Lozzo, Giordano Grilli, Luca Gupta, Siddharth Kratochvil, Jan Wolff, Alexander Univ Konstanz Constance Germany Roma Tre Univ Rome Italy Univ Perugia Perugia Italy Univ Warwick Coventry W Midlands England Charles Univ Prague Prague Czech Republic Univ Wurzburg Wurzburg Germany
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph G, the segment number of G is the minimum number of segments that can be achieved by any pla... 详细信息
来源: 评论
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
Solving Distance-constrained Labeling Problems for Small Dia...
收藏 引用
37th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
作者: Hanaka, Tesshu Ono, Hirotaka Sugiyama, Kosuke Kylishu Univ Dept Informat Fukuoka Japan Nagoya Univ Dept Math Informat Nagoya Aichi Japan
For an undirected graph G = (V, E) and a k-non-negative integer vector p = (p(1),..., p(k)), a mapping l : V -> N boolean OR {0} is called an L(p)-labeling of G if |vertical bar l(u) - l(v)vertical bar >= p(d) f... 详细信息
来源: 评论
Upward and Orthogonal Planarity are W-Hard parameterized by Treewidth  31st
Upward and Orthogonal Planarity are W-Hard Parameterized by ...
收藏 引用
31st International Symposium on Graph Drawing and Network Visualization (GD)
作者: Jansen, Bart M. P. Khazaliya, Liana Kindermann, Philipp Liotta, Giuseppe Montecchiani, Fabrizio Simonov, Kirill Eindhoven Univ Technol Eindhoven Netherlands Tech Univ Wien Vienna Austria Univ Trier Trier Germany Univ Perugia Perugia Italy Univ Potsdam Hasso Plattner Inst Potsdam Germany
UPWARD PLANARITY TESTING and RECTILINEAR PLANARITY TESTING are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth. In this paper we show that these tw... 详细信息
来源: 评论
Polynomial Formal Verification exploiting Constant Cutwidth  34
Polynomial Formal Verification exploiting Constant Cutwidth
收藏 引用
34th International Workshop on Rapid System Prototyping - Shortening the Path from Specification to Prototype
作者: Nadeem, Mohamed Kleinekathoefer, Jan Drechsler, Rolf Univ Bremen Bremen Germany DFKI GmbH Bremen Germany
Only formal methods can guarantee the correctness of a circuit, but are usually very time and memory consuming. Therefore, efficient formal verification is key in the design of complex circuits. Many verification tech... 详细信息
来源: 评论
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves  24th
Kernelization for Finding Lineal Topologies (Depth-First Spa...
收藏 引用
24th International Symposium on Fundamentals of Computation Theory (FCT)
作者: Sam, Emmanuel Bergougnoux, Benjamin Golovach, Petr A. Blaser, Nello Univ Bergen Dept Informat Bergen Norway Univ Warsaw Inst Informat Warsaw Poland
For a given graph G, a depth-first search (DFS) tree T of G is an r-rooted spanning tree such that every edge of G is either an edge of T or is between a descendant and an ancestor in T. A graph G together with a DFS ... 详细信息
来源: 评论
Treewidth-based algorithms for the small parsimony problem on networks
收藏 引用
ALGORITHMS FOR MOLECULAR BIOLOGY 2022年 第1期17卷 1-31页
作者: Scornavacca, Celine Weller, Mathias Univ Montpellier CNRS IRD ISEMEPHE Montpellier France Univ Gustave Eiffel CNRS LIGM Paris France
Background: Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the SMALL PARSIMONY problem: given a tree T... 详细信息
来源: 评论
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas
收藏 引用
ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2022年 第2期10卷 1-53页
作者: Boehmer, Niclas Heeger, Klaus Tech Univ Berlin Algorithm & Computat Complex Ernst Reuter Pl 7 D-10587 Berlin Germany
In the NP-hard Hospital Residents problem with lower and upper quotas (HR-QUL), the goal is to find a stable matching of residents to hospitals where the number of residents matched to a hospital is either between its... 详细信息
来源: 评论
On the computational complexity of the bipartizing matching problem
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2022年 第2期316卷 1235-1256页
作者: Lima, Carlos V. G. C. Rautenbach, Dieter Souza, Ueverton S. Szwarcfiter, Jayme L. Univ Fed Cariri Ctr Ciencias & Tecnol Juazeiro Do Norte Brazil Ulm Univ Inst Optimizat & Operat Res Ulm Germany Univ Fed Fluminense Inst Comp Niteroi RJ Brazil Univ Fed Rio de Janeiro COPPE PESC Rio De Janeiro Brazil
Given a graph G = ( V, E), an edge bipartization set of G is a subset E' subset of E(G) such that G' = (V, E\E') is bipartite. An edge bipartization set that is also a matching of G is called a bipartizing... 详细信息
来源: 评论
Offensive alliances in graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 989卷
作者: Gaikwad, Ajinkya Maity, Soumen Indian Inst Sci Educ & Res Dept Math Dr Homi Bhabha Rd Pune 411008 Maharashtra India
The OFFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set S subset of V of vertices is an offensive alliance in an undirected graph G = (V, E) if each v is an element of N(S) has ... 详细信息
来源: 评论