Network profile

Erel Segal-Halevi

Reputation

1,628

1.6k
1.3k
945

2018
2019
2020
2021

Top tag

ds.algorithms

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Next badge

0/1

Impact

4 posts edited

0 helpful flags

122 votes cast

19 Bookmarks

Votes Activity Newest Views Added

476

votes

answers

172k

views

What papers should everyone read?

big-list soft-question

Apr 13 at 8:00 Xi Li 21

116

votes

answers

views

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds

7h ago harris teeter employee website 1

votes

answers

views

Are there non-constructive algorithm existence proofs?

ds.algorithms soft-question lo.logic proofs

Aug 11 '12 at 20:01 Community♦ 1

votes

answers

views

Maximal classes for which largest independent set can be found in polynomial time?

ds.algorithms graph-theory co.combinatorics graph-classes

Oct 1 '14 at 2:17 Community♦ 1

votes

answers

views

Approximation algorithms for Maximum Independent Set on special classes of graphs

ds.algorithms graph-theory graph-algorithms approximation-algorithms

Jan 26 '14 at 18:56 Erel Segal-Halevi 1,628

votes

answers

views

Hardness of approximation - additive error

cc.complexity-theory complexity-classes np-hardness approximation-hardness

Nov 24 '10 at 14:31 Tsuyoshi Ito 16.1k

votes

answer

views

Computational complexity of the 3-partition problem with distinct numbers

cc.complexity-theory np-hardness

Aug 30 '10 at 0:35 Community♦ 1

votes

answers

views

Packing rectangles into convex polygons but without rotations

reference-request np-hardness cg.comp-geom optimization packing

Mar 21 '11 at 19:36 Community♦ 1

votes

answers

views

Algorithms for set packing

ds.algorithms

Sep 24 '16 at 10:25 Community♦ 1

votes

answers

487

views

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

ds.algorithms approximation-algorithms cg.comp-geom graph-colouring online-algorithms

Jan 7 '19 at 8:34 Glorfindel 209

votes

answer

432

views

Information complexity of query algorithms?

it.information-theory communication-complexity query-complexity

Apr 15 '15 at 9:05 TCS-user-12 99

votes

answers

views

Cover a Concave Polygon with a minimum number of rectangles

co.combinatorics cg.comp-geom

Dec 1 '12 at 5:56 Community♦ 1

votes

answers

views

Extension to the Stable Marriage Problem ?

ds.algorithms graph-theory matching

Oct 4 '10 at 2:00 Community♦ 1

votes

answer

772

views

NP-Hardness of a special case of orthogonal packing problem

cc.complexity-theory reference-request np-hardness packing

Dec 17 '10 at 16:06 Oleksandr Bondarenko 4,165

votes

answer

225

views

Counting the number of thick regions which overlap a square

cg.comp-geom

Apr 16 '12 at 20:37 Joe 1,307

votes

answers

807

views

Poly-time approximation scheme for problems with pseudo-polynomial time algorithms

cc.complexity-theory approximation-algorithms

Mar 16 '11 at 9:23 Community♦ 1

votes

answer

678

views

Is that particular case of the “minimum weight solution to linear equations” still NP-complete?

cc.complexity-theory np-hardness cg.comp-geom application-of-theory

Dec 16 '10 at 5:09 Tsuyoshi Ito 16.1k

votes

answers

661

views

Hardness of Approximation results for Special Set Packing Problem Wanted

cc.complexity-theory approximation-algorithms approximation-hardness set-cover packing

Nov 24 '12 at 7:10 Community♦ 1

votes

answer

267

views

Solving linear program with 1 quadratic constraint complexity

np-hardness optimization linear-programming

Sep 18 '17 at 16:42 karmanaut 1,035

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

19 Bookmarks

What papers should everyone read?

Examples of the price of abstraction?

Are there non-constructive algorithm existence proofs?

Maximal classes for which largest independent set can be found in polynomial time?

Approximation algorithms for Maximum Independent Set on special classes of graphs

Hardness of approximation - additive error

Computational complexity of the 3-partition problem with distinct numbers

Packing rectangles into convex polygons but without rotations

Algorithms for set packing

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

Information complexity of query algorithms?

Cover a Concave Polygon with a minimum number of rectangles

Extension to the Stable Marriage Problem ?

NP-Hardness of a special case of orthogonal packing problem

Counting the number of thick regions which overlap a square

Poly-time approximation scheme for problems with pseudo-polynomial time algorithms

Is that particular case of the “minimum weight solution to linear equations” still NP-complete?

Hardness of Approximation results for Special Set Packing Problem Wanted

Solving linear program with 1 quadratic constraint complexity