X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (35) 35
discrete mathematics (27) 27
mathematics (17) 17
graphs (13) 13
mathematics, applied (9) 9
coloring (8) 8
graph theory (8) 8
quality of service (8) 8
humans (7) 7
integers (7) 7
mathematical analysis (7) 7
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (6) 6
aged (6) 6
female (6) 6
male (6) 6
mathematics - combinatorics (6) 6
middle aged (6) 6
networking and internet architecture (6) 6
combinatorics (5) 5
index medicus (5) 5
packing chromatic number (5) 5
percutaneous coronary intervention (5) 5
routing (5) 5
[ info ] computer science [cs] (4) 4
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (4) 4
cardiac & cardiovascular systems (4) 4
coronary artery disease (4) 4
distance graph (4) 4
gewährleistung (4) 4
graph (4) 4
networks (4) 4
performance evaluation (4) 4
qos routing (4) 4
quality of service architectures (4) 4
registries (4) 4
treatment outcome (4) 4
wireless communication (4) 4
wireless mesh network (4) 4
[ info.info-ni ] computer science [cs]/networking and internet architecture [cs.ni] (3) 3
[ math ] mathematics [math] (3) 3
artery-disease (3) 3
bandwidth (3) 3
choosability (3) 3
chromatic number (3) 3
circulant graph (3) 3
color (3) 3
computer architecture (3) 3
computer networks (3) 3
computer science - discrete mathematics (3) 3
computer science, theory & methods (3) 3
construction (3) 3
data structures and algorithms (3) 3
discrete mathematics and combinatorics (3) 3
drug-eluting stent (3) 3
finite element method (3) 3
graph coloring (3) 3
graph labeling (3) 3
planar graphs (3) 3
routing protocols (3) 3
service-qualität (3) 3
sirolimus - analogs & derivatives (3) 3
square (3) 3
theoretical computer science (3) 3
voip (3) 3
05c15 (2) 2
[ info.info-cc ] computer science [cs]/computational complexity [cs.cc] (2) 2
[ math.math-co ] mathematics [math]/combinatorics [math.co] (2) 2
absorbable implants (2) 2
ad hoc networks (2) 2
ad-hoc-netz (2) 2
adjacent vertex-distinguishing (2) 2
algorithm analysis and problem complexity (2) 2
analysis (2) 2
angioplasty (2) 2
approximation algorithm (2) 2
availability (2) 2
biodegradable polymer (2) 2
bioresorbable vascular scaffold (2) 2
cardiology (2) 2
cardiovascular (2) 2
cardiovascular disease (2) 2
cardiovascular diseases (2) 2
cartesian product (2) 2
channel assignment (2) 2
clinical-outcomes (2) 2
cloud computing (2) 2
cloud-sla (2) 2
clustering algorithms (2) 2
comparative analysis (2) 2
completely independent spanning tree (2) 2
computational complexity (2) 2
computer communication networks (2) 2
computer graphics (2) 2
computer simulation (2) 2
conferences (2) 2
coronary angiography (2) 2
coronary heart disease (2) 2
coronary vessels (2) 2
cubic graph (2) 2
cycles (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal Article
JACC (Journal of the American College of Cardiology), ISSN 0735-1097, 2015, Volume 65, Issue 8, pp. 791 - 801
Abstract Background The first CE-approved bioresorbable vascular scaffold (BVS) is effective at treating simple lesions and stable coronary artery disease, but... 
Cardiovascular | Internal Medicine | coronary artery disease | late lumen loss | percutaneous coronary intervention | myocardial infarction | drug-eluting stent(s) | BIODEGRADABLE POLYMER | CARDIAC & CARDIOVASCULAR SYSTEMS | RANDOMIZED-TRIALS | PERCUTANEOUS CORONARY | NON-INFERIORITY TRIAL | FOLLOW-UP | LESIONS | NONINFERIORITY TRIAL | ABSORB | ARTERY-DISEASE | CLINICAL-OUTCOMES | Coronary Artery Disease - surgery | Sirolimus - analogs & derivatives | Humans | Middle Aged | Postoperative Complications - prevention & control | Coronary Restenosis - prevention & control | Male | Treatment Outcome | Sirolimus - pharmacology | Postoperative Complications - diagnosis | Absorbable Implants | Drug-Eluting Stents - adverse effects | Materials Testing - methods | Tissue Scaffolds | Coronary Restenosis - diagnosis | Coronary Angiography - methods | Coronary Artery Disease - diagnosis | Percutaneous Coronary Intervention - methods | Female | Aged | Everolimus | Immunosuppressive Agents - pharmacology | Percutaneous Coronary Intervention - adverse effects | Coronary Restenosis - etiology | Angiogenesis inhibitors | Coronary heart disease | Analysis | Stent (Surgery) | Transluminal angioplasty | Heart | Medical research | Medicine, Experimental | Comparative analysis | Cardiology | Drug therapy | Angioplasty | Stents | Coronary vessels | Clinical outcomes
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 04/2014, Volume 167, pp. 280 - 289
The packing chromatic numberχρ(G) of a graph G is the least integer k for which there exists a mapping f from V(G) to {1,2,…,k} such that any two vertices of... 
Distance graph | Packing chromatic number | Graph coloring | MATHEMATICS, APPLIED | CHROMATIC NUMBER | Integers | Coloring | Upper bounds | Mathematical analysis | Color | Graphs | Mapping | Computer Science | Discrete Mathematics
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2020
The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional... 
Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2016, Volume 339, Issue 10, pp. 2461 - 2470
Given a non-decreasing sequence S=(s sub(1),s sub(2),...,s sub(k))S=(s1,s2,...,sk) of positive integers, an SS-packing coloring of a graph GG is a mapping cc... 
Integers | Coloring | Subdivisions | Mathematical analysis | Color | Graphs | Graph theory | Mapping
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2016, Volume 339, Issue 10, pp. 2461 - 2470
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 04/2019, Volume 259, pp. 63 - 75
Given a non-decreasing sequence S=(s1,s2,…,sk) of positive integers, an S-packing edge-coloring of a graph G is a partition of the edge set of G into k subsets... 
Snark | Packing chromatic index | [formula omitted]-packing chromatic index | [formula omitted]-distance coloring | Cubic graph | d-distance coloring | S-packing chromatic index | MATHEMATICS, APPLIED | CHROMATIC NUMBER | Integers | Graphs | Graph coloring | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 209 - 221
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exist subclasses in which the... 
Packing colouring | Subcubic graphs | Packing chromatic number | Outerplanar graphs | COLORINGS | MATHEMATICS, APPLIED | SQUARE | PRODUCT | LATTICE | Graphs | Lattices | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2018, Volume 236, p. 124
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees... 
Trees | Integers | Completeness | Graphs | Graph theory | Trees (mathematics) | Combinatorics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, p. 163
Let k ≥ 2 be an integer and T1,..., Tk be spanning trees of a graph G. If for any pair of vertices (u, v} of V(G), the paths between is and v in every Ti, 1 ≤... 
Trees | Titanium | Graphs | Graph theory | Trees (mathematics) | Graph algorithms
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2016, Volume 339, Issue 10, pp. 2461 - 2470
Given a non-decreasing sequence S=(s1,s2,…,sk) of positive integers, an S-packing coloring of a graph G is a mapping c from V(G) to {s1,s2,…,sk} such that any... 
Coloring | Packing chromatic number | Graph | Cubic graph | MATHEMATICS | SQUARE | CHROMATIC NUMBER | Computer Science | Discrete Mathematics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2019, Volume 35, Issue 6, pp. 1555 - 1569
Given a graph G, the exact distance-p graph $$G^{[\natural p]}$$ G [ ♮ p ] has V(G) as its vertex set, and two vertices are adjacent whenever the distance... 
05C76 | Graph product | 05C12 | Hypercube | Connectivity | Mathematics | Engineering Design | Generalized Kneser graph | Combinatorics | Exact distance graph | Generalized Johnson graph | 05C15 | MATHEMATICS | CHROMATIC-NUMBERS | PROOF | Construction | Software reviews | Apexes | Hypercubes | Graphs | Graph theory | Cartesian coordinates | Computer Science | Discrete Mathematics
Journal Article
Journal Article
Computers, ISSN 2073-431X, 12/2018, Volume 7, Issue 4, p. 64
Providing Internet of Things (IoT) environments with service level guarantee is a challenging task for improving IoT application usage experience. We specify... 
IEEE 802.15.4 | Self-configuring | E-health | Slotted CSMA/CA | QBAIoT | IoT | Networking and Internet Architecture | Computer Science | e-health | self-configuring
Journal Article
Discrete Mathematics, ISSN 0012-365X, 08/2016, Volume 339, Issue 8, pp. 2157 - 2167
Gyárfás et al. and Zaker have proven that the Grundy number of a graph G satisfies Γ(G)≥t if and only if G contains an induced subgraph called a t-atom. The... 
Grundy number | b-coloring | Partial Grundy number | Parameterized complexity | MATHEMATICS | GRAPHS | Coloring | Graphs | Utilities | Graph theory | Equivalence | Mathematical analysis | Computer Science | Discrete Mathematics
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2019, Volume 11005, pp. 157 - 173
Conference Proceeding
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 163 - 174
Let k≥2 be an integer and T1,…,Tk be spanning trees of a graph G. If for any pair of vertices {u,v} of V(G), the paths between u and v in every Ti, 1≤i≤k, do... 
Completely independent spanning tree | Spanning tree | Cartesian product | MATHEMATICS, APPLIED | SMALL DEPTHS | Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2018, Volume 236, pp. 124 - 136
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees... 
Disjoint connected dominating sets | Independent spanning trees | Spanning trees | Completely independent spanning trees | Grid | HYPERCUBES | MATHEMATICS, APPLIED | CONSTRUCTION | TORUS NETWORKS | PLANAR GRAPHS | SMALL DEPTHS | Networking and Internet Architecture | Computer Science | Computational Complexity | Discrete Mathematics
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.