咨询与建议

限定检索结果

文献类型

  • 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 篇 其他
检索条件"机构=Group for Algorithms and Complexity"
317 条 记 录,以下是61-70 订阅
排序:
Block Crossings in One-Sided Tanglegrams
arXiv
收藏 引用
arXiv 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... 详细信息
来源: 评论
SAT modulo symmetries for graph generation  27
SAT modulo symmetries for graph generation
收藏 引用
27th International Conference on Principles and Practice of Constraint Programming, CP 2021
作者: Kirchweger, Markus Szeider, Stefan Algorithms and Complexity Group TU Wien Austria
We propose a novel constraint-based approach to graph generation. Our approach utilizes the interaction between a CDCL SAT solver and a special symmetry propagator where the SAT solver runs on an encoding of the desir... 详细信息
来源: 评论
Splitting Plane Graphs to Outerplanarity
arXiv
收藏 引用
arXiv 2023年
作者: Gronemann, Martin Nöllenburg, Martin Villedieu, Anaïs Algorithms and Complexity Group TU Wien Vienna Austria
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as pos... 详细信息
来源: 评论
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5  51
The k-Opt Algorithm for the Traveling Salesman Problem Has E...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 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... 详细信息
来源: 评论
***: Compressing Linear Set Diagrams
arXiv
收藏 引用
arXiv 2023年
作者: Wallinger, Markus Dobler, Alexander Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a column. Each such line segment of a ... 详细信息
来源: 评论
Constrained Boundary Labeling
arXiv
收藏 引用
arXiv 2024年
作者: Depian, Thomas Nöllenburg, Martin Terziadis, Soeren Wallinger, Markus Algorithms and Complexity Group TU Wien Austria Algorithms cluster TU Eindhoven Netherlands Technical University of Munich Germany
Boundary labeling is a technique in computational geometry used to label dense sets of feature points in an illustration. It involves placing labels along an axis-aligned bounding box and connecting each label with it... 详细信息
来源: 评论
Breaking Symmetries in Quantified Graph Search: A Comparative Study
arXiv
收藏 引用
arXiv 2025年
作者: Janota, Mikoláš Kirchweger, Markus Peitl, Tomáš Szeider, Stefan Czech Technical University in Prague Czech Republic Algorithms and Complexity Group TU Wien Austria
Graph generation and enumeration problems often require handling equivalent graphs—those that differ only in vertex labeling. We study how to extend SAT Modulo Symmetries (SMS), a framework for eliminating such redun... 详细信息
来源: 评论
The Computational complexity of Positive Non-Clashing Teaching in Graphs
arXiv
收藏 引用
arXiv 2025年
作者: Ganian, Robert Khazaliya, Liana Inerney, Fionn Mc Rocton, Mathis Algorithms and Complexity Group TU Wien Austria Telefónica Scientific Research Barcelona Spain
We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach a... 详细信息
来源: 评论
The complexity of Optimizing Atomic Congestion
arXiv
收藏 引用
arXiv 2023年
作者: Brand, Cornelius Ganian, Robert Kalyanasundaram, Subrahmanyam Inerney, Fionn Mc Algorithms & Complexity Theory Group Regensburg University Germany Algorithms and Complexity Group TU Wien Austria Department of Computer Science and Engineering IIT Hyderabad India
Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the pric... 详细信息
来源: 评论
A SAT Attack on Rota’s Basis Conjecture  25
A SAT Attack on Rota’s Basis Conjecture
收藏 引用
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022
作者: Kirchweger, Markus Scheucher, Manfred Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Institut für Mathematik Technische Universität Berlin Germany
The SAT modulo Symmetries (SMS) is a recently introduced framework for dynamic symmetry breaking in SAT instances. It combines a CDCL SAT solver with an external lexicographic minimality checking algorithm. We extend ... 详细信息
来源: 评论