Comments on "Decomposition of Permutation Networks". - Marek Kubale (IEEE Trans. Computers, 1982)

Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring. - Marek Kubale; E. Kusz (WG, 1983)

A Generalized Implicit Enumeration Algorithm for Graph Coloring. - Marek Kubale; Boguslaw Jackowski (Commun. ACM, 1985)

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems. - Henryk Krawczyk; Marek Kubale (IEEE Trans. Computers, 1985)

The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. - Marek Kubale (Inf. Process. Lett., 1987)

Interval vertex-coloring of a graph with forbidden colors. - Marek Kubale (Discret. Math., 1989)

Some results concerning the complexity of restricted colorings of graphs. - Marek Kubale (Discret. Appl. Math., 1992)

Interval edge coloring of a graph with forbidden colors. - Marek Kubale (Discret. Math., 1993)

A linear time algorithm for edge coloring of binomial trees. - Marek Kubale; Konrad Piwakowski (Discret. Math., 1996)

Repackable networks-The concept and applications. - Andrzej Jajszczyk; Marek Kubale (Advances in Switching Networks, 1997)

Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. - Marek Kubale (Discret. Appl. Math., 1997)

The smallest hard-to-color graph for the SL algorithm. - Marek Kubale; Jaroslaw Pakulski; Konrad Piwakowski (Discret. Math., 1997)

On the Deficiency of Bipartite Graphs. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski (Discret. Appl. Math., 1999)

Edge-chromatic sum of trees and bounded cyclicity graphs. - Krzysztof Giaro; Marek Kubale (Inf. Process. Lett., 2000)

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski; Konrad Piwakowski (PPAM, 2001)

Consecutive colorings of the edges of general graphs. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski (Discret. Math., 2001)

The smallest hard-to-color graph for algorithm DSATUR. - Robert Janczewski; Marek Kubale; Krzysztof Manuszewski; Konrad Piwakowski (Discret. Math., 2001)

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. - Krzysztof Giaro; Robert Janczewski; Marek Kubale; Michal Malafiejski (APPROX, 2002)

A Better Practical Algorithm for Distributed Graph Coloring. - Marek Kubale; Lukasz Kuszner (PARELEC, 2002)

Complexity results on open shop scheduling to minimize total cost of operations. - Krzysztof Giaro; Marek Kubale; Konrad Piwakowski (Int. J. Comput. Syst. Signals, 2002)

Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. - Dariusz Dereniowski; Marek Kubale (PPAM, 2003)

Distributed Largest-First Algorithm for Graph Coloring. - Jennie C. Hansen; Marek Kubale; Lukasz Kuszner; Adam Nadolski (Euro-Par, 2004)

Sum Coloring of Bipartite Graphs with Bounded Degree. - Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale (Algorithmica, 2004)

Compact scheduling of zero-one time operations in multi-stage systems. - Krzysztof Giaro; Marek Kubale (Discret. Appl. Math., 2004)

Parallel Query Processing and Edge Ranking of Graphs. - Dariusz Dereniowski; Marek Kubale (PPAM, 2005)

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. - Krzysztof Giaro; Marek Kubale (PPAM, 2005)

Chromatic scheduling in a cyclic open shop. - Marek Kubale; Adam Nadolski (Eur. J. Oper. Res., 2005)

On Some Ramsey and Turan-Type Numbers for Paths and Cycles. - Tomasz Dzido; Marek Kubale; Konrad Piwakowski (Electron. J. Comb., 2006)

Efficient Parallel Query Processing by Graph Ranking. - Dariusz Dereniowski; Marek Kubale (Fundam. Informaticae, 2006)

Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem. - Jacek Dabrowski 003; Marek Kubale (IPDPS, 2008)

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. - Krzysztof Giaro; Marek Kubale; Pawel Obszarski (Discret. Appl. Math., 2009)

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. - Krzysztof Giaro; Marek Kubale (Discuss. Math. Graph Theory, 2009)

Batch processing of unit-length jobs with cubic incompatibility graphs on three uniform machines. - Hanna Furmanczyk; Marek Kubale (CoRR, 2015)

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring. - Hanna Furmanczyk; Marek Kubale (Ars Math. Contemp., 2016)

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines. - Hanna Furmanczyk; Marek Kubale (CoRR, 2016)

On bipartization of cubic graphs by removal of an independent set. - Hanna Furmanczyk; Marek Kubale; Stanislaw P. Radziszowski (Discret. Appl. Math., 2016)

Equitable Colorings of l-Corona Products of Cubic Graphs. - Hanna Furmanczyk; Marek Kubale (CoRR, 2017)

Equitable colorings of corona multiproducts of graphs. - Hanna Furmanczyk; Marek Kubale; Vahan Mkrtchyan (Discuss. Math. Graph Theory, 2017)

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines. - Hanna Furmanczyk; Marek Kubale (Discret. Appl. Math., 2018)

Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs. - Hanna Furmanczyk; Marek Kubale (Discret. Appl. Math., 2018)

Chromatic cost coloring of weighted bipartite graphs. - Tytus Pikies; Marek Kubale (Appl. Math. Comput., 2020)

A note on polynomial algorithm for cost coloring of bipartite graphs with ? le 4. - Krzysztof Giaro; Marek Kubale (Discuss. Math. Graph Theory, 2020)

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. - Tytus Pikies; Krzysztof Turowski; Marek Kubale (ICAPS, 2021)

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms. - Tytus Pikies; Krzysztof Turowski; Marek Kubale (Artif. Intell., 2022)