咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
Space-Efficient Parameterized algorithms on Graphs of Low Shrubdepth  31
Space-Efficient Parameterized Algorithms on Graphs of Low Sh...
收藏 引用
31st Annual European Symposium on algorithms, ESA 2023
作者: Bergougnoux, Benjamin Chekan, Vera Ganian, Robert Kanté, Mamadou Moustapha Mnich, Matthias Oum, Sang-Il Pilipczuk, Michal van Leeuwen, Erik Jan Institute of Informatics University of Warsaw Poland Humboldt-Universität zu Berlin Germany Algorithms and Complexity Group TU Wien Austria Université Clermont Auvergne Clermont Auvergne INP LIMOS CNRS Clermont-Ferrand France Hamburg University of Technology Institute for Algorithms and Complexity Germany Daejeon Korea Republic of Department of Mathematical Sciences KAIST Daejeon Korea Republic of Dept. Information and Computing Sciences Utrecht University Netherlands
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, suc... 详细信息
来源: 评论
Parameterized complexity of Feature Selection for Categorical Data Clustering  46
Parameterized Complexity of Feature Selection for Categorica...
收藏 引用
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021
作者: Bandyapadhyay, Sayan Fomin, Fedor V. Golovach, Petr A. Simonov, Kirill Department of Informatics University of Bergen Norway Algorithms and Complexity Group TU Wien Austria
We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in prac... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Hedonic Diversity Games: A complexity Picture with More than Two Colors
arXiv
收藏 引用
arXiv 2022年
作者: Ganian, Robert Hamm, Thekla Knop, Dušan Schierreich, Šimon Suchý, Ondřej Algorithms and Complexity Group TU Wien Austria Algorithms and Complexity Group Utrecht University Netherlands Faculty of Information Technology Czech Technical University Prague Czech Republic
Hedonic diversity games are a variant of the classical hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classe... 详细信息
来源: 评论
Longest Cycle above Erdos-Gallai Bound  30
Longest Cycle above Erdos-Gallai Bound
收藏 引用
30th Annual European Symposium on algorithms, ESA 2022
作者: Fomin, Fedor V. Golovach, Petr A. Sagunov, Danil Simonov, Kirill Department of Informatics University of Bergen Norway St. Petersburg Department V.A. Steklov Institute of Mathematics Russia Algorithms and Complexity Group TU Wien Austria
In 1959, Erdos and Gallai proved that every graph G with average vertex degree ad(G) ≥ 2 contains a cycle of length at least ad(G). We provide an algorithm that for k ≥ 0 in time 2O(k) nO(1) decides whether a 2-conn... 详细信息
来源: 评论
The Fine-Grained complexity of Graph Homomorphism Parameterized by Clique-Width  49
The Fine-Grained Complexity of Graph Homomorphism Parameteri...
收藏 引用
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022
作者: Ganian, Robert Hamm, Thekla Korchemna, Viktoriia Okrasa, Karolina Simonov, Kirill Algorithms and Complexity Group TU Wien Austria Faculty of Matematics and Information Science Warsaw University of Technology Poland Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland
The generic homomorphism problem, which asks whether an input graph G admits a homomorphism into a fixed target graph H, has been widely studied in the literature. In this article, we provide a fine-grained complexity... 详细信息
来源: 评论
A Parameterized Theory of PAC Learning
arXiv
收藏 引用
arXiv 2023年
作者: Brand, Cornelius Ganian, Robert Simonov, Kirill Algorithms and Complexity Group TU Wien Austria Chair for Algorithm Engineering Hasso Plattner Institute Germany
Probably Approximately Correct (i.e., PAC) learning is a core concept of sample complexity theory, and efficient PAC learnability is often seen as a natural counterpart to the class P in classical computational comple... 详细信息
来源: 评论
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem  18
From Data Completion to Problems on Hypercubes: A Parameteri...
收藏 引用
18th International Symposium on Parameterized and Exact Computation, IPEC 2023
作者: 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 School of Computing University of Leeds United Kingdom
Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can b... 详细信息
来源: 评论
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized algorithms  47
Long Cycles in Graphs: Extremal Combinatorics Meets Paramete...
收藏 引用
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
作者: Fomin, Fedor V. Golovach, Petr A. Sagunov, Danil Simonov, Kirill Department of Informatics University of Bergen Norway St. Petersburg Department V.A. Steklov Institute of Mathematics Russia Algorithms and Complexity Group TU Wien Vienna Austria
We discuss recent algorithmic extensions of two classic results of extremal combinatorics about long paths in graphs. First, the theorem of Dirac from 1952 asserts that a 2-connected graph G with the minimum vertex de... 详细信息
来源: 评论