Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Student Poster Session

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7551))

Included in the following conference series:

  • 945 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  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. 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. 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)

    Chapter  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (2012). Student Poster Session. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2012. Lecture Notes in Computer Science, vol 7551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34611-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34611-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34610-1

  • Online ISBN: 978-3-642-34611-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics