The following pages link to Krzysztof Giaro (Q177037):
Displaying 26 items.
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- (Q967427) (redirect page) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- On the deficiency of bipartite graphs (Q1293200) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- Sum coloring of bipartite graphs with bounded degree (Q1884769) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- (Q3433944) (← links)
- Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384) (← links)
- (Q4393386) (← links)
- (Q4411283) (← links)
- (Q4433429) (← links)
- (Q4529311) (← links)
- (Q4737346) (← links)
- (Q4940090) (← links)
- On a matching distance between rooted phylogenetic trees (Q5396440) (← links)
- (Q5476406) (← links)
- (Q5502905) (← links)
- Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs (Q5504363) (← links)
- Compact Scheduling In Open Shop With Zero-One Time Operations (Q5888083) (← links)
- Parallel Processing and Applied Mathematics (Q5899139) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
- Consecutive colorings of the edges of general graphs (Q5959097) (← links)
