Groups, graphs, languages, automata, games and second-order monadic logic Fulltext Access 39 Pages 2012
Algorithms for combinatorial structures: Well-founded systems and Newton iterations Fulltext Access 63 Pages 2012
NoteOn a lower bound for the connectivity of the independence complex of a graph Fulltext Access 4 Pages 2011
NoteOn the maximum number of edges in a hypergraph with a unique perfect matching Fulltext Access 4 Pages 2011
On some structural properties of generalized fullerene graphs with 13 pentagonal faces Fulltext Access 4 Pages 2011
Intractability of approximate multi-dimensional nonlinear optimization on independence systems Fulltext Access 4 Pages 2011
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two Fulltext Access 4 Pages 2011
Stable decompositions for some symmetric group characters arising in braid group cohomology Fulltext Access 4 Pages 2011
On G-locally primitive graphs of locally Twisted Wreath type and a conjecture of Weiss Fulltext Access 4 Pages 2011
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem' Fulltext Access 4 Pages 2011
Strong subtournaments of order c containing a given vertex in regular c-partite tournaments with câ¥16 Fulltext Access 4 Pages 2011
Fast computation of Andrews’ smallest part statistic and conjectured congruences Fulltext Access 4 Pages 2011
On perfect hashing of numbers with sparse digit representation via multiplication by a constant Fulltext Access 4 Pages 2011
Bounding the feedback vertex number of digraphs in terms of vertex degrees Fulltext Access 4 Pages 2011
NoteA direct bijection between descending plane partitions with no special parts and permutation matrices Fulltext Access 5 Pages 2011
The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields Fulltext Access 5 Pages 2011
A characterization of the external lines of a hyperoval cone in PG(3, q), q even Fulltext Access 5 Pages 2011
A note on properties of locally finitely convergent sequences with respect to median filter Fulltext Access 5 Pages 2011
A Rao-type characterization for a sequence to have a realization containing a split graph Fulltext Access 5 Pages 2011
New upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs Fulltext Access 5 Pages 2011
The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems Fulltext Access 5 Pages 2011
An extremal problem for total domination stable graphs upon edge removal Fulltext Access 5 Pages 2011
The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph Fulltext Access 5 Pages 2011