Skip to main content
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian
  • Member for 6 years, 5 months
  • Last seen this week
  • Berlin, Deutschland
0 votes

Can we compute in polynomial time, an upper bound on an optimal solution of an integer linear program?

0 votes

Matching 2 sets of items by price

9 votes
Accepted

Counting number of paths between two vertices in a DAG

0 votes

Is variable a constant or a parameter

3 votes
Accepted

"evenly connected" graph

1 vote

NP-HARD optimization problem and instance correlation

2 votes
Accepted

Parameterized intractability relation between split and chordal graphs

5 votes

Algorithm to find a set of nodes with a smaller set of neighbours in a bipartite graph

1 vote

Deterministic infinite automaton equals a normal DFA?

0 votes

Need to create CFG that requires sum of other letters

1 vote
Accepted

Transform a non-regular language into a regular one using sort

1 vote

Given a binary matrix, find the number of sub-matrices with all ones

1 vote

Are "almost all" decidable languages not in P?

0 votes

Find the shortest path from a set of source points to the nearest source/destination point

1 vote

Query on distance to parameter in parameterized complexity

4 votes

Relationship between the parameters tree width and the maximum degree

3 votes
Accepted

Graph Isomorphism Problem: decisional vs functional

1 vote

Proving that Rice's theorem does not apply to a property

0 votes
Accepted

Max matching algorithm lemma approximation algorithm

4 votes
Accepted

Exponential Time Hypothesis and the input size vs number of variables

3 votes

Name and complexity of this problem on bipartite graphs

0 votes

Examples of time complexity $O(n^k)$

2 votes
Accepted

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

1 vote

Satisfiability of bounded assignment of input variables to CNF formula

2 votes

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

2 votes
Accepted

Marks that are impossible to obtain?

1 vote

Single-source shortest path problem with diameter

1 vote

Is there an algorithm that can ensure everyone gets bussed to their destination on time, while minimizing the time spent on a bus?

3 votes
Accepted

Given a DCEL, how do you identify the unbounded face

0 votes
Accepted

Combinatorial Problem similar in nature to a special version of max weighted matching problem

1
2 3 4 5