咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是211-220 订阅
排序:
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... 详细信息
来源: 评论
Teleportation of quantum coherence
收藏 引用
Physical Review A 2023年 第4期108卷 042620-042620页
作者: Sohail Arun K. Pati Vijeth Aradhya Indranil Chakrabarty Subhasree Patro Quantum Information and Computation Group Harish-Chandra Research Institute A CI of Homi Bhabha National Institute Chhatnag Road Jhunsi Prayagraj 211019 India Centre for Quantum Science and Technology International Institute of Information Technology Hyderabad Gachibowli Hyderabad-500032 Telangana India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad Gachibowli Hyderabad-500032 Telangana India Department of Computer Science National University of Singapore 117417 Singapore Computer science and physics department Utrecht University 3584 CS Utrecht The Netherlands Algorithms and complexity group QuSoft Centrum Wiskunde and Informatica 1098XG Amsterdam The Netherlands
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an un... 详细信息
来源: 评论
A study of 4−cycle systems
arXiv
收藏 引用
arXiv 2023年
作者: Bagheri, B.Gh. Khosravi, M. Mahmoodian, E.S. Rashidi, S. Algorithms and Complexity Group Vienna University of Technology Favoritenstrasse 9-11 Vienna1040 Austria Department of Pure Mathematics Faculty of Mathematics and Computer Shahid Bahonar University of Kerman Kerman Iran Department of Mathematical Sciences Sharif University of Technology P.O. Box 11155-9415 Tehran Iran Department of Applied Mathematics Faculty of Mathematics and Computer Shahid Bahonar University of Kerman Kerman Iran
A 4−cycle system is a partition of the edges of the complete graph Kn into 4−cycles. Let C be a collection of cycles of length 4 whose edges partition the edges of Kn. A set of 4-cycles T1 ⊂ C is called a 4-cycle trad... 详细信息
来源: 评论
Interplay of periodic dynamics and noise: Insights from a simple adaptive system
arXiv
收藏 引用
arXiv 2021年
作者: Folz, Frederic Mehlhorn, Kurt Morigi, Giovanna Theoretische Physik Universität des Saarlandes Saarbrücken66123 Germany Algorithms and Complexity Group Max-Planck-Institut für Informatik Saarland Informatics Campus Saarbrücken66123 Germany
We study the dynamics of a simple adaptive system in the presence of noise and periodic damping. The system is composed by two paths connecting a source and a sink, the dynamics is governed by equations that usually d... 详细信息
来源: 评论
complexity of Maker-Breaker Games on Edge Sets of Graphs
arXiv
收藏 引用
arXiv 2023年
作者: Duchêne, Eric Gledel, Valentin Inerney, Fionn Mc Nisse, Nicolas Oijid, Nacim Parreau, Aline Stojaković, Miloš Univ Lyon CNRS INSA Lyon UCBL Centrale Lyon Univ Lyon 2 LIRIS UMR5205 VilleurbanneF-69622 France Université Savoie Mont Blanc CNRS LAMA ChambéryF-73000 France Algorithms and Complexity Group TU Wien Austria Université Côte d’Azur Inria CNRS I3S France Department of Mathematics and Informatics Faculty of Sciences University of Novi Sad Novi Sad Serbia
We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the H-game. Maker wins if she claims the edges of a perfect matchi... 详细信息
来源: 评论
Crossing-optimal extension of simple drawings
arXiv
收藏 引用
arXiv 2020年
作者: Ganian, Robert Hamm, Thekla Klute, Fabian Parada, Irene Vogtenhuber, Birgit Algorithms and Complexity Group TU Wien Austria Utrecht University Netherlands TU Eindhoven Netherlands Graz University of Technology Austria
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph G and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems ar... 详细信息
来源: 评论
Gerrymandering on graphs: Computational complexity and parameterized algorithms
arXiv
收藏 引用
arXiv 2021年
作者: Gupta, Sushmita Jain, Pallavi Panolan, Fahad Roy, Sanjukta Saurabh, Saket Institute of Mathematical Science HBNI India Indian Institute of Technology Jodhpur India Indian Institute of Technology Hyderabad India Algorithms and Complexity Group TU Wien Austria Institute of Mathematical Science HBNI India University of Bergen Norway
The practice of partitioning a region into areas to favor a particular candidate or a party in an election has been known to exist for the last two centuries. This practice is commonly known as gerrymandering. Recentl... 详细信息
来源: 评论
Balanced Independent and Dominating Sets on Colored Interval Graphs
arXiv
收藏 引用
arXiv 2020年
作者: Bhore, Sujoy Haunert, Jan-Henrik Klute, Fabian Li, Guangping Nöllenburg, Martin Indian Institute of Science Education and Research Bhopal India Geoinformation Group University of Bonn Bonn Germany Algorithms and Complexity Group TU Wien Vienna Austria
We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely f-Balanced Independent Set (f-BIS) and f-Balanced Dominating Set (f-BDS). Let G = (V, E) be a vertex-color... 详细信息
来源: 评论
Parameterized study of STEINER TREE on unit disk graphs
arXiv
收藏 引用
arXiv 2020年
作者: Bhore, Sujoy Carmi, Paz Kolay, Sudeshna Kolay, Sudeshna Algorithms and Complexity Group Tu Wien Vienna Austria Ben-Gurion University of the Negev Beersheba Israel Indian Institute of Technology Kharagpur
We study the STEINER TREE problem on unit disk graphs. Given a n vertex unit disk graph G, a subset R ⊆ V (G) of t vertices and a positive integer k, the objective is to decide if there exists a tree T in G that spans... 详细信息
来源: 评论
Solving the Steiner Tree Problem with few Terminals
Solving the Steiner Tree Problem with few Terminals
收藏 引用
International Conference on Tools for Artificial Intelligence (ICTAI)
作者: Johannes K. Fichte Markus Hecher André Schidler Institute of Artificial Intelligence TU Dresden Dresden Germany University of Potsdam Germany Algorithms and Complexity Group TU Wien Vienna Austria
The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tree problem asks to output a sub-graph... 详细信息
来源: 评论