Skip to main content
Theoretical Computer Science
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian
  • Member for 6 years, 3 months
  • Last seen more than a month ago
  • Berlin, Deutschland
Profile Activity
Stats
241
reputation
492
reached
4
answers
1
question
Communities
View all
About

PhD student at the Humboldt University of Berlin - chair of algorithm engineering.

Badges
This user doesn’t have any gold badges yet.
1
silver badge
8
bronze badges
Top tags
View all tags
6
Score
3
Posts
60
Posts %
6
Score
2
Posts
40
Posts %
6
Score
2
Posts
40
Posts %
6
Score
2
Posts
40
Posts %
4
Score
1
Posts
20
Posts %
4
Score
1
Posts
20
Posts %
Top posts
answer
6
Hardness of finding if a vertex lies on a simple directed path between two vertices
Dec 19, 2019
answer
4
What Books Should Everyone Read?
Jan 3, 2020
question
4
Hardness of finding if a vertex lies on a simple directed path between two vertices
Dec 19, 2019
answer
4
Potentially stronger form of non-$ETH$
Nov 23, 2019
answer
0
Which graph problems are $W[1]$-Hard on directed(/weighted) graphs but FPT on undirected(/unweighted) graphs?
Jul 3
Top network posts
View all network posts
56
Why is English not a regular language?
11
Examples of simple/common problems with quadratic running time
9
Counting number of paths between two vertices in a DAG
8
Compute the expected size of an approximation of vertex cover
7
What is the point of traversing a binary tree in preoder, inorder or postorder?