The following pages link to Arkadiusz Socała (Q289930):
Displaying 17 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- Assigning Channels via the Meet-in-the-Middle Approach (Q3188903) (← links)
- Approximation and Parameterized Complexity of Minimax Approval Voting (Q4558792) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q4606330) (← links)
- Tight Lower Bounds on Graph Embedding Problems (Q4640290) (← links)
- Tight Lower Bound for the Channel Assignment Problem (Q4962622) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Tight Lower Bounds for List Edge Coloring (Q5116492) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5205808) (← links)
- Tight lower bound for the channel assignment problem (Q5363091) (← links)
- (Q5363775) (← links)
