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 new algorithmic framework for basic problems on binary images

Discrete Applied Mathematics, 2017-01, Vol.216, p.376-392

2017

Volltextzugriff (PDF)

On balanced 4-holes in bichromatic point sets

Computational geometry : theory and applications, 2015-03, Vol.48 (3), p.169-179

2015

Volltextzugriff (PDF)

The class cover problem with boxes

Computational geometry : theory and applications, 2012-08, Vol.45 (7), p.294-304

2012

Volltextzugriff (PDF)

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model

IEEE transactions on parallel and distributed systems, 2009-07, Vol.20 (7), p.913-924

2009

Volltextzugriff (PDF)

Enumerating pseudo-triangulations in the plane

Computational geometry : theory and applications, 2005-03, Vol.30 (3), p.207-222

Bereg, Sergey

2005

Volltextzugriff (PDF)

On the coarseness of bicolored point sets

Computational geometry : theory and applications, 2013-01, Vol.46 (1), p.65-77

2013

Volltextzugriff (PDF)

EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE

International journal of computational geometry & applications, 2014-09, Vol.24 (3), p.247-258

2014

Volltextzugriff (PDF)

CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS

International journal of computational geometry & applications, 2014-09, Vol.24 (3), p.183-196

2014

Volltextzugriff (PDF)

The Maximum Box Problem for moving points in the plane

Journal of combinatorial optimization, 2011-11, Vol.22 (4), p.517-530

2011

Volltextzugriff (PDF)

Phylogenetic Networks Based on the Molecular Clock Hypothesis

IEEE/ACM transactions on computational biology and bioinformatics, 2007-10, Vol.4 (4), p.661-667

2007

Volltextzugriff (PDF)

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

Frontiers in Algorithmics, 2016, Vol.9711, p.215-226

2016

Volltextzugriff (PDF)

Optimal placement of base stations in border surveillance using limited capacity drones

Theoretical computer science, 2022-09, Vol.928, p.183-196

2022

Volltextzugriff (PDF)

99mTechnetium-based Prostate-specific Membrane Antigen–radioguided Surgery in Recurrent Prostate Cancer

European urology, 2019-04, Vol.75 (4), p.659-666

2019

Volltextzugriff (PDF)

Equipartitions of Measures by 2-Fans

Discrete & computational geometry, 2005-07, Vol.34 (1), p.87-96

Bereg, Sergey

2005

Volltextzugriff (PDF)

SU‐E‐J‐23: An Accurate Algorithm to Match Imperfectly Matched Images for Lung Tumor Detection Without Markers

Medical physics (Lancaster), 2014-06, Vol.41 (6Part6), p.159-159

2014

Volltextzugriff (PDF)

Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

Discrete and Computational Geometry, 2005, p.29-36

2005

Volltextzugriff (PDF)

Optimizing Phylogenetic Networks for Circular Split Systems

IEEE/ACM transactions on computational biology and bioinformatics, 2012-03, Vol.9 (2), p.535-547

2012

Volltextzugriff (PDF)

Equipartitions of Measures by 2-Fans

Algorithms and Computation, 2004, p.149-158

2004

Volltextzugriff (PDF)

TH‐E‐17A‐10: Markerless Lung Tumor Tracking Based On Beams Eye View EPID Images

Medical physics (Lancaster), 2014-06, Vol.41 (6Part33), p.574-574

2014

Volltextzugriff (PDF)

TH-AB-202-01: Daily Lung Tumor Motion Characterization On EPIDs Using a Markerless Tiling Model

Medical physics (Lancaster), 2016-06, Vol.43 (6), p.3856-3856

2016

Volltextzugriff (PDF)

Genomic Scaffold Filling: A Progress Report

Frontiers in Algorithmics, 2016, Vol.9711, p.8-16

2016

Volltextzugriff (PDF)

Transforming pseudo-triangulations

Information processing letters, 2004-05, Vol.90 (3), p.141-145

Bereg, Sergey

2004

Volltextzugriff (PDF)

Approximating metrics with planar boundary-labeled phylogenetic networks

Journal of bioinformatics and computational biology, 2012-12, Vol.10 (6), p.1250017

2012

Volltextzugriff (PDF)

Guarding Orthogonal Galleries with Rectangular Rooms

Computer journal, 2014-11, Vol.57 (11), p.1668-1673

2014

Volltextzugriff (PDF)

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

Frontiers in Algorithmics, 2016, Vol.9711, p.92-101

2016

Volltextzugriff (PDF)

1 – 25 von 200

Menü

Weitere Dienste

Einstellungen

A new algorithmic framework for basic problems on binary images

On balanced 4-holes in bichromatic point sets

The class cover problem with boxes

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model

Enumerating pseudo-triangulations in the plane

On the coarseness of bicolored point sets

EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE

CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS

The Maximum Box Problem for moving points in the plane

Phylogenetic Networks Based on the Molecular Clock Hypothesis

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

Optimal placement of base stations in border surveillance using limited capacity drones

99mTechnetium-based Prostate-specific Membrane Antigen–radioguided Surgery in Recurrent Prostate Cancer

Equipartitions of Measures by 2-Fans

SU‐E‐J‐23: An Accurate Algorithm to Match Imperfectly Matched Images for Lung Tumor Detection Without Markers

Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

Optimizing Phylogenetic Networks for Circular Split Systems

Equipartitions of Measures by 2-Fans

TH‐E‐17A‐10: Markerless Lung Tumor Tracking Based On Beams Eye View EPID Images

TH-AB-202-01: Daily Lung Tumor Motion Characterization On EPIDs Using a Markerless Tiling Model

Genomic Scaffold Filling: A Progress Report

Transforming pseudo-triangulations

Approximating metrics with planar boundary-labeled phylogenetic networks

Guarding Orthogonal Galleries with Rectangular Rooms

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

Aktive Filter

Suchergebnisse filtern