C2 - Ed. Board
Real-valued multiple-instance learning with queries
An improved approximation algorithm for vertex cover with hard capacities
Bounded fixed-parameter tractability and log2n nondeterministic bits
The subsumption lattice and query learning
Sequential predictions based on algorithmic complexity
Minimizing maximum fiber requirement in optical networks
Optimal preemptive scheduling for general target functions
The many faces of a translation
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Papers to Appear
C4 - TOC