“Whoa! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Get 2 Weeks Free


Discrete Applied Mathematics Volume 154, Issue 12, 15 July 2006 Contributions R.J.R. Abel, N.J. Finizio, G. Ge and M. Greig New Z-cyclic triplewhist frames and triplewhist tournament designs E. Ackerman, G. Barequet and R.Y. Pinter A bijection between permutations and floorplans, and its applications `s E. Angel, E. Bampis and L. Gourve Approximation algorithms for the bi-criteria weighted MAX-CUT problem I. Bouyukliev On the binary projective codes with dimension 6 F. Coulon and M. Raffinot Fast algorithms for identifying maximal common connected sets of interval graphs C. Crespelle and C. Paul Fully dynamic recognition algorithm and certificate for directed cographs W. Morris Coloring copoints of a planar point set W. Wu, Y. Huang, X. Huang and Y. Li On error-tolerant DNA screening Notes H.-L. Fu and F.K. Hwang A novel use of t-packings to construct d-disjunct matrices S. Severini On the structure of the adjacency matrix of the line digraph of a regular digraph Y. Zhang and Y. Fan M2-equipackable graphs doi:10.1016/S0166-218X(06)00257-5 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Applied Mathematics Elsevier
Loading next page...
1 Page

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.