咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 245 篇 理学
    • 234 篇 数学
    • 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

机构

  • 226 篇 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 篇 tu eindhoven

作者

  • 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

语言

  • 301 篇 英文
  • 15 篇 其他
检索条件"机构=Algorithms and complexity group"
317 条 记 录,以下是131-140 订阅
排序:
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k ≥ 5
arXiv
收藏 引用
arXiv 2024年
作者: Heimann, Sophia Hoang, Hung P. Hougardy, Stefan Research Institute for Discrete Mathematics University of Bonn Germany Algorithms and Complexity Group Faculty of Informatics TU Wien Austria Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Germany
The k-Opt algorithm is a local search algorithm for the Traveling Salesman Problem. Starting with an initial tour, it iteratively replaces at most k edges in the tour with the same number of edges to obtain a better t... 详细信息
来源: 评论
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
arXiv
收藏 引用
arXiv 2022年
作者: Kiesel, Rafael Schidler, André Institute of Logic and Computation Tu Wien Vienna Austria Algorithms and Complexity Group Tu Wien Vienna Austria
We propose a new approach to the Directed Feedback Vertex Set Problem (DFVSP), where the input is a directed graph and the solution is a minimum set of vertices whose removal makes the graph acyclic. Our approach, imp... 详细信息
来源: 评论
The Computational complexity of Concise Hypersphere Classification
arXiv
收藏 引用
arXiv 2023年
作者: Eiben, Eduard Ganian, Robert Kanj, Iyad Ordyniak, Sebastian Szeider, Stefan Royal Holloway University of London United Kingdom Algorithms and Complexity Group TU Wien Austria DePaul University United States University of Leeds United Kingdom
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanatio... 详细信息
来源: 评论
LACON-, SHRUB- AND PARITY-DECOMPOSITIONS: CHARACTERIZING TRANSDUCTIONS OF BOUNDED EXPANSION CLASSES
arXiv
收藏 引用
arXiv 2021年
作者: Dreier, Jan Algorithms and Complexity Group TU Wien Austria
The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time o... 详细信息
来源: 评论
Crossing-optimal extension of simple drawings  48
Crossing-optimal extension of simple drawings
收藏 引用
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
作者: Ganian, Robert Hamm, Thekla Klute, Fabian Parada, Irene Vogtenhuber, Birgit Algorithms and Complexity Group TU Wien Austria Deptartment of Information and Computing Sciences Utrecht University Netherlands TU Eindhoven Netherlands Graz University of Technology Austria
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph G and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems ar... 详细信息
来源: 评论
A Unifying Framework for Characterizing and Computing Width Measures  13
A Unifying Framework for Characterizing and Computing Width ...
收藏 引用
13th Innovations in Theoretical Computer Science Conference, ITCS 2022
作者: Eiben, Eduard Ganian, Robert Hamm, Thekla Jaffke, Lars Kwon, O-Joung Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Austria Department of Informatics University of Bergen Norway Department of Mathematics Incheon National University Korea Republic of Discrete Mathematics Group Institute for Basic Science Daejeon Korea Republic of
algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim... 详细信息
来源: 评论
Finding a Cluster in Incomplete Data  30
Finding a Cluster in Incomplete Data
收藏 引用
30th Annual European Symposium on algorithms, ESA 2022
作者: 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 Austria School of Computing DePaul University ChicagoIL United States University of Leeds School of Computing Leeds United Kingdom
We study two variants of the fundamental problem of finding a cluster in incomplete data. In the problems under consideration, we are given a multiset of incomplete d-dimensional vectors over the binary domain and int... 详细信息
来源: 评论
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...
来源: 评论
A SAT Approach to Twin-Width
arXiv
收藏 引用
arXiv 2021年
作者: Schidler, André Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
The graph invariant twin-width was recently introduced by Bonnet, Kim, Thomassé, and Watrigan. Problems expressible in first-order logic, which includes many prominent NP-hard problems, are tractable on graphs of... 详细信息
来源: 评论
Self-organized transport in noisy dynamic networks
arXiv
收藏 引用
arXiv 2024年
作者: Folz, Frederic Mehlhorn, Kurt Morigi, Giovanna Theoretische Physik Universität des Saarlandes Saarbrücken66123 Germany Algorithms and Complexity Group Max-Planck-Institut für Informatik Saarland Informatics Campus Saarbrücken66123 Germany
We present a numerical study of multi-commodity transport in a noisy, nonlinear network. The nonlinearity determines the dynamics of the edge capacities, which can be amplified or suppressed depending on the local cur... 详细信息
来源: 评论