Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Marek Kubale
2010 – today
- 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, P. Obszarski: A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. Discrete Applied Mathematics 157(17): 3625-3630 (2009)
- [j21]Krzysztof Giaro, Marek Kubale: Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. Discussiones Mathematicae Graph Theory 29(2): 361-376 (2009)
- 2008
- [c8]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. Electr. J. Comb. 13(1) (2006)
- [j19]Dariusz Dereniowski, Marek Kubale: Efficient Parallel Query Processing by Graph Ranking. Fundam. Inform. 69(3): 273-285 (2006)
- 2005
- [j18]Marek Kubale, Adam Nadolski: Chromatic scheduling in a cyclic open shop. European Journal of Operational Research 164(3): 585-591 (2005)
- [c7]Dariusz Dereniowski, Marek Kubale: Parallel Query Processing and Edge Ranking of Graphs. PPAM 2005: 463-469
- [c6]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. Discrete Applied Mathematics 145(1): 95-103 (2004)
- [c5]Jennie C. Hansen, Marek Kubale, Lukasz Kuszner, Adam Nadolski: Distributed Largest-First Algorithm for Graph Coloring. Euro-Par 2004: 804-811
- 2003
- [c4]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. Signal 3(2): 84-91 (2002)
- [c3]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
- [c2]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. Discrete Mathematics 236(1-3): 131-143 (2001)
- [j13]Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski: The smallest hard-to-color graph for algorithm DSATUR. Discrete Mathematics 236(1-3): 151-165 (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
- [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. Discrete Applied Mathematics 94(1-3): 193-203 (1999)
- 1997
- [j10]Marek Kubale: Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. Discrete Applied Mathematics 76(1-3): 213-223 (1997)
- [j9]Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski: The smallest hard-to-color graph for the SL algorithm. Discrete Mathematics 164(1-3): 197-212 (1997)
- 1996
- [j8]Marek Kubale, Konrad Piwakowski: A linear time algorithm for edge coloring of binomial trees. Discrete Mathematics 150(1-3): 247-256 (1996)
- 1993
- [j7]Marek Kubale: Interval edge coloring of a graph with forbidden colors. Discrete Mathematics 121(1-3): 135-143 (1993)
- 1992
- [j6]Marek Kubale: Some results concerning the complexity of restricted colorings of graphs. Discrete Applied Mathematics 36(1): 35-46 (1992)
1980 – 1989
- 1989
- [j5]Marek Kubale: Interval vertex-coloring of a graph with forbidden colors. Discrete Mathematics 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)
- 1982
- [j1]Marek Kubale: Comments on ``Decomposition of Permutation Networks''. IEEE Trans. Computers 31(3): 265 (1982)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:42 CET by the dblp team