咨询与建议

限定检索结果

文献类型

  • 195 篇 期刊文献
  • 125 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 245 篇 理学
    • 235 篇 数学
    • 20 篇 统计学(可授理学、...
    • 16 篇 系统科学
    • 13 篇 物理学
    • 3 篇 化学
    • 3 篇 地球物理学
    • 3 篇 生物学
  • 168 篇 工学
    • 123 篇 计算机科学与技术...
    • 78 篇 软件工程
    • 37 篇 土木工程
    • 34 篇 建筑学
    • 23 篇 测绘科学与技术
    • 17 篇 材料科学与工程(可...
    • 11 篇 信息与通信工程
    • 11 篇 控制科学与工程
    • 10 篇 电子科学与技术(可...
    • 5 篇 电气工程
    • 4 篇 农业工程
    • 3 篇 机械工程
    • 3 篇 光学工程
    • 3 篇 化学工程与技术
    • 3 篇 生物工程
    • 2 篇 轻工技术与工程
    • 2 篇 林业工程
    • 2 篇 生物医学工程(可授...
  • 30 篇 管理学
    • 18 篇 图书情报与档案管...
    • 13 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 4 篇 法学
    • 4 篇 社会学
  • 4 篇 农学
    • 4 篇 作物学
  • 1 篇 经济学
  • 1 篇 教育学

主题

  • 24 篇 parameterization
  • 18 篇 graph theory
  • 14 篇 polynomial appro...
  • 12 篇 graphic methods
  • 11 篇 trees (mathemati...
  • 11 篇 parameter estima...
  • 9 篇 approximation al...
  • 9 篇 directed graphs
  • 8 篇 drawing (graphic...
  • 8 篇 computational co...
  • 7 篇 hamiltonians
  • 7 篇 visualization
  • 7 篇 constraint satis...
  • 5 篇 encoding (symbol...
  • 5 篇 computational ge...
  • 5 篇 optimization
  • 4 篇 undirected graph...
  • 4 篇 machine learning
  • 4 篇 clustering algor...
  • 4 篇 polynomials

机构

  • 227 篇 algorithms and c...
  • 17 篇 department of in...
  • 16 篇 department of co...
  • 13 篇 algorithms and c...
  • 9 篇 indian institute...
  • 8 篇 school of comput...
  • 6 篇 faculty of infor...
  • 5 篇 school of comput...
  • 5 篇 school of comput...
  • 5 篇 department of in...
  • 5 篇 department of ap...
  • 5 篇 department of ma...
  • 4 篇 university of le...
  • 4 篇 department of en...
  • 4 篇 department of en...
  • 4 篇 institute of inf...
  • 4 篇 institute of mat...
  • 4 篇 algorithms and c...
  • 4 篇 algorithms and c...
  • 4 篇 cispa helmholtz ...

作者

  • 85 篇 ganian robert
  • 69 篇 nöllenburg marti...
  • 47 篇 szeider stefan
  • 31 篇 eiben eduard
  • 31 篇 bhore sujoy
  • 27 篇 ordyniak sebasti...
  • 18 篇 simonov kirill
  • 17 篇 hamm thekla
  • 17 篇 klute fabian
  • 16 篇 ramanujan m.s.
  • 14 篇 kanj iyad
  • 14 篇 montecchiani fab...
  • 13 篇 wallinger markus
  • 12 篇 golovach petr a.
  • 12 篇 li guangping
  • 12 篇 wulms jules
  • 12 篇 fomin fedor v.
  • 11 篇 rutter ignaz
  • 9 篇 gronemann martin
  • 9 篇 villedieu anaïs

语言

  • 305 篇 英文
  • 15 篇 其他
检索条件"机构=Algorithms and Complexity group"
320 条 记 录,以下是121-130 订阅
排序:
Resource and service discovery for large-scale robot networks in disaster scenarios
Resource and service discovery for large-scale robot network...
收藏 引用
2005 IEEE International Workshop on Safety, Security and Rescue Robotics
作者: Du, Jia Lei Rührup, Stefan Witkowski, Ulf Rückert, Ulrich System and Circuit Technology Research Group Heinz Nixdorf Institute University of Paderborn 33102 Paderborn Germany Algorithms and Complexity Research Group Heinz Nixdorf Institute University of Paderborn 33102 Paderborn Germany
If robots are deployed in large numbers in disaster scenarios, the ability to discover and exchange resources and services with other robots in an open, heterogeneous, large-scale network will be essential for a succe... 详细信息
来源: 评论
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion  41
A single-exponential fixed-parameter algorithm for distance-...
收藏 引用
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016
作者: Eiben, Eduard Ganian, Robert Kwon, O-Joung Algorithms and Complexity Group TU Wien Vienna Austria Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary FI MU Brno Czech Republic
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex... 详细信息
来源: 评论
Drawing k-linear Metro Maps
arXiv
收藏 引用
arXiv 2019年
作者: Nickel, Soeren Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Schematic metro maps in practice as well as metro map layout algorithms usually adhere to an octilinear layout style with all paths composed of horizontal, vertical, and 45◦-diagonal edges. Despite growing interest in... 详细信息
来源: 评论
Hedonic Diversity Games: A complexity Picture with More than Two Colors
arXiv
收藏 引用
arXiv 2022年
作者: Ganian, Robert Hamm, Thekla Knop, Dušan Schierreich, Šimon Suchý, Ondřej Algorithms and Complexity Group TU Wien Austria Algorithms and Complexity Group Utrecht University Netherlands Faculty of Information Technology Czech Technical University Prague Czech Republic
Hedonic diversity games are a variant of the classical hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classe... 详细信息
来源: 评论
Longest Cycle above Erdos-Gallai Bound  30
Longest Cycle above Erdos-Gallai Bound
收藏 引用
30th Annual European Symposium on algorithms, ESA 2022
作者: Fomin, Fedor V. Golovach, Petr A. Sagunov, Danil Simonov, Kirill Department of Informatics University of Bergen Norway St. Petersburg Department V.A. Steklov Institute of Mathematics Russia Algorithms and Complexity Group TU Wien Austria
In 1959, Erdos and Gallai proved that every graph G with average vertex degree ad(G) ≥ 2 contains a cycle of length at least ad(G). We provide an algorithm that for k ≥ 0 in time 2O(k) nO(1) decides whether a 2-conn... 详细信息
来源: 评论
On Balanced Coloring Games in Random Graphs
收藏 引用
Electronic Notes in Discrete Mathematics 2011年 38卷 425-430页
作者: Gugelmann, Luca Spöhel, Reto Institute of Theoretical Computer Science ETH Zürich 8092 Zürich Switzerland Algorithms and Complexity Group Max-Planck-Institut für Informatik 66123 Saarbrücken Germany
Consider the balanced Ramsey game, in which a player has r colors and where in each round r random edges of an initially empty graph on n vertices are presented. The player has to immediately assign a different color ... 详细信息
来源: 评论
Multiplicative approximations and the hypervolume indicator
Multiplicative approximations and the hypervolume indicator
收藏 引用
11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
作者: Friedrich, Tobias Horoba, Christian Neumann, Frank Algorithms Group International Computer Science Institute Berkeley CA United States Fakultät für Informatik LS 2 Technische Universität Dortmund Dortmund Germany Algorithms and Complexity Group Max-Planck-Institut für Informatik Saarbrücken Germany
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of algorithms maximizing the hypervolume for... 详细信息
来源: 评论
On the path-avoidance vertex-coloring game
收藏 引用
Electronic Notes in Discrete Mathematics 2011年 38卷 657-662页
作者: Mütze, Torsten Spöhel, Reto Institute of Theoretical Computer Science ETH Zürich 8092 Zürich Switzerland Algorithms and Complexity Group Max-Planck-Institut für Informatik 66123 Saarbrücken Germany
For any graph F and any integer r≥2, the online vertex-Ramsey density of F and r, denoted m*(F, r), is a parameter defined via a deterministic two-player Ramsey-type game (Painter vs. Builder). This parameter was int... 详细信息
来源: 评论
SAT-encodings for treecut width and treedepth
arXiv
收藏 引用
arXiv 2019年
作者: Ganian, Robert Lodha, Neha Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria Algorithms Group University of Sheffield Sheffield United Kingdom
The decomposition of graphs is a prominent algorithmic task with numerous applications in computer science. A graph decomposition method is typically associated with a width parameter (such as treewidth) that indicate... 详细信息
来源: 评论
The power of cut-based parameters for computing edge disjoint paths
arXiv
收藏 引用
arXiv 2018年
作者: Ganian, Robert Ordyniak, Sebastian Algorithms and Complexity group TU Wien Vienna Austria Algorithms group University of Sheffield Sheffield United Kingdom
This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting ... 详细信息
来源: 评论