Computer Science
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian
  • Member for 5 years, 10 months
  • Last seen this week
  • Berlin, Deutschland
Profile Activity

137 Answers

Score Activity Newest
3 votes

How to check if a list of XY coordinate meet the safety distance to each others?

3 votes
Accepted

Inorder tree tranversal on binary search tree doesn't give the elements in order?

3 votes
Accepted

Find all nodes on simple paths between two nodes in cyclic directed graph

3 votes
Accepted

Is SAT a single language or a union of languages?

3 votes

Selection over combinatorics that satisfies a distribution

3 votes

Name and complexity of this problem on bipartite graphs

3 votes
Accepted

Graph Isomorphism Problem: decisional vs functional

3 votes
Accepted

"evenly connected" graph

2 votes
Accepted

Parameterized intractability relation between split and chordal graphs

2 votes
Accepted

Partition data into two sets of the same size such that the sum of the average distances is maximized

2 votes
Accepted

Marks that are impossible to obtain?

2 votes

Algorithm that finds a matrix with a specific number of 1s in its rows & columns

2 votes

Coloring an interval graph with weights

2 votes

Obtaining an acyclic graph by removing edges using an algorithm that decides ACYCLIC

2 votes

Solving a modified Travelling Salesman Problem(TSP)

2 votes
Accepted

Non-deterministic Turing machine for $L_1 = \{w\#0^n|w \text{ is a suffix of some $x$ in $L$ with } |x|=n\}$

2 votes

How to remove cycles from a directed graph by edge contraction?

2 votes
Accepted

A special case of subset sum

2 votes

How to sort a large list of elements where everything is sorted but k elements?

2 votes
Accepted

Time complexity of travelling salesman problem

2 votes
Accepted

Does topological sort exist for any complete directed acyclic graph?

2 votes

Is it NP-complete to test if a graph contains $t$ $k$-cliques?

2 votes
Accepted

Why can’t you simulate a Turing machine with a one-stack PDA by messing with the stack?

2 votes

Finding the hidden treasure

2 votes
Accepted

Need clarification regarding certificates of coNP problems

2 votes

Near Triangulation Planar Graph

2 votes

How to prove LastToken problem is NP-complete

2 votes

Finding minimum in PRAM model

2 votes
Accepted

An example where the algorithm of Hopcroft and Karp performs poorly?

2 votes
Accepted

Conditions under which the 3-partition problem is not strongly NP-complete?

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.