咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
The Evolution and Implications of the Inosine tRNA Modification
收藏 引用
Journal of Molecular Biology 2025年 169187页
作者: van der Gulik, Peter T.S. Hoff, Wouter D. Algorithms and Complexity Group Centrum Wiskunde & Informatica P.O. Box 94079 Amsterdam 1090 GB Netherlands Department of Microbiology and Molecular Genetics Oklahoma State University Stillwater 74078 OK United States
Ever since the legendary publication by Francis Crick in JMB introducing the wobble hypothesis in 1966, inosine has been a permanent part of molecular biology. This review aims to integrate the rich array of novel ins... 详细信息
来源: 评论
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding  51
A Tight Subexponential-Time Algorithm for Two-Page Book Embe...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Ganian, Robert Müller, Haiko Ordyniak, Sebastian Paesani, Giacomo Rychlicki, Mateusz Algorithms and Complexity Group TU Wien Austria School of Computing University of Leeds United Kingdom
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into "pages", which are half-planes bounded by that line. Two-page book embeddin... 详细信息
来源: 评论
Lossy Kernelization of Same-Size Clustering  1
收藏 引用
17th International Computer Science Symposium in Russia, CSR 2022
作者: Bandyapadhyay, Sayan Fomin, Fedor V. Golovach, Petr A. Purohit, Nidhi Siminov, Kirill Department of Informatics University of Bergen Bergen Norway Algorithms and Complexity Group TU Wien Vienna Austria
In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) ... 详细信息
来源: 评论
Path-contractions, edge deletions and connectivity preservation  25
Path-contractions, edge deletions and connectivity preservat...
收藏 引用
25th European Symposium on algorithms, ESA 2017
作者: Gutin, Gregory Ramanujan, M.S. Reidl, Felix Wahlström, Magnus Algorithms and Complexity Group TU Wien Vienna Austria Royal Holloway University Egham United Kingdom
We study several problems related to graph modification problems under connectivity constraints from the perspective of parameterized complexity: (Weighted) Biconnectivity Deletion, where we are tasked with deleting k... 详细信息
来源: 评论
Parameterised Partially-Predrawn Crossing Number  38
Parameterised Partially-Predrawn Crossing Number
收藏 引用
38th International Symposium on Computational Geometry, SoCG 2022
作者: Hamm, Thekla Hlinený, Petr Algorithms and Complexity Group TU Wien Austria Faculty of Informatics Masaryk University Brno Czech Republic
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new perspective on the traditional and arguably most important geometric graph parameter, the crossing number. Specifical... 详细信息
来源: 评论
Boundary Labeling in a Circular Orbit  32
Boundary Labeling in a Circular Orbit
收藏 引用
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024
作者: Bonerath, Annika Nöllenburg, Martin Terziadis, Soeren Wallinger, Markus Wulms, Jules University of Bonn Germany Algorithms and Complexity Group TU Wien Austria TU Eindhoven Netherlands Chair for Efficient Algorithms TU Munich Germany
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresponding points are connected via cross... 详细信息
来源: 评论
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting  16
Discovering Archipelagos of Tractability for Constraint Sati...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Robert Ganian M. S. Ramanujan Stefan Szeider Algorithms and Complexity Group
The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with ... 详细信息
来源: 评论
Deterministic Constrained Multilinear Detection  48
Deterministic Constrained Multilinear Detection
收藏 引用
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
作者: Brand, Cornelius Korchemna, Viktoriia Skotnica, Michael Algorithms and Complexity Group TU Wien Austria Department of Applied Mathematics Charles University Prague Czech Republic
We extend the algebraic techniques of Brand and Pratt (ICALP’21) for deterministic detection of k-multilinear monomials in a given polynomial with non-negative coefficients to the more general situation of detecting ... 详细信息
来源: 评论
Twin-Width Meets Feedback Edges and Vertex Integrity  19
Twin-Width Meets Feedback Edges and Vertex Integrity
收藏 引用
19th International Symposium on Parameterized and Exact Computation, IPEC 2024
作者: Balabán, Jakub Ganian, Robert Rocton, Mathis Faculty of Informatics Masaryk University Brno Czech Republic Algorithms and Complexity Group TU Wien Vienna Austria
The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding o... 详细信息
来源: 评论
A SAT Attack on Rota’s Basis Conjecture  25
A SAT Attack on Rota’s Basis Conjecture
收藏 引用
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022
作者: Kirchweger, Markus Scheucher, Manfred Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Institut für Mathematik Technische Universität Berlin Germany
The SAT modulo Symmetries (SMS) is a recently introduced framework for dynamic symmetry breaking in SAT instances. It combines a CDCL SAT solver with an external lexicographic minimality checking algorithm. We extend ... 详细信息
来源: 评论