This paper focuses on socio-emotional processes in order to understand how geographic dispersion could influence the quality of relationships, job satisfaction, and affective commitment of workers in a team context. In particular, we assume that geographic dispersion of team members affects Team-Member Exchange (TMX) which, in turn, affects their job satisfaction and affective commitment. A sur...

We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We show that for every k, the satisfiability above average of ordering CSPs of arity at most k is fixed-parameter tractable.

We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic framework.

We consider the problem of partitioning the vertices of a graph with maximum degree d into k classes V1, . . . , Vk of almost equal sizes in a way that minimizes the number of pairs (i, j) such that there is an edge between Vi and Vj . We show that there is always such a partition with O(k2−2/d) adjacent pairs and this bound is tight. This problem is related to questions about the depth of cert...

Dealing with spatial and temporal knowledge is an indispensable part of almost all aspects of human activity. The qualitative approach to spatial and temporal reasoning, known as Qualitative Spatial and Temporal Reasoning (QSTR), typically represents spatial/temporal knowledge in terms of qualitative relations (e.g., to the east of, after), and reasons with spatial/temporal knowledge by solving...

Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. In ...

A Boolean function f : {0, 1} → {0, 1} is called a dictator if it depends on exactly one variable i.e f(x1, x2, . . . , xn) = xi for some i ∈ [n]. In this work, we study a k-query dictatorship test. Dictatorship tests are central in proving many hardness results for constraint satisfaction problems. The dictatorship test is said to have perfect completeness if it accepts any dictator function. ...

We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping between different solutions of the same problem. We argue that we may be able to exploit both types of symmetry when finding solutions. We illustrate the potential of exploiting internal symmetries on two benchmark doma...

The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in geometric constraint satisfaction problems (GCSPs). However, it may fail even on simple GCSPs because it does not take geometric properties into account. In this paper, we question the flow-based algorithm used by Hoffm...