![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yoram J. Sussmann
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2003
- [j6]Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. 7(1): 3-31 (2003) - 2000
- [j5]Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The full-degree spanning tree problem. Networks 36(4): 203-209 (2000) - [j4]Samir Khuller, Yoram J. Sussmann:
The Capacitated K-Center Problem. SIAM J. Discret. Math. 13(3): 403-418 (2000) - [j3]Samir Khuller, Robert Pless, Yoram J. Sussmann:
Fault tolerant K-center problems. Theor. Comput. Sci. 242(1-2): 237-245 (2000) - 1998
- [j2]Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann:
Facility Location with Dynamic Distance Functions. J. Comb. Optim. 2(3): 199-217 (1998) - [j1]Randeep Bhatia, Yoram J. Sussmann:
Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997). SIGACT News 29(2): 17-20 (1998)
Conference and Workshop Papers
- 2006
- [c8]Sofya Poger, Yoram J. Sussmann:
A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic Time. ACiD 2006: 119-130 - 2001
- [c7]Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE 2001: 172-184 - 1999
- [c6]Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The Full Degree Spanning Tree Problem. SODA 1999: 864-865 - 1998
- [c5]Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann:
Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615 - [c4]Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann:
Facility Location with Dynamic Distance Function (Extended Abstract). SWAT 1998: 23-34 - 1997
- [c3]Samir Khuller, Robert Pless, Yoram J. Sussmann:
Fault Tolerant K-Center Problems. CIAC 1997: 37-48 - [c2]Gísli R. Hjaltason, Hanan Samet, Yoram J. Sussmann:
Speeding up Bulk-Loading of Quadtrees. ACM-GIS 1997: 50-53 - 1996
- [c1]Samir Khuller, Yoram J. Sussmann:
The Capacitated K-Center Problem (Extended Abstract). ESA 1996: 152-166
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint