Articles with public access mandates - Dror RawitzLearn more
Not available anywhere: 8
Online generalized caching with varying weights and costs
G Even, M Medina, D Rawitz
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
Mandates: US National Science Foundation
Composed degree-distance realizations of graphs
A Bar-Noy, D Peleg, M Perry, D Rawitz
Algorithmica 85 (3), 665-687, 2023
Mandates: US National Science Foundation
Weighted microscopic image reconstruction
A Bar-Noy, T Böhnlein, Z Lotker, D Peleg, D Rawitz
Discrete Applied Mathematics 345, 17-33, 2024
Mandates: US National Science Foundation
Relaxed and approximate graph realizations
A Bar-Noy, T Böhnlein, D Peleg, M Perry, D Rawitz
International Workshop on Combinatorial Algorithms, 3-19, 2021
Mandates: US National Science Foundation
On vertex-weighted graph realizations
A Bar-Noy, T Böhnlein, D Peleg, D Rawitz
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
Mandates: US National Science Foundation
Forcibly bipartite and acyclic (uni-) graphic sequences
A Bar-Noy, T Böhnlein, D Peleg, D Rawitz
Discrete mathematics 346 (7), 113460, 2023
Mandates: US National Science Foundation
On vertex-weighted realizations of acyclic and general graphs
A Bar-Noy, T Böhnlein, D Peleg, D Rawitz
Theoretical Computer Science 922, 81-95, 2022
Mandates: US National Science Foundation
Vertex-Weighted Graphs: Realizable and Unrealizable Domains
A Bar-Noy, T Böhnlein, D Peleg, D Rawitz
International Conference and Workshops on Algorithms and Computation, 315-327, 2022
Mandates: US National Science Foundation
Available somewhere: 16
Distributed backup placement in networks
MM Halldórsson, S Köhler, B Patt-Shamir, D Rawitz
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
Mandates: Icelandic Centre for Research
Online Budgeted Maximum Coverage
D Rawitz, A Rosén
Algorithmica 83 (9), 2989-3014, 2021
Mandates: Agence Nationale de la Recherche
Realizability of graph specifications: Characterizations and algorithms
A Bar-Noy, K Choudhary, D Peleg, D Rawitz
International Colloquium on Structural Information and Communication …, 2018
Mandates: US Department of Defense
Simple and local independent set approximation
RB Boppana, MM Halldórsson, D Rawitz
International Colloquium on Structural Information and Communication …, 2018
Mandates: Icelandic Centre for Research
Online scheduling with interval conflicts
MM Halldórsson, B Patt-Shamir, D Rawitz
Theory of Computing Systems 53 (2), 300-317, 2013
Mandates: Icelandic Centre for Research
The generalized microscopic image reconstruction problem
A Bar-Noy, T Böhnlein, Z Lotker, D Peleg, D Rawitz
Discrete Applied Mathematics 321, 402-416, 2022
Mandates: US National Science Foundation
Efficiently realizing interval sequences
A Bar-Noy, K Choudhary, D Peleg, D Rawitz
SIAM Journal on Discrete Mathematics 34 (4), 2318-2337, 2020
Mandates: US National Science Foundation, US Department of Defense
Graph realizations: Maximum degree in vertex neighborhoods
A Bar-Noy, K Choudhary, D Peleg, D Rawitz
Discrete Mathematics 346 (9), 113483, 2023
Mandates: US National Science Foundation, US Department of Defense
Distributed approximation of k-service assignment
MM Halldórsson, S Köhler, D Rawitz
Distributed Computing 32 (1), 27-40, 2019
Mandates: Fraunhofer-Gesellschaft, Icelandic Centre for Research
On realizing a single degree sequence by a bipartite graph
A Bar-Noy, T Böhnlein, D Peleg, D Rawitz
18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), 1 …, 2022
Mandates: US National Science Foundation
Vertex-weighted realizations of graphs
A Bar-Noy, D Peleg, D Rawitz
Theoretical Computer Science 807, 56-72, 2020
Mandates: US National Science Foundation, US Department of Defense
Minimum neighboring degree realization in graphs and trees
A Bar-Noy, K Choudhary, A Cohen, D Peleg, D Rawitz
28th Annual European Symposium on Algorithms (ESA 2020), 10: 1-10: 15, 2020
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program