( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.

, , и . PPAM, том 4967 из Lecture Notes in Computer Science, стр. 1001-1008. Springer, (2007)

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.

Kornelia Kosowski

Alexander Kosowski

Kai Kosowski

Heinrich Kosowski

Nicole Adrian

 

Другие публикации лиц с тем же именем

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