On some optimization problems for star-free graphs
On Sorting by Bounded Block Interchanges
On symmetric sandpiles
On the Accepting Power of 2-Tape Büchi Automata
On the Algorithmic Nature of the World
On the Applicability of Post's Lattice
On the approximability of minmax (regret) network optimization problems
On the approximability of robust spanning tree problems
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results
On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata
On the Certification of the Restricted Isometry Property
On the circuit-size of inverses
On the communication complexity of XOR functions
On the completeness of quantum computation models
On the Complexity of a Derivative Chess Problem
On the complexity of curve fitting algorithms
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
On the Complexity of Edge Packing and Vertex Packing
On the Complexity of Elementary Modal Logics