Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Łukasz Kowalik"'
This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:687-713
We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b560635399e424507c4d2f8f0fca14db
https://doi.org/10.1137/15m1048975
https://doi.org/10.1137/15m1048975
Autor:
Marthe Bonamy, Łukasz Kowalik
Publikováno v:
Theor. Comput. Sci.
Theor. Comput. Sci., 2016, 645, pp.25--40. ⟨10.1016/j.tcs.2016.05.031⟩
Theor. Comput. Sci., 2016, 645, pp.25--40. ⟨10.1016/j.tcs.2016.05.031⟩
We show a kernel of at most $13k$ vertices for the Planar Feedback Vertex Set problem restricted to planar graphs, i.e., a polynomial-time algorithm that transforms an input instance $(G,k)$ to an equivalent instance with at most $13k$ vertices. To t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::534bb4489d1a737839ace184cb8894dd
https://doi.org/10.1016/j.tcs.2016.05.031
https://doi.org/10.1016/j.tcs.2016.05.031
Autor:
Łukasz Kowalik, Juho Lauri
Publikováno v:
Theoretical Computer Science. 628:110-114
In the Colorful Path problem we are given a graph G = ( V , E ) and an arbitrary vertex coloring function c : V ? k . The goal is to find a colorful path, i.e., a path on k vertices, that visits each color. This problem has been introduced in the cla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e017a3ea493a5bf55d32adcb1e4600f
https://doi.org/10.1016/j.tcs.2016.03.017
https://doi.org/10.1016/j.tcs.2016.03.017
Autor:
Łukasz Kowalik, Wojciech Drożdż
Publikováno v:
Zeszyty Naukowe Uniwersytetu Szczecińskiego. Studia Informatica. 41:59-68
W tekście podjeto problem skuteczności dzialan edukacyjnych i promocyjnych wspierających wejście na rynek nowej kategorii produktow i jej uzaleznienie od sposobow komunikacji z nabywcą. Obok rozwazan teoretycznych ujete w nim zostaly takze wynik
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56a2458c25ed21e79ea8cadd18d77205
https://doi.org/10.18276/si.2016.41-05
https://doi.org/10.18276/si.2016.41-05
Publikováno v:
25th Annual European Symposium on Algorithms (ESA 2017)
Given a traveling salesman problem (TSP) tour H in graph G , a k -move is an operation that removes k edges from H and adds k edges of G so that a new tour H ′ is formed. The popular k -OPT heuristic for TSP finds a local optimum by starting from a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9597e8191e4be80d8ddd95c7d5b43aad
Publikováno v:
Journal of Contemporary Brachytherapy
Purpose: To present comparison of treatment plans made by using 2D and 3D methods in the planning system, as well as to assess the quality of treatment plans using the 2D and 3D methods. Material and methods: The studies involved a group of 31 patien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e1ba3353bc084716e80e19f1f36f992
http://europepmc.org/articles/PMC4200179
http://europepmc.org/articles/PMC4200179
Autor:
Łukasz Kowalik, Marcin Mucha
Publikováno v:
Graph-Theoretic Concepts in Computer Science-38th International Workshop
We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. We focus on the Planar Maximum Nonseparating Independent Set problem, where given a planar graph and an integer k one has to find an independent set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84e58e6bef443409373b26fd3a218df6
https://doi.org/10.1016/j.tcs.2013.11.021
https://doi.org/10.1016/j.tcs.2013.11.021
Publikováno v:
Physica Medica. 52:146-147
Purpose The purpose of this study is to estimation the dose distribution in HDR endobronchial brachytherapy in 2D and 3D methods with the use of three-dimensional images. Methods Conducted examination concerns patients diagnosed with non-small cell l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4322217441e2bcbbc4a52c11fe6b9e86
https://doi.org/10.1016/j.ejmp.2018.06.467
https://doi.org/10.1016/j.ejmp.2018.06.467
Publikováno v:
Journal of Contemporary Brachytherapy
The aim of this paper is to discuss brachytherapy treatment and individual applicators suitable for unfavorably lo calized superficial malignant lesions. Techniques for manufacturing an individual applicator and clinical examples of its use for vario
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::541a357762014b6ab83fac891758fd9c
http://europepmc.org/articles/PMC3635046
http://europepmc.org/articles/PMC3635046