The Universal Edge Elimination Polynomial and the Dichromatic Polynomial Fulltext Access 6 Pages 2011
On lower bounds for the b-chromatic number of connected bipartite graphs Fulltext Access 6 Pages 2011
Probe interval and probe unit interval graphs on superclasses of cographs Fulltext Access 6 Pages 2011
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs Fulltext Access 6 Pages 2011
Asymptotically settling Zarankiewiczʼs Conjecture in finite time, for each m Fulltext Access 6 Pages 2011
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem Fulltext Access 6 Pages 2011
Minimal families in terms of double-sided shadow in the Boolean cube layer Fulltext Access 6 Pages 2011
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs Fulltext Access 6 Pages 2011
An effective compact formulation of the max cut problem on sparse graphs Fulltext Access 6 Pages 2011
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs Fulltext Access 6 Pages 2011
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids Fulltext Access 6 Pages 2011
A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks Fulltext Access 6 Pages 2011
A note on the primal-dual column generation method for combinatorial optimization Fulltext Access 6 Pages 2011
Combinatorial properties and further facets of maximum edge subgraph polytopes Fulltext Access 6 Pages 2011
Solving the segmentation problem for the 2010 Argentine census with integer programming Fulltext Access 6 Pages 2011
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem Fulltext Access 6 Pages 2011
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs Fulltext Access 6 Pages 2011
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking Fulltext Access 6 Pages 2011
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty Fulltext Access 6 Pages 2011
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Fulltext Access 6 Pages 2011
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope Fulltext Access 6 Pages 2011
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs Fulltext Access 6 Pages 2011
Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope Fulltext Access 6 Pages 2011
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber Fulltext Access 6 Pages 2011