default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof Giaro
Person information
- affiliation: Gdansk University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Damian Bogdanowicz
, Krzysztof Giaro:
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages. J. Comput. Biol. 30(3): 261-276 (2023)- 2020
- [j17]Krzysztof Giaro, Marek Kubale:
A note on polynomial algorithm for cost coloring of bipartite graphs with ? \le 4. Discuss. Math. Graph Theory 40(3): 885-891 (2020)
2010 – 2019
- 2017
- [j16]Damian Bogdanowicz, Krzysztof Giaro:
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions. J. Comput. Biol. 24(5): 422-435 (2017) - 2013
- [j15]Damian Bogdanowicz, Krzysztof Giaro:
On a matching distance between rooted phylogenetic trees. Int. J. Appl. Math. Comput. Sci. 23(3): 669-684 (2013) - 2012
- [j14]Damian Bogdanowicz, Krzysztof Giaro:
Matching Split Distance for Unrooted Binary Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 150-160 (2012) - 2011
- [j13]Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski:
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem. Theor. Comput. Sci. 412(35): 4721-4728 (2011)
2000 – 2009
- 2009
- [j12]Krzysztof Giaro, Marek Kubale, Pawel Obszarski:
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. Discret. Appl. Math. 157(17): 3625-3630 (2009) - [j11]Krzysztof Giaro, Marek Kubale:
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. Discuss. Math. Graph Theory 29(2): 361-376 (2009) - 2005
- [c3]Krzysztof Giaro, Marek Kubale:
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. PPAM 2005: 855-862 - 2004
- [j10]Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40(4): 235-244 (2004) - [j9]Krzysztof Giaro, Marek Kubale:
Compact scheduling of zero-one time operations in multi-stage systems. Discret. Appl. Math. 145(1): 95-103 (2004) - 2003
- [j8]Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129(2-3): 361-369 (2003) - [j7]Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129(2-3): 371-382 (2003) - 2002
- [j6]Krzysztof Giaro, Marek Kubale, Konrad Piwakowski:
Complexity results on open shop scheduling to minimize total cost of operations. Int. J. Comput. Syst. Signals 3(2): 84-91 (2002) - [c2]Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX 2002: 135-145 - 2001
- [j5]Krzysztof Giaro, Marek Kubale, Michal Malafiejski:
Consecutive colorings of the edges of general graphs. Discret. Math. 236(1-3): 131-143 (2001) - [j4]Krzysztof Giaro:
NP-hardness of compact scheduling in simplified open and flow shops. Eur. J. Oper. Res. 130(1): 90-98 (2001) - [c1]Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. PPAM 2001: 87-96 - 2000
- [j3]Krzysztof Giaro, Marek Kubale:
Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75(1-2): 65-69 (2000)
1990 – 1999
- 1999
- [j2]Krzysztof Giaro, Marek Kubale, Michal Malafiejski:
On the Deficiency of Bipartite Graphs. Discret. Appl. Math. 94(1-3): 193-203 (1999) - 1997
- [j1]Krzysztof Giaro:
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Comb. 47 (1997)
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-09-09 01:16 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:
