32 that a canonical ordering or a 4-connected triangular planar graph is possible, in which every vertex v k has out(v k) 2, which decreases the width of a visibility representation by a factor 2.â€¦ (More)

We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area.â€¦ (More)

In this paper we consider the problem of decomposing an integer matrix into a weighted sum of binary matrices that have the strict consecutive ones property. This problem is motivated by anâ€¦ (More)

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machineâ€¦ (More)

Woeginger, G.J., On-line scheduling of jobs with fixed start and end times, Theoretical Computer Science 130 (1994) 5516. We investigate an on-line scheduling problem on a single machine where jobsâ€¦ (More)

Given three n-element sequences a i ; b i and c i of nonnega-tive real numbers, the aim is to nd two permutations and such that the sum P n i=1 a i b (i) c (i) is minimized (maximized, respectively).â€¦ (More)