咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
Minimum Link Fencing  33
Minimum Link Fencing
收藏 引用
33rd International Symposium on algorithms and Computation, ISAAC 2022
作者: Bhore, Sujoy Klute, Fabian Löffler, Maarten Nöllenburg, Martin Terziadis, Soeren Villedieu, Anaïs Department of Computer Science & Engineering Indian Institute of Technology Bombay India Department of Information and Computing Sciences Utrecht University Netherlands Algorithms and Complexity Group TU Wien Austria
We study a variant of the geometric multicut problem, where we are given a set P of colored and pairwise interior-disjoint polygons in the plane. The objective is to compute a set of simple closed polygon boundaries (... 详细信息
来源: 评论
Exact algorithms for Clustered Planarity with Linear Saturators  35
Exact Algorithms for Clustered Planarity with Linear Saturat...
收藏 引用
35th International Symposium on algorithms and Computation, ISAAC 2024
作者: Da Lozzo, Giordano Ganian, Robert Gupta, Siddharth Mohar, Bojan Ordyniak, Sebastian Zehavi, Meirav Roma Tre University Italy Algorithms and Complexity Group TU Wien Austria BITS Pilani K K Birla Goa Campus India Department of Mathematics Simon Fraser University Burnaby Canada University of Leeds United Kingdom Ben-Gurion University of the Negev Beer-Sheva Israel
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an n-vertex planar graph whose vertices are partitioned into independent sets (called clusters) with paths - one for each cluster... 详细信息
来源: 评论
Near-Tight Runtime Guarantees for Many-Objective Evolutionary algorithms
arXiv
收藏 引用
arXiv 2024年
作者: Wietheger, Simon Doerr, Benjamin Algorithms and Complexity Group Technische Universität Wien Vienna Austria CNRS École Polytechnique Institut Polytechnique de Paris Palaiseau France
Despite significant progress in the field of mathematical runtime analysis of multi-objective evolutionary algorithms (MOEAs), the performance of MOEAs on discrete many-objective problems is little understood. In part... 详细信息
来源: 评论
Computing Twin-Width Parameterized by the Feedback Edge Number
arXiv
收藏 引用
arXiv 2023年
作者: Balabán, Jakub Ganian, Robert Rocton, Mathis Faculty of Informatics Masaryk University Brno Czech Republic Algorithms and Complexity Group TU Wien Vienna Austria
The problem of whether and how one can compute the twin-width of a graph—along with an accompanying contraction sequence—lies at the forefront of the area of algorithmic model theory. While significant effort has be... 详细信息
来源: 评论
Learning Depth Vision-Based Personalized Robot Navigation From Dynamic Demonstrations in Virtual Reality
Learning Depth Vision-Based Personalized Robot Navigation Fr...
收藏 引用
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
作者: Jorge de Heuvel Nathan Corral Benedikt Kreis Jacobus Conradi Anne Driemel Maren Bennewitz Humanoid Robots Lab Group for Algorithms and Complexity University of Bonn 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...
来源: 评论
Further Exploiting c-Closure for FPT algorithms and Kernels for Domination Problems  39
Further Exploiting c-Closure for FPT Algorithms and Kernels ...
收藏 引用
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
作者: Kanesh, Lawqueen Madathil, Jayakrishnan Roy, Sanjukta Sahu, Abhishek Saurabh, Saket National University of Singapore Singapore Chennai Mathematical Institute India Algorithms and Complexity Group TU Wien Austria The Institute of Mathematical Sciences HBNI Chennai India University of Bergen Norway
For a positive integer c, a graph G is said to be c-closed if every pair of non-adjacent vertices in G have at most c - 1 neighbours in common. The closure of a graph G, denoted by cl(G), is the least positive integer... 详细信息
来源: 评论
A Simple Partially Embedded Planarity Test Based on Vertex-Addition
arXiv
收藏 引用
arXiv 2024年
作者: Fink, Simon D. Rutter, Ignaz Sandhya, T.P. Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Informatics and Mathematics University of Passau Germany Stockholm University Department of Mathematics Sweden
In the Partially Embedded Planarity problem, we are given a graph G together with a topological drawing of a subgraph H of G. The task is to decide whether the drawing can be extended to a drawing of the whole graph s... 详细信息
来源: 评论
MosaicSets: Embedding Set Systems into Grid Graphs
arXiv
收藏 引用
arXiv 2022年
作者: Rottmann, Peter Wallinger, Markus Bonerath, Annika Gedicke, Sven Nöllenburg, Martin Haunert, Jan-Henrik The Geoinformation Group of the University of Bonn Germany The Algorithms and Complexity Group of the Technical University of Vienna Austria
Visualizing sets of elements and their relations is an important research area in information visualization. In this paper, we present MosaicSets: a novel approach to create Euler-like diagrams from non-spatial set sy... 详细信息
来源: 评论
Explaining Decisions in ML Models: a Parameterized complexity Analysis
arXiv
收藏 引用
arXiv 2024年
作者: Ordyniak, Sebastian Paesani, Giacomo Rychlicki, Mateusz Szeider, Stefan School of Computing University of Leeds United Kingdom Dipartimento di Informatica Sapienza University of Rome Italy Algorithms and Complexity Group TU Wien Vienna Austria
This paper presents a comprehensive theoretical investigation into the parameterized complexity of explanation problems in various machine learning (ML) models. Contrary to the prevalent black-box perception, our stud... 详细信息
来源: 评论
Pseudorandom Finite Models
Pseudorandom Finite Models
收藏 引用
Annual Symposium on Logic in Computer Science
作者: Jan Dreier Jamie Tucker-Foltz Algorithms and Complexity Group TU Wien Vienna Austria School of Engineering and Applied Sciences Harvard University Allston MA USA
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to determinist...
来源: 评论