Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

dr Katarzyna Paluch

Pracownik  

2015

  1. K. Paluch, Maximum ATSP with weights zero and one via half-edges, Approximation and Online Algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers / Laura Sanita, Martin Skutella (eds.). - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 9499). - S. 25-34. (http://dx.doi.org/10.1007/978-3-319-28684-6_3)

2014

  1. K. Paluch, Faster and Simpler Approximation of Stable Matchings, Algorithms 2014, 7(2), 189-202. (http://dx.doi.org/10.3390/a7020189)
  2. K. Paluch, Popular and clan-popular b-matchings, Theoretical Computer Science 544: 3-13 (2014). (http://dx.doi.org/10.1016/j.tcs.2014.04.017)

2013

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

2012

  1. K. Paluch, K. Elbassioni, A. van Zuylen, Simpler approximation of the maximum asymmetric traveling salesman problem, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; 14).- S. 501-506. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.501)
  2. K. Paluch, Faster and simpler approximation of stable matchings, Approximation and online algorithms : 9th international workshop ; revised selected papers : WAOA 2011, Saarbruecken, Germany, September 8-9, 2011 / (ed.)Roberto Solis-Oba, Giuseppe Persiano. - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7164). - S. 176-187.

2011

  1. K. Paluch, Faster and simpler approximation of stable matchings, WAOA 2011.

2009

  1. M. Mucha, A. Mądry, K. Paluch, A 7/9 – Approximation Algorithm for the Maximum Traveling Salesman Problem, APPROX-RANDOM 2009: 298-311. (http://www.springerlink.com/content/q6088qt27k751u30/)

2008

  1. T. Kavitha, K. Mehlhorn, D. Michail, K. Paluch, Õ(m2n) Algorithm for Minimum Cycle Basis of Graphs, Algorithmica 52(3), 2008, 333-349.

2007

  1. T. Kavitha, K. Mehlhorn, D. Michaił, K. Paluch, Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem, ACM Transactions on Algorithms 3(2): (2007).

2006

  1. K. Paluch, New Approximation Algorithm for Multidimensional Rectangle Tiling, ISAAC 2006, LNCS 4288, 712-721.
  2. K. Paluch, Rank-maximal matchings, ACM Transactions on Algorithms(TALG) Volume 2, Issue 4 October 2006, 602-610.

2004

  1. K. Paluch, A 2 1/8 Approximation Algorithm for Rectangle Tiling, ICALP'2004: 1054-1065.
  2. T. Kavitha, K. Mehlhorn, D. Michail, K. Paluch, A Faster Algorithm for Minimum Cycle Basis of Graphs, ICALP'2004, 846-857.
  3. R. W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, K. Paluch, Rank-Maximal Matchings, SODA'2004, 68-75.
  4. T. Kavitha, K. Mehlhorn, D. Michail, K. Paluch, Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem, STACS'2004, 222-233.

2003

  1. K. Loryś, K. Paluch, New approximation algorithm for RTILE problem, Theoretical Computer Science, Vol 303/2-3, 2003, pp 517-537.

2000

  1. K. Loryś, K. Paluch, Rectangle Tiling, Proc. 3rd Intern. Workshop. APPROX 2000, Lecture Notes in Computer Science, vol. 1913, (Springer, Berlin, 2000), 206-213.

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