Student Poster Session

  • Martin Charles Golumbic
  • Michal Stern
  • Avivit Levy
  • Gila Morgenstern
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7551)

Abstract

During WG 2012 there was a Student Poster Session, where the following posters were presented (alphabetically ordered by student’s last name).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, I., Chechik, S., Gavoille, C.: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In: Proc. the 44th Symposium on Theory of Computing Conference, STOC 2012, pp. 1199–1218 (2012)Google Scholar
  2. 2.
    Avin, C., Cohen, A., Haddad, Y., Kantor, E., Lotker, Z., Parter, M., Peleg, D.: In: Proc. the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 502–515 (2012)Google Scholar
  3. 3.
    Gamzu, I., Medina, M.: Improved Approximation for Orienting Mixed Graphs. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 243–253. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Jurkiewicz, M., Kubale, M.: Product Graphs Invariants with Applications to the Theory of Information. In: The 5th International Interdisciplinary Technical Conference of Young Scientists InterTech (2012)Google Scholar
  5. 5.
    Roditty, L., Tov, R.: Approximating the Girth. In: Proc. the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1446–1454 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Martin Charles Golumbic
    • Michal Stern
      • 1
    • Avivit Levy
      • 2
    • Gila Morgenstern
      1. 1.Unit of Statistics and Probability StudiesThe Academic College of Tel AvivYaffoIsrael
      2. 2.Shenkar CollegeRamat-GanIsrael

      Personalised recommendations