User Simon Razniewski - Theoretical Computer Science Stack Exchange

1. Home
2. Questions
3. Tags
5. Users
6. Jobs
7. Companies
8. Unanswered
Teams

Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for free Explore Teams
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams

Simon Razniewski

Member for 9 years, 1 month
Last seen more than 7 years ago

simonrazniewski.de.vu

7 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions

awarded

Student

Nov 21, 2015 at 18:53

suggested

Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?

Nov 21, 2015 at 13:28

awarded

Autobiographer

Nov 21, 2015 at 11:24

comment

Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?

Thanks a lot, that looks elegant! Will credit you should this go any further.

Nov 21, 2015 at 11:22

awarded

Scholar

Nov 21, 2015 at 11:14

accepted

Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?

Nov 21, 2015 at 11:09

asked

Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?

Nov 21, 2015 at 6:07

Loading…