[Edit]

Shai Gutner [FOAF]  [Follow]

Email:
Homepage: www.cs.tau.ac.il/research/shai.gutner/
[Edit]
Statistics: H-index: 7 (See all experts' h-index.)
total citation number: 198
highest-cited paper: The complexity of planar graph choosability (2008) at CoRR (Cited By 0)

Research Interest:

Dominating Set, Degenerated Graphs, Linear Time Algorithms, Fixed Size, Dominating Set Problem

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

2009(3)
[18]Shai Gutner. Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. 2009. pp.246~257    Cited By 2[Bibtex]
[17]Noga Alon, Shai Gutner. Balanced Hashing, Color Coding and Approximate Counting. 2009. pp.1~16    Cited By 4[Bibtex]
[16]Noga Alon, Shai Gutner. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Algorithmica, 2009: 544~556    Cited By 14[Bibtex]
2008(10)
[15]Shai Gutner. Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.  COCOA'2008. pp.246~254    Cited By 4[Bibtex]
[14]Shai Gutner, Michael Tarsi. Some results on (a:b)-choosability. CoRR, 2008.     Cited By 17[Bibtex]
[13]Shai Gutner. Choice numbers of graphs. CoRR, 2008.     Cited By 7[Bibtex]
[12]Shai Gutner. The complexity of planar graph choosability. CoRR, 2008.    [Bibtex] [PDF]
[11]Noga Alon, Yossi Azar, Shai Gutner. Admission Control to Minimize Rejections and Online Set Cover with Repetitions. CoRR, 2008.     Cited By 7[Bibtex] [PDF]
[10]Yossi Azar, Iftah Gamzu, Shai Gutner. Truthful Unsplittable Flow for Large Capacity Networks. CoRR, 2008.     Cited By 4[Bibtex]
[9]Noga Alon, Shai Gutner. Balanced Families of Perfect Hash Functions and Their Applications. CoRR, 2008.     Cited By 8[Bibtex]
[8]Noga Alon, Shai Gutner. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. CoRR, 2008.     Cited By 14[Bibtex]
[7]Noga Alon, Shai Gutner. Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. Electronic Colloquium on Computational Complexity (ECCC), 2008.     Cited By 14[Bibtex]
[6]Shai Gutner. Elementary approximation algorithms for prize collecting Steiner tree problems. Inf. Process. Lett., 2008: 39~44    Cited By 4[Bibtex]
2007(3)
[5]Noga Alon, Shai Gutner. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.  COCOON'2007. pp.394~405    Cited By 14[Bibtex]
[4]Noga Alon, Shai Gutner. Balanced Families of Perfect Hash Functions and Their Applications.  ICALP'2007. pp.435~446    Cited By 8[Bibtex]
[3]Yossi Azar, Iftah Gamzu, Shai Gutner. Truthful unsplittable flow for large capacity networks.  SPAA'2007. pp.320~329    Cited By 4[Bibtex]
2005(1)
[2]Noga Alon, Yossi Azar, Shai Gutner. Admission control to minimize rejections and online set cover with repetitions.  SPAA'2005. pp.238~244    Cited By 7[Bibtex] [PDF]
1996(1)
[1]Shai Gutner. The complexity of planar graph choosability. Discrete Mathematics, 1996: 119~130   [Bibtex] [PDF]