Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

Interval graphs represent vertices as intervals on the real line, with edges denoting
overlapping intervals, while proper interval graphs prevent one interval from being fully …

We consider the following problem of scheduling with conflicts (swc): Find a minimum
makespan schedule on identical machines where conflicting jobs cannot be scheduled …

We consider the offline and online versions of a bin packing problem called bin packing with
conflicts. Given a set of items V={1,2,\dots,n\} with sizes s_1,s_2,\dots,s_n∈0,1 and a conflict …

We consider an extension of classic parallel machine scheduling where a set of jobs is
scheduled on identical parallel machines and an undirected conflict graph is part of the …

The partition problem of a given graph into three independent sets of minimizing the
maximum one is studied in this paper. This problem is NP-hard, even restricted to bipartite …

In this work, we study the production scheduling of a real world assembly problem present in
the aeronautical industry. Parts of aircrafts should be produced on fixtures, which are …

The p-center problem is to locate p facilities in a network of n demand points so as to
minimize the longest distance between a demand point and its nearest facility. We consider …

Dynamics is an inherent feature of many real life systems so it is natural to define and
investigate the properties of models that reflect their dynamic nature. Dynamic graph …

This paper deals with the p-maxian problem on interval graphs where each interval has a
positive weight. First we propose a linear time algorithm which is similar to the algorithm of …