UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 305

Sortiert nach

Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover

Algorithms and Computation, p.467-478

Link zum Volltext

Verfügbarkeit prüfen

An Efficient Method for Indexing All Topological Orders of a Directed Graph

Algorithms and Computation, p.103-114

Link zum Volltext

Verfügbarkeit prüfen

Polynomial-Time Algorithm for Sliding Tokens on Trees

Algorithms and Computation, 2014, p.389-400

2014

Link zum Volltext

Verfügbarkeit prüfen

The Generalized Popular Condensation Problem

Algorithms and Computation, p.606-617

Link zum Volltext

Verfügbarkeit prüfen

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Algorithms and Computation, p.208-219

Link zum Volltext

Verfügbarkeit prüfen

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

Algorithms and Computation, p.285-297

Link zum Volltext

Verfügbarkeit prüfen

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

Algorithms and Computation, p.94-102

Link zum Volltext

Verfügbarkeit prüfen

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries

Algorithms and Computation, p.128-140

Link zum Volltext

Verfügbarkeit prüfen

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

Algorithms and Computation, p.686-697

Link zum Volltext

Verfügbarkeit prüfen

Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography

Algorithms and Computation, p.365-375

Link zum Volltext

Verfügbarkeit prüfen

An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves

Algorithms and Computation, p.491-503

Link zum Volltext

Verfügbarkeit prüfen

Throughput Maximization in Multiprocessor Speed-Scaling

Algorithms and Computation, p.247-258

Link zum Volltext

Verfügbarkeit prüfen

Approximation Algorithms Inspired by Kernelization Methods

Algorithms and Computation, p.479-490

Link zum Volltext

Verfügbarkeit prüfen

Speed-Scaling with No Preemptions

Algorithms and Computation, p.259-269

Link zum Volltext

Verfügbarkeit prüfen

Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs

Algorithms and Computation, p.429-440

Link zum Volltext

Verfügbarkeit prüfen

Prognostic significance of cachexia score assessed by CT in male patients with small cell lung cancer

European journal of cancer care, 2018-01, Vol.27 (1), p.e12695-n/a

2018

Link zum Volltext

Verfügbarkeit prüfen

An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem

Algorithms and Computation, p.353-364

Link zum Volltext

Verfügbarkeit prüfen

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes

Algorithms and Computation, p.543-552

Link zum Volltext

Verfügbarkeit prüfen

A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams

Algorithms and Computation, p.27-37

Link zum Volltext

Verfügbarkeit prüfen

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

Algorithms and Computation, p.81-93

Link zum Volltext

Verfügbarkeit prüfen

Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties

Algorithms and Computation, p.646-657

Link zum Volltext

Verfügbarkeit prüfen

Efficiently Correcting Matrix Products

25th International Symposium on Algorithms and Computation (ISAAC), 2014,Jeonju, Korea, Republic of,2014-12-15 - 2014-12-17, 2014, Vol.8889, p.53-64

2014

Link zum Volltext

Verfügbarkeit prüfen

Linear-Time Algorithms for Proportional Apportionment

Algorithms and Computation, p.581-592

Link zum Volltext

Verfügbarkeit prüfen

Planar Matchings for Weighted Straight Skeletons

Algorithms and Computation, p.117-127

Link zum Volltext

Verfügbarkeit prüfen

Vertex Cover Reconfiguration and Beyond

Algorithms and Computation, p.452-463

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 305

Suche als RSS-Feed

Aktive Filter

KollektionElectronic Journals Library - Freely accessible e-journals

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(270)
Mit Volltextzugriff
(288)

Publikationsform

Sprache

Englisch
(305)
Japanisch
(56)
Deutsch
(1)

Erscheinungsjahr

n.n

Thema

Science & Technology
(301)
Technology
(169)
Physical Sciences
(161)
Life Sciences & Biomedicine
(95)
Exact Sciences And Technology
(80)
Computer Science
(74)
Physics
(61)
Humans
(60)
Biological And Medical Sciences
(57)
Computer Science, Theory & Methods
(57)
Applied Sciences
(56)
Materials Science
(54)
Mathematics
(53)
Materials Science, Multidisciplinary
(48)
Medical Sciences
(47)
Engineering
(46)
Chemistry
(44)
Female
(38)
Physics, Applied
(38)
Male
(31)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover

An Efficient Method for Indexing All Topological Orders of a Directed Graph

Polynomial-Time Algorithm for Sliding Tokens on Trees

The Generalized Popular Condensation Problem

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography

An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves

Throughput Maximization in Multiprocessor Speed-Scaling

Approximation Algorithms Inspired by Kernelization Methods

Speed-Scaling with No Preemptions

Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs

Prognostic significance of cachexia score assessed by CT in male patients with small cell lung cancer

An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes

A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties

Efficiently Correcting Matrix Products

Linear-Time Algorithms for Proportional Apportionment

Planar Matchings for Weighted Straight Skeletons

Vertex Cover Reconfiguration and Beyond

Aktive Filter

Suchergebnisse filtern