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

Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm

Algorithm Engineering and Experimentation, 1999, p.286-299

1999

Volltextzugriff (PDF)

Short trees in polygons

Discrete Applied Mathematics, 2002-09, Vol.118 (1), p.55-72

2002

Volltextzugriff (PDF)

Reductions for the rectilinear steiner tree problem

Networks, 1995-12, Vol.26 (4), p.187-198

Winter, Pawel

1995

Volltextzugriff (PDF)

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

Computational geometry : theory and applications, 2004-11, Vol.29 (3), p.251-263

2004

Volltextzugriff (PDF)

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

Algorithms - ESA 2002, 2002, Vol.2461, p.760-772

2002

Volltextzugriff (PDF)

On the location of Steiner points in uniformly-oriented Steiner trees

Information processing letters, 2002-09, Vol.83 (5), p.237-241

2002

Volltextzugriff (PDF)

An algorithm for the steiner problem in the euclidean plane

Networks, 1985, Vol.15 (3), p.323-345

Winter, Pawel

1985

Volltextzugriff (PDF)

Topological network synthesis

Combinatorial Optimization, 2006, p.282-303

2006

Volltextzugriff (PDF)

Path-distance heuristics for the Steiner problem in undirected networks

Algorithmica, 1992-06, Vol.7 (1-6), p.309-327

1992

Volltextzugriff (PDF)

Steiner problem in Halin networks

Discrete Applied Mathematics, 1987-06, Vol.17 (3), p.281-294

Winter, Pawel

1987

Volltextzugriff (PDF)

Steiner minimal trees for three points with one convex polygonal obstacle

Annals of operations research, 1991-07, Vol.33 (7), p.577-599

1991

Volltextzugriff (PDF)

Generalized steiner problem in series-parallel networks

Journal of algorithms, 1986-12, Vol.7 (4), p.549-566

Winter, Pawel

1986

Volltextzugriff (PDF)

Plane embeddings of 2-trees and biconnected partial 2-trees

SIAM journal on discrete mathematics, 1996-11, Vol.9 (4), p.577-596

1996

Volltextzugriff (PDF)

Generalized Steiner problem in outerplanar networks

BIT, 1985-09, Vol.25 (3), p.485-496

WINTER, P

1985

Volltextzugriff (PDF)

Distance-Based Classification Methods

INFOR. Information systems and operational research, 1999-08, Vol.37 (3), p.337-352

1999

Volltextzugriff (PDF)

An algorithm for the enumeration of spanning trees

BIT, 1986-03, Vol.26 (1), p.44-62

WINTER, P

1986

Volltextzugriff (PDF)

Protein Packing Quality Using Delaunay Complexes

2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011, p.117-122

2011

Volltextzugriff (PDF)

A new paradigm for general architecture routing

Great Lakes Symposium on VLSI: Proceedings of the 14th ACM Great Lakes symposium on VLSI; 26-28 Apr. 2004, 2004, p.202-207

2004

Volltextzugriff (PDF)

Alpha Shapes and Proteins

2009 Sixth International Symposium on Voronoi Diagrams, 2009, p.217-224

2009

Volltextzugriff (PDF)

Maximal outerplanar graphs with perfect face-independent vertex covers

Discrete Applied Mathematics, 1994-10, Vol.54 (2), p.267-280

1994

Volltextzugriff (PDF)

In-trees and plane embeddings of outerplanar graphs

BIT, 1990-03, Vol.30 (1), p.83-90

1990

Volltextzugriff (PDF)

Exact solutions to large-scale plane Steiner tree problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 1999, p.979-980

1999

Volltextzugriff (PDF)

Engineered cortical microcircuits for investigations of neuroplasticity

Lab on a chip, 2024-10, Vol.24 (21), p.4974-4988

2024

Volltextzugriff (PDF)

Independent covers in outerplanar graphs

SWAT 88, 1988, p.243-254

1988

Volltextzugriff (PDF)

26 – 50 von 99

Menü

Weitere Dienste

Einstellungen

Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm

Short trees in polygons

Reductions for the rectilinear steiner tree problem

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

On the location of Steiner points in uniformly-oriented Steiner trees

An algorithm for the steiner problem in the euclidean plane

Topological network synthesis

Path-distance heuristics for the Steiner problem in undirected networks

Steiner problem in Halin networks

Steiner minimal trees for three points with one convex polygonal obstacle

Generalized steiner problem in series-parallel networks

Plane embeddings of 2-trees and biconnected partial 2-trees

Generalized Steiner problem in outerplanar networks

Distance-Based Classification Methods

An algorithm for the enumeration of spanning trees

Protein Packing Quality Using Delaunay Complexes

A new paradigm for general architecture routing

Alpha Shapes and Proteins

Maximal outerplanar graphs with perfect face-independent vertex covers

In-trees and plane embeddings of outerplanar graphs

Exact solutions to large-scale plane Steiner tree problems

Therapeutic Drug Monitoring of Tacrolimus-Personalized Therapy: Second Consensus Report

Engineered cortical microcircuits for investigations of neuroplasticity

Independent covers in outerplanar graphs

Suchergebnisse filtern