Logowanie

Języki

  • Polski
  • English

publikacje w roku  

Zakład Optymalizacji Kombinatorycznej - 2013

  1. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, A. Jeż, G. Stachowiak, Collecting Weighted Items from a Dynamic Queue, Algorithmica, January 2013, Volume 65, Issue 1, pp 60-94. (http://dx.doi.org/10.1007/s00453-011-9574-6)
  2. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, G. Stachowiak, A phi-competitive algorithm for collecting items with increasing weights from a dynamic queue, Theoretical Computer Science, Volume 475, 4 March 2013, Pages 92-102. (http://dx.doi.org/10.1016/j.tcs.2012.12.046)
  3. M. Bieńkowski, J. Byrka, M. Chrobak, N. Dobbs, T. Nowicki, M. Sviridenko, G. Świrszcz, N. E. Young, Approximation algorithms for the joint replenishment problem with deadlines, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part I / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7965).- S. 135-147. (http://dx.doi.org/10.1007/978-3-642-39206-1_12)
  4. M. Bieńkowski, J. Byrka, Ł. Jeż, M. Chrobak, J. Sgall, Online control message aggregation in chain networks, Algorithms and Data Structures : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 8037). - S. 133-145. (http://dx.doi.org/10.1007/978-3-642-40104-6_1)
  5. Ł. Jeż, C. Dürr, Ó. C. Vásquez, Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling, Web and Internet Economics : 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013 : proceedings / Yiling Chen, Nicole Immorlica (eds.). - Berlin [u.a.] : Springer International Publishing, 2013. - (Lecture Notes in Computer Science ; Vol.8289).- S. 134-145. (http://dx.doi.org/10.1007/978-3-642-45046-4_12)
  6. M. Bieńkowski, P. Zalewski, (1, 2)-Hamiltonian completion on a matching, International Journal of Foundations of Computer Science. - Vol. 24, no 01 (2013), s. 95-108. (http://dx.doi.org/10.1142/S0129054113500019)
  7. J. Byrka, F. Grandoni, T. Rothvoss, L. Sanita, Steiner tree approximation via iterative randomized rounding, Journal of the ACM. - Vol. 60, iss. 1 (2013), nr art. 6 (33 str.). (http://dx.doi.org/10.1145/2432622.2432628)
  8. Ł. Jeż, M. Chrobak, J. Sgall, Better bounds for incremental frequency allocation in bipartite graphs, Theoretical Computer Science. - Vol.514 (2013), s. 75-83. (http://dx.doi.org/10.1016/j.tcs.2012.05.020)
  9. J. Schwartz, J. Sgall, J. Békési, Ł. Jeż, Lower bounds for online makespan minimization on a smallnumber of related machines, Journal of Scheduling. - Vol. 16, nr 5 (2013), s. 539-547. (http://dx.doi.org/10.1007/s10951-012-0288-7)
  10. Ł. Jeż, A universal randomized packet scheduling algorithm, Algorithmica. - Vol. 67, nr 4 (2013), s. 498-515. (http://dx.doi.org/10.1007/s00453-012-9700-0)
  11. M. Bieńkowski, S. Schmid, Competitive FIB Aggregation: Online Ski Rental on the Trie, 20th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer 2013, (Lecture Notes in Computer Science vol. 8205), s. 583-584. (http://www.ii.uni.wroc.pl/~mbi/papers/2013-sirocco-fib-compression.pdf)
  12. M. Bieńkowski, N. Sarrar, S. Schmid, S. Uhlig, Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes, 27th Int. Symposium on DIStributed Computing (DISC), Springer 2013, (Lecture Notes in Computer Science vol. 8179), s. 92-103. (http://www.ii.uni.wroc.pl/~mbi/papers/2013-disc-ba-fib-aggregation.pdf)
  13. K. Paluch, Capacitated Rank-Maximal Matchings, 8th International Conference on Algorithms and Complexity CIAC 2013-Springer 2013 (Lecture Notes in Computer Science Vol. 7878) 2013, s. 324-335. (http://dx.doi.org/10.1007/978-3-642-38233-8_27)
  14. M. Cygan, Ł. Jeż, Online Knapsack Revisited, Approximation and Online Algorithms Lecture Notes in Computer Science Volume 8447, 2014, pp 144-155. (http://link.springer.com/chapter/10.1007%2F978-3-319-08001-7_13)
  15. J. Byrka, S. Li, B. Rybicki, Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter, WAOA 2013: 85-96.
Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS