Łukasz Kuszner University of Gdansk Faculty of Mathematics, Physics and Informatics Institute of Informatics ul. Wita Stwosza 57, 80-952 Gdańsk, Poland. Contact me: <first name><dot><last name>@ug.edu.pl You can find me also at: Google Scholar, ResearchId, DBLP, Stack Overflow, SPOJ, LinkedIn, X (Twitter), Wikipedia.

Education

Ph.D. thesis in computer science (with honors): Rozproszone kolorowanie grafów (Distributed graph coloring), Gdańsk University of Technology WETI (25 IV 2006), supported by grant number 3 T11F 006 28.

Master Thesis in mathematics: Geometria form rzeczywistych powierzchni Riemanna (On real forms of Riemann surfaces), University of Gdańsk WMiF (2003). (ps)

Master Thesis in computer science: Rozproszone kolorowanie grafów (Distributed graph coloring), Gdańsk University of Technology WETI (2001).

List of publications

1. P. Borowiecki, S. Das, D. Dereniowski, Ł. Kuszner, Discrete Evacuation in Graphs with Multiple Exits, Theoretical Computer Science, vol. 1035, 2025, 115141, ISSN 0304-3975, doi: 10.1016/j.tcs.2025.115141, 2025 Extended abstract appeared as Distributed Evacuation in Graphs with Multiple Exits, Proc. of SIROCCO, Helsinki, Finnland, Jul 19-21, 2016, Lecture Notes in Computer Sc. vol. 9988, 2016, 228-241, doi: 10.1007/978-3-319-48314-6_15, Springer, pre-proceedings.
2. L. Gąsieniec, Ł. Kuszner, E. Latif, R. Parasuraman, P. Spirakis, G. Stachowiak Anonymous Distributed Localisation via Spatial Population Protocols, 2024, CoRR abs/2411.08434.
3. D. Dereniowski, Ł. Kuszner and R. Ostrowski, Searching by heterogeneous agents, Journal of Computer and System Sciences, vol. 115, February 2021, 1-21, doi:10.1016/j.jcss.2020.06.008, Extended abstract appeared as a Proc. of 11th International Conference on Algorithms and Complexity (CIAC 2019), Rome, Italy, May 27-29, 2019. Lecture Notes in Computer Sc., vol 11485, Springer.
4. E.C. Akrida, J. Czyżowicz, L. Gąsieniec, Ł. Kuszner, P.G. Spirakis, Temporal flows in Temporal networks, Journal of Computer and System Sciences, vol. 103, 2019, 46-60, doi:10.1016/j.jcss.2019.02.003, Extended abstract appeared as a Proc. of 10th International Conference on Algorithms and Complexity (CIAC 2017) Athens, Greece, May 24-26, Lecture Notes in Computer Sc. vol. 10236, 2017, 43-54, doi: 10.1007/978-3-319-57586-5, Springer (arXiv draft).
5. A. Farrugia, L. Gąsieniec, Ł. Kuszner, E. Pacheco, Deterministic Rendezvous with Different Maps, Journal of Computer and System Sciences, available online 19 June 2019, doi:10.1016/j.jcss.2019.06.001. Extended abstract appeared as Deterministic Rendezvous in Restricted Graphs, Proc. of SOFSEM, Pec pod Sněžkou, Czech Republic, Jan 24-29, 2015, Lecture Notes in Computer Sc. vol. 8939, 2015, 189-200, Springer (draft).
6. K. Myslitski, J. Rak, Ł. Kuszner, Towards Fast Calculation of Communication Paths for Resilient Routing, Networks, vol. 70 (4), 2017, 308-326. Special Issue: Special Issue on Design of Resilient Communication Networks, doi:10.1002/net.21789.
7. K. Myslitski, J. Rak, Ł. Kuszner, Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing, Proc. of 8th International Workshop on Resilient Networks Design and Modeling (RNDM 2016), 238-244, available online, doi: 10.1109/RNDM.2016.7608293.
8. P. Borowiecki, D. Dereniowski, Ł. Kuszner, Distributed graph searching with a sense of direction, Distributed Computing (Open Access, 19 Nov 2014 ), vol. 28 (3), 2015, 155-170.
9. D. Dereniowski, R. Klasing, A. Kosowski, Ł. Kuszner, Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks, Theoretical Computer Science, vol. 608 (3), 2015, 219-230, available online, doi:10.1016/j.tcs.2015.05.055. Extended abstract appeared as a Proc. of SIROCCO, Takayama, Japan, July 23-25, 2014, Lecture Notes in Computer Sc. vol. 8576, 311-326, Springer (draft + appendix).
10. C. Gavoille, R. Klasing, A. Kosowski, Ł. Kuszner, A. Navarra, On the Complexity of Distributed Graph Coloring with Local Minimality Constraints, Networks, vol. 54 (1), 2009, 12-19 (available online, a preliminary version available as INRIA report).
11. T. Dobrowolski, D. Dereniowski, Ł. Kuszner, KOALA graph coloring library: an open graph coloring library for real-world applications, Proc. of 1st International Conference on Information Technology (2008) Gdańsk, Poland.
12. Ł. Kuszner, M. Małafiejski, A polynomial algorithm for some preemptive multiprocessor task scheduling problems. European Journal of Operational Research, vol. 176, 2007, 145-150 (Article in Press).
13. A. Kosowski, Ł. Kuszner, Energy optimisation in resilient self-stabilizing processes, Proc. of IEEE International Conference on Parallel Computing in Electrical Engineering, PARELEC, Białystok 2006, IEEE Explore (pdf, ps).
14. A. Kosowski, Ł. Kuszner, A self-stabilizing algorithm for coloring bipartite graphs and cacti (in Polish: Samostabilizujący się algorytm kolorowania grafów dwudzielnych i kaktusów.) Zeszyty Naukowe Politechniki Śląskiej 1726, Automatyka, z. 143, 2006 (KKAPD 2006), 75-81. (pdf, ps).
15. A. Kosowski, Ł. Kuszner, Greedy algorithms for distributed graph coloring (in Polish: Zachłanne algorytmy kolorowania grafów w modelu rozproszonym), Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej, vol. 10, 2006, 491-498 (pdf).
16. A. Kosowski, Ł. Kuszner, On Greedy Graph Coloring in the Distributed Model Proc. 12th International Euro-Par Conference Dresden, Germany. Lecture Notes in Computer Sc. vol. 4128, 2006, 592-601, Springer (draft).
17. Ł. Kuszner, A. Nadolski, Self-stabilizing algorithm for edge-coloring of graphs, Foundations of Computing and Decision Sciences , vol. 31, No. 2, 2006, 157-167.
18. A. Kosowski, Ł. Kuszner, Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees, 8th International Conference on Artificial Intelligence and Soft Computing (ICAISC 2006), LNAI 4029, 2006, 1150-1159, Springer (draft version).
19. A. Kosowski, Ł. Kuszner, A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves. 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) 2005. Lecture Notes in Computer Sc. vol. 3911, 2006, 75-82, Springer (draft) .
20. J. Dąbrowski, D. Dereniowski, R. Janczewski, A. Kosowski, Ł. Kuszner, M. Małafiejski, A. Nadolski, T. Noiński, K. Piwakowski, The internet-based online judge system (in Polish), Proc. XIII Konferencja sieci i Systemy Informatyczne, Łódź (2005), 633-638.
21. J. Hansen, M. Kubale, Ł. Kuszner, A. Nadolski, Distributed largest-first algorithm for graph coloring. Proc. 10th International Euro-Par Conference Pisa, Italy, 31 August - 3 September, 2004 Lecture Notes in Computer Sc. vol. 3149, 804-811, Springer (ps).
22. Ł. Kuszner, Samostabilizujące się algorytmy wierzchołkowego kolorowania grafów. XIV Krajowa Konferencja Automatyzacja Procesów Dyskretnych. Zakopane, 22-25 września 2004. Warszawa: WNT 2004 Rozdz. 6. Optymalizacja dyskretna, 109-116 (ps).
23. Ł. Kuszner, A. Nadolski, R. Janczewski, Samostabilizujące się algorytmy kolorowania krawędzi grafów. XIV Krajowa Konferencja Automatyzacja Procesów Dyskretnych. Zakopane, 22-25 września 2004. Warszawa: WNT 2004 rozdz. 11. Optymalizacja dyskretna 117-123.
24. R. Janczewski, Ł. Kuszner, A. Nadolski, Algorytmy zachłanne i ich zastosowanie w problemie przydziału częstotliwości. W: XIV Krajowa Konferencja Automatyzacja Procesów Dyskretnych. Zakopane, 22-25 września 2004. Warszawa: WNT 2004 Rozdz. 6. Optymalizacja dyskretna, 57-62 (ps).
25. R. Janczewski, Ł. Kuszner, M. Małafiejski, A. Nadolski, An experimental study of distributed algorithms for graph coloring, Proc. 10th International Multi-Conference ACS-SCM'2003, Międzyzdroje, Poland (2003), Technical University of Szczecin 2003, 295-298 (pdf, ps).
26. R. Janczewski, Ł. Kuszner, M. Małafiejski, A. Nadolski, Algorytm przybliżony dla cyrkularnego kolorowania krawędzi grafów, Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej, 2003, 473-479.
27. R. Janczewski, Ł. Kuszner, M. Małafiejski, A. Nadolski, Uszeregowania zadań wieloprocesorowych minimalizujące średni czas przepływu, Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej, 2003, 481-485.
28. M. Małafiejski, Ł. Kuszner, K. Piwakowski, Preemptive multiprocessor task scheduling to minimize the sum of completion times, Proc. 9th International Multi-Conference ACS-SCM'2002, Międzyzdroje, Poland (2002), Wyd. Politechniki Szczecińskiej 2002, cz.I, 189-196 (doc, ps).
29. Ł. Kuszner, Distributed graph coloring (in Polish), Zeszyty Naukowe Politechniki Śląskiej 1556, Automatyka, z. 136, 2002, 145-156 (ps).
30. M. Małafiejski, Ł. Kuszner, M. Kubale, Preemptive scheduling of biprocessor tasks on dedicated machines to minimize sum of completion times (in Polish), Zeszyty Naukowe Politechniki Śląskiej 1554, Automatyka, z. 134, 2002, 313-325 (ps).
31. M. Kubale, Ł. Kuszner, A better practical algorithm for distributed graph coloring, Proc. of IEEE International Conference on Parallel Computing in Electrical Engineering, PARELEC, Warsaw 2002, 72-75, IEEE Explore (ps).

