咨询与建议

限定检索结果

文献类型

  • 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 篇 其他
检索条件"机构=Group for Algorithms and Complexity"
320 条 记 录,以下是61-70 订阅
排序:
On existential MSO and its relation to ETH  41
On existential MSO and its relation to ETH
收藏 引用
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016
作者: Ganian, Robert De Haan, Ronald Kanj, Iyad Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria School of Computing DePaul University ChicagoIL United States
Impagliazzo et al. proposed a framework, based on the logic fragment defining the complexity class SNP, to identify problems that are equivalent to k-CNF-Sat modulo subexponential-time reducibility (serf-reducibility)... 详细信息
来源: 评论
Hedonic Diversity Games: A complexity Picture with More than Two Colors  36
Hedonic Diversity Games: A Complexity Picture with More than...
收藏 引用
36th AAAI Conference on Artificial Intelligence, AAAI 2022
作者: Ganian, Robert Hamm, Thekla Knop, Dušan Schierreich, Šimon Suchý, Ondřej Algorithms and Complexity Group TU Wien Austria 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... 详细信息
来源: 评论
Towards a polynomial kernel for directed feedback vertex set  42
Towards a polynomial kernel for directed feedback vertex set
收藏 引用
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
作者: Bergougnoux, Benjamin Eiben, Eduard Ganian, Robert Ordyniak, Sebastian Ramanujan, M.S. Université Clermont Auvergne LIMOS CNRS Aubière France Algorithms and Complexity Group TU Wien Vienna Austria
In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of... 详细信息
来源: 评论
Worbel: Aggregating Point Labels into Word Clouds  21
Worbel: Aggregating Point Labels into Word Clouds
收藏 引用
29th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2021
作者: Bhore, Sujoy Ganian, Robert Li, Guangping Nöllenburg, Martin Wulms, Jules Indian Institute of Science Education and Research Bhopal Bhopal India Algorithms and Complexity Group Tu Wien Vienna Austria
Point feature labeling is a classical problem in cartography and GIS that has been extensively studied for geospatial point data. At the same time, word clouds are a popular visualization tool to show the most importa... 详细信息
来源: 评论
Extending partial 1-planar drawings  47
Extending partial 1-planar drawings
收藏 引用
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
作者: Eiben, Eduard Ganian, Robert Hamm, Thekla Klute, Fabian Nöllenburg, Martin Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Austria
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an... 详细信息
来源: 评论
SAT-Based Generation of Planar Graphs  26
SAT-Based Generation of Planar Graphs
收藏 引用
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023
作者: Markus Kirchweger Manfred Scheucher Stefan Szeider Algorithms and Complexity Group TU Wien Austria Institut för Mathematik Technische Universität Berlin Germany
To test a graph's planarity in SAT-based graph generation we develop SAT encodings with dynamic symmetry breaking as facilitated in the SAT modulo Symmetry (SMS) framework. We implement and compare encodings based... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Lossy kernels for hitting subgraphs  42
Lossy kernels for hitting subgraphs
收藏 引用
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
作者: Eiben, Eduard Hermelin, Danny Ramanujan, M.S. Algorithms and Complexity Group TU Wien Vienna Austria Industrial Engineering and Management Ben Gurion University Be'er Scheva Israel
In this paper, we study the Connected H-hitting Set and Dominating Set problems from the perspective of approximate kernelization, a framework recently introduced by Lokshtanov et al. [STOC 2017]. For the Connected H-... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A linear-Time parameterized algorithm for node unique label cover  25
A linear-Time parameterized algorithm for node unique label ...
收藏 引用
25th European Symposium on algorithms, ESA 2017
作者: Lokshtanov, Daniel Ramanujan, M.S. Saurabh, Saket University of Bergen Bergen Norway Algorithms and Complexity Group TU Wien Vienna Austria Institute of Mathematical Sciences Chennai India
The optimization version of the Unique Label Cover problem is at the heart of the Unique Games Conjecture which has played an important role in the proof of several tight inapproximability results. In recent years, th... 详细信息
来源: 评论