JCSS
2010
13 years 9 months ago
2010
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks ...
JCSS
2010
13 years 9 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
JCSS
2010
13 years 9 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
JCSS
2010
13 years 9 months ago
2010
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in...
JCSS
2010
13 years 9 months ago
2010
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
JCSS
2010
13 years 9 months ago
2010
JCSS
2010
13 years 9 months ago
2010
JCSS
2010
13 years 9 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
JCSS
2010
13 years 9 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
JCSS
2010
13 years 9 months ago
2010