咨询与建议

限定检索结果

文献类型

  • 16 篇 期刊文献
  • 7 篇 会议

馆藏范围

  • 23 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 17 篇 工学
    • 17 篇 计算机科学与技术...
    • 4 篇 软件工程
    • 3 篇 控制科学与工程
  • 11 篇 理学
    • 11 篇 数学
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 2 篇 工商管理

主题

  • 23 篇 parameterized al...
  • 3 篇 dynamic programm...
  • 3 篇 np-hardness
  • 3 篇 bounded treewidt...
  • 2 篇 database systems
  • 2 篇 fair allocation
  • 2 篇 sql
  • 2 篇 counting
  • 2 篇 connected subgra...
  • 2 篇 indivisible reso...
  • 2 篇 data reduction
  • 2 篇 envy-freeness
  • 2 篇 wildlife crossin...
  • 2 篇 algorithm engine...
  • 2 篇 fixed-parameter ...
  • 2 篇 relational algeb...
  • 2 篇 donating goods
  • 2 篇 electoral distri...
  • 2 篇 preprocessing
  • 2 篇 computational su...

机构

  • 4 篇 tu berlin inst s...
  • 3 篇 tu wien austria
  • 3 篇 tech univ berlin...
  • 2 篇 univ potsdam pot...
  • 2 篇 tech univ dresde...
  • 2 篇 tu berlin
  • 1 篇 humboldt univ al...
  • 1 篇 czech technical ...
  • 1 篇 czech tech univ ...
  • 1 篇 max planck inst ...
  • 1 篇 nanyang technolo...
  • 1 篇 inst softwaretec...
  • 1 篇 univ jena inst i...
  • 1 篇 beijing jiaotong...
  • 1 篇 tu berlin inst s...
  • 1 篇 tech univ claust...
  • 1 篇 tech univ berlin...
  • 1 篇 tech univ berlin...
  • 1 篇 tech univ berlin...
  • 1 篇 royal holloway u...

作者

  • 9 篇 niedermeier rolf
  • 3 篇 hecher markus
  • 3 篇 kellerhals leon
  • 3 篇 fluschnik till
  • 3 篇 bredereck robert
  • 2 篇 hueffner falk
  • 2 篇 thier patrick
  • 2 篇 betzler nadja
  • 2 篇 niclas boehmer
  • 2 篇 woltran stefan
  • 2 篇 nichterlein andr...
  • 2 篇 zschoche philipp
  • 2 篇 koana tomohiro
  • 2 篇 moser hannes
  • 2 篇 boehmer niclas
  • 2 篇 fichte johannes ...
  • 2 篇 komusiewicz chri...
  • 2 篇 froese vincent
  • 1 篇 rolf niedermeier
  • 1 篇 sorge manuel

语言

  • 22 篇 英文
  • 1 篇 其他
