We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

In this paper, we propose to use vehicular ad hoc networks (VANETs) to collect and
aggregate real-time speed and position information on individual vehicles to optimize signal …

Hadron pair production γ* γ→ hh in the region where the cm energy is much smaller than
the photon virtuality can be described in a factorized form, as the convolution of a partonic …

This paper studies an optimization problem that arises in the context of distributed resource
allocation: Given a conflict graph that represents the competition of processors over …

In this paper we consider the following bin packing problem with conflicts. Given a set of
items V= 1,..., n with sizes s 1,..., s∈(0, 1) and a conflict graph G=(V, E), we consider the …

In this paper we consider the following time constrained scheduling problem. Given a set of
jobsJwith execution timese (j)∈(0, 1] and an undirected graphG=(J, E), we consider the …

LAB (Linear Alkyl Benzene) isomers were obtained by the alkylation of benzene with 1-
dodecene over FAU, BEA and EMT zeolites in the presence of decane as solvent. The initial …

A proper coloring of a graph G is equitable if the sizes of any two color classes differ by at
most one. A proper coloring is ℓ-bounded, when each color class has size at most ℓ. We …

The transactional approach to contention management guarantees atomicity by making sure
that whenever two transactions have a conflict on a resource, only one of them proceeds. A …

In this paper, we consider the mutual exclusion scheduling problem for comparability
graphs. Given an undirected graph G and a fixed constant m, the problem is to find a …