The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...

In visual search for a conjunction it is much more difficult to search for the conjunction of 2 colors or 2 orientations than for Color x Orientation or Color x Shape conjunctions. The result is not limited to particular colors or shapes. Two colors cannot occupy the same spatial location in Color x Color searches. However, Experiments 6 and 7 show that Color x Shape searches remain efficient e...

The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...

We are proposing MOnDrianULOR, a system capable of producing visual forms based on the works of Swiss architect Le Corbusier and Dutch artist Piet Mondrian. The system produces visual forms that employ a rectangular harmonic division of the plane based on Le Corbusier’s Modulor principles and a coloring scheme that may use only primary colors so as to produce the strongest visual effect, as Mon...

In their recent editorial, Baltussen and colleagues provide a concise summary of the prevailing discourse on priority-setting in health policy. Their perspective is entirely consistent with current practice, yet they unintentionally demonstrate the narrowness and moral precariousness of that discourse and practice. I respond with demonstrations of the importance of ‘interrogating scarcity’ in a...

This paper studies the tricolorations of edges of triangulations of simply connected orientable surfaces such that the degree of each interior vertex is even. Using previous results on lozenge tilings, we give a linear algorithm of coloration for triangulations of the sphere, or of planar regions with the constraint that the boundary is monochromatic. We define a flip as a shift of colors on a ...