Krzysztof Turowski

SIAM J. Discret. Math., March, 2024

2023

Edge coloring of graphs of signed class 1 and 2.

[BibT_eX]

[DOI]

Bartlomiej Wróblewski

Discret. Appl. Math., October, 2023

Edge coloring of products of signed graphs.

[BibT_eX]

[DOI]

Bartlomiej Wróblewski

CoRR, 2023

The Game Chromatic Number of Complete Multipartite Graphs with No Singletons.

[BibT_eX]

[DOI]

Hubert Zieba

CoRR, 2023

2022

Weighted 2-sections and hypergraph reconstruction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Infinite chromatic games.

[BibT_eX]

[DOI]

Bartlomiej Wróblewski

Discret. Appl. Math., 2022

Task scheduling for block-type conflict graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms.

[BibT_eX]

[DOI]

Tytus Pikies

Marek Kubale

Artif. Intell., 2022

2021

Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-Supervised Learning Algorithms.

[BibT_eX]

[DOI]

Jithin K. Sreedharan

IEEE Trans. Netw. Sci. Eng., 2021

Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries.

[BibT_eX]

[DOI]

Jithin K. Sreedharan

IEEE ACM Trans. Comput. Biol. Bioinform., 2021

<i>T</i>-colorings, divisibility and circular chromatic number.

[BibT_eX]

[DOI]

Anna Maria Trzaskowska

Discuss. Math. Graph Theory, 2021

On λ-backbone coloring of cliques with tree backbones in linear time.

[BibT_eX]

[DOI]

Krzysztof Michalik

CoRR, 2021

Towards Degree Distribution of a Duplication-Divergence Graph Model.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines.

[BibT_eX]

[DOI]

Tytus Pikies

Marek Kubale

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Compression of Dynamic Graphs Generated by a Duplication Model.

[BibT_eX]

[DOI]

Abram Magner

Algorithmica, 2020

Degree Distribution for Duplication-Divergence Graphs: Large Deviations.

[BibT_eX]

[DOI]

Alan M. Frieze

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Temporal Ordered Clustering in Dynamic Networks.

[BibT_eX]

[DOI]

Jithin K. Sreedharan

Proceedings of the IEEE International Symposium on Information Theory, 2020

Power-Law Degree Distribution in the Connected Component of a Duplication Graph.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

2-Coloring number revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Asymptotics of Entropy of the Dirichlet-Multinomial Distribution.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Lossless Compression of Binary Trees With Correlated Vertex Names.

[BibT_eX]

[DOI]

Abram Magner

IEEE Trans. Inf. Theory, 2018

2017

On Symmetries of Non-Plane Trees in a Non-Uniform Model.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

An O(n log n) algorithm for finding edge span of cacti.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

On the hardness of computing span of subcubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

2015

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

The Backbone Coloring Problem for Bipartite Backbones.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Optimal backbone coloring of split graphs with matching backbones.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

The computational complexity of the backbone coloring problem for planar graphs with connected backbones.

[BibT_eX]

[DOI]