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

Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles

Computers & operations research, 2024-04, Vol.164, p.106529, Article 106529

2024

Volltextzugriff (PDF)

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs

Theoretical computer science, 2019-02, Vol.761, p.78-88

2019

Volltextzugriff (PDF)

Approximate ridesharing of personal vehicles problem

Theoretical computer science, 2021-06, Vol.871, p.30-50

2021

Volltextzugriff (PDF)

Algorithmic Analysis for Ridesharing of Personal Vehicles

Combinatorial Optimization and Applications, p.438-452

Volltextzugriff (PDF)

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

Discrete Applied Mathematics, 2019-03, Vol.257, p.186-205

2019

Volltextzugriff (PDF)

Algorithmic analysis for ridesharing of personal vehicles

Theoretical computer science, 2018-11, Vol.749, p.36-46

2018

Volltextzugriff (PDF)

Efficient algorithms for ridesharing of personal vehicles

Theoretical computer science, 2019-10, Vol.788, p.79-94

2019

Volltextzugriff (PDF)

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time

Algorithms and Computation, p.984-993

Volltextzugriff (PDF)

Efficient Algorithms for Ridesharing of Personal Vehicles

Combinatorial Optimization and Applications, p.340-354

Volltextzugriff (PDF)

Computational Study on a PTAS for Planar Dominating Set Problem

Algorithms, 2013-03, Vol.6 (1), p.43-59

2013

Volltextzugriff (PDF)

Practical algorithms for branch-decompositions of planar graphs

Discrete Applied Mathematics, 2016-01, Vol.199, p.156-171

2016

Volltextzugriff (PDF)

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

Algorithmica, 2012-11, Vol.64 (3), p.416-453

2012

Volltextzugriff (PDF)

Algorithms for the Ridesharing with Profit Constraint Problem

Combinatorial Optimization and Applications, p.366-379

Volltextzugriff (PDF)

Wavelength assignment in multifiber star networks

Networks, 2010-08, Vol.56 (1), p.30-38

2010

Volltextzugriff (PDF)

New analysis and computational study for the planar connected dominating set problem

Journal of combinatorial optimization, 2016-07, Vol.32 (1), p.198-225

2016

Volltextzugriff (PDF)

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O ( n 1 + ϵ ) time

Theoretical computer science, 2011-07, Vol.412 (32), p.4100-4109

2011

Volltextzugriff (PDF)

Carving-decomposition based algorithms for the maximum path coloring problem

2012 IEEE International Conference on Communications (ICC), 2012, p.2977-2982

2012

Volltextzugriff (PDF)

Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths

Networks, 2009-05, Vol.53 (3), p.276-286

2009

Volltextzugriff (PDF)

An Efficient Oracle for Counting Shortest Paths in Planar Graphs

Algorithmic Aspects in Information and Management, p.406-417

Volltextzugriff (PDF)

Efficient algorithms for minimum congestion hypergraph embedding in a cycle

IEEE transactions on parallel and distributed systems, 2006-03, Vol.17 (3), p.205-214

2006

Volltextzugriff (PDF)

Multihop all-to-all broadcast on WDM optical networks

IEEE transactions on parallel and distributed systems, 2003-05, Vol.14 (5), p.477-486

2003

Volltextzugriff (PDF)

A 2-approximation algorithm for genome rearrangements by reversals and transpositions

Theoretical computer science, 1999-01, Vol.210 (2), p.327-339

1999

Volltextzugriff (PDF)

Optimal branch-decomposition of planar graphs in O ( n 3 ) Time

ACM transactions on algorithms, 2008-06, Vol.4 (3), p.1-13

2008

Volltextzugriff (PDF)

A Practical Algorithm for Embedding Graphs on Torus

International Journal of Networking and Computing, 2016, Vol.6(2), pp.149-166

2016

Volltextzugriff (PDF)

Efficacy of Nimotuzumab Combined with Docetaxel–Cisplatin–Fluorouracil Regimen in Treatment of Advanced Oral Carcinoma

Cell biochemistry and biophysics, 2014, Vol.68 (1), p.181-184

2014

Volltextzugriff (PDF)

1 – 25 von 139

Menü

Weitere Dienste

Einstellungen

Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles

Constant query time (1 + ϵ)-approximate distance oracle for planar graphs

Approximate ridesharing of personal vehicles problem

Algorithmic Analysis for Ridesharing of Personal Vehicles

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

Algorithmic analysis for ridesharing of personal vehicles

Efficient algorithms for ridesharing of personal vehicles

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time

Efficient Algorithms for Ridesharing of Personal Vehicles

Computational Study on a PTAS for Planar Dominating Set Problem

Practical algorithms for branch-decompositions of planar graphs

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

Algorithms for the Ridesharing with Profit Constraint Problem

Wavelength assignment in multifiber star networks

New analysis and computational study for the planar connected dominating set problem

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O ( n 1 + ϵ ) time

Carving-decomposition based algorithms for the maximum path coloring problem

Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths

An Efficient Oracle for Counting Shortest Paths in Planar Graphs

Efficient algorithms for minimum congestion hypergraph embedding in a cycle

Multihop all-to-all broadcast on WDM optical networks

A 2-approximation algorithm for genome rearrangements by reversals and transpositions

Optimal branch-decomposition of planar graphs in O ( n 3 ) Time

A Practical Algorithm for Embedding Graphs on Torus

Efficacy of Nimotuzumab Combined with Docetaxel–Cisplatin–Fluorouracil Regimen in Treatment of Advanced Oral Carcinoma

Suchergebnisse filtern