The following pages link to Martin Olsen (Q264206):
Displaying 19 items.
- On the complexity of exchanging (Q264207) (← links)
- On the approximability of the link building problem (Q391785) (← links)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- A general view on computing communities (Q459400) (← links)
- Dimension and codimension of simple games (Q510973) (← links)
- Nash stability in additively separable hedonic games and community structures (Q733746) (← links)
- Distance hedonic games (Q831802) (← links)
- A note on online colouring problems in overlap graphs and their complements (Q1641110) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- On alliance partitions and bisection width for planar graphs (Q2865020) (← links)
- A Constant-Factor Approximation Algorithm for the Link Building Problem (Q3066446) (← links)
- The Computational Complexity of Link Building (Q3511320) (← links)
- Communities in Large Networks: Identification and Ranking (Q3520033) (← links)
- Maximizing PageRank with New Backlinks (Q3562990) (← links)
- On the Construction of High Dimensional Simple Games (Q4576222) (← links)
- Alliances and Bisection Width for Planar Graphs (Q4914449) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- Nash Stability in Additively Separable Hedonic Games Is NP-Hard (Q5425362) (← links)
- An asymptotically optimal algorithm for online stacking (Q6040850) (← links)