On a bijective proof of a factorization formula for Macdonald polynomials Fulltext Access 8 Pages 2012
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems Fulltext Access 8 Pages 2012
On the enumeration of rooted trees with fixed size of maximal decreasing trees Fulltext Access 8 Pages 2012
On Ladnerʼs result for a class of real machines with restricted use of constants Fulltext Access 8 Pages 2012
Derivative polynomials and enumeration of permutations by number of interior and left peaks Fulltext Access 8 Pages 2012
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees Fulltext Access 9 Pages 2012
Global defensive alliances of trees and Cartesian product of paths and cycles Fulltext Access 9 Pages 2012
Checking Compatibility of Bit Sizes in Floating Point Comparison Operations Fulltext Access 9 Pages 2012
On minimal vertex separators of dually chordal graphs: Properties and characterizations Fulltext Access 9 Pages 2012
Vertex and edge Padmakar–Ivan indices of the generalized hierarchical product of graphs Fulltext Access 9 Pages 2012
Hypergraphs with large domination number and with edge sizes at least three Fulltext Access 9 Pages 2012
Scheduling an unbounded batching machine with job processing time compatibilities Fulltext Access 9 Pages 2012
Extended dynamic subgraph statistics using h-index parameterized data structures Fulltext Access 9 Pages 2012
LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth Fulltext Access 9 Pages 2012
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs Fulltext Access 9 Pages 2012
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs Fulltext Access 9 Pages 2012
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism Fulltext Access 9 Pages 2012
Fast algorithms for computing the constrained LCS of run-length encoded strings Fulltext Access 9 Pages 2012
Robust optimization of graph partitioning involving interval uncertainty Fulltext Access 9 Pages 2012
An O(m(m+nlogn)log(nC))-time algorithm to solve the minimum cost tension problem Fulltext Access 9 Pages 2012
Categorial grammars with iterated types form a strict hierarchy of k-valued languages Fulltext Access 9 Pages 2012
An algorithm approach to bounding aggregations of multidimensional Markov chains Fulltext Access 9 Pages 2012
Parsing Boolean grammars over a one-letter alphabet using online convolution Fulltext Access 9 Pages 2012
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets Fulltext Access 9 Pages 2012