| Local conflict coloring P Fraigniaud, M Heinrich, A Kosowski 2016 IEEE 57th annual symposium on foundations of computer science (FOCS …, 2016 | 169 | 2016 |
| Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring R Klasing, A Kosowski, A Navarra Theoretical Computer Science 411 (34-36), 3235-3246, 2010 | 156* | 2010 |
| How to meet when you forget: log-space rendezvous in arbitrary graphs J Czyzowicz, A Kosowski, A Pelc Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 129 | 2010 |
| Boundary patrolling by mobile agents with distinct maximal speeds J Czyzowicz, L Gąsieniec, A Kosowski, E Kranakis European Symposium on Algorithms, 701-712, 2011 | 119 | 2011 |
| Classical coloring of graphs A Kosowski, K Manuszewski Contemporary Mathematics 352, 1-20, 2004 | 111 | 2004 |
| Fast collaborative graph exploration D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański Information and Computation 243, 37-49, 2015 | 108 | 2015 |
| Constructing a map of an anonymous graph: Applications of universal sequences J Chalopin, S Das, A Kosowski International Conference On Principles Of Distributed Systems, 119-134, 2010 | 72 | 2010 |
| Euler tour lock-in problem in the rotor-router model: I choose pointers and you choose port numbers E Bampas, L Gąsieniec, N Hanusse, D Ilcinkas, R Klasing, A Kosowski International Symposium on Distributed Computing, 423-435, 2009 | 69* | 2009 |
| On the complexity of distributed graph coloring with local minimality constraints C Gavoille, R Klasing, A Kosowski, Ł Kuszner, A Navarra Networks 54 (1), 12-19, 2009 | 66* | 2009 |
| What can be observed locally? Round-based models for quantum distributed computing C Gavoille, A Kosowski, M Markiewicz International Symposium on Distributed Computing, 243-257, 2009 | 64 | 2009 |
| A locally-blazed ant trail achieves efficient collective navigation despite limited information E Fonio, Y Heyman, L Boczkowski, A Gelblum, A Kosowski, A Korman, ... Elife 5, e20185, 2016 | 57 | 2016 |
| Optimal patrolling of fragmented boundaries A Collins, J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, D Krizanc, ... Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013 | 55 | 2013 |
| Population protocols are fast A Kosowski, P Uznański arXiv preprint arXiv:1802.06872, 2018 | 54* | 2018 |
| Beyond highway dimension: small distance labels using tree skeletons A Kosowski, L Viennot Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 52 | 2017 |
| Non-classicality of temporal correlations S Brierley, A Kosowski, M Markiewicz, T Paterek, A Przysiezna arXiv preprint arXiv:1501.03505, 2015 | 49 | 2015 |
| Cost minimization in wireless networks with a bounded and unbounded number of interfaces R Klasing, A Kosowski, A Navarra Networks 53 (3), 266-275, 2009 | 48* | 2009 |
| Application of an online judge & contester system in academic tuition A Kosowski, M Małafiejski, T Noiński International Conference on Web-Based Learning, 343-354, 2007 | 46 | 2007 |
| Synchronous rendezvous for location-aware agents A Collins, J Czyzowicz, L Gąsieniec, A Kosowski, R Martin International Symposium on Distributed Computing, 447-459, 2011 | 43 | 2011 |
| When patrolmen become corrupted: Monitoring a graph using faulty mobile robots J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, D Krizanc, N Taleb Algorithmica 79 (3), 925-940, 2017 | 41 | 2017 |
| k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth A Kosowski, B Li, N Nisse, K Suchan Algorithmica, 2015 | 41 | 2015 |
Przemysław UznańskiPathwayVerified email at pathway.com
