| Exact and approximation algorithms for a soft rectangle packing problem A Fügenschuh, K Junosza-Szaniawski, Z Lonc Optimization 63 (11), 1637-1663, 2014 | 30 | 2014 |
| Travel time prediction for trams in Warsaw A Zychowski, K Junosza-Szaniawski, A Kosicki Proceedings of the 10th International Conference on Computer Recognition …, 2018 | 14 | 2018 |
| Fast exact algorithm for L (2, 1)-labeling of graphs K Junosza-Szaniawski, J Kratochvíl, M Liedloff, P Rossmanith, ... Theoretical Computer Science 505, 42-54, 2013 | 14 | 2013 |
| On the number of 2-packings in a connected graph K Junosza-Szaniawski, P Rzążewski Discrete Mathematics 312 (23), 3444-3450, 2012 | 13 | 2012 |
| Fractional and j-Fold Coloring of the Plane J Grytczuk, K Junosza-Szaniawski, J Sokół, K Węsek Discrete & Computational Geometry 55, 594-609, 2016 | 12 | 2016 |
| On the complexity of exact algorithm for L (2, 1)-labeling of graphs K Junosza-Szaniawski, P Rzążewski Information Processing Letters 111 (14), 697-701, 2011 | 12 | 2011 |
| On Improved Exact Algorithms for L(2,1)-Labeling of Graphs K Junosza-Szaniawski, P Rzążewski Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011 | 11 | 2011 |
| Dynamic transfer patterns for fast multi-modal route planning T Liebig, S Peter, M Grzenda, K Junosza-Szaniawski Societal Geo-innovation: Selected papers of the 20th AGILE conference on …, 2017 | 10 | 2017 |
| Coloring distance graphs on the plane J Chybowska-Sokół, K Junosza-Szaniawski, K Węsek Discrete Mathematics 346 (7), 113441, 2023 | 9 | 2023 |
| Online Coloring and -Labeling of Unit Disk Intersection Graphs K Junosza-Szaniawski, P Rzaͅżewski, J Sokół, K Wesek SIAM Journal on Discrete Mathematics 32 (2), 1335-1350, 2018 | 8 | 2018 |
| The reservation-allocation network flow problem A Fügenschuh, K Junosza-Szaniawski, S Kwasiborski Helmut-Schmidt-Univ., Professur für Angewandte Mathematik, 2014 | 8 | 2014 |
| Determining the L (2, 1)-span in polynomial space K Junosza-Szaniawski, J Kratochvíl, M Liedloff, P Rzążewski Discrete Applied Mathematics 161 (13-14), 2052-2061, 2013 | 8 | 2013 |
| Beyond homothetic polygons: Recognition and maximum clique K Junosza-Szaniawski, J Kratochvíl, M Pergel, P Rzążewski Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012 | 8 | 2012 |
| L (2, 1)-labeling of disk intersection graphs J Chybowska-Sokół, K Junosza-Szaniawski, P Rzążewski Discrete Applied Mathematics 277, 71-81, 2020 | 7 | 2020 |
| Online coloring of short intervals J Chybowska-Sokół, G Gutowski, K Junosza-Szaniawski, P Mikos, ... arXiv preprint arXiv:1802.09503, 2018 | 7 | 2018 |
| Exact and approximation algorithms for sensor placement against DDoS attacks K Junosza-Szaniawski, D Nogalski, P Rzążewski International Journal of Applied Mathematics and Computer Science 32 (1), 2022 | 6 | 2022 |
| Strong chromatic index of K1, t-free graphs M Dębski, K Junosza-Szaniawski, M Śleszyńska-Nowak Discrete Applied Mathematics 284, 53-60, 2020 | 6 | 2020 |
| Homothetic polygons and beyond: Maximal cliques in intersection graphs VE Brimkov, K Junosza-Szaniawski, S Kafer, J Kratochvíl, M Pergel, ... Discrete Applied Mathematics 247, 263-277, 2018 | 6 | 2018 |
| An exact algorithm for the generalized list T-coloring problem K Junosza-Szaniawski, P Rzazewski Discrete Mathematics & Theoretical Computer Science 16 (Discrete Algorithms), 2014 | 6 | 2014 |
| Fixing improper colorings of graphs V Garnero, K Junosza-Szaniawski, M Liedloff, P Montealegre, ... Theoretical Computer Science 711, 66-78, 2018 | 5 | 2018 |
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
