Author:
Francis Mathew C.,Gonçalves Daniel,Ochem Pascal
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Alon, N.: Piercing d-intervals. Discrete and Computational Geometry 19, 333–334 (1998)
2. Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex Intersection Graphs of Paths on a Grid. Journal of Graph Algorithms and Applications 16(2), 129–150 (2012)
3. Aumann, Y., Lewenstein, M., Melamud, O., Pinter, R.Y., Yakhini, Z.: Dotted interval graphs and high throughput genotyping. In: Proc. of the 16th Annual Symposium on Discrete Algorithms, SODA 2005, pp. 339–348 (2005)
4. Bar-Yehuda, R., Halldórsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36, 1–15 (2006)
5. Lecture Notes in Computer Science;P. Berman,1995