咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
Mixed Linear Layouts: complexity, Heuristics, and Experiments
arXiv
收藏 引用
arXiv 2019年
作者: de Col, Philipp Klute, Fabian Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
A k-page linear graph layout of a graph G = (V, E) draws all vertices along a line and each edge in one of k disjoint halfplanes called pages, which are bounded by . We consider two types of pages. In a stack page no ... 详细信息
来源: 评论
Turbocharging treewidth-bounded Bayesian network structure learning
arXiv
收藏 引用
arXiv 2020年
作者: Ramaswamy, Vaidyanathan Peruvemba Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
We present a new approach for learning the structure of a treewidth-bounded Bayesian Network (BN). The key to our approach is applying an exact method (based on MaxSAT) locally, to improve the score of a heuristically... 详细信息
来源: 评论
The Parameterized complexity of Extending Stack Layouts
arXiv
收藏 引用
arXiv 2024年
作者: Depian, Thomas Fink, Simon D. Ganian, Robert Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
An -page stack layout (also known as an -page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into stacks (or pages), such that the endpoints of no two edges on... 详细信息
来源: 评论
MCP-Solver: Integrating Language Models with Constraint Programming Systems
arXiv
收藏 引用
arXiv 2024年
作者: Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
While Large Language Models (LLMs) perform exceptionally well at natural language tasks, they often struggle with precise formal reasoning and the rigorous specification of problems. We present MCP-Solver, a prototype... 详细信息
来源: 评论
On structural parameterizations of the edge disjoint paths problem
arXiv
收藏 引用
arXiv 2017年
作者: Ganian, Robert Ordyniak, Sebastian Ramanujan, M.S. 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... 详细信息
来源: 评论
Learning fast-inference Bayesian networks  21
Learning fast-inference Bayesian networks
收藏 引用
Proceedings of the 35th International Conference on Neural Information Processing Systems
作者: Vaidyanathan Peruvemba Ramaswamy Stefan Szeider Algorithms and Complexity Group TU Wien Vienna Austria
We propose new methods for learning Bayesian networks (BNs) that reliably support fast inference. We utilize maximum state space size as a more fine-grained measure for the BN's reasoning complexity than the stand...
来源: 评论
Small unsatisfiable k-CNFs with bounded literal occurrence
arXiv
收藏 引用
arXiv 2024年
作者: Zhang, Tianwei Peitl, Tomáš Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
We obtain the smallest unsatisfiable formulas in subclasses of k-CNF (exactly k distinct literals per clause) with bounded variable or literal occurrences. Smaller unsatisfiable formulas of this type translate into st... 详细信息
来源: 评论
Slim Tree-Cut Width
arXiv
收藏 引用
arXiv 2022年
作者: Ganian, Robert Korchemna, Viktoriia Algorithms and Complexity Group TU Wien Vienna Austria
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it turned out that tree-cut width ... 详细信息
来源: 评论
On Computing Optimal Linear Diagrams
arXiv
收藏 引用
arXiv 2022年
作者: Dobler, Alexander Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical overlaps with other rows indicate set int... 详细信息
来源: 评论
Maximizing ink in partial edge drawings of k-plane graphs
arXiv
收藏 引用
arXiv 2019年
作者: Hummel, Matthias Klute, Fabian Nickel, Soeren Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, ... 详细信息
来源: 评论