-----------------------------------------------
Proponowany tytul pracy:
  "Klastry jako narzedzie rozproszonej aproksymacji w grafach planarnych."
Dziedzina: informatyka
Status: przydzielona
Literatura:

1. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, 
   "Distributed Approximation Algorithms for Planar Graphs", 
   CIAC 2006, pp. 296-307
2. Andrzej Czygrinow, Michal Hanckowiak, 
   "Distributed Almost Exact Approximations for Minor-Closed Families", 
   ESA 2006, pp. 244-255
3. Andrzej Czygrinow, Michal Hanckowiak, 
   "Distributed algorithms for weighted problems in sparse graphs", 
   Journal of Discrete Algorithms, Volume 4 (2006), pp. 588-607
   
-----------------------------------------------   
Proponowany tytul pracy:
  "Algorytmy konstrukcji (a,b)-spannera w grafach."
Dziedzina: informatyka
Status: przydzielona

Literatura:
1. Michael Elkin, David Peleg, 
   "(1+epsilon, beta)-Spanner Constructions for General Graphs", 
   SIAM J. Comput. 33(3), 2004, pp. 608-631.
2. Michael Elkin, Jian Zhang, 
   "Efficient algorithms for constructing (1+epsilon, beta)-spanners 
   in the distributed and streaming models", 
   Distributed Computing 18(5), 2006, pp. 375-385.
   
-----------------------------------------------
Proponowany tytul pracy:
  "Rysowanie grafow: algorytmy i oprogramowanie."
Dziedzina: informatyka
Status: przydzielona

Literatura:
1. A Linear Algorithm for Bend-Optimal Orthogonal Drawings 
   of Triconnected Cubic Plane Graphs
   Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
   Journal of Graph Algorithms and Applications
   Vol. 3, no. 4, pp. 31-62, 1999. 
2. New Lower Bounds For Orthogonal Drawings
   Therese C. Biedl
   Journal of Graph Algorithms and Applications
   Vol. 2, no. 7, pp. 1-31, 1998. 
3. A technique for drawing directed graphs (1993)
   Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-phong Vo
   IEEE Transactions on Software Engineering
   http://solo.uwaterloo.ca/~ijdavis/graph/graph_drawing.ps 
   
-----------------------------------------------
Proponowany tytul pracy:
  "Programowanie liniowe w algorytmach rozproszonych"
Dziedzina: informatyka
Status: przydzielona

Literatura:
1. Constant-Time Distributed Dominating Set Approximation
   Fabian Kuhn and Roger Wattenhofer
   22nd ACM Symposium on the Principles of Distributed Computing (PODC 2003)
2. The Price of Being Near-Sighted
   Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer
   17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006)

-----------------------------------------------
Proponowany tytul pracy:
  "Grafowe algorytmy rozproszone dzialajace w czasie sublogarytmicznym"
Dziedzina: informatyka
Status: przydzielona

Literatura:
1. Fast Distributed Approximations in Planar Graphs
   Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak 
   Distributed Computing, 22nd International Symposium, DISC 2008
2. A log-star distributed maximal independent set algorithm 
   for growth-bounded graphs
   Johannes Schneider, Roger Wattenhofer
   Proceedings of the Twenty-Seventh Annual ACM Symposium 
   on Principles of Distributed Computing
   PODC 2008: 35-44
3. What can be approximated locally?:
   case study: dominating sets in planar graphs
   Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer
   Proceedings of the 20th Annual ACM Symposium 
   on Parallel Algorithms and Architectures,
   SPAA 2008: 46-54 
4. Sublogarithmic distributed MIS algorithm for sparse graphs 
   using nash-williams decomposition. 
   Leonid Barenboim, Michael Elkin
   PODC 2008: 25-34