Marek Kubale

Artif. Intell., 2022

2021

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines.

[BibT_eX]

[DOI]

Tytus Pikies

Krzysztof Turowski

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

A note on polynomial algorithm for cost coloring of bipartite graphs with <i>? \le 4</i>.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Chromatic cost coloring of weighted bipartite graphs.

[BibT_eX]

[DOI]

Tytus Pikies

Appl. Math. Comput., 2020

2018

Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Equitable colorings of corona multiproducts of graphs.

[BibT_eX]

[DOI]

Vahan Mkrtchyan

Discuss. Math. Graph Theory, 2017

Equitable Colorings of l-Corona Products of Cubic Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

On bipartization of cubic graphs by removal of an independent set.

[BibT_eX]

[DOI]

Stanislaw P. Radziszowski

Discret. Appl. Math., 2016

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines.

[BibT_eX]

[DOI]

CoRR, 2016

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

2015

Batch processing of unit-length jobs with cubic incompatibility graphs on three uniform machines.

[BibT_eX]

[DOI]

CoRR, 2015

2009

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints.

[BibT_eX]

[DOI]

Pawel Obszarski

Discret. Appl. Math., 2009

2008

Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem.

[BibT_eX]

[DOI]

Jacek Dabrowski

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2006

Efficient Parallel Query Processing by Graph Ranking.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Fundam. Informaticae, 2006

On Some Ramsey and Turan-Type Numbers for Paths and Cycles.

[BibT_eX]

[DOI]

Tomasz Dzido

Electron. J. Comb., 2006

2005

Chromatic scheduling in a cyclic open shop.

[BibT_eX]

[DOI]

Adam Nadolski

Eur. J. Oper. Res., 2005

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2005

Parallel Query Processing and Edge Ranking of Graphs.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004

Compact scheduling of zero-one time operations in multi-stage systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Sum Coloring of Bipartite Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Algorithmica, 2004

Distributed Largest-First Algorithm for Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003

Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Proceedings of the Parallel Processing and Applied Mathematics, 2003

2002

Complexity results on open shop scheduling to minimize total cost of operations.

[BibT_eX]

[DOI]

Int. J. Comput. Syst. Signals, 2002

A Better Practical Algorithm for Distributed Graph Coloring.

[BibT_eX]

[DOI]

Lukasz Kuszner

Proceedings of the 2002 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2002), 2002

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

The smallest hard-to-color graph for algorithm DSATUR.

[BibT_eX]

[DOI]

Robert Janczewski

Krzysztof Manuszewski

Discret. Math., 2001

Consecutive colorings of the edges of general graphs.

[BibT_eX]

[DOI]

Michal Malafiejski

Discret. Math., 2001

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2001

2000

Edge-chromatic sum of trees and bounded cyclicity graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1999

On the Deficiency of Bipartite Graphs.

[BibT_eX]

[DOI]

Michal Malafiejski

Discret. Appl. Math., 1999

1997

The smallest hard-to-color graph for the SL algorithm.

[BibT_eX]

[DOI]

Jaroslaw Pakulski

Discret. Math., 1997

Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Repackable networks-The concept and applications.

[BibT_eX]

[DOI]

Andrzej Jajszczyk

Proceedings of the Advances in Switching Networks, 1997

1996

A linear time algorithm for edge coloring of binomial trees.

[BibT_eX]

[DOI]

Discret. Math., 1996

1993

Interval edge coloring of a graph with forbidden colors.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

Some results concerning the complexity of restricted colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1989

Interval vertex-coloring of a graph with forbidden colors.

[BibT_eX]

[DOI]

Discret. Math., 1989

1987

The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1985

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems.

[BibT_eX]

[DOI]

Henryk Krawczyk

IEEE Trans. Computers, 1985

A Generalized Implicit Enumeration Algorithm for Graph Coloring.

[BibT_eX]

[DOI]

Boguslaw Jackowski

Commun. ACM, 1985

1983

Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring.

[BibT_eX]

E. Kusz

Proceedings of the WG '83, 1983

1982

Comments on "Decomposition of Permutation Networks".

[BibT_eX]

[DOI]