default search action
Krzysztof Turowski
Person information
- affiliation: Jagiellonian University, Kraków, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Hanna Furmanczyk
, Tytus Pikies, Inka Sokolowska, Krzysztof Turowski:
Approximation algorithms for job scheduling with block-type conflict graphs. Comput. Oper. Res. 166: 106606 (2024) - [j18]Alan M. Frieze
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. 38(1): 988-1006 (2024) - 2023
- [j17]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
Edge coloring of graphs of signed class 1 and 2. Discret. Appl. Math. 338: 311-319 (2023) - [i8]Pawel Obszarski, Krzysztof Turowski, Hubert Zieba:
The Game Chromatic Number of Complete Multipartite Graphs with No Singletons. CoRR abs/2304.12073 (2023) - [i7]Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the concentration of the maximum degree in the duplication-divergence models. CoRR abs/2308.04336 (2023) - [i6]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of products of signed graphs. CoRR abs/2312.02691 (2023) - 2022
- [j16]Tytus Pikies
Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms. Artif. Intell. 309: 103711 (2022) - [j15]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
Infinite chromatic games. Discret. Appl. Math. 309: 138-146 (2022) - [j14]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
Weighted 2-sections and hypergraph reconstruction. Theor. Comput. Sci. 915: 11-25 (2022) - [i5]Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of graphs of signed class 1 and 2. CoRR abs/2205.15425 (2022) - [i4]Hanna Furmanczyk, Tytus Pikies, Inka Sokolowska, Krzysztof Turowski:
Task scheduling for block-type conflict graphs. CoRR abs/2207.05868 (2022) - 2021
- [j13]Krzysztof Turowski, Wojciech Szpankowski:
Towards Degree Distribution of a Duplication-Divergence Graph Model. Electron. J. Comb. 28(1): 1 (2021) - [j12]Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski:
T-colorings, divisibility and circular chromatic number. Discuss. Math. Graph Theory 41(2): 441-450 (2021) - [j11]Jithin K. Sreedharan
Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries. IEEE ACM Trans. Comput. Biol. Bioinform. 18(3): 836-849 (2021) - [j10]Krzysztof Turowski, Jithin K. Sreedharan
Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-Supervised Learning Algorithms. IEEE Trans. Netw. Sci. Eng. 8(2): 1426-1442 (2021) - [c9]Tytus Pikies, Krzysztof Turowski, Marek Kubale:
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. ICAPS 2021: 262-270 - [c8]Alan M. Frieze
The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON 2021: 413-424 - [i3]Krzysztof Michalik, Krzysztof Turowski:
On λ-backbone coloring of cliques with tree backbones in linear time. CoRR abs/2107.05772 (2021) - 2020
- [j9]Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model. Algorithmica 82(9): 2687-2707 (2020) - [c7]Philippe Jacquet, Krzysztof Turowski
Power-Law Degree Distribution in the Connected Component of a Duplication Graph. AofA 2020: 16:1-16:14 - [c6]Krzysztof Turowski
Temporal Ordered Clustering in Dynamic Networks. ISIT 2020: 1349-1354 - [c5]Alan M. Frieze
Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG 2020: 226-237 - [i2]Tytus Pikies, Krzysztof Turowski, Marek Kubale:
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. CoRR abs/2010.13207 (2020)
2010 – 2019
- 2019
- [j8]Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
2-Coloring number revisited. Theor. Comput. Sci. 796: 187-195 (2019) - [c4]Krzysztof Turowski
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution. ISIT 2019: 1517-1521 - [i1]Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski:
Temporal Ordered Clustering in Dynamic Networks. CoRR abs/1905.00672 (2019) - 2018
- [j7]Abram Magner
Lossless Compression of Binary Trees With Correlated Vertex Names. IEEE Trans. Inf. Theory 64(9): 6070-6080 (2018) - [c3]Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model. Allerton 2018: 1089-1096 - 2017
- [c2]Jacek Cichon
On Symmetries of Non-Plane Trees in a Non-Uniform Model. ANALCO 2017: 156-163 - 2016
- [j6]Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs. Inf. Process. Lett. 116(1): 26-32 (2016) - [j5]Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti. J. Comb. Optim. 31(4): 1373-1382 (2016) - [c1]Abram Magner, Krzysztof Turowski
Lossless compression of binary trees with correlated vertex names. ISIT 2016: 1217-1221 - 2015
- [j4]Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discret. Appl. Math. 184: 237-242 (2015) - [j3]Krzysztof Turowski
Optimal backbone coloring of split graphs with matching backbones. Discuss. Math. Graph Theory 35(1): 157-169 (2015) - [j2]Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones. Graphs Comb. 31(5): 1487-1496 (2015) - [j1]Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. Inf. Process. Lett. 115(2): 232-236 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: