Theoretical Computer Science
maxdan94
  • Member for 8 years, 1 month
  • Last seen more than a month ago
  • Paris, France
Profile Activity
Stats
523
reputation
5k
reached
8
answers
7
questions
Communities
View all
About

My research interests revolve around the study of very large real-world graphs: http://bit.ly/maxdan94.

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
10
bronze badges
Top tags
View all tags
3
Score
8
Posts
53
Posts %
2
Score
2
Posts
13
Posts %
2
Score
1
Posts
7
Posts %
1
Score
10
Posts
67
Posts %
1
Score
5
Posts
33
Posts %
1
Score
3
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
10
Is the following graph optimization problem approximable within a constant factor?
Jun 10 '20
8
Is this vertex ordering optimization NP-Hard?
May 22 '17
6
Is that edge orientation optimization problem NP-hard?
Mar 12 '21
5
Is this edge orientation optimization problem NP-hard?
Mar 12 '21
3
find the densest subgraph of size k
Dec 16 '13
2
Is this node permutation optimization NP-Hard?
Mar 12 '21
2
Count $k$-hop neighborhood for every vertex
Dec 31 '20
1
Algorithms for finding all cliques of a given degree in a graph
Dec 31 '20
1
Simplifying a parametrized complexity given that a parameter is in $o(n)$
Mar 2 '17
1
Is this vertex ordering optimization NP-Hard?
Mar 16 '21

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.