On the Footsteps to Generalized Tower of Hanoi Strategy
On the gap between ess(f) and cnf_size(f)
On the growth of components with non fixed excesses
On the Hamming Distance between base-n representations of whole numbers
On the independence polynomial of an antiregular graph
On the Intersection of All Critical Sets of a Unicyclic Graph
On the kernelization of ranking r-CSP in tournaments
On the length of attractors in boolean networks with an interaction graph by layers
On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
On the maximal sum of exponents of runs in a string
On the Minimum Size of a Contraction-Universal Tree
On the Minimum Spanning Tree for Directed Graphs with Potential Weights
On the number of $k$-cycles in the assignment problem for random matrices
On the number of solutions of the discretizable molecular distance geometry problem
On the number of t-ary trees with a given path length
On the Obfuscation Complexity of Planar Graphs
On the perfect matching index of bridgeless cubic graphs
On the poset of computation rules for nonassociative calculus
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
On the Ramsey Numbers for Bipartite Multigraphs