The following pages link to Shai Gutner (Q963392):
Displaying 12 items.
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- Admission control to minimize rejections and online set cover with repetitions (Q2930285) (← links)
- Truthful unsplittable flow for large capacity networks (Q2930315) (← links)
- Balanced families of perfect hash functions and their applications (Q2930337) (← links)
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (Q3608864) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Balanced Families of Perfect Hash Functions and Their Applications (Q5428829) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
