DE1423184U
(cg-RX-API-DMAC7.html )
ATE168266T1
(de )
1998-08-15
Kombination einer antimikrobiellen verbindung (z.b. der lipoaminosäure n,n-octanoyl-glycin) und eines monoalkylglycerinethers und ihre verwendung als antimikrobieller wirkstoff
Caccetta et al.
1979
On diameter critical graphs
ATE399411T1
(de )
2008-07-15
Dienstqualität über wege mit einer drahtlosen verbindung
Onaga
2003
Dynamic programming of optimum flows in lossy communication nets
Li et al.
1992
The point-to-point delivery and connection problems: complexity and algorithms
Eiselt et al.
1992
Location of facilities on a network subject to a single‐edge failure
FR3129550B1
(fr )
2023-12-29
Réseau de télécommunications quantiques avec une composante spatioportée ou aéroportée
Hughes
1999
Stratified path spaces and fibrations
DE1464441U
(cg-RX-API-DMAC7.html )
Kessler et al.
2002
On the cost of fairness in ring networks
Jiang et al.
1999
Edge-bandwidth of graphs
MA63065B1
(fr )
2024-12-31
Ensemble pipeline et son procédé de fabrication
Moltó
1991
On a theorem of Sobczyk
Rispoli
1992
The monotonic diameter of the perfect matching and shortest path polytopes
Ellis et al.
2004
Random geometric graph diameter in the unit disk with ℓ p metric
Reines
2021
Certain Legal-Economic Issues Related to Franchise Contracts-Thoughts regarding the Concept of Efficient Breach
Mol et al.
2020
The threshold dimension and irreducible graphs
ATE242464T1
(de )
2003-06-15
Gewehrschloss, insbesondere für ein jagdgewehr
GB1440049A
(en )
1976-06-23
Diphenyl ether compounds and their use as herbicides
Legradi
1999
Reliance Damage in the Hungarian Civil Code and Jurisprudence
Sadowskiej-Snarskiej
0
RÓWNOWAGA
Perl et al.
1982
On the complexity of edge labelings for trees
Dahlhaus
1998
Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs
Williams
1999
Focus groups