For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...