咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
Level Planarity Is More Difficult Than We Thought  32
Level Planarity Is More Difficult Than We Thought
收藏 引用
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024
作者: Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Computer Science and Mathematics Universität Passau Germany Charles University Prague Czech Republic
We consider three simple quadratic-time algorithms for Level Planarity and give a level-planar instance that they either falsely classify as negative or for which they output a non-planar drawing. © Simon D. Fink... 详细信息
来源: 评论
Computing Hive Plots: A Combinatorial Framework
arXiv
收藏 引用
arXiv 2023年
作者: Nöllenburg, Martin Wallinger, Markus Algorithms and Complexity Group TU Wien 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... 详细信息
来源: 评论
Crossing Minimization in Time Interval Storylines
arXiv
收藏 引用
arXiv 2023年
作者: Dobler, Alexander Nöllenburg, Martin Stojanovic, Daniel Villedieu, Anaïs Wulms, Jules Algorithms and Complexity Group TU Wien Austria
Storyline visualizations are a popular way of visualizing characters and their interactions over time: Characters are drawn as x-monotone curves and interactions are visualized through close proximity of the correspon...
来源: 评论
MySemCloud: Semantic-aware Word Cloud Editing
arXiv
收藏 引用
arXiv 2023年
作者: Huber, Michael Nöllenburg, Martin Villedieu, Anaïs The Algorithms and Complexity Group at TU Wien Austria
Word clouds are a popular text visualization technique that summarize an input text by displaying its most important words in a compact image. The traditional layout methods do not take proximity effects between words... 详细信息
来源: 评论
A Note on the complexity of One-Sided Crossing Minimization of Trees
arXiv
收藏 引用
arXiv 2023年
作者: Dobler, Alexander Algorithms and Complexity Group TU Wien Austria
In 2011, Harrigan and Healy published a polynomial-time algorithm for one-sided crossing minimization for trees [2]. We point out a counterexample to that algorithm, and show that one-sided crossing minimization is NP... 详细信息
来源: 评论
Lossy Kernelization of Same-Size Clustering  1
收藏 引用
17th International Computer Science Symposium in Russia, CSR 2022
作者: Bandyapadhyay, Sayan Fomin, Fedor V. Golovach, Petr A. Purohit, Nidhi Siminov, Kirill Department of Informatics University of Bergen Bergen Norway Algorithms and Complexity Group TU Wien Vienna Austria
In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) ... 详细信息
来源: 评论
PACE Solver Description: Touiouidth  18
PACE Solver Description: Touiouidth
收藏 引用
18th International Symposium on Parameterized and Exact Computation, IPEC 2023
作者: Berthe, Gaétan Coudert-Osmont, Yoann Dobler, Alexander Morelle, Laure Reinald, Amadeus Rocton, Mathis LIRMM CNRS Université de Montpellier France Université de Lorraine CNRS Inria LORIA France Algorithms and Complexity Group TU Wien Austria
We describe Touiouidth, a twin-width solver for the exact-track of the 2023 PACE Challenge: Twin Width. Our solver is based on a simple branch and bound algorithm with search space reductions and is implemented in C++... 详细信息
来源: 评论
Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Hot off the Press: The First Proven Performance Guarantees f...
收藏 引用
2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion
作者: Cerf, Sacha Doerr, Benjamin Hebras, Benjamin Kahane, Yakob Wietheger, Simon École Polytechnique Institut Polytechnique de Paris Paris France École Polytechnique CNRS Institut Polytechnique de Paris Palaiseau France Algorithms and Complexity Group TU Wien Vienna Austria
Recently, the first mathematical runtime guarantees have been obtained for the NSGA-II, one of the most prominent multi-objective optimization algorithms, however only for synthetic benchmark *** this work, we give th... 详细信息
来源: 评论
Parameterised Partially-Predrawn Crossing Number  38
Parameterised Partially-Predrawn Crossing Number
收藏 引用
38th International Symposium on Computational Geometry, SoCG 2022
作者: Hamm, Thekla Hlinený, Petr Algorithms and Complexity Group TU Wien Austria Faculty of Informatics Masaryk University Brno Czech Republic
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new perspective on the traditional and arguably most important geometric graph parameter, the crossing number. Specifical... 详细信息
来源: 评论
Co-Certificate Learning with SAT Modulo Symmetries
arXiv
收藏 引用
arXiv 2023年
作者: Kirchweger, Markus Peitl, Tomáš Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria
We present a new SAT-based method for generating all graphs up to isomorphism that satisfy a given co-NP property. Our method extends the SAT Modulo Symmetry (SMS) framework with a technique that we call co-certificat... 详细信息
来源: 评论