Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. - Hanna Furmanczyk; Adrian Kosowski; Pawel Zylinski (PPAM, 2007)

A note on mixed tree coloring. - Hanna Furmanczyk; Adrian Kosowski; Pawel Zylinski (Inf. Process. Lett., 2008)

Mixed graph edge coloring. - Hanna Furmanczyk; Adrian Kosowski; Bernard Ries; Pawel Zylinski (Discret. Math., 2009)

Equitable coloring of Kneser graphs. - Robert Fidytek; Hanna Furmanczyk; Pawel Zylinski (Discuss. Math. Graph Theory, 2009)

Equitable total coloring of corona of cubic graphs. - Hanna Furmanczyk (CoRR, 2015)

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)

Equitable coloring of hypergraphs. - Hanna Furmanczyk; Pawel Obszarski (Discret. Appl. Math., 2019)

Equitable d-degenerate Choosability of Graphs. - Ewa Drgas-Burchardt; Hanna Furmanczyk; Elzbieta Sidorowicz (IWOCA, 2020)

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (CoRR, 2020)

Equitable improper choosability of graphs. - Ewa Drgas-Burchardt; Hanna Furmanczyk; Elzbieta Sidorowicz (Theor. Comput. Sci., 2020)

Equitable total coloring of corona of cubic graphs. - Hanna Furmanczyk; Rita Zuazua (Discuss. Math. Graph Theory, 2021)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. - Hanna Furmanczyk; Vahan Mkrtchyan (Discret. Math. Theor. Comput. Sci., 2021)

Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs. - Tytus Pikies; Hanna Furmanczyk (IPDPS, 2022)

Task scheduling for block-type conflict graphs. - Hanna Furmanczyk; Tytus Pikies; Inka Sokolowska; Krzysztof Turowski (CoRR, 2022)

Adjacent vertex distinguishing total coloring of corona products (Brief Announcement). - Hanna Furmanczyk; Rita Zuazua (LAGOS, 2023)

A new approach to b-coloring of regular graphs. - Magda Dettlaff; Hanna Furmanczyk; Iztok Peterin; Adriana Roux; Radoslaw Ziemann (Appl. Math. Comput., 2024)

Approximation algorithms for job scheduling with block-type conflict graphs. - Hanna Furmanczyk; Tytus Pikies; Inka Sokolowska; Krzysztof Turowski (Comput. Oper. Res., 2024)

Gap one bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (Discret. Appl. Math., 2024)

Adjacent vertex distinguishing total coloring of corona product of graphs. - Hanna Furmanczyk; Rita Zuazua (Ars Math. Contemp., 2025)