The following pages link to (Q4258216):
Displaying 11 items.
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Controlling the losing probability in a monotone game (Q2489238) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
