Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Szilágyi, Krisztina"'
The class XNLP consists of (parameterized) problems that can be solved nondeterministically in $f(k)n^{O(1)}$ time and $f(k)\log n$ space, where $n$ is the size of the input instance and $k$ the parameter. The class XALP consists of problems that can
Externí odkaz:
http://arxiv.org/abs/2402.03087
An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called Cover by Arithmetic P
Externí odkaz:
http://arxiv.org/abs/2312.06393
Autor:
Nederlof, Jesper, Szilágyi, Krisztina
In this paper we investigate the parameterized complexity of the task of counting and detecting occurrences of small patterns in unit disk graphs: Given an $n$-vertex unit disk graph $G$ with an embedding of ply $p$ (that is, the graph is represented
Externí odkaz:
http://arxiv.org/abs/2312.06377
Autor:
Nederlof, Jesper, Szilágyi, Krisztina
Publikováno v:
In Journal of Computer and System Sciences March 2025 148
We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decompositions of small treewidth decompose the graph with small vertex separato
Externí odkaz:
http://arxiv.org/abs/2110.02730
We study a variant of Min Cost Flow in which the flow needs to be connected. Specifically, in the Connected Flow problem one is given a directed graph $G$, along with a set of demand vertices $D \subseteq V(G)$ with demands $\mathsf{dem}: D \rightarr
Externí odkaz:
http://arxiv.org/abs/2106.11689
Publikováno v:
Aleph: Historical Studies in Science and Judaism, 2016 Jan 01. 16(1), 33-38.
Externí odkaz:
https://www.jstor.org/stable/10.2979/aleph.16.1.33
Autor:
Szilágyi, Krisztina
Publikováno v:
Aleph: Historical Studies in Science and Judaism, 2016 Jan 01. 16(1), 11-31.
Externí odkaz:
https://www.jstor.org/stable/10.2979/aleph.16.1.11
Autor:
Groenland, Carla, Mannens, Isja, Nederlof, Jesper, Szilágyi, Krisztina, Sub Algorithms and Complexity, Sub Mathematical Modeling
Publikováno v:
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), 219, 36:1. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decompositions of small treewidth decompose the graph with small vertex separato
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41098c17759c07e0a2f61cfb79d85719
https://dspace.library.uu.nl/handle/1874/426681
https://dspace.library.uu.nl/handle/1874/426681
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.