The complexity of planar graph choosability. - Shai Gutner (Discret. Math., 1996)

Some results on (a:b)-choosability - Shai Gutner; Michael Tarsi (CoRR, 2008)

Choice numbers of graphs - Shai Gutner (CoRR, 2008)

Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. - Noga Alon; Shai Gutner (Electron. Colloquium Comput. Complex., 2008)

Elementary approximation algorithms for prize collecting Steiner tree problems. - Shai Gutner (Inf. Process. Lett., 2008)

Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. - Shai Gutner (IWPEC, 2009)

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. - Noga Alon; Shai Gutner (Algorithmica, 2009)

Some results on (a: b)-choosability. - Shai Gutner; Michael Tarsi (Discret. Math., 2009)

Balanced Hashing, Color Coding and Approximate Counting. - Noga Alon; Shai Gutner (Electron. Colloquium Comput. Complex., 2009)

Admission control to minimize rejections and online set cover with repetitions. - Noga Alon; Yossi Azar; Shai Gutner (ACM Trans. Algorithms, 2009)

Algorithms for optimization problems on networks and graphs - Shai Gutner (2009)

Balanced families of perfect hash functions and their applications. - Noga Alon; Shai Gutner (ACM Trans. Algorithms, 2010)

Truthful unsplittable flow for large capacity networks. - Yossi Azar; Iftah Gamzu; Shai Gutner (ACM Trans. Algorithms, 2010)