On Touching Triangle Graphs
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
On two variations of identifying codes
On uniform sampling simple directed graph realizations of degree sequences
On upper bounds for parameters related to construction of special maximum matchings
On variables with few occurrences in conjunctive normal forms
On z-factorization and c-factorization of standard episturmian words
On-line Chain Partitions of Up-growing Semi-orders
One Dimensional p-adic Integral Value Transformations
Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
Optimal antithickenings of claw-free trigraphs
Optimal Base Encodings for Pseudo-Boolean Constraints
Optimal bounds for monotonicity and Lipschitz testing over the hypercube
Optimal Constructions of Hybrid Algorithms
Optimal Interdiction of Unreactive Markovian Evaders
Optimal k-fold colorings of webs and antiwebs
Optimal Partial Tiling of Manhattan Polyominoes
Optimal Per-Edge Processing Times in the Semi-Streaming Model
Optimized on-line computation of PageRank algorithm
Optimizing diversity