![](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
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Baruch Schieber
New Jersey Institute of Technology, Newark, NJ, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 175 matches
- 2024
- Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. J. Sched. 27(1): 103-118 (2024) - Ilan Doron Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - Noga Alon, Baruch Schieber:
Optimal Preprocessing for Answering On-Line Product Queries. CoRR abs/2406.06321 (2024) - 2023
- Baruch Schieber, Soroush Vahidi
:
Approximating Connected Maximum Cuts via Local Search. ESA 2023: 93:1-93:17 - Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader:
Parallel Longest Common SubSequence Analysis In Chapel. HPEC 2023: 1-6 - Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. WADS 2023: 637-643 - Baruch Schieber, Bhargav Samineni, Soroush Vahidi
:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. WALCOM 2023: 305-316 - Shlomi Dolev
, Baruch Schieber:
Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings. Lecture Notes in Computer Science 14310, Springer 2023, ISBN 978-3-031-44273-5 [contents] - Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2301.05460 (2023) - Soroush Vahidi
, Baruch Schieber, Zhihui Du, David A. Bader:
Parallel Longest Common SubSequence Analysis In Chapel. CoRR abs/2309.09072 (2023) - 2022
- Md Mouinul Islam, Dong Wei, Baruch Schieber, Senjuti Basu Roy:
Satisfying Complex Top-k Fairness Constraints by Preference Substitutions. Proc. VLDB Endow. 16(2): 317-329 (2022) - Dong Wei, Md Mouinul Islam, Baruch Schieber, Senjuti Basu Roy:
Rank Aggregation with Proportionate Fairness. SIGMOD Conference 2022: 262-275 - Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint k Shortest Paths. CoRR abs/2211.03335 (2022) - Baruch Schieber, Bhargav Samineni, Soroush Vahidi
:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. CoRR abs/2212.07002 (2022) - 2020
- Viswanath Nagarajan
, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. Math. Oper. Res. 45(1): 1-14 (2020) - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM 2020: 48:1-48:18 - 2019
- Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation to Interval Jobs. Algorithmica 81(8): 3217-3244 (2019) - Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1): 1-6 (2019) - Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. FSTTCS 2019: 26:1-26:15 - Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - 2018
- Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80(2): 576-607 (2018) - Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM 2018: 24:1-24:18 - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA 2018: 343-345
skipping 145 more matches
loading more results
failed to load more results, please try again later
![](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.
retrieved on 2024-07-27 06:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint