Ostatnia aktualizacja:
June 04. 2017 18:55:04
Aktualności > Publication list

Publication list

  1. J. Grytczuk, K. Junosza-Szaniawski , J. Sokół, K. Węsek,  Fractional and j-Fold Coloring of the Plane, open access in Discrete and Computational Geometry
  2. A. Fuegenschuh, K. Junosza-Szaniawski, T. Klug, S.Kwasiborski, T. Schlechte, Fastest, Average and Quantile Schedule, SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE  Book Series: LNCS 8939, 201-216, (2015) WoS.
  3. K. Junosza-Szaniawski, M. Liedloff, P. Rzazewski,  Fixing Improper Colorings of Graphs, SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE  Book Series: LNCS 8939, 266-276, (2015) WoS. 
  4. K. Junosza-Szaniawski, P. Rzazewski, An Exact Algorithm for the Generalized List T-Coloring Problem, Discrete Mathematics and Theoretical Computer 16   Issue: 3, 77-94, (2014) WoS.
  5. A. Fügenschuh, K. Junosza-Szaniawski, Z. Lonc, Exact and Approximation Algorithms for a Soft Rectangle Packing Problem External Link: Exact and Approximation Algorithms for a Soft Rectangle Packing Problem (http://dx.doi.org/10.1080/02331934.2012.728217), Optimization 63   Issue: 11,   1637-1663, (2014) WoS.
  6. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rzążewski, Determining the L(2,1)-span in Polynomial Space, Discrete Applied Mathematics 161, pp. 2052-2061, 2013 (DOI: 10.1016/j.dam.2013.03.027) WoS. Conference version:WG 2012 Proc., LNCS  7551, 126-137 (2012)
  7. K. Junosza-Szaniawski, J. Kratochvil, M. Pergel, P. Rzążewski, Beyond homothetic polygons: recognition and maximum clique, ISAAC 2012 Proc., LNCS 7676, pp. 619-628, (2012) WoS
  8. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, P. Rzążewski, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, Theoretical Computer Science  (DOI: 10.1016/j.tcs.2012.06.037) Conference version TAMC 2011 Proc., LNCS 6648, pp. 82-93 (DOI: 10.1007/978-3-642-20877-5) WoS
  9. K. Junosza-Szaniawski, P. Rzążewski, On the number of 2-packings in a connected graph, Discrete Mathematics 312, pp. 3444–3450, 2012 (DOI: 10.1016/j.disc.2012.02.005) WoS
  10. K. Junosza-Szaniawski, M. Tuczyński, Counting Maximal Independent Sets in Subcubic Graphs, Lecture Notes in Computer Science 7147(2012), s.325-336 WoS
  11. K. Junosza-Szaniawski, Z. Lonc, M. Tuczyński, Counting Independent Sets in Claw-Free Graphs, Lecture Notes in Computer Science 6986 (2011), 227-237, WoS
  12. .K. Junosza-Szaniawski, P. Rzążewski, On the Complexity of Exact Algorithm for L(2,1)-labeling of Graphs, Information Processing Letters 111, pp. 697-701, 2011 (DOI: 10.1016/j.ipl.2011.04.010) WoS Conference version: On Improved Exact Algorithms for L(2,1)-labeling of Graphs, IWOCA 2010 Proc., LNCS 6460, pp. 34–37, 2011 (DOI: 10.1007/978-3-642-19222-7) WoS
  13. Konstanty Junosza-Szaniawski, Łukasz Rożej, "Game chromatic number of graphs with locally bounded number of cycles", Information Processing Letters Volume 110, Issue 17,  (2010) 757-760. WoS
  14. Adam Idzik, Konstanty Junosza-Szaniawski, „Combinatorial lemmas for oriented complexes” Topological Methods in Nonlinear Analysis  32 No 2, (2008) 379-410. Wos
  15. Adam Idzik, Konstanty Junosza-Szaniawski „Combinatorial lemmas for polyhedrons I”  Discussiones Mathematicae Graph Theory 26 (3) (2006) 439-448.
  16. Adam Idzik, Konstanty Junosza-Szaniawski „Combinatorial lemmas for polyhedrons”  Discussiones Mathematicae Graph Theory 25(1-2) (2005) 95-102.
  17. Adam Idzik, Konstanty Junosza-Szaniawski, „Combinatorial lemmas for nonoriented pseudomanifolds” Topological Methods in Nonlinear Analysis. 22, (2003), 387-398.