咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是201-210 订阅
排序:
Detours in Directed Graphs
arXiv
收藏 引用
arXiv 2022年
作者: Fomin, Fedor V. Golovach, Petr A. Lochet, William Sagunov, Danil Simonov, Kirill Saurabh, Saket Department of Informatics University of Bergen Norway St. Petersburg Department V.A. Steklov Institute of Mathematics Russia JetBrains Research Saint Petersburg Russia Algorithms and Complexity Group TU Wien Austria Institute of Mathematical Sciences HBNI Chennai India
We study two "above guarantee" versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Lo... 详细信息
来源: 评论
Finding a battleship of uncertain shape
arXiv
收藏 引用
arXiv 2022年
作者: Hainzl, Eva-Maria Löffler, Maarten Perz, Daniel Tkadlec, Josef Wallinger, Markus Institute of Discrete Mathematics and Geometry TU Wien Austria Department of Computing and Information Sciences Utrecht University Netherlands Institute of Software Technology TU Graz Austria Department of Mathematics Harvard University United States Algorithms and Complexity Group TU Wien Austria
Motivated by a game of Battleship, we consider the problem of efficiently hitting a ship of an uncertain shape within a large playing board. Formally, we fix a dimension d ϵ {1, 2}. A ship is a subset of d. Given a fa... 详细信息
来源: 评论
Recognizing DAGs with Page-Number 2 is NP-complete
arXiv
收藏 引用
arXiv 2022年
作者: Bekos, Michael A. Da Lozzo, Giordano Frati, Fabrizio Gronemann, Martin McHedlidze, Tamara Raftopoulou, Chrysanthi Department of Mathematics University of Ioannina Ioannina Greece Department of Engineering Roma Tre University Italy Algorithms and Complexity Group TU Wien Vienna Austria Department of Computer Science Utrecht University Utrecht Netherlands School of Applied Mathematical & Physical Sciences NTUA Athens Greece
The page-number of a directed acyclic graph (a DAG, for short) is the minimum k for which the DAG has a topological order and a k-coloring of its edges such that no two edges of the same color cross, i.e., have altern... 详细信息
来源: 评论
Parameterized algorithms for book embedding problems
收藏 引用
Journal of Graph algorithms and Applications 2020年 第4期24卷 603-620页
作者: Bhore, Sujoy Ganian, Robert Montecchiani, Fabrizio Nöllenburg, Martin Algorithms and Complexity Group TU Wien Vienna Austria Engineering Department University of Perugia Perugia Italy
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determi... 详细信息
来源: 评论
On Turn-Regular Orthogonal Representations
收藏 引用
Journal of Graph algorithms and Applications 2022年 第3期26卷 285-296页
作者: Bekos, Michael A. Binucci, Carla Di Battista, Giuseppe Didimo, Walter Gronemann, Martin Klein, Karsten Patrignani, Maurizio Rutter, Ignaz Department of Mathematics University of Ioannina Ioannina Greece Department of Engineering University of Perugia Perugia Italy Department of Engineering Roma Tre University Italy Algorithms and Complexity Group TU Wien Vienna Austria Department of Computer and Information Science University of Konstanz Konstanz Germany Department of Computer Science and Mathematics University of Passau Germany
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other" inside a face. For such a... 详细信息
来源: 评论
Recognizing Map Graphs of Bounded Treewidth
arXiv
收藏 引用
arXiv 2022年
作者: Angelini, Patrizio Bekos, Michael A. Da Lozzo, Giordano Gronemann, Martin Montecchiani, Fabrizio Tappini, Alessandra Department of Mathematics Natural and Applied Sciences John Cabot University Rome Italy Department of Mathematics University of Ioannina Ioannina Greece Department of Engineering Roma Tre University Rome Italy Algorithms and Complexity Group TU Wien Vienna Austria Department of Engineering University of Perugia Perugia Italy
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an explicit fixed-parameter tractable algori... 详细信息
来源: 评论
On the upward book thickness problem: Combinatorial and complexity results
arXiv
收藏 引用
arXiv 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 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... 详细信息
来源: 评论
Resolving Infeasibility of Linear Systems: A Parameterized Approach
arXiv
收藏 引用
arXiv 2022年
作者: Bérczi, Kristóf Göke, Alexander Mendoza-Cadena, Lydia Mirabel Mnich, Matthias MTA-ELTE Momentum Matroid Optimization Research Group MTA-ELTE Egerváry Research Group Department of Operations Research Eötvös Loránd University Budapest Hungary Hamburg University of Technology Institute for Algorithms and Complexity Hamburg Germany MTA-ELTE Momentum Matroid Optimization Research Group Department of Operations Research Eötvös Loránd University Budapest Hungary
Deciding feasibility of large systems of linear equations and inequalities is one of the most fundamental algorithmic tasks. However, due to data inaccuracies or modeling errors, in practical applications one often fa... 详细信息
来源: 评论
Single-Peaked Opinion Updates
arXiv
收藏 引用
arXiv 2022年
作者: Bredereck, Robert George, Anne-Marie Israel, Jonas Kellerhals, Leon Algorithm Engineering Humboldt-Universität Berlin Germany Institut für Informatik TU Clausthal Germany Analytical Solutions and Reasoning University of Oslo Germany Research Group Efficient Algorithms Technische Universität Berlin Germany Algorithmics and Computational Complexity Technische Universität Berlin Germany
We consider opinion diffusion for undirected networks with sequential updates when the opinions of the agents are single-peaked preference rankings. Our starting point is the study of preserving single-peakedness. We ... 详细信息
来源: 评论
The most general structure of graphs with hamiltonian or hamiltonian connected square
arXiv
收藏 引用
arXiv 2022年
作者: Ekstein, Jan Fleischner, Herbert Department of Mathematics European Centre of Excellence Ntis - New Technologies for the Information Society Faculty of Applied Sciences University of West Bohemia Pilsen Technická 8 Plzeň306 14 Czech Republic Institute of Logic and Computation Algorithms and Complexity Group Technical University of Vienna Favoritenstrasse 9 - 11 Wien1040 Austria
On the basis of recent results on hamiltonicity, [4], and hamiltonian connectedness, [8], in the square of a 2-block, we determine the most general block-cutvertex structure a graph G may have in order to guarantee th... 详细信息
来源: 评论