Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Till Fluschnik"'
Autor:
Till Fluschnik, Steffen Kriewald, Anselmo García Cantú Ros, Bin Zhou, Dominik E. Reusser, Jürgen P. Kropp, Diego Rybski
Publikováno v:
ISPRS International Journal of Geo-Information, Vol 5, Iss 7, p 110 (2016)
Human development has far-reaching impacts on the surface of the globe. The transformation of natural land cover occurs in different forms, and urban growth is one of the most eminent transformative processes. We analyze global land cover data and ex
Externí odkaz:
https://doaj.org/article/988735f7d76c4c319b9535741437ecc2
Publikováno v:
Algorithmica.
Addressing a quest by Gupta et al. (in: Proceedings of the 41st international colloquium on automata, languages, and programming (ICALP 2014), vol 8572 of LNCS. Springer, pp 563–575, 2014), we provide a first, comprehensive study of finding a short
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce two time-dependent multistage models based on simple scoring-based voting. Therein, we are giv
Publikováno v:
Networks. 76:485-508
Given an undirected graph with edge weights and a subset $R$ of its edges, the Rural Postman Problem (RPP) is to find a closed walk of minimum total weight containing all edges of $R$. We prove that RPP is WK[1]-complete parameterized by the number a
Autor:
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Publikováno v:
Computability. 9:1-24
Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bou
Publikováno v:
Journal of Computer and System Sciences. 106:23-48
We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at mo
Publikováno v:
Journal of Computer and System Sciences. 102:69-86
We study the computational complexity of routing multiple objects through a network while avoiding collision: Given a graph G with two distinct terminals and two positive integers p , k , the question is whether one can connect the terminals by at le
Autor:
Till Fluschnik, Leon Kellerhals
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
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 animals and possibilities of bui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e93c4dbe4d260b104c1ce4df07287e8
https://doi.org/10.1007/978-3-030-80049-9_19
https://doi.org/10.1007/978-3-030-80049-9_19
Autor:
Till Fluschnik, Dario Cavallaro
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
WG
We study the computational complexity of Feedback Vertex Set on subclasses of Hamiltonian graphs. In particular, we consider Hamiltonian graphs that are regular or are planar and regular. Moreover, we study the less known class of p-Hamiltonian-order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9301d1922c6294859df5fe962995b030
https://doi.org/10.1007/978-3-030-86838-3_16
https://doi.org/10.1007/978-3-030-86838-3_16
Autor:
Till Fluschnik
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030752415
CIAC
CIAC
We study q-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein, given a sequence of q-CNF formulas and a non-negative integer d, the question is whether there is a sequence of satisfying truth assignments such that for eve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b41f8ace09c0fdbf06be5353b4e44605
https://doi.org/10.1007/978-3-030-75242-2_16
https://doi.org/10.1007/978-3-030-75242-2_16