Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Dekel Tsur"'
Autor:
Dekel Tsur
Publikováno v:
Theoretical Computer Science. 940:112-123
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91d98cd515acfba4b8657567637c3c41
https://doi.org/10.1016/j.tcs.2022.10.044
https://doi.org/10.1016/j.tcs.2022.10.044
Autor:
Dekel Tsur
Publikováno v:
Journal of Combinatorial Optimization. 44:3701-3710
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::902b954d25b6f4ddf447d1938763d8f6
https://doi.org/10.1007/s10878-022-00917-3
https://doi.org/10.1007/s10878-022-00917-3
Autor:
Dekel Tsur
Publikováno v:
Theoretical Computer Science. 921:63-74
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bb5d80e44aa844cdc0d3beaf6788c86
https://doi.org/10.1016/j.tcs.2022.04.001
https://doi.org/10.1016/j.tcs.2022.04.001
Autor:
Dekel Tsur
Publikováno v:
Theoretical Computer Science. 953:113796
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b0db447625fce6b0454f4fcd52e3cd9
https://doi.org/10.1016/j.tcs.2023.113796
https://doi.org/10.1016/j.tcs.2023.113796
Autor:
Dekel Tsur
Publikováno v:
Discrete Applied Mathematics. 291:1-14
In the 4-Path Vertex Cover problem, the input is an undirected graph G and an integer k . The goal is to decide whether there is a set S of vertices of size at most k such that every path with 4 vertices in G contains at least one vertex of S . In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::470afc1dcff6032df71569c1a1d55fdc
https://doi.org/10.1016/j.dam.2020.11.019
https://doi.org/10.1016/j.dam.2020.11.019
Autor:
Dekel Tsur
Publikováno v:
Theory of Computing Systems. 65:323-343
In the Cluster Vertex Deletion problem the input is a graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that the deletion of the vertices of $S$ from $G$ results a graph in which every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d66b13d4b7a47993c57dabfb5e968a3
https://doi.org/10.1007/s00224-020-10005-w
https://doi.org/10.1007/s00224-020-10005-w
Autor:
Dekel Tsur
Publikováno v:
Information Processing Letters. 180:106335
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e0f909f41b0d28735107e96904ca9c7
https://doi.org/10.1016/j.ipl.2022.106335
https://doi.org/10.1016/j.ipl.2022.106335
Autor:
Dekel Tsur
Publikováno v:
Information Processing Letters. 179:106317
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eaddd3abe5a3a54e8ae9839919bb5055
https://doi.org/10.1016/j.ipl.2022.106317
https://doi.org/10.1016/j.ipl.2022.106317
Autor:
Dekel Tsur
Publikováno v:
Theoretical Computer Science. 790:96-104
In the k -Path problem, the input is a directed graph G and an integer k ≥ 1 , and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k -Path with time complexity O ⁎
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f73f9db2425e4adc027dad8db318b9c
https://doi.org/10.1016/j.tcs.2019.04.024
https://doi.org/10.1016/j.tcs.2019.04.024
Autor:
Dekel Tsur
Publikováno v:
Theoretical Computer Science. 780:12-19
Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O ( log n / log log n ) or O ( log n ) time, and insertion or deletion of a single node in O (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50ba7eef063e3797d5fd3e323e90e690
https://doi.org/10.1016/j.tcs.2019.02.005
https://doi.org/10.1016/j.tcs.2019.02.005