1. Boxicity of Circular Arc Graphs

   • Diptendu Bhowmick
   • L. Sunil Chandran

   Original Paper 18 December 2010 Pages: 769 - 783

2. Maximum Hitting of a Set by Compressed Intersecting Families

   • Peter Borg

   Original Paper 05 January 2011 Pages: 785 - 797

3. Path-Bicolorable Graphs

   • Andreas Brandstädt
   • Martin Charles Golumbic
   • Marina Lipshteyn

   Original Paper 05 January 2011 Pages: 799 - 819

4. Domination Number of Graphs Without Small Cycles

   • Xue-gang Chen
   • Moo Young Sohn

   Original Paper 05 January 2011 Pages: 821 - 830

5. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

   • Nathann Cohen
   • Frédéric Havet

   Original Paper 05 January 2011 Pages: 831 - 849

6. Symmetrized Induced Ramsey Theory

   • Stefan Geschke
   • Menachem Kojman

   Original Paper 05 January 2011 Pages: 851 - 864

7. On the Perfect Matchings of Near Regular Graphs

   • Xinmin Hou

   Original Paper 05 January 2011 Pages: 865 - 869

8. Splitting Off Operation for Binary Matroids and its Applications

   • M. M. Shikare
   • K. V. Dalvi
   • S. B. Dhotre

   Original Paper 25 February 2011 Pages: 871 - 882

9. Minimum Resolvable Coverings of K _v with Copies of K ₄ − e

   • Renwang Su
   • Lidong Wang

   Original Paper 05 January 2011 Pages: 883 - 896