Search results for: ITALIAN DOMINATION

• Italian Journal of Linguistics

  Journals

  ISSN: 1120-2726

• Italian Journal of Pediatrics

  Journals

  ISSN: 1720-8424 , eISSN: 1824-7288

• Italian Economic Journal

  Journals

  ISSN: 2199-322X , eISSN: 2199-3238

• Italian Journal of Geosciences

  Journals

  ISSN: 2038-1719 , eISSN: 2038-1727

• Italian Journal of Medicine

  Journals

  ISSN: 1877-9344 , eISSN: 1877-9352

• Italian Journal of Agronomy

  Journals

  ISSN: 1125-4718 , eISSN: 2039-6805

• Italian Sociological Review

  Journals

  ISSN: 2239-8589

• Contemporary Italian Politics

  Journals

  ISSN: 2324-8823

• Italian Law Journal

  Journals

  eISSN: 2421-2156

• ITALIAN JOURNAL OF ZOOLOGY

  Journals

  ISSN: 1125-0003

• Italian Journal of Mycology

  Journals

  eISSN: 2531-7342

• NOMINATION DOSSIER, The Modernist Centre of Gdynia, parts 4 - 7

  Publication

  • R. Hirsch
  • C. Łozowska
  • A. Orchowska
  • K. Piotrowska
  • M. Sołtysik

  - Year 2021

  The city of Gdynia is commonly known in Poland as a symbol of the country’s independence and evidence of the foresight of planners and politicians. It is the outcome of the efforts and aspirations of generations of people from all kinds of backgrounds who made Gdynia their home. Document prepared by researchers from Gdansk University of Technology and other experts is the important part of the Nomination Dossier prepared for international...

• The Role of Daylight in Forming the Traditional Space: Classification of Traditional Iranian Daylighting Elements

  Publication

  • M. Ahmadi
  • N. Sokół
  • J. Francuzik
  • J. Martyniuk-Pęczek

  - TEKA KOMISJI URBANISTYKI I ARCHITEKTURY Oddział PAN w Krakowie - Year 2023

  Daylight character in a space can be defined as the manner in which daylight permeates and is dispersed in that space. The architectural elements related to daylighting under investigation in this study were rooted in Iranian-Isfahani heritage, considered traditional Iranian architecture (from the 16th to early 20th century). The establishment of a classification system for daylighting systems holds significant utility. This...

  Full text to download in external service

• Matriosche: nonne, madri e nipoti. Tre esempi di genealogie femminili nella letteratura italiana del Novecento

  Publication

  • D. Cerrato

  - Studia romanica posnaniensia - Year 2018

  Full text to download in external service

• INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS

  Publication

  • M. Dettlaff
  • M. Lemańska
  • A. Dapena
  • M. J. Souto-Salorio

  - Year 2015

  A minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...

  Full text to download in external service

• Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

  Publication

  • M. Lemańska
  • J. A. RODRíGUEZ-VELáZQUEZ
  • R. Trujillo-Rasua

  - FUNDAMENTA INFORMATICAE - Year 2017

  A vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...

  Full text to download in external service

• Lettere italiane

  Journals

  ISSN: 0024-1334 , eISSN: 2035-6315

• Italiano LinguaDue

  Journals

  ISSN: 2037-3597

• Veterinaria Italiana

  Journals

  ISSN: 0505-401X , eISSN: 1828-1427

• Trees having many minimal dominating sets

  Publication

  • M. Krzywkowski

  - INFORMATION PROCESSING LETTERS - Year 2013

  We provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...

  Full text to download in external service

• Nomination Dossier, The Modernist Centre of Gdynia, Part 2b, History and Development

  Publication

  • M. Sołtysik

  - Year 2021

  History and development of Gdynia, from Medieval times up until today. The project concerns such chapters as: Introduction; The village of Gdynia; Gdynia as a seaside resort; Construction of the port and the city in the interwar period; The modernist city centre – layout; architecture;Architecture of the city centre; South Pier and Grand District; Post-war development of Śródmieście: a continuation

