BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family wit...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...