咨询与建议

限定检索结果

文献类型

  • 240 篇 期刊文献
  • 203 篇 会议
  • 2 册 图书

馆藏范围

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

日期分布

学科分类号

  • 321 篇 理学
    • 302 篇 数学
    • 29 篇 统计学(可授理学、...
    • 22 篇 系统科学
    • 19 篇 物理学
    • 12 篇 生物学
    • 3 篇 化学
    • 3 篇 地球物理学
  • 230 篇 工学
    • 166 篇 计算机科学与技术...
    • 109 篇 软件工程
    • 39 篇 土木工程
    • 36 篇 建筑学
    • 23 篇 测绘科学与技术
    • 18 篇 材料科学与工程(可...
    • 17 篇 控制科学与工程
    • 16 篇 信息与通信工程
    • 12 篇 电子科学与技术(可...
    • 8 篇 电气工程
    • 7 篇 机械工程
    • 7 篇 生物工程
    • 4 篇 光学工程
    • 4 篇 农业工程
    • 4 篇 生物医学工程(可授...
    • 3 篇 化学工程与技术
    • 3 篇 交通运输工程
  • 53 篇 管理学
    • 29 篇 图书情报与档案管...
    • 25 篇 管理科学与工程(可...
    • 11 篇 工商管理
  • 7 篇 农学
    • 7 篇 作物学
  • 6 篇 法学
    • 6 篇 社会学
  • 4 篇 经济学
    • 4 篇 应用经济学
  • 1 篇 教育学
  • 1 篇 医学
  • 1 篇 军事学

主题

  • 27 篇 parameterization
  • 21 篇 graph theory
  • 18 篇 approximation al...
  • 17 篇 polynomial appro...
  • 15 篇 graphic methods
  • 13 篇 trees (mathemati...
  • 11 篇 visualization
  • 11 篇 parameter estima...
  • 10 篇 computational co...
  • 10 篇 algorithm design...
  • 10 篇 directed graphs
  • 9 篇 optimization
  • 9 篇 clustering algor...
  • 8 篇 drawing (graphic...
  • 8 篇 hamiltonians
  • 7 篇 evolutionary alg...
  • 7 篇 constraint satis...
  • 7 篇 evolutionary com...
  • 6 篇 runtime
  • 6 篇 integer programm...

机构

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

作者

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

语言

  • 424 篇 英文
  • 20 篇 其他
  • 1 篇 中文
检索条件"机构=Algorithms and Complexity"
445 条 记 录,以下是51-60 订阅
排序:
Finding linear arrangements of hypergraphs with bounded cutwidth in linear time  14
Finding linear arrangements of hypergraphs with bounded cutw...
收藏 引用
14th International Symposium on Parameterized and Exact Computation, IPEC 2019
作者: Hamm, Thekla Algorithms and Complexity Group TU Wien Vienna Austria
Cutwidth is a fundamental graph layout parameter. It generalises to hypergraphs in a natural way and has been studied in a wide range of contexts. For graphs it is known that for a fixed constant k there is a linear t... 详细信息
来源: 评论
Meta-kernelization using well-structured modulators  10
Meta-kernelization using well-structured modulators
收藏 引用
10th International Symposium on Parameterized and Exact Computation, IPEC 2015
作者: Eiben, Eduard Ganian, Robert Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
Kernelization investigates exact preprocessing algorithms with performance guarantees. The most prevalent type of parameters used in kernelization is the solution size for optimization problems;however, also structura... 详细信息
来源: 评论
A Structural complexity Analysis of Hierarchical Task Network Planning
arXiv
收藏 引用
arXiv 2024年
作者: Brand, Cornelius Ganian, Robert Inerney, Fion Mc Wietheger, Simon Algorithms & Complexity Theory Group Regensburg University Germany Algorithms and Complexity Group TU Wien Austria Telefónica Scientific Research Barcelona Spain
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether ... 详细信息
来源: 评论
Discovering archipelagos of tractability for constraint satisfaction and counting  27
Discovering archipelagos of tractability for constraint sati...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016
作者: Ganian, Robert Ramanujan, M.S. Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with ... 详细信息
来源: 评论
The Power of Collaboration: Learning Large Bayesian Networks at Scale  36
The Power of Collaboration: Learning Large Bayesian Networks...
收藏 引用
36th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2024
作者: Ramaswamy, Vaidyanathan Peruvemba Szeider, Stefan Xia, Hai Algorithms and Complexity Group TU Wien Vienna Austria
We present a novel approach to learn the structure of large Bayesian Networks (BNs) of bounded treewidth. Our approach combines the complementary strengths of heuristic and MaxSAT-based methods. Both methods operate i... 详细信息
来源: 评论
Block Crossings in One-Sided Tanglegrams  18th
Block Crossings in One-Sided Tanglegrams
收藏 引用
18th International Symposium on algorithms and Data Structures, WADS 2023
作者: Dobler, Alexander Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Layered Area-Proportional Rectangle Contact Representations  29th
Layered Area-Proportional Rectangle Contact Representations
收藏 引用
29th International Symposium on Graph Drawing and Network Visualization, GD 2021
作者: Nöllenburg, Martin Villedieu, Anaïs Wulms, Jules Algorithms and Complexity Group TU Wien Vienna Austria
We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoint unit-height rectangles of prescrib... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
ASP-QRAT: a Conditionally Optimal Dual Proof System for ASP  21
ASP-QRAT: a Conditionally Optimal Dual Proof System for ASP
收藏 引用
21st International Conference on Principles of Knowledge Representation and Reasoning, KR 2024
作者: Chew, Leroy de Colnet, Alexis Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
Answer Set Programming (ASP) is a declarative programming approach that captures many problems in knowledge representation and reasoning. To certify an ASP solver’s decision, whether the program is consistent or inco... 详细信息
来源: 评论