Conference talks

• IX GCGT, Gdańsk, 2024.
• XXIII SIROCCO, Helsinki, 2016.
• FIT, Warszawa, 2016.
• XXI SIROCCO, Takayama, 2014.
• VIII ICAISC, Zakopane 2006 (poster).
• TI, Gdańsk 2006.
• VI PPAM, Poznań 2005 (poster).
• X Euro-Par, Pisa 2004.
• XIV KKAPD, Zakopane 2004.
• X ACS-SCM, Międzyzdroje 2003.
• IEEE PARELEC, Warszawa 2002.
• XIII KKAPD, Zakopane 2002.

Research visits

• University of Liverpool, UK, 15-24 May 2023.
• Paris Diderot Université, France, 23-30 September 2016.
• University of Liverpool, UK, 20 June - 1 July 2015.
• University of Liverpool, UK, 13-24 May 2014.
• The Inria Bordeaux - Sud-Ouest Centre, France, 24-31 May 2013.

Program Committees

• ISPAN2017 - The 14th International Symposium on Pervasive Systems, Algorithms, and Networks.

Organizing committees

• FCT 2015 - 20th International Symposium on Fundamentals of Computation Theory, Gdańsk, Poland, August 17-19, 2015.
• XVIII SIROCCO, Gdańsk, Poland June 26-29, 2011.

Erdős-Bacon number

• My Erdős number is 3 via: (Distributed graph searching with a sense of direction, 2015) with Piotr Borowiecki (Minimum order of graphs with given coloring parameters, 2015) with Zsolt Tuza and (Radius, diameter, and minimum degree, 1989) with Paul Erdös.
• My Bacon number is 4 via: (Student Break, 2011) with Wojciech Tremiszewski (Czarny czwartek. Janek Wiśniewski padł, 2011) with Witold Dębicki (Eminent Domain, 1990) with Donald Sutherland and (JFK, 1991) with Kevin Bacon.