The following pages link to Maciej M. Sysło (Q583878):
Displayed 50 items.
- (Q3325749) (← links)
- (Q3325753) (← links)
- (Q3331236) (← links)
- On the computational complexity of the minimum-dummy-activities problem in a pert network (Q3332752) (← links)
- (Q3333072) (← links)
- On the fundamental cycle set graph (Q3338292) (← links)
- (Q3340898) (← links)
- (Q3342593) (← links)
- (Q3343454) (← links)
- (Q3344027) (← links)
- On Posets of Page Number 2 (Q3439398) (← links)
- On Page Number of N-free Posets (Q3439444) (← links)
- (Q3446271) (← links)
- (Q3665147) (← links)
- (Q3676161) (← links)
- (Q3686741) (← links)
- (Q3693257) (← links)
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
- (Q3710545) (← links)
- (Q3718741) (← links)
- An algorithmic characterization of total digraphs (Q3722533) (← links)
- (Q3758847) (← links)
- (Q3773904) (← links)
- (Q3783094) (← links)
- (Q3800059) (← links)
- (Q3803152) (← links)
- (Q3804190) (← links)
- (Q3854536) (← links)
- (Q3856804) (← links)
- (Q3866155) (← links)
- (Q3869379) (← links)
- (Q3886876) (← links)
- (Q3914785) (← links)
- Optimal constructions of event-node networks (Q3916390) (← links)
- (Q3918147) (← links)
- An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph (Q3922183) (← links)
- (Q3926607) (← links)
- (Q3927277) (← links)
- Minimum dominating cycles in outerplanar graphs (Q3933020) (← links)
- (Q3934412) (← links)
- The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars (Q3956995) (← links)
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2 (Q3956996) (← links)
- (Q3972023) (← links)
- (Q3972104) (← links)
- (Q4048488) (← links)
- (Q4049111) (← links)
- (Q4088851) (← links)
- (Q4094641) (← links)
- (Q4108356) (← links)
- (Q4109191) (← links)