Subhrajit Guhathakurta, Yoshi Kobayashi, Mookesh Patel, Janet Holston, Tim Lant, John Crittenden, Ke Li, Goran Konjevod, and Karthikeya Date. Digital phoenix project: A multidimensional journey through time. In Gerhard Steinebach, Subhrajit Guhathakurta, and Hans Hagen, editors, Visualizing Sustainable Planning, pages 159-184. Springer, 2009. [ bib ]
Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe, and Dorothea Wagner. Engineering label-constrained shortest-path algorithms. In Camil Demetrescu, Andrew Goldberg, and David S. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pages 309-318. AMS and DIMACS, 2009. [ bib ]
Goran Konjevod. Integer programming models for flat origami. In Robert J. Lang, editor, Origami 4, Proceedings of 4OSME: 4th International Conference on Origami Science, Mathematics and Education, pages 207-216. 2009. [ bib | www: | .pdf ]
Goran Konjevod. Separators (Leighton-Rao). In Ming-Yang Kao, editor, Encyclopedia of Algorithms, pages 815-818. 2008. [ bib | .pdf ]
Robert D. Carr and Goran Konjevod. Polyhedral combinatorics. In Harvey Greenberg, editor, Tutorials on emerging methodologies and applications in Operations Research, chapter 2, pages (2-1)-(2-48). Springer, 2004. [ bib | .pdf ]
This file was generated by bibtex2html 1.91.