咨询与建议

限定检索结果

文献类型

  • 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 篇 其他
检索条件"机构=Algorithms and Complexity group"
320 条 记 录,以下是131-140 订阅
排序:
SAT-encodings for treecut width and treedepth
arXiv
收藏 引用
arXiv 2019年
作者: Ganian, Robert Lodha, Neha Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria Algorithms Group University of Sheffield Sheffield United Kingdom
The decomposition of graphs is a prominent algorithmic task with numerous applications in computer science. A graph decomposition method is typically associated with a width parameter (such as treewidth) that indicate... 详细信息
来源: 评论
Compatible Cycle Decomposition of bad K5-minor-free graphs
收藏 引用
Electronic Notes in Discrete Mathematics 2017年 61卷 445-449页
作者: Fleischner, Herbert Bagheri Gh., Behrooz Zhang, Cun-Quan Zhang, Zhang Algorithms and Complexity Group Vienna University of Technology Favoritenstrasse 9-11 Vienna 1040 Austria Department of Mathematics West Virginia University Morgantown 26506-6310 WV United States
Let G be an eulerian graph. For each vertex v∈V(G), let T(v) be a non-empty subset of a partition of the edges incident with v into 2-subsets and set T=∪v∈V(G)T(v), called a transition system of G. A transition sys... 详细信息
来源: 评论
Balanced Connected Subgraph Problem in Geometric Intersection Graphs  1
收藏 引用
13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019
作者: Bhore, Sujoy Jana, Satyabrata Pandit, Supantha Roy, Sasanka Algorithms and Complexity Group TU Wien Vienna Austria Indian Statistical Institute Kolkata India Dhirubhai Ambani Institute of Information and Communication Technology GandhinagarGujarat India
We study the (shortly,) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given agraph, where each vertex in V is colored with either "... 详细信息
来源: 评论
Level Planarity Is More Difficult Than We Thought  32
Level Planarity Is More Difficult Than We Thought
收藏 引用
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024
作者: Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Computer Science and Mathematics Universität Passau Germany Charles University Prague Czech Republic
We consider three simple quadratic-time algorithms for Level Planarity and give a level-planar instance that they either falsely classify as negative or for which they output a non-planar drawing. © Simon D. Fink... 详细信息
来源: 评论
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs  29th
Unit Disk Representations of Embedded Trees, Outerplanar an...
收藏 引用
29th International Symposium on Graph Drawing and Network Visualization, GD 2021
作者: Bhore, Sujoy Löffler, Maarten Nickel, Soeren Nöllenburg, Martin Indian Institute of Science Education and Research Bhopal India Department of Computing and Information Sciences Utrecht University Utrecht Netherlands Algorithms and Complexity Group TU Wien Vienna Austria
A unit disk intersection representation (UDR) of a graph G represents each vertex of G as a unit disk in the plane, such that two disks intersect if and only if their vertices are adjacent in G. A UDR with interior-di... 详细信息
来源: 评论
The complexity of Optimizing Atomic Congestion
arXiv
收藏 引用
arXiv 2023年
作者: Brand, Cornelius Ganian, Robert Kalyanasundaram, Subrahmanyam Inerney, Fionn Mc Algorithms & Complexity Theory Group Regensburg University Germany Algorithms and Complexity Group TU Wien Austria Department of Computer Science and Engineering IIT Hyderabad India
Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the pric... 详细信息
来源: 评论
A join-based hybrid parameter for constraint satisfaction
arXiv
收藏 引用
arXiv 2019年
作者: Ganian, Robert Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria Algorithms Group University of Sheffield Sheffield United Kingdom
We propose joinwidth, a new complexity parameter for the Constraint Satisfaction Problem (CSP). The definition of joinwidth is based on the arrangement of basic operations on relations (joins, projections, and pruning... 详细信息
来源: 评论
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized algorithms  47
Long Cycles in Graphs: Extremal Combinatorics Meets Paramete...
收藏 引用
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
作者: Fomin, Fedor V. Golovach, Petr A. Sagunov, Danil Simonov, Kirill Department of Informatics University of Bergen Norway St. Petersburg Department V.A. Steklov Institute of Mathematics Russia Algorithms and Complexity Group TU Wien Vienna Austria
We discuss recent algorithmic extensions of two classic results of extremal combinatorics about long paths in graphs. First, the theorem of Dirac from 1952 asserts that a 2-connected graph G with the minimum vertex de... 详细信息
来源: 评论
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 (... 详细信息
来源: 评论
New complexity-theoretic frontiers of tractability for neural network training  23
New complexity-theoretic frontiers of tractability for neura...
收藏 引用
Proceedings of the 37th International Conference on Neural Information Processing Systems
作者: Cornelius Brand Robert Ganian Mathis Rocton Algorithms & Complexity Group Vienna University of Technology Vienna Austria
In spite of the fundamental role of neural networks in contemporary machine learning research, our understanding of the computational complexity of optimally training neural networks remains incomplete even when deali...
来源: 评论