Joanna Berlinska

Orcid: 0000-0003-2120-2595

According to our database1, Joanna Berlinska authored at least 20 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimum Large Sensor Data Filtering, Networking and Computing.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022
Minimum-weight partitioning of a set with associated subsets.
CoRR, 2022

Scheduling data gathering with background communications and a processing stage.
Comput. Ind. Eng., 2022

2021
Two-machine flow shop with dynamic storage space.
Optim. Lett., 2021

Scheduling for gathering multitype data with local computations.
Eur. J. Oper. Res., 2021

Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

2020
Scheduling in data gathering networks with background communications.
J. Sched., 2020

Heuristics for scheduling data gathering with limited base station memory.
Ann. Oper. Res., 2020

2019
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Makespan Minimization in Data Gathering Networks with Dataset Release Times.
Proceedings of the Parallel Processing and Applied Mathematics, 2019

2018
Comparing load-balancing algorithms for MapReduce under Zipfian data skews.
Parallel Comput., 2018

Scheduling in a Data Gathering Network to Minimize Maximum Lateness.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Scheduling Data Gathering with Maximum Lateness Objective.
Proceedings of the Parallel Processing and Applied Mathematics, 2017

2015
Scheduling Multilayer Divisible Computations.
RAIRO Oper. Res., 2015

Scheduling for data gathering networks with data compression.
Eur. J. Oper. Res., 2015

2014
Communication scheduling in data gathering networks with limited memory.
Appl. Math. Comput., 2014

2011
Scheduling divisible MapReduce computations.
J. Parallel Distributed Comput., 2011

2010
Heuristics for multi-round divisible loads scheduling with limited memory.
Parallel Comput., 2010

2009
Experimental study of scheduling with memory constraints using hybrid methods.
J. Comput. Appl. Math., 2009

Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads.
Proceedings of the Parallel Processing and Applied Mathematics, 2009


  Loading...