Abstract
During WG 2012 there was a Student Poster Session, where the following posters were presented (alphabetically ordered by student’s last name).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
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)
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)
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)
Roditty, L., Tov, R.: Approximating the Girth. In: Proc. the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1446–1454 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)