Computer Science
NYD's user avatar
NYD's user avatar
NYD's user avatar
NYD
  • Member for 6 years, 2 months
  • Last seen more than 1 year ago
Profile Activity
Stats
63
reputation
1k
reached
5
answers
1
question
Communities
Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
5
bronze badges
Top tags
View all tags
1
Score
1
Posts
17
Posts %
1
Score
1
Posts
17
Posts %
1
Score
1
Posts
17
Posts %
1
Score
1
Posts
17
Posts %
0
Score
3
Posts
50
Posts %
0
Score
1
Posts
17
Posts %
Top posts
All Questions Answers
Score Newest
question
1
Shortest Path using at most k colors
Sep 12, 2017
answer
1
Aggregate planning with inventory
Sep 24, 2017
answer
1
Are all vertices within a strongly connected component with 2 or more vertices part of a cycle?
Oct 17, 2017
answer
0
Is a Knapsack Problem with only Color Constraints NP-Complete?
Sep 11, 2017
answer
0
NP hardness of partitioning a graph into two subgraphs
Nov 6, 2017
answer
-1
Show that Knapsack-like problem on directed graph is NP-hard
Nov 6, 2017

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.