Publications
Filters
total: 517
Catalog Publications
Year 2023
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach. 5. Alicja kupuje buty.
PublicationNiniejszy miniesej pokazuje, w jaki sposób można efektywnie przeszukiwać uporządkowane tablice 2-wymiarowe oraz, w jaki sposób można radzić sobie (niekiedy) z trudnymi problemami obliczeniowymi.
-
Rekordowe liczby pierwsze
PublicationProblem liczb pierwszych ma długą historię sięgającą czasów starożytnych. W śród liczb całkowitych liczby pierwsze grają rolę analogiczną do pierwiastków w chemii.
-
Screening of predicted synergistic multi-target therapies in glioblastoma identifies new treatment strategies
PublicationAbstract Background IDH-wildtype glioblastoma (GBM) is a highly malignant primary brain tumor with a median survival of 15 months after standard of care, which highlights the need for improved therapy. Personalized combination therapy has shown to be successful in many other tumor types and could be beneficial for GBM patients. Methods We performed the largest drug combination screen to date in GBM, using a high-throughput effort...
-
Security of Cryptocurrencies: A View on the State-of-the-Art Research and Current Developments
Publication[Context] The goal of security is to protect digital assets, devices, and services from being disrupted, exploited or stolen by unauthorized users. It is also about having reliable information available at the right time. [Motivation] Since the inception in 2009 of the first cryptocurrency, few studies have been undertaken to analyze and review the state-of-the-art research and current developments with respect to the security...
Year 2022
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Efficacy of intralesional bleomycin in treatment resistant viral warts
PublicationIntroduction Optimal management of treatment-refractory viral warts caused by human papillomavirus is unknown. One of the treatment methods is intralesional bleomycin solution. Objective To determine risk factors for resistant viral warts (not responding to conventional treatments for ≥ 6 months), to determine the effectiveness and safety of intralesional bleomycin in a group of patients with viral warts resistant to conventional...
-
Global defensive secure structures
PublicationLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Grafo-ania, czyli rzecz o grafach i algorytmach. Drzewa Steinera
PublicationProblem: na płaszczyźnie leżą 3 punkty. Znajdź czwarty, taki że jego sumaryczna odległość od 3 pozostałych jest minimalna, Pokazujemy jak rozwiązać ten problem i jego uogólnienie.
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Liczby Ramseya
PublicationZdefiniowano liczby Ramseya i wskazano na trudności obliczeniowe ich wyznaczania już przy niewielkich wartościach takich liczb.
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Problem 8 hetmanów
PublicationW eseju spojrzano na problem 8 hetmanów na szachownicy z punktu widzenia teorii grafów
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Szybkie mnożenie macierzy
PublicationMiniesej zawiera komentarz na temat zastosowania sztucznej inteligencji do problemu mnożenia macierzy.
-
Hybrid no-signaling-quantum correlations
PublicationFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
Infinite chromatic games
PublicationIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Non-Perfect Propagation of Information to a Noisy Environment with Self-Evolution
PublicationWe study the non-perfect propagation of information for evolving a low-dimensional environment that includes self-evolution as well as noisy initial states and analyse the interrelations between the degree of objectivization and environment parameters. In particular, we consider an analytical model of three interacting qubits and derive its objectivity parameters. The numerical analysis shows that the quality of the spectrum broadcast...
-
On zero-error codes produced by greedy algorithms
PublicationWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Potyczki algorytmiczne, czyli Alicja i Bogdan w nowych sytuacjach. Alicja i Bogdan w naleśnikarni
PublicationNiniejszym esejem inaugurujemy , po kilkuletniej przerwie, nową serię zagadek algorytmicznych.Pierwszy odcinek nosi nazwę Alicja i Bogdan w naleśnikarni.
-
Quantum security and theory of decoherence
PublicationWe sketch a relation between two crucial, yet independent, fields in quantum information research, viz. quantum decoherence and quantum cryptography. We investigate here how the standard cryptographic assumption of shielded laboratory, stating that data generated by a secure quantum device remain private unless explicitly published, is disturbed by the einselection mechanism of quantum Darwinism explaining the measurement process...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...