The following pages link to Marek Kubale (Q237429):
Displaying 44 items.
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- On some Ramsey and Turán-type numbers for paths and cycles (Q2500974) (← links)
- (Q2712308) (← links)
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784) (← links)
- (Q2858945) (← links)
- (Q2932933) (← links)
- (Q3312261) (← links)
- (Q3433944) (← links)
- Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384) (← links)
- (Q3674698) (← links)
- (Q3686636) (← links)
- (Q3743323) (← links)
- (Q3747203) (← links)
- (Q3971918) (← links)
- (Q4062185) (← links)
- (Q4083334) (← links)
- (Q4166702) (← links)
- (Q4221274) (← links)
- (Q4298852) (← links)
- (Q4393386) (← links)
- (Q4411283) (← links)
- (Q4433429) (← links)
- (Q4433446) (← links)
- (Q4433447) (← links)
- (Q4515763) (← links)
- (Q4529311) (← links)
- (Q4737346) (← links)
- (Q4836302) (← links)
- (Q4942486) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments (Q5162169) (← links)
- Parallel Processing and Applied Mathematics (Q5307437) (← links)
- Euro-Par 2004 Parallel Processing (Q5311346) (← links)
- (Q5472917) (← links)
- (Q5476406) (← links)
- Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs (Q5504363) (← links)
- Parallel Processing and Applied Mathematics (Q5899123) (← links)
- Parallel Processing and Applied Mathematics (Q5899139) (← links)
- Divisibility and \(T\)-span of graphs (Q5936063) (← links)
- Consecutive colorings of the edges of general graphs (Q5959097) (← links)
- The smallest hard-to-color graph for algorithm DSATUR (Q5959099) (← links)
