咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 246 篇 理学
    • 235 篇 数学
    • 20 篇 统计学(可授理学、...
    • 16 篇 系统科学
    • 13 篇 物理学
    • 4 篇 化学
    • 4 篇 生物学
    • 3 篇 地球物理学
  • 169 篇 工学
    • 123 篇 计算机科学与技术...
    • 78 篇 软件工程
    • 37 篇 土木工程
    • 34 篇 建筑学
    • 23 篇 测绘科学与技术
    • 17 篇 材料科学与工程(可...
    • 11 篇 信息与通信工程
    • 11 篇 控制科学与工程
    • 10 篇 电子科学与技术(可...
    • 5 篇 电气工程
    • 4 篇 农业工程
    • 3 篇 机械工程
    • 3 篇 光学工程
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 3 篇 生物工程
    • 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

语言

  • 304 篇 英文
  • 15 篇 其他
检索条件"机构=Group for Algorithms and Complexity"
320 条 记 录,以下是241-250 订阅
排序:
On strict (outer-)confluent graphs
arXiv
收藏 引用
arXiv 2019年
作者: Förster, Henry Ganian, Robert Klute, Fabian Nöllenburg, Martin University of Tübingen Tübingen Germany Algorithms and Complexity Group TU Wien Vienna Austria
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar ... 详细信息
来源: 评论
Parameterized algorithms for book embedding problems
arXiv
收藏 引用
arXiv 2019年
作者: Bhore, Sujoy Ganian, Robert Montecchiani, Fabrizio Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria Engineering Department University of Perugia Perugia Italy
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determi... 详细信息
来源: 评论
Algorithm and hardness results on liar’s dominating set and k-tuple dominating set
arXiv
收藏 引用
arXiv 2019年
作者: Banerjee, Sandip Bhore, Sujoy Department of Computer Science Hebrew University of Jerusalem Israel Algorithms and Complexity Group Technische Universität Wien Austria
Given a graph G = (V, E), the dominating set problem asks for a minimum subset of vertices D ⊆ V such that every vertex u ∈ V \D is adjacent to at least one vertex v ∈ D. That is, the set D satisfies the condition t... 详细信息
来源: 评论
On layered fan-planar graph drawings
arXiv
收藏 引用
arXiv 2020年
作者: Biedl, Therese Chaplick, Steven Fiala, Jiři Kaufmann, Michael Montecchiani, Fabrizio Nöllenburg, Martin Raftopoulou, Chrysanthi University of Waterloo Canada Universität Würzburg Germany Charles University Prague Czech Republic Universität Tübingen Germany Università degli Studi di Perugia Italy Algorithms and Complexity Group TU Wien Vienna Austria National Technical University of Athens Greece
In this paper, we study fan-planar drawings that use h layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fi... 详细信息
来源: 评论
Integer programming and incidence treedepth
arXiv
收藏 引用
arXiv 2020年
作者: Eiben, Eduard Ganian, Robert Knop, Dušan Ordyniak, Sebastian Pilipczuk, Michal Wrochna, Marcin Department of Computer Science Royal Holloway University of London United Kingdom Algorithms and Complexity Group Vienna University of Technology Austria Department of Theoretical Computer Science Czech Technical University in Prague Czech Republic School of Computing University of Leeds United Kingdom Institute of Informatics University of Warsaw Poland University of Oxford United Kingdom
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, int... 详细信息
来源: 评论
Geometric systems of unbiased representatives
arXiv
收藏 引用
arXiv 2020年
作者: Banik, Aritra Bhattacharya, Bhaswar B. Bhore, Sujoy Martínez-Sandoval, Leonardo School of Computer Sciences National Institute of Science Education and Research HBNI Bhubaneswar India Department of Statistics University of Pennsylvania Philadelphia United States Algorithms and Complexity Group Technische Universität Wien Austria Institut de Mathématiques de Jussieu-Paris Rive Gauche UMR 7586 Sorbonne Université France
Let P be a set of points in Rd, B a bicoloring of P and O a family of geometric objects (that is, intervals, boxes, balls, etc). An object from O is called balanced with respect to B if it contains the same number of ...
来源: 评论
Balanced connected subgraph problem in geometric intersection graphs
arXiv
收藏 引用
arXiv 2019年
作者: Bhore, Sujoy Jana, Satyabrata Pandit, Supantha Roy, Sasanka Algorithms and Complexity Group TU Wien Vienna Austria Indian Statistical Institute Kolkata India Dhirubhai Ambani Institute of Information and Communication Technology Gandhinagar Gujarat India
We study the Balanced Connected Subgraph (shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a vertex-colored graph G = (V, E... 详细信息
来源: 评论
Perfect Pseudo-Matchings in cubic graphs
arXiv
收藏 引用
arXiv 2019年
作者: Fleischner, Herbert Behrooz Bagheri, Gh. Klocker, Benedikt Algorithms and Complexity Group Vienna University of Technology Favoritenstrasse 9-11 Vienna1040 Department of Mathematics West Virginia University MorgantownWV26506-6310 United States
A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K2or to K1,3. In view of snarks G with dominating cycle C, this is a natural generalization of... 详细信息
来源: 评论
External labeling techniques: A taxonomy and survey
arXiv
收藏 引用
arXiv 2019年
作者: Bekos, Michael A. Niedermann, Benjamin Nöllenburg, Martin Institute for Informatics University of Tübingen Tübingen Germany Institute of Geodesy and Geoinformation University of Bonn Bonn Germany Algorithms and Complexity Group Tu Wien Vienna Austria
External labeling is frequently used for annotating features in graphical displays and visualizations, such as technical illustrations, anatomical drawings, or maps, with textual information. Such a labeling connects ... 详细信息
来源: 评论
Scheduling with non-renewable resources: Minimizing the sum of completion times
arXiv
收藏 引用
arXiv 2019年
作者: Bércziy, Kristóf Királyz, Tamás Omlorx, Simon MTA-ELTE Egerváry Research Group Department of Operations Research Eötvös Loránd University Budapest Tu Hamburg Institute for Algorithms and Complexity Hamburg
The paper considers single-machine scheduling problems with a non-renewable resource. In this setting, we are given a set jobs, each of which is characterized by a processing time, a weight, and the job also has some ... 详细信息
来源: 评论