Skip to main content
R B's user avatar
R B's user avatar
R B's user avatar
R B
  • Member for 10 years, 5 months
  • Last seen more than a month ago
4 votes
Accepted

Objective function for stochastic optimization

4 votes
Accepted

Root finding in [0,1]

4 votes

Does $\delta^+(G)+\delta^-(G) \geq n$ imply strong connectivity?

4 votes

Minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?

4 votes
Accepted

Efficient recalculation of the maximum flow when edge capacities are reduced

4 votes

Finding the sparsest solution to a system of linear equations

4 votes

Most memorable CS paper titles

3 votes

Finding an exactly weighted st-path in a digraph

3 votes

Is this NP-Hard or does a known optimal polynomial time solution exist?

3 votes
Accepted

Approximating the value of k in $k$-mean clustering problem

3 votes

Separating lists of words

3 votes

New Space Lower-Bound Techniques for Streaming Algorithms

3 votes

Fastest polynomial time algorithm for solving minimum cost maximum flow problems in bipartite graphs

3 votes
Accepted

Iteratively minimizing the function

3 votes

What is the most efficient algorithm to generate a sequence of prime numbers?

3 votes

Approximation in subexponental time

2 votes

On the size of P4-transversals of graphs

2 votes

Design of exact algorithms for non-local hard problems

2 votes
Accepted

Minimum order of partite in a bipartite graph

2 votes
Accepted

Lower bound for finding repeated elements in sorted array

2 votes

Showing that interval-sum queries on a binary array can not be done using linear space and constant time

2 votes

What is the expected depth of a randomly generated tree?

2 votes
Accepted

Hamiltonian cycle on a subset of 2D points, constrained by maximum total length

1 vote

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

1 vote

How to map random cardesian points in a 2d array

1 vote

Complexity of distributively verifying that the diameter is small

1 vote

Can words in regular languages be generated by automata in a unique way?

1 vote

How to find the pair of two of edges which, removed from a graph, makes it disconnected?

1 vote

Hyperspherical nature of K-means and similar clustering methods

1 vote

Set packing with maximum coverage objective