Aktualności > Publication list

Publication list

ORCID iD iconorcid.org/0000-0003-0352-8583

https://dblp.org/pers/hd/j/Junosza=Szaniawski:Konstanty
  1. K. Junosza-Szaniawski, J. Sokół, K. Węsek Coloring distance graphs on the plane preprint   https://arxiv.org/abs/2201.04499
  2. K. Junosza-Szaniawski, D. Nogalski, A. Wójcik, Exact and approximation algorithms for sensor placement against DDoS attacks, 2020 15th Conference on Computer Science and Information Systems (FedCSIS) DOI: 10.15439/2020F106
  3. M. Dębski, K. Junosza-Szaniawski, M. Śleszyńska-Nowak, Strong chromatic index of K_{1,t}-free graphs, Discrete Applied Mathematics, 2020, https://doi.org/10.1016/j.dam.2020.03.024.
  4. M.Dębski, K.Junosza-Szaniawski, Z.Lonc, Bundling all shortest paths, Discrete Applied Mathematics,  Available online 30 September 2019, https://doi.org/10.1016/j.dam.2019.08.027
  5. J.Chybowska-Sokół, K.Junosza-Szaniawski, P.Rzążewski, L(2,1)-labeling of disk intersection graphs, Discrete Applied Mathematics
    Available online 21 September 2019, https://doi.org/10.1016/j.dam.2019.08.020 
  6. K. Junosza-Szaniawski, P. Rzążewski, J. Sokół, K. Węsek, Online coloring and L(2,1)-labeling of unit disk intersection graphs, SIAM J. Discrete Mathematics 32, 1335-1350 (DOI: 10.1137/16M1097821).
  7. V.E. Brimkov, K. Junosza-Szaniawski, S. Kafer, J. Kratochvil, M. Pergel, P. Rzążewski, M. Szczepankiewicz, J. Terhaar, Homothetic Polygons and Beyond: Maximal Cliques in Intersection Graphs, Discrete Applied Mathematics 247, 263-277, 2018 (DOI: 10.1016/j.dam.2018.03.046). Conference version:  Beyond homothetic polygons: recognition and maximum clique, ISAAC 2012 Proc., LNCS 7676, pp. 619-628, (2012) WoS
  8. K. Junosza-Szaniawski,  Upper Bound on the Circular Chromatic Number of the Plane, Electronic Journal of Combinatorics,  Volume 25, Issue 1 (2018) > Paper #P1.53.
  9. V. Garnero, K. Junosza-Szaniawski, M. Liedloff, P. Montealegre, P. Rzążewski, Fixing improper colorings of graphs, Theoretical Computer Science, available online (DOI: 10.1016/j.tcs.2017.11.013) Conference version: 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.  
  10. A. Zychowski, K. Junosza-Szaniawski, A. Kosicki. (2018) Travel Time Prediction for Trams in Warsaw. In: Kurzynski M., Wozniak M., Burduk R. (eds) Proceedings of the 10th International Conference on Computer Recognition Systems CORES 2017. CORES 2017. Advances in Intelligent Systems and Computing, vol 578. Springer, Cham
  11. J. Grytczuk, K. Junosza-Szaniawski , J. Sokół, K. Węsek,  Fractional and j-Fold Coloring of the Plane, Discrete & Computational Geometry 55, 594–609 (2016). https://doi.org/10.1007/s00454-016-9769-3  open access
  12. 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.
  13. 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.
  14. 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.
  15. 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)
  16. 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
  17. 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
  18. K. Junosza-Szaniawski, M. Tuczyński, Counting Maximal Independent Sets in Subcubic Graphs, Lecture Notes in Computer Science 7147(2012), s.325-336 WoS
  19. 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
  20. .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
  21. 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
  22. Adam Idzik, Konstanty Junosza-Szaniawski, „Combinatorial lemmas for oriented complexes” Topological Methods in Nonlinear Analysis  32 No 2, (2008) 379-410. Wos
  23. Adam Idzik, Konstanty Junosza-Szaniawski „Combinatorial lemmas for polyhedrons I”  Discussiones Mathematicae Graph Theory 26 (3) (2006) 439-448.
  24. Adam Idzik, Konstanty Junosza-Szaniawski „Combinatorial lemmas for polyhedrons”  Discussiones Mathematicae Graph Theory 25(1-2) (2005) 95-102.
  25. Adam Idzik, Konstanty Junosza-Szaniawski, „Combinatorial lemmas for nonoriented pseudomanifolds” Topological Methods in Nonlinear Analysis. 22, (2003), 387-398.