检索条件"主题词=parameterized algorithmics"
23 条 记 录,以下是1-10 订阅
排序:
Placing Green Bridges Optimally, with a Multivariate Analysis
收藏 引用
THEORY OF COMPUTING SYSTEMS 2024年 第5期68卷 1312-1338页
作者: Fluschnik, Till Kellerhals, Leon Tech Univ Berlin Fac 4 Algorithm & Computat Complex Berlin Germany
We study the problem of placing wildlife crossings, such as green bridges, over human-made obstacles to challenge habitat fragmentation. The main task herein is, given a graph describing habitats or routes of wildlife... 详细信息
来源: 评论
Disentangling the Computational Complexity of Network Untangling
收藏 引用
THEORY OF COMPUTING SYSTEMS 2024年 第1期68卷 103-121页
作者: Froese, Vincent Kunz, Pascal Zschoche, Philipp Tech Univ Berlin Algorithm & Computat Complex Ernst Reuter Pl 7 D-10587 Berlin Germany Humboldt Univ Algorithm Engn Rudower Chaussee 25 D-12489 Berlin Germany
We study the network untangling problem introduced by Rozenshtein et al. (Data Min. Knowl. Disc. 35(1), 213-247, 2021), which is a variant of Vertex Cover on temporal graphs-graphs whose edge set changes over discrete... 详细信息
来源: 评论
Multivariate algorithmics for eliminating envy by donating goods
收藏 引用
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2024年 第2期38卷 1-35页
作者: Boehmer, Niclas Bredereck, Robert Heeger, Klaus Knop, Dusan Luo, Junjie Tech Univ Berlin Algorithm & Computat Complex Berlin Germany Tech Univ Clausthal Inst Informat Clausthal Zellerfeld Germany Czech Tech Univ Prague Czech Republic Beijing Jiaotong Univ Beijing Peoples R China
Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might a... 详细信息
来源: 评论
Multistage Vertex Cover
收藏 引用
THEORY OF COMPUTING SYSTEMS 2022年 第2期66卷 454-483页
作者: Fluschnik, Till Niedermeier, Rolf Rohm, Valentin Zschoche, Philipp Tech Univ Berlin Algorithm & Computat Complex Berlin Germany
The NP-complete Vertex Cover problem asks to cover all edges of a graph by a small (given) number of vertices. It is among the most prominent graph-algorithmic problems. Following a recent trend in studying temporal g... 详细信息
来源: 评论
Exploiting Database Management Systems and Treewidth for Counting
收藏 引用
THEORY AND PRACTICE OF LOGIC PROGRAMMING 2022年 第1期22卷 128-157页
作者: Fichte, Johannes. K. K. Hecher, Markus Thier, Patrick Woltran, Stefan Univ Calif Berkeley Berkeley CA 94720 USA TU Wien Vienna Austria
Bounded treewidth is one of the most cited combinatorial invariants in the literature. It was also applied for solving several counting problems efficiently. A canonical counting problem is #Sat, which asks to count t... 详细信息
来源: 评论
The parameterized Complexity of Welfare Guarantees in Schelling Segregation  24
The Parameterized Complexity of Welfare Guarantees in Schell...
收藏 引用
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems
作者: Argyrios Deligkas Eduard Eiben Tiger-Lily Goldsmith Royal Holloway University of London Egham United Kingdom
Schelling's model considers k types of agents each of whom needs to select a vertex on an undirected graph, where every agent prefers neighboring agents of the same type. We are motivated by a recent line of work ... 详细信息
来源: 评论
parameterized Complexity of Min-Power Asymmetric Connectivity
收藏 引用
THEORY OF COMPUTING SYSTEMS 2020年 第7期64卷 1158-1182页
作者: Bentert, Matthias Haag, Roman Hofer, Christian Koana, Tomohiro Nichterlein, Andre TU Berlin Fac IV Algorithm & Computat Complex Berlin Germany
We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed arc-weighted graph, MinPAC asks for a stro... 详细信息
来源: 评论
Modification-fair cluster editing
收藏 引用
SOCIAL NETWORK ANALYSIS AND MINING 2024年 第1期14卷 109-109页
作者: Froese, Vincent Kellerhals, Leon Niedermeier, Rolf Tech Univ Berlin Algorithm & Computat Complex Berlin Germany
The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to vertex-co... 详细信息
来源: 评论
A refined complexity analysis of fair districting over graphs
收藏 引用
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2023年 第1期37卷 13-13页
作者: Boehmer, Niclas Koana, Tomohiro Niedermeier, Rolf Tech Univ Berlin Algorithm & Computat Complex D-10623 Berlin Germany
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in ... 详细信息
来源: 评论
Placing Green Bridges Optimally, with a Multivariate Analysis  1
收藏 引用
17th Conference on Computability in Europe (CiE)
作者: Fluschnik, Till Kellerhals, Leon Tech Univ Berlin Algorithm & Computat Complex Fac 4 Berlin Germany
We study the problem of placing wildlife crossings, such as green bridges, over human-made obstacles to challenge habitat fragmentation. The main task herein is, given a graph describing habitats or routes of wildlife... 详细信息
来源: 评论