On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid Fulltext Access 6 Pages 2015
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope Fulltext Access 6 Pages 2015
Some links between identifying codes and separating, dominating and total dominating sets in graphs Fulltext Access 6 Pages 2015
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions Fulltext Access 6 Pages 2015
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width Fulltext Access 6 Pages 2015
Distance kk-domination, distance kk-guarding, and distance kk-vertex cover of maximal outerplanar graphs Fulltext Access 6 Pages 2015
NoteOn a link between Dirichlet kernels and central multinomial coefficients Fulltext Access 6 Pages 2015
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity Fulltext Access 6 Pages 2015
Proof of a conjecture of Kulakova et al. related to the sl2 weight system Fulltext Access 6 Pages 2015
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques Fulltext Access 6 Pages 2015
Partitioning H-minor free graphs into three subgraphs with no large components Fulltext Access 6 Pages 2015
A simple algorithm for a class of nonsmooth convex–concave saddle-point problems Fulltext Access 6 Pages 2015
An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem Fulltext Access 6 Pages 2015
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs Fulltext Access 6 Pages 2015
Bounded serial-batching scheduling for minimizing maximum lateness and makespan Fulltext Access 6 Pages 2015
On the mean number of remaining components in three-state kk-out-of-nn system Fulltext Access 6 Pages 2015
Degree conditions for graphs to be maximally kk-restricted edge connected and super kk-restricted edge connected Fulltext Access 6 Pages 2015
The computational complexity of the backbone coloring problem for planar graphs with connected backbones Fulltext Access 6 Pages 2015
Polynomial-time algorithms for minimum weighted colorings of (P5,P¯5)-free graphs and similar graph classes Fulltext Access 6 Pages 2015
On the maximum fraction of edges covered by tt perfect matchings in a cubic bridgeless graph Fulltext Access 6 Pages 2015
Maximum uniformly resolvable decompositions of Kv and KvâI into 3-stars and 3-cycles Fulltext Access 7 Pages 2015
Maximum spectral radius of graphs with given connectivity, minimum degree and independence number Fulltext Access 7 Pages 2015
Brooks type results for conflict-free colorings and {a,b}{a,b}-factors in graphs Fulltext Access 7 Pages 2015