Marek Kubale

From MaRDI portal
Person:237429

Available identifiers

zbMath Open kubale.marekMaRDI QIDQ237429

List of research outcomes

PublicationDate of PublicationType
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms2022-07-08Paper
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments2021-11-02Paper
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling2020-10-12Paper
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms2020-10-12Paper
A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)2020-04-28Paper
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs2018-02-22Paper
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines2017-12-20Paper
Equitable colorings of corona multiproducts of graphs2017-10-13Paper
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring2016-10-21Paper
On bipartization of cubic graphs by removal of an independent set2016-06-21Paper
Edge-chromatic sum of trees and bounded cyclicity graphs2016-06-16Paper
On the independence number of some strong products of cycle-powers2016-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29329332014-12-09Paper
https://portal.mardi4nfdi.de/entity/Q28589452013-11-05Paper
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs2010-05-14Paper
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints2010-04-28Paper
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs2009-01-22Paper
Parallel Processing and Applied Mathematics2007-09-25Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
https://portal.mardi4nfdi.de/entity/Q34339442007-04-23Paper
On some Ramsey and Turán-type numbers for paths and cycles2006-08-30Paper
https://portal.mardi4nfdi.de/entity/Q54764062006-07-14Paper
https://portal.mardi4nfdi.de/entity/Q54729172006-06-19Paper
Euro-Par 2004 Parallel Processing2005-08-23Paper
Chromatic scheduling in a cyclic open shop2005-03-08Paper
Compact scheduling of zero-one time operations in multi-stage systems2005-01-31Paper
Sum coloring of bipartite graphs with bounded degree2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47373462004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44334462003-11-24Paper
https://portal.mardi4nfdi.de/entity/Q44112832003-07-07Paper
The smallest hard-to-color graph for algorithm DSATUR2002-12-02Paper
Consecutive colorings of the edges of general graphs2002-07-30Paper
https://portal.mardi4nfdi.de/entity/Q45293112002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27123082001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q45157632000-11-23Paper
https://portal.mardi4nfdi.de/entity/Q49424862000-06-04Paper
On the deficiency of bipartite graphs2000-04-04Paper
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors1999-04-22Paper
https://portal.mardi4nfdi.de/entity/Q42212741999-01-03Paper
https://portal.mardi4nfdi.de/entity/Q43933861998-12-02Paper
The smallest hard-to-color graph for the SL algorithm1997-12-08Paper
Open shop problem with zero-one time operations and integer release date/deadline intervals1997-08-11Paper
A linear time algorithm for edge coloring of binomial trees1997-01-12Paper
https://portal.mardi4nfdi.de/entity/Q44334291996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44334471996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48363021995-06-14Paper
https://portal.mardi4nfdi.de/entity/Q42988521994-06-29Paper
Interval edge coloring of a graph with forbidden colors1994-02-24Paper
Some results concerning the complexity of restricted colorings of graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39719181992-06-25Paper
Interval vertex-coloring of a graph with forbidden colors1989-01-01Paper
The complexity of scheduling independent two-processor tasks on dedicated processors1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37472031986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36866361985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433231985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746981983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33122611982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41667021978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40621851975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40833341975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marek Kubale