default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShai Gutner
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j7]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. ACM Trans. Algorithms 6(2): 36:1-36:20 (2010)- [j6]Noga Alon, Shai Gutner:
Balanced families of perfect hash functions and their applications. ACM Trans. Algorithms 6(3): 54:1-54:12 (2010)
2000 – 2009
- 2009
- [b1]Shai Gutner:
Algorithms for optimization problems on networks and graphs. Tel Aviv University, Israel, 2009 - [j5]Noga Alon, Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Algorithmica 54(4): 544-556 (2009) - [j4]Shai Gutner, Michael Tarsi:
Some results on (a: b)-choosability. Discret. Math. 309(8): 2260-2270 (2009) - [j3]Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. ACM Trans. Algorithms 6(1): 11:1-11:13 (2009) - [c7]Noga Alon, Shai Gutner:
Balanced Hashing, Color Coding and Approximate Counting. IWPEC 2009: 1-16 - [c6]Shai Gutner:
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. IWPEC 2009: 246-257 - [i9]Noga Alon, Shai Gutner:
Balanced Hashing, Color Coding and Approximate Counting. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Shai Gutner:
Elementary approximation algorithms for prize collecting Steiner tree problems. Inf. Process. Lett. 107(1): 39-44 (2008) - [c5]Shai Gutner:
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems. COCOA 2008: 246-254 - [i8]Shai Gutner, Michael Tarsi:
Some results on (a:b)-choosability. CoRR abs/0802.1338 (2008) - [i7]Shai Gutner:
Choice numbers of graphs. CoRR abs/0802.2157 (2008) - [i6]Shai Gutner:
The complexity of planar graph choosability. CoRR abs/0802.2668 (2008) - [i5]Noga Alon, Yossi Azar, Shai Gutner:
Admission Control to Minimize Rejections and Online Set Cover with Repetitions. CoRR abs/0803.2842 (2008) - [i4]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful Unsplittable Flow for Large Capacity Networks. CoRR abs/0804.2112 (2008) - [i3]Noga Alon, Shai Gutner:
Balanced Families of Perfect Hash Functions and Their Applications. CoRR abs/0805.4300 (2008) - [i2]Noga Alon, Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. CoRR abs/0806.4735 (2008) - [i1]Noga Alon, Shai Gutner:
Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c4]Noga Alon, Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. COCOON 2007: 394-405 - [c3]Noga Alon, Shai Gutner:
Balanced Families of Perfect Hash Functions and Their Applications. ICALP 2007: 435-446 - [c2]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. SPAA 2007: 320-329 - 2005
- [c1]Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. SPAA 2005: 238-244
1990 – 1999
- 1996
- [j1]Shai Gutner:
The complexity of planar graph choosability. Discret. Math. 159(1-3): 119-130 (1996)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
