( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Weakly Cooperative Guards in Grids.

, и . ICCSA (1), том 3480 из Lecture Notes in Computer Science, стр. 647-656. 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.

Michal Goldmann

Michal Vorel

Michal Buryan

Michal Ratajski

Michal Grochol

 

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

Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees., , , и . ISAAC, том 212 из LIPIcs, стр. 26:1-26:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Global edge alliances in graphs., , , и . Discret. Appl. Math., (2019)Parallel Processing Subsystems with Redundancy in a Distributed Environment., , и . PPAM, том 3911 из Lecture Notes in Computer Science, стр. 1002-1009. Springer, (2005)Interval incidence coloring of bipartite graphs., , и . Discret. Appl. Math., (2014)Fault Tolerant Guarding of Grids., , и . ICCSA (1), том 3980 из Lecture Notes in Computer Science, стр. 161-170. Springer, (2006)Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time., , , и . PPAM, том 2328 из Lecture Notes in Computer Science, стр. 87-96. Springer, (2001)An Improved Strategy for Exploring a Grid Polygon., , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 222-236. Springer, (2009)Application of an Online Judge & Contester System in Academic Tuition., , и . ICWL, том 4823 из Lecture Notes in Computer Science, стр. 343-354. Springer, (2007)A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs., , , и . APPROX, том 2462 из Lecture Notes in Computer Science, стр. 135-145. Springer, (2002)An Efficient Algorithm for Mobile Guarded Guards in Simple Grids., , и . ICCSA (1), том 3980 из Lecture Notes in Computer Science, стр. 141-150. Springer, (2006)