• Evaluation of Sicilian landraces of broccoli (B. oleracea var. italica Plenck) for quality traits

  Publication

  • M. Di Bella
  • S. Treccarichi
  • D. Arena
  • R. Nicotra
  • A. Mazzaglia
  • M. Melilli
  • A. Bartoszek-Pączkowska
  • B. Kusznierewicz
  • K. Parchem
  • F. Branca

  - Year 2022

  Brassica oleracea L. var. italica Plenck is one of the most popular vegetables which belong to Brassicaceae family. It is getting attention as an important source of bioactive compounds such as glucosinolates, and many other phytochemicals. In the frame of the H2020 BRESOV project, we evaluated three landraces (‘Broccolo nero', ‘Ramoso calabrese' and ‘Sparaceddu') and two commercial F1 hybrid cultivars (‘Marathon' and ‘Naxos')....

  Full text to download in external service

• Italia dialettale

  Journals

  ISSN: 0085-2295

• Italia Contemporanea

  Journals

  ISSN: 0392-1077 , eISSN: 2036-4555

• Italica

  Journals

  ISSN: 0021-3020

• Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

  Publication

  • M. Dettlaff
  • J. Raczek
  • I. G. Yero

  - Opuscula Mathematica - Year 2016

  Given a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...

  Full text available to download

• Combination treatment in hypertension – the latest 2013 European Guidelines

  Publication

  • T. Hedner
  • S. Kjeldsen
  • K. Narkiewicz

  - BLOOD PRESSURE - Year 2013

  Full text to download in external service

• Demineralization of water using a combination of MD and NF(RO)

  Publication

  • M. M. Gryta
  • K. Karakulski
  • M. Tomaszewska
  • W. Morawski

  - DESALINATION - Year 2006

  Full text to download in external service

• APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION

  Publication

  • T. Niksa-Rynkiewicz
  • M. Landowski
  • P. Szalewski

  - Polish Maritime Research - Year 2020

  The article specifies the dependence of defects occurring in the lamination process in the production of yachts. Despite great knowledge about their genesis, they cannot be completely eliminated. Authentic data obtained through cooperation with one of the Polish yacht shipyards during the years 2013–2017 were used for the analysis. To perform a simulation, the sample size was observed in 1450 samples, consisting of 6 models of...

  Full text available to download

• Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks

  Publication

  • J. Raczek

  - Electronics - Year 2022

  Dominating 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...

  Full text available to download

• Joanna Raczek dr inż.

  People

  Department of Algorithms and Systems Modelling

  Employment 2003 -- 2019: Faculty of Applied Physics and Mathematics, Gdańsk University of Technology. 2019 - present: Faculty of Electronic, Informatics and Telecominications, Gdańsk University of Technology. Education May 2007: Doctor of Philosophy in Mathematics, University of Gdańsk. Doctoral dissertation: "Paired domination and doubly domination in graphs". Supervisor: dr hab. Jerzy Topp. 2000 -- 2004 Bachelor of Science...

• Iranian future healthcare professionals' knowledge and opinions about rare diseases: cross-sectional study

  Publication

  • R. Jahanshahi
  • A. Nasirzadeh
  • M. Farzan
  • J. Domaradzki
  • L. Jouybari
  • A. Sanagoo
  • M. Farzan
  • K. Aghazadeh-Habashi
  • A. Fallah
  • S. Bagheri... and 13 others

  - Orphanet Journal of Rare Diseases - Year 2022

  Full text to download in external service

• Iranian future healthcare professionals’ knowledge and opinions about rare diseases: cross‑sectional study

  Publication

  • J. Domaradzki

  - Orphanet Journal of Rare Diseases - Year 2022

  Background: Rare diseases are a new global health priority, requiring evidence-based estimates of the global prevalenceof diseases to inform public policymakers and provide a serious challenge to the healthcare system that must not be ignored. The purpose of this study is to investigate Iranian future healthcare professionals’ knowledge and opinions about rare diseases.Results: A total of 6838 students responded...

  Full text available to download

• Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number

  Publication

  • S. Bermudo
  • M. Dettlaff
  • M. Lemańska

  - DISCRETE APPLIED MATHEMATICS - Year 2021

  Given two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...

  Full text to download in external service

• Journal of Modern Italian Studies

  Journals

  ISSN: 1354-571X , eISSN: 1469-9583

• Journal of Anglo-Italian Studies

  Journals

  ISSN: 1560-2168

• Bulletin of Society of Italian Studies

  Journals

  ISSN: 0264-2190

• Italian Journal of Food Safety

  Journals

  ISSN: 2239-7132

• Italian Journal of Planning Practice

  Journals

  ISSN: 2239-267X

• Italian Journal of Gynaecology and Obstetrics

  Journals

  ISSN: 1121-8339

• Italian Journal of Sociology of Education

  Journals

  eISSN: 2035-4983

• Italian Journal of Anatomy and Embryology

  Journals

  ISSN: 1122-6714

• HYSTRIX-Italian Journal of Mammalogy

  Journals

  ISSN: 0394-1914 , eISSN: 1825-5272

• Italian Journal of Dermatology and Venereology

  Journals

  ISSN: 2784-8671 , eISSN: 2784-8450

• Italian Review of Legal History

  Journals

  ISSN: 2464-8914

• Italian Journal of Animal Science

  Journals

  ISSN: 1594-4077 , eISSN: 1828-051X

• ITALIAN JOURNAL OF FOOD SCIENCE

  Journals

  ISSN: 1120-1770 , eISSN: 2239-5687

• Documentation of endpoint prevention with combination therapy in hypertension is urgently needed

  Publication

  • S. Kjeldsen
  • S. Oparil
  • T. Hedner
  • K. Narkiewicz

  - BLOOD PRESSURE - Year 2007

  Full text to download in external service

• An algorithm for listing all minimal double dominating sets of a tree

  Publication

  • M. Krzywkowski

  - FUNDAMENTA INFORMATICAE - Year 2014

  We provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.

  Full text to download in external service

• An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree

  Publication

  • M. Krzywkowski

  - LECTURE NOTES IN COMPUTER SCIENCE - Year 2013

  We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.

  Full text available to download