C2 - Ed. Board
A refined search tree technique for Dominating Set on planar graphs
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
Measuring nondeterminism in pushdown automata
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
An optimal self-stabilizing strarvation-free alternator
Approximation algorithms for covering/packing integer programs
An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
Bounds on the OBDD-size of integer multiplication via universal hashing
On the verification of finite failure
Papers to Appear
C4 - TOC