咨询与建议

限定检索结果

文献类型

  • 240 篇 期刊文献
  • 203 篇 会议
  • 2 册 图书

馆藏范围

  • 445 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 321 篇 理学
    • 302 篇 数学
    • 29 篇 统计学(可授理学、...
    • 22 篇 系统科学
    • 19 篇 物理学
    • 12 篇 生物学
    • 3 篇 化学
    • 3 篇 地球物理学
  • 230 篇 工学
    • 166 篇 计算机科学与技术...
    • 109 篇 软件工程
    • 39 篇 土木工程
    • 36 篇 建筑学
    • 23 篇 测绘科学与技术
    • 18 篇 材料科学与工程(可...
    • 17 篇 控制科学与工程
    • 16 篇 信息与通信工程
    • 12 篇 电子科学与技术(可...
    • 8 篇 电气工程
    • 7 篇 机械工程
    • 7 篇 生物工程
    • 4 篇 光学工程
    • 4 篇 农业工程
    • 4 篇 生物医学工程(可授...
    • 3 篇 化学工程与技术
    • 3 篇 交通运输工程
  • 53 篇 管理学
    • 29 篇 图书情报与档案管...
    • 25 篇 管理科学与工程(可...
    • 11 篇 工商管理
  • 7 篇 农学
    • 7 篇 作物学
  • 6 篇 法学
    • 6 篇 社会学
  • 4 篇 经济学
    • 4 篇 应用经济学
  • 1 篇 教育学
  • 1 篇 医学
  • 1 篇 军事学

主题

  • 27 篇 parameterization
  • 21 篇 graph theory
  • 18 篇 approximation al...
  • 17 篇 polynomial appro...
  • 15 篇 graphic methods
  • 13 篇 trees (mathemati...
  • 11 篇 visualization
  • 11 篇 parameter estima...
  • 10 篇 computational co...
  • 10 篇 algorithm design...
  • 10 篇 directed graphs
  • 9 篇 optimization
  • 9 篇 clustering algor...
  • 8 篇 drawing (graphic...
  • 8 篇 hamiltonians
  • 7 篇 evolutionary alg...
  • 7 篇 constraint satis...
  • 7 篇 evolutionary com...
  • 6 篇 runtime
  • 6 篇 integer programm...

机构

  • 227 篇 algorithms and c...
  • 18 篇 hamburg universi...
  • 17 篇 department of in...
  • 16 篇 department of co...
  • 13 篇 algorithms and c...
  • 9 篇 indian institute...
  • 8 篇 school of comput...
  • 8 篇 hamburg universi...
  • 6 篇 algorithms and c...
  • 6 篇 faculty of infor...
  • 5 篇 school of comput...
  • 5 篇 school of comput...
  • 5 篇 department of in...
  • 5 篇 cispa helmholtz ...
  • 5 篇 department of ap...
  • 5 篇 department of ma...
  • 4 篇 university of le...
  • 4 篇 department of en...
  • 4 篇 department of al...
  • 4 篇 department of en...

作者

  • 85 篇 ganian robert
  • 69 篇 nöllenburg marti...
  • 47 篇 szeider stefan
  • 31 篇 eiben eduard
  • 31 篇 bhore sujoy
  • 27 篇 mnich matthias
  • 27 篇 ordyniak sebasti...
  • 18 篇 simonov kirill
  • 17 篇 hamm thekla
  • 17 篇 klute fabian
  • 16 篇 ramanujan m.s.
  • 14 篇 kanj iyad
  • 14 篇 wallinger markus
  • 14 篇 montecchiani fab...
  • 12 篇 golovach petr a.
  • 12 篇 li guangping
  • 12 篇 wulms jules
  • 12 篇 fomin fedor v.
  • 11 篇 neumann frank
  • 11 篇 rutter ignaz

语言

  • 424 篇 英文
  • 20 篇 其他
  • 1 篇 中文
检索条件"机构=Algorithms and Complexity"
445 条 记 录,以下是71-80 订阅
排序:
Reoptimization of motif finding problem
Reoptimization of motif finding problem
收藏 引用
International MultiConference of Engineers and Computer Scientists, IMECS 2014
作者: Clemente, Jhoirene B. Aborot, Jeffrey A. Adorna, Henry N. Algorithms and Complexity Lab Department of Computer Science University of the Philippines Diliman Philippines
One of the approaches in solving NP-hard problems is through reoptimization. In this technique, we solve a locally modified instance of a problem by making use of known solution to its original instance instead of obt... 详细信息
来源: 评论
The Parameterized complexity of Coordinated Motion Planning  39
The Parameterized Complexity of Coordinated Motion Planning
收藏 引用
39th International Symposium on Computational Geometry, SoCG 2023
作者: Eiben, Eduard Ganian, Robert Kanj, Iyad 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
In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which k robots occupy k distinct starting gridpoints and need to reach k distinct destination gridpoints. In each time step, any robot may move ... 详细信息
来源: 评论
On the Upward Book Thickness Problem: Combinatorial and complexity Results  29th
On the Upward Book Thickness Problem: Combinatorial and Com...
收藏 引用
29th International Symposium on Graph Drawing and Network Visualization, GD 2021
作者: Bhore, Sujoy Da Lozzo, Giordano Montecchiani, Fabrizio Nöllenburg, Martin Indian Institute of Science Education and Research Bhopal India Roma Tre University Rome Italy Department of Engineering University of Perugia Perugia Italy Algorithms and Complexity Group TU Wien Vienna Austria
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of u... 详细信息
来源: 评论
A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem  18th
A Relative Value Function Based Learning Beam Search for th...
收藏 引用
18th International Conference on Computer Aided Systems Theory, EUROCAST 2022
作者: Huber, M. Raidl, G.R. Algorithms and Complexity Group Institute of Logic and Computation TU Wien Vienna Austria
Beam search (BS) is a well-known graph search algorithm frequently used to heuristically find good or near-optimal solutions to combinatorial optimization problems. Its most crucial component is a heuristic function t... 详细信息
来源: 评论
The Parameterized complexity of Network Microaggregation  37
The Parameterized Complexity of Network Microaggregation
收藏 引用
37th AAAI Conference on Artificial Intelligence, AAAI 2023
作者: Blažej, Václav Ganian, Robert Knop, Dušan Pokorný, Jan Schierreich, Šimon Simonov, Kirill Faculty of Information Technology Czech Technical University in Prague Prague Czech Republic Algorithms and Complexity Group Technische Universität Wien Vienna Austria Hasso Plattner Institute University of Potsdam Postdam Germany
Microaggregation is a classical statistical disclosure control technique which requires the input data to be partitioned into clusters while adhering to specified size constraints. We provide novel exact algorithms an... 详细信息
来源: 评论
Communication complexity and lower bounds on multilective computations
Theoretical Informatics and Applications
收藏 引用
Theoretical Informatics and Applications 1999年 第2期33卷 193-212页
作者: Hromkovič, Juraj Department of Computer Science I Algorithms and Complexity University of Technology Aachen Ahornstrasse 55 52056 Aachen Germany
A general framework for the use of two-party communication protocols for lower bound proofs on multilective computations was developed. The result not only created a transparent presentation of some known lower bounds... 详细信息
来源: 评论
FPT Approximation for Fair Minimum-Load Clustering  17
FPT Approximation for Fair Minimum-Load Clustering
收藏 引用
17th International Symposium on Parameterized and Exact Computation, IPEC 2022
作者: Bandyapadhyay, Sayan Fomin, Fedor V. Golovach, Petr A. Purohit, Nidhi Simonov, Kirill Department of Informatics University of Bergen Norway Algorithms and Complexity Group TU Wien Austria
In this paper, we consider the Minimum-Load k-Clustering/Facility Location (MLkC) problem where we are given a set P of n points in a metric space that we have to cluster and an integer k > 0 that denotes the numbe... 详细信息
来源: 评论
Self-organized transport in noisy dynamic networks
收藏 引用
Physical Review E 2024年 第4期110卷 044310页
作者: Frederic Folz Kurt Mehlhorn Giovanna Morigi Theoretische Physik Algorithms and Complexity Group
We present a numerical study of multicommodity transport in a noisy, nonlinear network. The nonlinearity determines the dynamics of the edge capacities, which can be amplified or suppressed depending on the local curr... 详细信息
来源: 评论
Weighted Model Counting with Twin-Width  25
Weighted Model Counting with Twin-Width
收藏 引用
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022
作者: Ganian, Robert Pokrývka, Filip Schidler, André Simonov, Kirill Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Masaryk University Brno Czech Republic
Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, includin... 详细信息
来源: 评论
The complexity landscape of decompositional parameters for ILP
arXiv
收藏 引用
arXiv 2018年
作者: Ganian, Robert Ordyniak, Sebastian Algorithms and Complexity Group TU Wien Favoritenstrasse 9-11 Wien1040 Austria
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. ... 详细信息
来源: 评论