咨询与建议

限定检索结果

文献类型

  • 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 篇 其他
检索条件"机构=Algorithms and complexity group"
320 条 记 录,以下是21-30 订阅
排序:
CSP Beyond Tractable Constraint Languages  28
CSP Beyond Tractable Constraint Languages
收藏 引用
28th International Conference on Principles and Practice of Constraint Programming, CP 2022
作者: Dreier, Jan Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Algorithms and Complexity Group University of Leeds United Kingdom
The constraint satisfaction problem (CSP) is among the most studied computational problems. While NP-hard, many tractable subproblems have been identified (Bulatov 2017, Zuk 2017). Backdoors, introduced by Williams, G... 详细信息
来源: 评论
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding  51
A Tight Subexponential-Time Algorithm for Two-Page Book Embe...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Ganian, Robert Müller, Haiko Ordyniak, Sebastian Paesani, Giacomo Rychlicki, Mateusz Algorithms and Complexity Group TU Wien Austria School of Computing University of Leeds United Kingdom
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into "pages", which are half-planes bounded by that line. Two-page book embeddin... 详细信息
来源: 评论
Boundary Labeling in a Circular Orbit  32
Boundary Labeling in a Circular Orbit
收藏 引用
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024
作者: Bonerath, Annika Nöllenburg, Martin Terziadis, Soeren Wallinger, Markus Wulms, Jules University of Bonn Germany Algorithms and Complexity Group TU Wien Austria TU Eindhoven Netherlands Chair for Efficient Algorithms TU Munich Germany
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresponding points are connected via cross... 详细信息
来源: 评论
Transitions in Dynamic Point Labeling  12
Transitions in Dynamic Point Labeling
收藏 引用
12th International Conference on Geographic Information Science, GIScience 2023
作者: Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules Algorithms and Complexity Group TU Wien Austria Algorithm Engineering Group TU Dortmund Germany
The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point feat... 详细信息
来源: 评论
Twin-Width Meets Feedback Edges and Vertex Integrity  19
Twin-Width Meets Feedback Edges and Vertex Integrity
收藏 引用
19th International Symposium on Parameterized and Exact Computation, IPEC 2024
作者: Balabán, Jakub Ganian, Robert Rocton, Mathis Faculty of Informatics Masaryk University Brno Czech Republic Algorithms and Complexity Group TU Wien Vienna Austria
The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding o... 详细信息
来源: 评论
Slim Tree-Cut Width  17
Slim Tree-Cut Width
收藏 引用
17th International Symposium on Parameterized and Exact Computation, IPEC 2022
作者: Ganian, Robert Korchemna, Viktoriia Algorithms and Complexity Group TU Wien 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 ... 详细信息
来源: 评论
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)
A Mathematical Runtime Analysis of the Non-dominated Sorting...
收藏 引用
2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion
作者: Wietheger, Simon Doerr, Benjamin Algorithms and Complexity Group TU Wien Vienna Austria École Polytechnique CNRS Institut Polytechnique de Paris Palaiseau France
The Non-dominated Sorting Genetic Algorithm II (NSGA-II) is the most prominent multi-objective evolutionary algorithm for real-world applications. While it performs evidently well on bi-objective optimization problems... 详细信息
来源: 评论
Splitting Plane Graphs to Outerplanarity
收藏 引用
Journal of Graph algorithms and Applications 2024年 第3期28卷 31-48页
作者: 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... 详细信息
来源: 评论
Fixed-Parameter algorithms for Computing Bend-Restricted RAC Drawings of Graphs
收藏 引用
Journal of Graph algorithms and Applications 2024年 第2期28卷 131-150页
作者: Brand, Cornelius Ganian, Robert Röder, Sebastian Schager, Florian Algorithms and Complexity Group TU Wien Vienna Austria
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly 90◦, where the number of bends on such polylines is typically restricted ... 详细信息
来源: 评论
Computing Hive Plots: A Combinatorial Framework
收藏 引用
Journal of Graph algorithms and Applications 2024年 第2期28卷 101-129页
作者: Nöllenburg, Martin Wallinger, Markus Algorithms and Complexity Group TU Wien Vienna Austria
Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective endpoints. In previous work on hive plo... 详细信息
来源: 评论