On the Complexity of Binary Samples
On the Complexity of Connected (s, t)-Vertex Separator
On the complexity of finding a sun in a graph
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
On the Complexity of Rearrangement Problems under the Breakpoint Distance
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments
On the concentration of the number of solutions of random satisfiability formulas
On the Configuration-LP for Scheduling on Unrelated Machines
On the Core of a Unicyclic Graph
On the cubicity of AT-free graphs and circular-arc graphs
On the cubicity of bipartite graphs
On the d-complexity of strings
On the decidability of semigroup freeness
On the dynamics of Social Balance on general networks (with an application to XOR-SAT)
On the enumerating series of an abstract numeration system
On the Equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$ (Extended Version)
On the equivalence between hierarchical segmentations and ultrametric watersheds
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
On the Extension of Pseudo-Boolean Functions for the Aggregation of Interacting Criteria