咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是251-260 订阅
排序:
On the parameterized complexity of simultaneous deletion problems  37
On the parameterized complexity of simultaneous deletion pro...
收藏 引用
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017
作者: Agrawal, Akanksha Krithika, R. Lokshtanov, Daniel Mouawad, Amer E. Ramanujan, M.S. Department of Informatics University of Bergen Bergen Norway Institute of Mathematical Sciences HBNI Chennai India Algorithms and Complexity Group Vienna University of Technology Vienna Austria
For a family of graphs F, an n-vertex graph G, and a positive integer k, the F-Deletion problem asks whether we can delete at most k vertices from G to obtain a graph in F. F-Deletion generalizes many classical graph ... 详细信息
来源: 评论
Minimizing crossings in constrained two-sided circular graph layouts
arXiv
收藏 引用
arXiv 2018年
作者: Klute, Fabian Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossi... 详细信息
来源: 评论
On Erdős–Szekeres-type problems for k-convex point sets
收藏 引用
European Journal of Combinatorics 2020年 89卷 103157-103157页
作者: Balko, Martin Bhore, Sujoy Martínez-Sandoval, Leonardo Valtr, Pavel Department of Applied Mathematics Charles University Prague Czech Republic Algorithms and Complexity Group TU Wien Vienna Austria Institut de Mathématiques de Jussieu – Paris Rive Gauche (UMR 7586) Sorbonne Université Paris France Faculty of Sciences National Autonomous University of Mexico Mexico City Mexico
We study Erdős–Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning sim...
来源: 评论
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 ... 详细信息
来源: 评论
Geometric Planar Networks on Bichromatic Collinear Points
arXiv
收藏 引用
arXiv 2019年
作者: Bandyapadhyay, Sayan Banik, Aritra Bhore, Sujoy Nöllenburg, Martin Department of Informatics University of Bergen Norway School of Computer Sciences NISER Bhubaneswar India Indian Institute of Science Education and Research Bhopal India Algorithms and Complexity Group Technische Universität Wien Austria
We study three classical graph problems – Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studie... 详细信息
来源: 评论
Brief announcement: Treewidth modulator: Emergency exit for DFVS  45
Brief announcement: Treewidth modulator: Emergency exit for ...
收藏 引用
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
作者: Lokshtanov, Daniel Ramanujan, M.S. Saurabh, Saket Sharma, Roohani Zehavi, Meirav Department of Informatics University of Bergen Norway Algorithms and Complexity Group TU Wien Austria Institute of Mathematical Sciences HBNI UMI ReLax India Department of Computer Science Ben-Gurion University Israel
In the Directed Feedback Vertex Set (DFVS) problem, we are given as input a directed graph D and an integer k, and the objective is to check whether there exists a set S of at most k vertices such that F = D − S is a ... 详细信息
来源: 评论
The complexity landscape of decompositional parameters for ILP
arXiv
收藏 引用
arXiv 2018年
作者: Ganian, Robert Ordyniak, Sebastian Algorithms and Complexity Group TU Wien Favoritenstrasse 9-11 Wien1040 Austria
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. ... 详细信息
来源: 评论
On structural parameterizations of the edge disjoint paths problem  28
On structural parameterizations of the edge disjoint paths p...
收藏 引用
28th International Symposium on algorithms and Computation, ISAAC 2017
作者: Ganian, Robert Ordyniak, Sebastian Sridharan, Ramanujan Algorithms and Complexity Group TU Wien Vienna Austria
In this paper we revisit 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 connec... 详细信息
来源: 评论
The parameterized complexity of clustering incomplete data
arXiv
收藏 引用
arXiv 2019年
作者: Eiben, Eduard Ganian, Robert Kanj, Iyad Ordyniak, Sebastian Szeider, Stefan Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Vienna Austria School of Computing DePaul University Chicago United States University of Leeds School of Computing Leeds United Kingdom
We study fundamental clustering problems for incomplete data. Specifically, given a set of incomplete d-dimensional vectors (representing rows of a matrix), the goal is to complete the missing vector entries in a way ... 详细信息
来源: 评论
Parameterized algorithms for the matrix completion problem
arXiv
收藏 引用
arXiv 2018年
作者: Ganian, Robert Kanj, Iyad Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Austria School of Computing DePaul University Chicago United States
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows... 详细信息
来源: 评论