( en | de | ru )

 

Disambiguation of "Kosowski, Adrian"

Author of the publication

copydeleteadd this publication to your clipboard
On Bounded Load Routings for Modeling k-Regular Connection Topologies.

, , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 614-623. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kornelia Kosowski

Alexander Kosowski

Heinrich Kosowski

Kai Kosowski

Nicole Adrian

 

Other publications of authors with the same name

On Bounded Load Routings for Modeling k-Regular Connection Topologies., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 614-623. Springer, (2005)Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds., , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 701-712. Springer, (2011)A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves., and . PPAM, volume 3911 of Lecture Notes in Computer Science, page 75-82. Springer, (2005)Energy Optimisation in Resilient Self-Stabilizing Processes., and . PARELEC, page 105-110. IEEE Computer Society, (2006)On the Power of Louvain in the Stochastic Block Model., , , and . NeurIPS, (2020)A note on the strength and minimum color sum of bipartite graphs.. Discret. Appl. Math., 157 (11): 2552-2554 (2009)Cost Minimisation in Unbounded Multi-interface Networks., and . PPAM, volume 4967 of Lecture Notes in Computer Science, page 1039-1047. Springer, (2007)How to meet when you forget: log-space rendezvous in arbitrary graphs., , and . PODC, page 450-459. ACM, (2010)Time vs. space trade-offs for rendezvous in trees., , and . SPAA, page 1-10. ACM, (2012)What Can Be Observed Locally?, , and . DISC, volume 5805 of Lecture Notes in Computer Science, page 243-257. Springer, (2009)