Year of publication
Type of material
Licence
Language
1–20 of 1,067 hits
Sort by:
Sort by:
-
Polynomial time algorithms and extended formulations for unit commitment problems
Taylor & Francis Verlag | 2018|Keywords: polynomial-time algorithm -
Single-machine scheduling with a variable maintenance activity
Elsevier | 2014|Keywords: Polynomial-time algorithm -
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Elsevier | 2008|Keywords: Polynomial-time algorithm -
Vertex coloring of graphs with few obstructions
Elsevier | 2015|Keywords: Polynomial-time algorithm -
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
Elsevier | 2015|Keywords: Polynomial-time algorithm -
A polynomial time algorithm for the triangle packing problem on interval graphs
Elsevier | 2023|Keywords: Polynomial time algorithm -
Sparse regular induced subgraphs in -free graphs
Elsevier | 2013|Keywords: Polynomial-time algorithm -
Several single-machine scheduling problems with general learning effects
Elsevier | 2012|Keywords: Polynomial time algorithm -
The Directed Disjoint Shortest Paths Problem
Free accessDataCite | 2017|Keywords: polynomial time algorithm -
Two complexity results for the vertex coloring problem
Elsevier | 2016|Keywords: Polynomial-time algorithm -
An improved algorithm for single-unit commitment with ramping limits
Free accessBASE | 2021|Keywords: Polynomial-time algorithm -
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Elsevier | 2012|Keywords: Polynomial-time algorithm -
On minimizing dataset transfer time in an acyclic network with four servers
Online Contents | 2016|Keywords: polynomial time algorithm -
An improved algorithm for single-unit commitment with ramping limits
Elsevier | 2020|Keywords: Polynomial-time algorithm, -
On the maximum independent set problem in subclasses of subcubic graphs
Elsevier | 2014|Keywords: Polynomial-time algorithm -
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Elsevier | 2016|Keywords: Polynomial time algorithm -
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
Elsevier | 2015|Keywords: Polynomial-time algorithm
Send my search to (beta)
Send your search query (search terms without filters) to other databases, portals and catalogues to find more interesting hits.
Dimensions:
full data search
or
title and abstract search
Dimensions is a database for abstracts and citations that links information on research funding with the resulting publications, studies and patents.
TIB AV portal
In the TIB AV-Portal, audiovisual media from science and teaching can be foundand own scientific videos can be published.
Specialised Information Service for Mobility and Transport Research (FID move)
Open Research Knowledge Graph (ORKG)
The FID move can be used to search for subject-specific literature, research data and other information from mobility and transport research.
The Open Research Knowledge Graph provides structured descriptions of research content and makes it comparable.
Common Union Catalogue (GVK)
Freely accessible part of the collaborative K10plus catalogue with materials relevant for interlibrary loan and direct delivery services.