Hanna Furmanczyk
Orcid: 0000-0001-8057-4108
According to our database1,
Hanna Furmanczyk
authored at least 25 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Discret. Appl. Math., 2024
Comput. Oper. Res., 2024
2023
Adjacent vertex distinguishing total coloring of corona products (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022
2021
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs.
Discret. Math. Theor. Comput. Sci., 2021
Discuss. Math. Graph Theory, 2021
2020
CoRR, 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
2019
2018
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs.
Discret. Appl. Math., 2018
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines.
Discret. Appl. Math., 2018
2017
Discuss. Math. Graph Theory, 2017
2016
Discret. Appl. Math., 2016
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines.
CoRR, 2016
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring.
Ars Math. Contemp., 2016
2015
Batch processing of unit-length jobs with cubic incompatibility graphs on three uniform machines.
CoRR, 2015
2009
2008
2007
Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2007