Shai Gutner

Affiliations:
  • Tel Aviv University, Israel


According to our database1, Shai Gutner authored at least 13 papers between 1996 and 2009.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Algorithms for optimization problems on networks and graphs
PhD thesis, 2009

Some results on (a: b)-choosability.
Discret. Math., 2009

Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Balanced Hashing, Color Coding and Approximate Counting.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008
Kernels for the Dominating Set Problem on Graphs with an Excluded Minor.
Electron. Colloquium Comput. Complex., 2008

Choice numbers of graphs
CoRR, 2008

Some results on (a:b)-choosability
CoRR, 2008

Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Truthful unsplittable flow for large capacity networks.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Balanced Families of Perfect Hash Functions and Their Applications.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005
Admission control to minimize rejections and online set cover with repetitions.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

1996
The complexity of planar graph choosability.
Discret. Math., 1996


  Loading...