Miroslaw Dynia

According to our database, Miroslaw Dynia authored at least 8 papers between 2005 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Collective graph exploration

Miroslaw Dynia

PhD thesis, 2007

Local strategies for maintaining a chain of relay stations between an explorer and a base station.

Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.

Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Why Robots Need Maps.

Miroslaw Dynia, Jakub Lopuszanski, Christian Schindelhauer

Proceedings of the Structural Information and Communication Complexity, 2007

2006

Smart Robot Teams Exploring Sparse Trees.

Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Maintaining Communication Between an Explorer and a Base Station.

Miroslaw Dynia, Jaroslaw Kutylowski, Pawel Lorek, Friedhelm Meyer auf der Heide

Proceedings of the Biologically Inspired Cooperative Computing, 2006

Power-Aware Collective Tree Exploration.

Miroslaw Dynia, Miroslaw Korzeniowski, Christian Schindelhauer

Proceedings of the Architecture of Computing Systems, 2006

2005

Improved Algorithms for Dynamic Page Migration.

Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski

Proceedings of the STACS 2005, 2005