咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是151-160 订阅
排序:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
arXiv
收藏 引用
arXiv 2024年
作者: 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 Vienna Austria School of Computing DePaul University Chicago United States University of Leeds School of Computing 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... 详细信息
来源: 评论
Untangling Circular Drawings: algorithms and complexity  32
Untangling Circular Drawings: Algorithms and Complexity
收藏 引用
32nd International Symposium on algorithms and Computation, ISAAC 2021
作者: Bhore, Sujoy Li, Guangping Nöllenburg, Martin Rutter, Ignaz Wu, Hsiang-Yun Indian Institute of Science Education and Research Bhopal India Algorithms and Complexity Group TU Wien Austria Universität Passau Germany Research Unit of Computer Graphics TU Wien Austria
We consider the problem of untangling a given (non-planar) straight-line circular drawing δG of an outerplanar graph G = (V, E) into a planar straight-line circular drawing by shifting a minimum number of vertices to... 详细信息
来源: 评论
Parameterized algorithms for Coordinated Motion Planning: Minimizing Energy
arXiv
收藏 引用
arXiv 2024年
作者: Deligkas, Argyrios Eiben, Eduard Ganian, Robert Kanj, Iyad Ramanujan, M.S. Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Vienna Austria School of Computing DePaul University Chicago United States Department of Computer Science University of Warwick United Kingdom
We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of k robots to their destinations with the a... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Graph drawing applications in combinatorial theory of maturity models
arXiv
收藏 引用
arXiv 2024年
作者: Kajzer, Špela Dobler, Alexander Jerebic, Janja Nöllenburg, Martin Orthaber, Joachim Bokal, Drago Faculty of Natural Sciences and Mathematics University of Maribor Slovenia Institute of Mathematics Physics and Mechanics Ljubljana Slovenia Algorithms and Complexity Group TU Wien Austria Faculty of Organizational Sciences University of Maribor Slovenia Institute of Software Technology Graz University of Technology Austria
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total ord... 详细信息
来源: 评论
Signed Double Roman Domination on Cubic Graphs
arXiv
收藏 引用
arXiv 2023年
作者: Iurlano, Enrico Zec, Tatjana Djukanovic, Marko Raidl, Günther R. Algorithms and Complexity Group TU Wien Favoritenstraße 9/1921 Vienna1040 Austria Faculty of Natural Sciences and Mathematics University of Banja Luka Mladena Stojanovića 2 Banja Luka78000 Bosnia and Herzegovina
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from {±1, 2, 3} to each vertex feasibly, such that the total sum of assigned labels is minimi... 详细信息
来源: 评论
First-order logic in finite domains: Where semantic evaluation competes with SMT solving
arXiv
收藏 引用
arXiv 2021年
作者: Schreiner, Wolfgang Reichl, Franz-Xaver Johannes Kepler University Linz Austria Algorithms and Complexity Group Tu Wien Austria
In this paper, we compare two alternative mechanisms for deciding the validity of first-order formulas over finite domains supported by the mathematical model checker RISCAL: first, the original approach of "sema... 详细信息
来源: 评论
Efficient Approximation of Fractional Hypertree Width
Efficient Approximation of Fractional Hypertree Width
收藏 引用
Annual IEEE Symposium on Foundations of Computer Science
作者: Viktoriia Korchemna Daniel Lokshtanov Saket Saurabh Vaishali Surianarayanan Jie Xue Algorithms and Complexity Group TU Wien Vienna Austria Department of Computer Science University of California Santa Barbara Santa Barbara USA University of Bergen Bergen Norway Institute of Mathematical Sciences Chennai India New York University Shanghai Shanghai China
We give two new approximation algorithms to compute the fractional hypertree width of an input hypergraph. The first algorithm takes as input n-vertex m-edge hypergraph $H$ of fractional hypertree width at most $\o... 详细信息
来源: 评论
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
arXiv
收藏 引用
arXiv 2022年
作者: Dumas, Maël Perez, Anthony Rocton, Mathis Todinca, Ioan LIFO EA 4022 Univ. Orléans INSA Centre Val de Loire France Algorithms and Complexity Group TU Wien Vienna Austria
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph G = (V, E) and an integer k ∈ N and seeks to edit (add or delete) at most k edges from G to obt... 详细信息
来源: 评论
Tight complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
arXiv
收藏 引用
arXiv 2023年
作者: Focke, Jacob Marx, Dániel Inerney, Fionn Mc Neuen, Daniel Sankar, Govind S. Schepper, Philipp Wellnitz, Philip CISPA Helmholtz Center for Information Security Germany Algorithms and Complexity Group TU Wien Austria School of Computing Science Simon Fraser University Canada Duke University United States Max Planck Institute for Informatics SIC Germany
For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets σ, ρ of non-negative integers, a (σ, ρ)-set of a graph ... 详细信息
来源: 评论