| 2008 |
|---|
| 15 | EE | Shai Gutner:
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.
COCOA 2008: 246-254 |
| 14 | EE | Shai Gutner,
Michael Tarsi:
Some results on (a:b)-choosability
CoRR abs/0802.1338: (2008) |
| 13 | EE | Shai Gutner:
Choice numbers of graphs
CoRR abs/0802.2157: (2008) |
| 12 | EE | Shai Gutner:
The complexity of planar graph choosability
CoRR abs/0802.2668: (2008) |
| 11 | EE | Noga Alon,
Yossi Azar,
Shai Gutner:
Admission Control to Minimize Rejections and Online Set Cover with Repetitions
CoRR abs/0803.2842: (2008) |
| 10 | EE | Yossi Azar,
Iftah Gamzu,
Shai Gutner:
Truthful Unsplittable Flow for Large Capacity Networks
CoRR abs/0804.2112: (2008) |
| 9 | EE | Noga Alon,
Shai Gutner:
Balanced Families of Perfect Hash Functions and Their Applications
CoRR abs/0805.4300: (2008) |
| 8 | EE | Noga Alon,
Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
CoRR abs/0806.4735: (2008) |
| 7 | EE | Noga Alon,
Shai Gutner:
Kernels for the Dominating Set Problem on Graphs with an Excluded Minor.
Electronic Colloquium on Computational Complexity (ECCC) 15(066): (2008) |
| 6 | EE | Shai Gutner:
Elementary approximation algorithms for prize collecting Steiner tree problems.
Inf. Process. Lett. 107(1): 39-44 (2008) |
| 2007 |
|---|
| 5 | EE | Noga Alon,
Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.
COCOON 2007: 394-405 |
| 4 | EE | Noga Alon,
Shai Gutner:
Balanced Families of Perfect Hash Functions and Their Applications.
ICALP 2007: 435-446 |
| 3 | EE | Yossi Azar,
Iftah Gamzu,
Shai Gutner:
Truthful unsplittable flow for large capacity networks.
SPAA 2007: 320-329 |
| 2005 |
|---|
| 2 | EE | Noga Alon,
Yossi Azar,
Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions.
SPAA 2005: 238-244 |
| 1996 |
|---|
| 1 | EE | Shai Gutner:
The complexity of planar graph choosability.
Discrete Mathematics 159(1-3): 119-130 (1996) |
