Marek Kubale - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2022

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithmsTytus Pikies, Krzysztof Turowski, Marek Kubale. ai, 309:103711, 2022. [doi]

2021

Scheduling with Complete Multipartite Incompatibility Graph on Parallel MachinesTytus Pikies, Krzysztof Turowski, Marek Kubale. aips 2021: 262-270 [doi]

2020

? \le 4Krzysztof Giaro, Marek Kubale. dmgt, 40(3):885-891, 2020. [doi]

Chromatic cost coloring of weighted bipartite graphsTytus Pikies, Marek Kubale. amc, 375:125073, 2020. [doi]

2018

Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphsHanna Furmanczyk, Marek Kubale. DAM, 237:116-122, 2018. [doi]

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machinesHanna Furmanczyk, Marek Kubale. DAM, 234:210-217, 2018. [doi]

2017

Equitable colorings of corona multiproducts of graphsHanna Furmanczyk, Marek Kubale, Vahan Mkrtchyan. dmgt, 37(4):1079-1094, 2017. [doi]

2016

Equitable coloring of corona products of cubic graphs is harder than ordinary coloringHanna Furmanczyk, Marek Kubale. arsmc, 10(2):333-347, 2016. [doi]

On bipartization of cubic graphs by removal of an independent setHanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski. DAM, 209:115-121, 2016. [doi]

2009

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraintsKrzysztof Giaro, Marek Kubale, P. Obszarski. DAM, 157(17):3625-3630, 2009. [doi]

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphsKrzysztof Giaro, Marek Kubale. dmgt, 29(2):361-376, 2009. [doi]

2008

Computer experiments with a parallel clonal selection algorithm for the Graph Coloring ProblemJacek Dabrowski, Marek Kubale. ipps 2008: 1-6 [doi]

2006

Efficient Parallel Query Processing by Graph RankingDariusz Dereniowski, Marek Kubale. FUIN, 69(3):273-285, 2006. [doi]

On Some Ramsey and Turan-Type Numbers for Paths and CyclesTomasz Dzido, Marek Kubale, Konrad Piwakowski. combinatorics, 13(1), 2006. [doi]

2005

Parallel Query Processing and Edge Ranking of GraphsDariusz Dereniowski, Marek Kubale. ppam 2006: 463-469 [doi]

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability ConstraintsKrzysztof Giaro, Marek Kubale. ppam 2006: 855-862 [doi]

Chromatic scheduling in a cyclic open shopMarek Kubale, Adam Nadolski. eor, 164(3):585-591, 2005. [doi]

2004

Compact scheduling of zero-one time operations in multi-stage systemsKrzysztof Giaro, Marek Kubale. DAM, 145(1):95-103, 2004. [doi]

Distributed Largest-First Algorithm for Graph ColoringJennie C. Hansen, Marek Kubale, Lukasz Kuszner, Adam Nadolski. europar 2004: 804-811 [doi]

Sum Coloring of Bipartite Graphs with Bounded DegreeMichal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale. algorithmica, 40(4):235-244, 2004. [doi]

2003

Cholesky Factorization of Matrices in Parallel and Ranking of GraphsDariusz Dereniowski, Marek Kubale. ppam 2004: 985-992 [doi]

2002

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite GraphsKrzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski. approx 2002: 135-145 [doi]

Complexity results on open shop scheduling to minimize total cost of operationsKrzysztof Giaro, Marek Kubale, Konrad Piwakowski. ijcss, 3(2):84-91, 2002. [doi]

A Better Practical Algorithm for Distributed Graph ColoringMarek Kubale, Lukasz Kuszner. parelec 2002: 72-75 [doi]

2001

2000

Edge-chromatic sum of trees and bounded cyclicity graphsKrzysztof Giaro, Marek Kubale. ipl, 75(1-2):65-69, 2000. [doi]

1999

On the Deficiency of Bipartite GraphsKrzysztof Giaro, Marek Kubale, Michal Malafiejski. DAM, 94(1-3):193-203, 1999. [doi]

1997

Repackable networks--The concept and applicationsAndrzej Jajszczyk, Marek Kubale. dimacs 1998: 75-84

The smallest hard-to-color graph for the SL algorithmMarek Kubale, Jaroslaw Pakulski, Konrad Piwakowski. DM, 164(1-3):197-212, 1997. [doi]

Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline IntervalsMarek Kubale. DAM, 76(1-3):213-223, 1997. [doi]

1996

A linear time algorithm for edge coloring of binomial treesMarek Kubale, Konrad Piwakowski. DM, 150(1-3):247-256, 1996. [doi]

1993

Interval edge coloring of a graph with forbidden colorsMarek Kubale. DM, 121(1-3):135-143, 1993. [doi]

1992

Some results concerning the complexity of restricted colorings of graphsMarek Kubale. DAM, 36(1):35-46, 1992. [doi]

1989

Interval vertex-coloring of a graph with forbidden colorsMarek Kubale. DM, 74(1-2):125-136, 1989. [doi]

1987

The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated ProcessorsMarek Kubale. ipl, 24(3):141-147, 1987.

1985

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer SystemsHenryk Krawczyk, Marek Kubale. TC, 34(9):869-872, 1985.

A Generalized Implicit Enumeration Algorithm for Graph ColoringMarek Kubale, Boguslaw Jackowski. CACM, 28(4):412-418, 1985.

1983

Computer Experiences with Implicit Enumeration Algorithms for Graph ColoringMarek Kubale, E. Kusz. wg 1984: 167-176

1982

Comments on Decomposition of Permutation Networks Marek Kubale. TC, 31(3):265, 1982.

Sign in or sign up to see more results.

runs on WebDSL