A note on interval edge-colorings of graphs
A note on minimal matching covered graphs
A note on Prüfer-like coding and counting forests of uniform hypertrees
A Note on Solid Coloring of Pure Simplicial Complexes
A note on the hardness of graph diameter augmentation problems
A Note on the Middle Levels Conjecture
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
A note on triangle-free graphs
A note on uniform power connectivity in the SINR model
A note on upper bounds for the maximum span in interval edge colorings of graphs
A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem
A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem
A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields
A Partial Order on Bipartite Graphs with n Vertices
A polyhedral approach for the Equitable Coloring Problem
A polynomial 3-colorability algorithm with automatic generation of NO 3-colorability (i.e. Co-NP) short proofs
A Polynomial Diophantine Generator Function for Integer Residuals
A Polynomial Kernel For Multicut In Trees
A Polynomial Time Algorithm for The Traveling Salesman Problem
A Primal Dual Algorithm for a Heterogeneous Traveling Salesman Problem