According to our database1, Lukasz Kuszner
Legend:Book In proceedings Article PhD thesis Other
Toward fast calculation of communication paths for resilient routing.
Temporal Flows in Temporal Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
Flows in Temporal networks.
Distributed Evacuation in Graphs with Multiple Exits.
Proceedings of the Structural Information and Communication Complexity, 2016
Network graph transformation providing fast calculation of paths for resilient routing.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016
Rendezvous of heterogeneous mobile agents in edge-weighted networks.
Theor. Comput. Sci., 2015
Distributed graph searching with a sense of direction.
Distributed Computing, 2015
Deterministic Rendezvous in Restricted Graphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks.
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks.
Proceedings of the Structural Information and Communication Complexity, 2014
On the complexity of distributed graph coloring with local minimality constraints.
A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
European Journal of Operational Research, 2007
Energy Optimisation in Resilient Self-Stabilizing Processes.
Proceedings of the Fifth International Conference on Parallel Computing in Electrical Engineering (PARELEC 2006), 2006
Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees.
Proceedings of the Artificial Intelligence and Soft Computing, 2006
On Greedy Graph Coloring in the Distributed Model.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006
A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.
Proceedings of the Parallel Processing and Applied Mathematics, 2005
Distributed Largest-First Algorithm for Graph Coloring.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004
A Better Practical Algorithm for Distributed Graph Coloring.
Proceedings of the 2002 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2002), 2002