Bogdan Armaselu

According to our database, Bogdan Armaselu authored at least 15 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Finding the largest separating rectangle among two point sets.

Bogdan Armaselu

Theor. Comput. Sci., 2024

2023

Approximation algorithms for some extensions of the maximum profit routing problem.

Bogdan Armaselu

J. Comb. Optim., 2023

Randomized Algorithm for the Maximum-Profit Routing Problem.

Bogdan Armaselu

CoRR, 2023

2022

Extensions of the Maximum Bichromatic Separating Rectangle Problem.

Bogdan Armaselu

Inf., 2022

2021

Maximum-Profit Routing Problem with Multiple Vehicles per Site.

Bogdan Armaselu

CoRR, 2021

2020

Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box.

Bogdan Armaselu

CoRR, 2020

An APX for the Maximum-Profit Routing Problem with Variable Supply.

Bogdan Armaselu

CoRR, 2020

2019

Dynamic minimum bichromatic separating circle.

Bogdan Armaselu, Ovidiu Daescu

Theor. Comput. Sci., 2019

2017

Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma.

Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain

Proceedings of the Biocomputing 2017: Proceedings of the Pacific Symposium, 2017

Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities.

Bogdan Armaselu, Ovidiu Daescu

Proceedings of the 10th International Conference on PErvasive Technologies Related to Assistive Environments, 2017

2016

Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint.

Bogdan Armaselu, Ovidiu Daescu

CoRR, 2016

Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper.

Bogdan Armaselu, Ovidiu Daescu

Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2016

Maximum Area Rectangle Separating Red and Blue Points.

Bogdan Armaselu, Ovidiu Daescu

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Algorithms for fair partitioning of convex polygons.

Bogdan Armaselu, Ovidiu Daescu

Theor. Comput. Sci., 2015

Whole slide images stitching for osteosarcoma detection.

Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015