咨询与建议

限定检索结果

文献类型

  • 84 篇 期刊文献
  • 63 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 123 篇 理学
    • 116 篇 数学
    • 9 篇 物理学
    • 7 篇 统计学(可授理学、...
    • 5 篇 系统科学
    • 2 篇 化学
    • 2 篇 生物学
    • 1 篇 地球物理学
  • 67 篇 工学
    • 43 篇 计算机科学与技术...
    • 27 篇 软件工程
    • 12 篇 土木工程
    • 11 篇 建筑学
    • 5 篇 机械工程
    • 5 篇 材料科学与工程(可...
    • 4 篇 光学工程
    • 4 篇 测绘科学与技术
    • 3 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 3 篇 林业工程
    • 2 篇 仪器科学与技术
    • 2 篇 电气工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 化学工程与技术
    • 2 篇 农业工程
    • 1 篇 力学(可授工学、理...
  • 13 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 4 篇 农学
    • 4 篇 作物学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 1 篇 医学

主题

  • 9 篇 approximation al...
  • 9 篇 graphic methods
  • 9 篇 graph theory
  • 8 篇 polynomial appro...
  • 7 篇 trees (mathemati...
  • 6 篇 hamiltonians
  • 6 篇 directed graphs
  • 5 篇 parameterization
  • 4 篇 integer programm...
  • 4 篇 dynamic programm...
  • 4 篇 parameter estima...
  • 4 篇 color
  • 3 篇 computational co...
  • 3 篇 computational ge...
  • 3 篇 visualization
  • 3 篇 evolutionary alg...
  • 2 篇 traveling salesm...
  • 2 篇 routing
  • 2 篇 optimization
  • 2 篇 dominating set

机构

  • 54 篇 algorithms and c...
  • 18 篇 hamburg universi...
  • 11 篇 department of in...
  • 9 篇 hamburg universi...
  • 9 篇 indian institute...
  • 5 篇 algorithms and c...
  • 5 篇 cispa helmholtz ...
  • 4 篇 department of al...
  • 4 篇 institute of inf...
  • 4 篇 institute of mat...
  • 4 篇 tu hamburg insti...
  • 4 篇 st. petersburg d...
  • 3 篇 algorithms and c...
  • 3 篇 institute of the...
  • 3 篇 jetbrains resear...
  • 3 篇 university of be...
  • 2 篇 school of comput...
  • 2 篇 algorithms and c...
  • 2 篇 department of ma...
  • 2 篇 department of ma...

作者

  • 27 篇 mnich matthias
  • 21 篇 bhore sujoy
  • 20 篇 nöllenburg marti...
  • 15 篇 ganian robert
  • 9 篇 simonov kirill
  • 9 篇 saurabh saket
  • 8 篇 ramanujan m.s.
  • 7 篇 eiben eduard
  • 7 篇 li guangping
  • 6 篇 kaul matthias
  • 6 篇 golovach petr a.
  • 6 篇 rutter ignaz
  • 6 篇 sagunov danil
  • 6 篇 fomin fedor v.
  • 5 篇 löffler maarten
  • 5 篇 lokshtanov danie...
  • 4 篇 neumann frank
  • 4 篇 cembrano javier
  • 4 篇 göke alexander
  • 4 篇 hermelin danny

语言

  • 143 篇 英文
  • 5 篇 其他
检索条件"机构=Institute for Algorithms and Complexity"
148 条 记 录,以下是31-40 订阅
排序:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time  40
Fully Dynamic Maximum Independent Sets of Disks in Polylogar...
收藏 引用
40th International Symposium on Computational Geometry, SoCG 2024
作者: Bhore, Sujoy Nöllenburg, Martin Tóth, Csaba D. Wulms, Jules Department of Computer Science and Engineering Indian Institute of Technology Bombay Mumbai India Institute of Logic and Computation Algorithms and Complexity Group TU Wien Austria Department of Mathematics California State University Northridge Los AngelesCA United States Department of Computer Science Tufts University MedfordMA United States Department of Mathematics and Computer Science TU Eindhoven Netherlands
A fundamental question is whether one can maintain a maximum independent set (MIS) in polylogarithmic update time for a dynamic collection of geometric objects in Euclidean space. For a set of intervals, it is known t... 详细信息
来源: 评论
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... 详细信息
来源: 评论
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k ≥ 5
arXiv
收藏 引用
arXiv 2024年
作者: Heimann, Sophia Hoang, Hung P. Hougardy, Stefan Research Institute for Discrete Mathematics University of Bonn Germany Algorithms and Complexity Group Faculty of Informatics TU Wien Austria Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Germany
The k-Opt algorithm is a local search algorithm for the Traveling Salesman Problem. Starting with an initial tour, it iteratively replaces at most k edges in the tour with the same number of edges to obtain a better t... 详细信息
来源: 评论
Clustered Planarity Variants for Level Graphs
arXiv
收藏 引用
arXiv 2024年
作者: Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Sieper, Marie Diana Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Computer Science and Mathematics University of Passau Germany Institute of Computer Science University of Würzburg Germany
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawi... 详细信息
来源: 评论
IMPARTIAL SELECTION UNDER COMBINATORIAL CONSTRAINTS
arXiv
收藏 引用
arXiv 2024年
作者: Cembrano, Javier Klimm, Max Merino, Arturo Department of Algorithms and Complexity Max Planck Institut für Informatik Germany Institute for Mathematics Technische Universität Berlin Germany Institute of Engineering Sciences Universidad de O'Higgins Chile
Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of the agents, the axiom of impartiality r... 详细信息
来源: 评论
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
arXiv
收藏 引用
arXiv 2024年
作者: Kaul, Matthias Mnich, Matthias Molter, Hendrik Universität Bonn Germany Hamburg University of Technology Institute for Algorithms and Complexity Hamburg Germany Department of Computer Science Ben-Gurion University of the Negev Be’er-Sheva Israel
We study the fundamental scheduling problem 1 | rj | P wjUj: schedule a set of n jobs with weights, processing times, release dates, and due dates on a single machine, such that each job starts after its release date ... 详细信息
来源: 评论
Enumerating minimal solution sets for metric graph problems
arXiv
收藏 引用
arXiv 2023年
作者: Bergougnoux, Benjamin Defrain, Oscar Inerney, Fionn Mc Institute of Informatics University of Warsaw Poland LIS Aix-Marseille Université France Algorithms and Complexity Group Technische Universität Wien Austria
Problems from metric graph theory like Metric Dimension, Geodetic Set, and Strong Metric Dimension have recently had a strong impact in parameterized complexity by being the first known problems in NP to admit double-... 详细信息
来源: 评论
No Polynomial Kernels for Knapsack
arXiv
收藏 引用
arXiv 2023年
作者: Heeger, Klaus Hermelin, Danny Mnich, Matthias Shabtay, Dvir Department of Industrial Engineering and Management Ben-Gurion University of the Negev Beer-Sheva Israel Hamburg University of Technology Institute for Algorithms and Complexity Hamburg Germany
This paper focuses on kernelization algorithms for the fundamental Knapsack problem. A kernelization algorithm (or kernel) is a polynomial-time reduction from a problem onto itself, where the output size is bounded by... 详细信息
来源: 评论
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
arXiv
收藏 引用
arXiv 2023年
作者: Berndt, Sebastian Brinkop, Hauke Jansen, Klaus Mnich, Matthias Stamm, Tobias University of Lübeck Institute for Theoretical Computer Science Lübeck Germany Kiel University Kiel Germany Hamburg University of Technology Institute for Algorithms and Complexity Hamburg Germany
Mixed-integer linear programming (MILP) is at the core of many advanced algorithms for solving fundamental problems in combinatorial optimization. The complexity of solving MILPs directly correlates with their support... 详细信息
来源: 评论
Learning Depth Vision-Based Personalized Robot Navigation From Dynamic Demonstrations in Virtual Reality
arXiv
收藏 引用
arXiv 2022年
作者: de Heuvel, Jorge Corral, Nathan Kreis, Benedikt Conradi, Jacobus Driemel, Anne Bennewitz, Maren Group for Algorithms and Complexity University of Bonn Germany Lamarr Institute for Machine Learning and Artificial Intelligence Germany
— For the best human-robot interaction experience, the robot’s navigation policy should take into account personal preferences of the user. In this paper, we present a learning framework complemented by a perception... 详细信息
来源: 评论