Marek Kubale

According to our database1, Marek Kubale
  • authored at least 38 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Equitable Colorings of l-Corona Products of Cubic Graphs.
CoRR, 2017

2016
On bipartization of cubic graphs by removal of an independent set.
Discrete Applied Mathematics, 2016

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

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

2014
On bipartization of cubic graphs by removal of an independent set.
CoRR, 2014

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

2012
Equitable Colorings of Corona Multiproducts of Graphs
CoRR, 2012

2009
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs.
Discussiones Mathematicae Graph Theory, 2009

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints.
Discrete Applied Mathematics, 2009

2008
Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2006
Efficient Parallel Query Processing by Graph Ranking.
Fundam. Inform., 2006

On Some Ramsey and Turan-Type Numbers for Paths and Cycles.
Electr. J. Comb., 2006

2005
Chromatic scheduling in a cyclic open shop.
European Journal of Operational Research, 2005

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

Parallel Query Processing and Edge Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004
Compact scheduling of zero-one time operations in multi-stage systems.
Discrete Applied Mathematics, 2004

Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica, 2004

Distributed Largest-First Algorithm for Graph Coloring.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

2002
Complexity results on open shop scheduling to minimize total cost of operations.
Int. J. Comput. Syst. Signal, 2002

A Better Practical Algorithm for Distributed Graph Coloring.
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.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
The smallest hard-to-color graph for algorithm DSATUR.
Discrete Mathematics, 2001

Consecutive colorings of the edges of general graphs.
Discrete Mathematics, 2001

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

2000
Edge-chromatic sum of trees and bounded cyclicity graphs.
Inf. Process. Lett., 2000

1999
On the Deficiency of Bipartite Graphs.
Discrete Applied Mathematics, 1999

1997
The smallest hard-to-color graph for the SL algorithm.
Discrete Mathematics, 1997

Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals.
Discrete Applied Mathematics, 1997

Repackable networks--The concept and applications.
Proceedings of the Advances in Switching Networks, 1997

1996
A linear time algorithm for edge coloring of binomial trees.
Discrete Mathematics, 1996

1993
Interval edge coloring of a graph with forbidden colors.
Discrete Mathematics, 1993

1992
Some results concerning the complexity of restricted colorings of graphs.
Discrete Applied Mathematics, 1992

1989
Interval vertex-coloring of a graph with forbidden colors.
Discrete Mathematics, 1989

1987
The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors.
Inf. Process. Lett., 1987

1985
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems.
IEEE Trans. Computers, 1985

A Generalized Implicit Enumeration Algorithm for Graph Coloring.
Commun. ACM, 1985

1982
Comments on "Decomposition of Permutation Networks".
IEEE Trans. Computers, 1982


  Loading...