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

An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs

Mathematical programming, 2021, Vol.186 (1-2), p.409-437

2021

Volltextzugriff (PDF)

Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study

IEEE access, 2024, Vol.12, p.23725-23732

2024

Volltextzugriff (PDF)

An $${\mathcal {O}}(n^2 \log {n})$$ algorithm for the weighted stable set problem in claw-free graphs

Mathematical programming, 2021-03, Vol.186 (1-2), p.409-437

2021

Volltextzugriff (PDF)

An O(mlogn) algorithm for the weighted stable set problem in claw-free graphs with α(G)≤3

Mathematical programming, 2017-07, Vol.164 (1-2), p.157-165

2017

Volltextzugriff (PDF)

An O(m log n) algorithm for the weighted stable set problem in claw-free graphs with [alpha](G) [less-than or equal to] 3

Mathematical programming, 2017-07, Vol.164 (1-2), p.157

2017

Volltextzugriff (PDF)

An $$\mathcal{O}(m\log n)$$ O ( m log n ) algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$ α ( G ) ≤ 3

Mathematical programming, 2017-07, Vol.164 (1-2), p.157-165

2017

Volltextzugriff (PDF)

I contadi organizzati. Amministrazione e territorialità dei “comuni rurali” in quattro distretti lombardi (1210-1250 circa)

Reti medievali rivista, 2013-01, Vol.14 (1)

Paolo Gabriele Nobili

2013

Volltextzugriff (PDF)

Real-time energy consumption minimization in railway networks

Transportation research. Part D, Transport and environment, 2018-12, Vol.65, p.524-539

2018

Volltextzugriff (PDF)

An O(nm) algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4

Discrete optimization, 2016-02, Vol.19, p.63-78

2016

Volltextzugriff (PDF)

A reduction algorithm for the weighted stable set problem in claw-free graphs

Discrete Applied Mathematics, 2014-03, Vol.165, p.245-262

2014

Volltextzugriff (PDF)

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number

Graphs and combinatorics, 2015-09, Vol.31 (5), p.1649-1658

2015

Volltextzugriff (PDF)

An Early Diagnosis of Gastroepiploic Arterial Aneurysm during a Routine Abdominal Ultrasound Study

Case reports in gastrointestinal medicine, 2011-01, Vol.2011 (2011), p.1-2

2011

Volltextzugriff (PDF)

Energy Consumption Minimization Problem In A Railway Network

Transportation research procedia (Online), 2017, Vol.22 (22), p.85-94

2017

Volltextzugriff (PDF)

Early Experience with a Newly Developed Electrospun Polycarbonate-urethane Vascular Graft for Hemodialysis Access

The journal of vascular access, 2013-07, Vol.14 (3), p.252-256

2013

Volltextzugriff (PDF)

Marco Gentile et Pierre Savy (éd.), Noblesse et États princiers en Italie et en France au xv: Rome, École française de Rome, 2009, 434 p. (Collection de l’École française de Rome, 416)

Médiévales, 2011-12, Vol.61 (61), p.207-208

Nobili, Paolo Gabriele

2011

Volltextzugriff (PDF)

Minimum power multicasting problem in wireless networks

Mathematical methods of operations research (Heidelberg, Germany), 2008-10, Vol.68 (2), p.295-311

2008

Volltextzugriff (PDF)

Endograft infection following emergency repair for abdominal aortic aneurysm dissection and the undervalued role of the bowel reservoir

Surgical practice, 2013-02, Vol.17 (1), p.31-33

2013

Volltextzugriff (PDF)

Fiscalità signorile e comune rurale: Calusco d'Adda a inizio XIII secolo

Archivio storico italiano, 2010-01, Vol.168 (4 (626)), p.679-706

Nobili, Paolo Gabriele

2010

Volltextzugriff (PDF)

A MILP Algorithm for the Minimization of Train Delay and Energy Consumption

Optimization and Decision Science: Methodologies and Applications, p.485-493

Volltextzugriff (PDF)

Alle origini della fiscalità comunale : fodro, estimo e prestiti a Bergamo tra fi ne XII e metà XIII secolo

Reti medievali rivista, 2010, p.45-78

Nobili, Paolo Gabriele

2010

Volltextzugriff (PDF)

Optimal routing and resource allocation in multi-hop wireless networks

Optimization methods & software, 2008-08, Vol.23 (4), p.593-608

2008

Volltextzugriff (PDF)

A Lagrangian-based heuristic for large-scale set covering problems

Mathematical programming, 1998-04, Vol.81 (2), p.215-228

1998

Volltextzugriff (PDF)

Minimum power multicasting in wireless networks under probabilistic node failures

Computational optimization and applications, 2011-05, Vol.49 (1), p.193-212

2011

Volltextzugriff (PDF)

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem

Electronic notes in discrete mathematics, 2010-08, Vol.36, p.463-470

2010

Volltextzugriff (PDF)

Improved approximation of maximum vertex cover

Operations research letters, 2006, Vol.34 (1), p.77-84

2006

Volltextzugriff (PDF)

1 – 25 von 419

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(391)
Mit Volltextzugriff
(376)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs

Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study

An $${\mathcal {O}}(n^2 \log {n})$$ algorithm for the weighted stable set problem in claw-free graphs

An O(mlogn) algorithm for the weighted stable set problem in claw-free graphs with α(G)≤3

An O(m log n) algorithm for the weighted stable set problem in claw-free graphs with [alpha](G) [less-than or equal to] 3

An $$\mathcal{O}(m\log n)$$ O ( m log n ) algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$ α ( G ) ≤ 3

I contadi organizzati. Amministrazione e territorialità dei “comuni rurali” in quattro distretti lombardi (1210-1250 circa)

Real-time energy consumption minimization in railway networks

An O(nm) algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4

A reduction algorithm for the weighted stable set problem in claw-free graphs

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number

An Early Diagnosis of Gastroepiploic Arterial Aneurysm during a Routine Abdominal Ultrasound Study

Energy Consumption Minimization Problem In A Railway Network

Early Experience with a Newly Developed Electrospun Polycarbonate-urethane Vascular Graft for Hemodialysis Access

Marco Gentile et Pierre Savy (éd.), Noblesse et États princiers en Italie et en France au xv: Rome, École française de Rome, 2009, 434 p. (Collection de l’École française de Rome, 416)

Minimum power multicasting problem in wireless networks

Endograft infection following emergency repair for abdominal aortic aneurysm dissection and the undervalued role of the bowel reservoir

Fiscalità signorile e comune rurale: Calusco d'Adda a inizio XIII secolo

A MILP Algorithm for the Minimization of Train Delay and Energy Consumption

Alle origini della fiscalità comunale : fodro, estimo e prestiti a Bergamo tra fi ne XII e metà XIII secolo

Optimal routing and resource allocation in multi-hop wireless networks

A Lagrangian-based heuristic for large-scale set covering problems

Minimum power multicasting in wireless networks under probabilistic node failures

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem

Improved approximation of maximum vertex cover

Suchergebnisse filtern