default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Kubale
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j30]Tytus Pikies
, Krzysztof Turowski, Marek Kubale:
Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms. Artif. Intell. 309: 103711 (2022)- 2021
- [c11]Tytus Pikies, Krzysztof Turowski, Marek Kubale:
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. ICAPS 2021: 262-270 - 2020
- [j29]Tytus Pikies, Marek Kubale:
Chromatic cost coloring of weighted bipartite graphs. Appl. Math. Comput. 375: 125073 (2020) - [j28]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) - [i7]Tytus Pikies, Krzysztof Turowski, Marek Kubale:
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. CoRR abs/2010.13207 (2020)
2010 – 2019
- 2018
- [j27]Hanna Furmanczyk, Marek Kubale:
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines. Discret. Appl. Math. 234: 210-217 (2018) - [j26]Hanna Furmanczyk, Marek Kubale:
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs. Discret. Appl. Math. 237: 116-122 (2018) - 2017
- [j25]Hanna Furmanczyk, Marek Kubale, Vahan Mkrtchyan:
Equitable colorings of corona multiproducts of graphs. Discuss. Math. Graph Theory 37(4): 1079-1094 (2017) - [i6]Hanna Furmanczyk, Marek Kubale:
Equitable Colorings of l-Corona Products of Cubic Graphs. CoRR abs/1704.05929 (2017) - 2016
- [j24]Hanna Furmanczyk, Marek Kubale:
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring. Ars Math. Contemp. 10(2): 333-347 (2016) - [j23]Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski:
On bipartization of cubic graphs by removal of an independent set. Discret. Appl. Math. 209: 115-121 (2016) - [i5]Hanna Furmanczyk, Marek Kubale:
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines. CoRR abs/1602.01867 (2016) - 2015
- [i4]Hanna Furmanczyk, Marek Kubale:
Batch processing of unit-length jobs with cubic incompatibility graphs on three uniform machines. CoRR abs/1502.04240 (2015) - 2014
- [i3]Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski:
On bipartization of cubic graphs by removal of an independent set. CoRR abs/1406.2728 (2014) - [i2]Hanna Furmanczyk, Marek Kubale:
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring. CoRR abs/1409.0650 (2014) - 2012
- [i1]Hanna Furmanczyk, Marek Kubale, Vahan V. Mkrtchyan:
Equitable Colorings of Corona Multiproducts of Graphs. CoRR abs/1210.6568 (2012)
2000 – 2009
- 2009
- [j22]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) - [j21]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) - 2008
- [c10]Jacek Dabrowski, Marek Kubale:
Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem. IPDPS 2008: 1-6 - 2006
- [j20]Tomasz Dzido, Marek Kubale, Konrad Piwakowski:
On Some Ramsey and Turan-Type Numbers for Paths and Cycles. Electron. J. Comb. 13(1) (2006) - [j19]Dariusz Dereniowski, Marek Kubale:
Efficient Parallel Query Processing by Graph Ranking. Fundam. Informaticae 69(3): 273-285 (2006) - 2005
- [j18]Marek Kubale, Adam Nadolski:
Chromatic scheduling in a cyclic open shop. Eur. J. Oper. Res. 164(3): 585-591 (2005) - [c9]Dariusz Dereniowski, Marek Kubale:
Parallel Query Processing and Edge Ranking of Graphs. PPAM 2005: 463-469 - [c8]Krzysztof Giaro, Marek Kubale:
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. PPAM 2005: 855-862 - 2004
- [j17]Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40(4): 235-244 (2004) - [j16]Krzysztof Giaro, Marek Kubale:
Compact scheduling of zero-one time operations in multi-stage systems. Discret. Appl. Math. 145(1): 95-103 (2004) - [c7]Jennie C. Hansen, Marek Kubale, Lukasz Kuszner, Adam Nadolski:
Distributed Largest-First Algorithm for Graph Coloring. Euro-Par 2004: 804-811 - 2003
- [c6]Dariusz Dereniowski, Marek Kubale:
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. PPAM 2003: 985-992 - 2002
- [j15]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) - [c5]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 - [c4]Marek Kubale, Lukasz Kuszner:
A Better Practical Algorithm for Distributed Graph Coloring. PARELEC 2002: 72-75 - 2001
- [j14]Krzysztof Giaro, Marek Kubale, Michal Malafiejski:
Consecutive colorings of the edges of general graphs. Discret. Math. 236(1-3): 131-143 (2001) - [j13]Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR. Discret. Math. 236(1-3): 151-165 (2001) - [c3]Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. PPAM 2001: 87-96 - 2000
- [j12]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
- [j11]Krzysztof Giaro, Marek Kubale, Michal Malafiejski:
On the Deficiency of Bipartite Graphs. Discret. Appl. Math. 94(1-3): 193-203 (1999) - 1997
- [j10]Marek Kubale:
Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. Discret. Appl. Math. 76(1-3): 213-223 (1997) - [j9]Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski:
The smallest hard-to-color graph for the SL algorithm. Discret. Math. 164(1-3): 197-212 (1997) - [c2]Andrzej Jajszczyk, Marek Kubale:
Repackable networks-The concept and applications. Advances in Switching Networks 1997: 75-83 - 1996
- [j8]Marek Kubale, Konrad Piwakowski:
A linear time algorithm for edge coloring of binomial trees. Discret. Math. 150(1-3): 247-256 (1996) - 1993
- [j7]Marek Kubale:
Interval edge coloring of a graph with forbidden colors. Discret. Math. 121(1-3): 135-143 (1993) - 1992
- [j6]Marek Kubale:
Some results concerning the complexity of restricted colorings of graphs. Discret. Appl. Math. 36(1): 35-46 (1992)
1980 – 1989
- 1989
- [j5]Marek Kubale:
Interval vertex-coloring of a graph with forbidden colors. Discret. Math. 74(1-2): 125-136 (1989) - 1987
- [j4]Marek Kubale:
The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. Inf. Process. Lett. 24(3): 141-147 (1987) - 1985
- [j3]Marek Kubale, Boguslaw Jackowski:
A Generalized Implicit Enumeration Algorithm for Graph Coloring. Commun. ACM 28(4): 412-418 (1985) - [j2]Henryk Krawczyk, Marek Kubale:
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems. IEEE Trans. Computers 34(9): 869-872 (1985) - 1983
- [c1]Marek Kubale, E. Kusz:
Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring. WG 1983: 167-176 - 1982
- [j1]Marek Kubale:
Comments on "Decomposition of Permutation Networks". IEEE Trans. Computers 31(3): 265 (1982)
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-04-25 05:51 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:
