UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A Process-based Model with Temperature, Water, and Lab-derived Data Improves Predictions of Daily Culex pipiens/restuans Mosquito Density

Journal of medical entomology, 2022-11, Vol.59 (6), p.1947-1959

2022

Volltextzugriff (PDF)

On gauge repeatability and reproducibility studies for counts

Quality engineering, 2021-10, Vol.33 (4), p.641-654

2021

Volltextzugriff (PDF)

Dynamic linear models for forecasting of radiation belt electrons and limitations on physical interpretation of predictive models

Space Weather, 2014-06, Vol.12 (6), p.426-446

2014

Volltextzugriff (PDF)

A Process-based Model with Temperature, Water, and Labderived Data Improves Predictions of Daily Culex pipiens/restuans Mosquito Density

Journal of medical entomology, 2022-11, Vol.59 (6), p.1947

2022

Volltextzugriff (PDF)

Matchings in hypergraphs of large minimum degree

Journal of graph theory, 2006-04, Vol.51 (4), p.269-280

2006

Volltextzugriff (PDF)

Popularity based random graph models leading to a scale-free degree sequence

Discrete mathematics, 2004-05, Vol.282 (1), p.53-68

2004

Volltextzugriff (PDF)

The length of random subsets of Boolean lattices

Random structures & algorithms, 2000-03, Vol.16 (2), p.177-194

2000

Volltextzugriff (PDF)

Forcing unbalanced complete bipartite minors

European journal of combinatorics, 2005, Vol.26 (1), p.75-81

2005

Volltextzugriff (PDF)

Large planar subgraphs in dense graphs

Journal of combinatorial theory. Series B, 2005-11, Vol.95 (2), p.263-282

2005

Volltextzugriff (PDF)

Minors in graphs of large girth

Random structures & algorithms, 2003-03, Vol.22 (2), p.213-225

2003

Volltextzugriff (PDF)

Improved Bounds for Topological Cliques in Graphs of Large Girth

SIAM journal on discrete mathematics, 2006-01, Vol.20 (1), p.62-78

2006

Volltextzugriff (PDF)

Extremal connectivity for topological cliques in bipartite graphs

Journal of combinatorial theory. Series B, 2006, Vol.96 (1), p.73-99

2006

Volltextzugriff (PDF)

Partitions of graphs with high minimum degree or connectivity

Journal of combinatorial theory. Series B, 2003-05, Vol.88 (1), p.29-43

2003

Volltextzugriff (PDF)

On random planar graphs, the number of planar graphs and their triangulations

Journal of combinatorial theory. Series B, 2003-05, Vol.88 (1), p.119-134

2003

Volltextzugriff (PDF)

Spanning triangulations in graphs

Journal of graph theory, 2005-07, Vol.49 (3), p.205-233

2005

Volltextzugriff (PDF)

Topological Minors in Graphs of Large Girth

Journal of combinatorial theory. Series B, 2002-11, Vol.86 (2), p.364-380

2002

Volltextzugriff (PDF)

Maximum Antichains in Random Subsets of a Finite Set

Journal of combinatorial theory. Series A, 2000-05, Vol.90 (2), p.336-346

Osthus, Deryk

2000

Volltextzugriff (PDF)

Four-cycles in graphs without a given even cycle

Journal of graph theory, 2005-02, Vol.48 (2), p.147-156

2005

Volltextzugriff (PDF)

Large Topological Cliques in Graphs Without a 4-Cycle

Combinatorics, probability & computing, 2004-01, Vol.13 (1), p.93-102, Article S0963548303005650

2004

Volltextzugriff (PDF)

The order of the largest complete minor in a random graph

Electronic notes in discrete mathematics, 2007-08, Vol.29, p.141-146

2007

Volltextzugriff (PDF)

Packings in Dense Regular Graphs

Combinatorics, probability & computing, 2005-05, Vol.14 (3), p.325-337

2005

Volltextzugriff (PDF)

Every Graph of Sufficiently Large Average Degree Contains a C 4 -Free Subgraph of Large Average Degree

Combinatorica (Budapest. 1981), 2004-01, Vol.24 (1), p.155-162

2004

Volltextzugriff (PDF)

En France : Une conscience linguistique ancienne et toujours vigoureuse malgré de graves menaces

Sprache und Sprachbewusstsein in Europa / Langues et conscience linguistique en Europe, 2014, Vol.10, p.135-140

2014

Volltextzugriff (PDF)

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Combinatorica (Budapest. 1981), 2003-01, Vol.23 (1), p.105-150

2003

Volltextzugriff (PDF)

Almost all graphs with high girth and suitable density have high chromatic number

Journal of graph theory, 2001-08, Vol.37 (4), p.220-226

2001

Volltextzugriff (PDF)

1 – 25 von 46

Menü

Weitere Dienste

Einstellungen

A Process-based Model with Temperature, Water, and Lab-derived Data Improves Predictions of Daily Culex pipiens/restuans Mosquito Density

On gauge repeatability and reproducibility studies for counts

Dynamic linear models for forecasting of radiation belt electrons and limitations on physical interpretation of predictive models

A Process-based Model with Temperature, Water, and Labderived Data Improves Predictions of Daily Culex pipiens/restuans Mosquito Density

Matchings in hypergraphs of large minimum degree

Popularity based random graph models leading to a scale-free degree sequence

The length of random subsets of Boolean lattices

Forcing unbalanced complete bipartite minors

Large planar subgraphs in dense graphs

Minors in graphs of large girth

Improved Bounds for Topological Cliques in Graphs of Large Girth

Extremal connectivity for topological cliques in bipartite graphs

Partitions of graphs with high minimum degree or connectivity

On random planar graphs, the number of planar graphs and their triangulations

Spanning triangulations in graphs

Topological Minors in Graphs of Large Girth

Maximum Antichains in Random Subsets of a Finite Set

Four-cycles in graphs without a given even cycle

Large Topological Cliques in Graphs Without a 4-Cycle

The order of the largest complete minor in a random graph

Packings in Dense Regular Graphs

Every Graph of Sufficiently Large Average Degree Contains a C 4 -Free Subgraph of Large Average Degree

En France : Une conscience linguistique ancienne et toujours vigoureuse malgré de graves menaces

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Almost all graphs with high girth and suitable density have high chromatic number

Suchergebnisse filtern