( en | de | ru )

 

Disambiguation of "Malafiejski, Michal"

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.

Michal Olszewski

Michal Pejko

Michal Fic

Michal Novotny

Michal Ratajski

 

Other publications of authors with the same name

Global edge alliances in graphs., , , and . Discret. Appl. Math., (2019)Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph., , and . Graphs Comb., 24 (5): 461-468 (2008)Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees., , , and . ISAAC, volume 212 of LIPIcs, page 26:1-26:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time., , , and . PPAM, volume 2328 of Lecture Notes in Computer Science, page 87-96. Springer, (2001)An Improved Strategy for Exploring a Grid Polygon., , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 222-236. Springer, (2009)On incidence coloring of complete multipartite and semicubic bipartite graphs., , and . Discussiones Mathematicae Graph Theory, 38 (1): 107-119 (2018)Application of an Online Judge & Contester System in Academic Tuition., , and . ICWL, volume 4823 of Lecture Notes in Computer Science, page 343-354. Springer, (2007)On the Deficiency of Bipartite Graphs., , and . Discret. Appl. Math., 94 (1-3): 193-203 (1999)A polynomial algorithm for some preemptive multiprocessor task scheduling problems., and . Eur. J. Oper. Res., 176 (1): 145-150 (2007)Parallel Processing Subsystems with Redundancy in a Distributed Environment., , and . PPAM, volume 3911 of Lecture Notes in Computer Science, page 1002-1009. Springer, (2005)