Bogdan Armaselu

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 18

Top Topics

Routing Problem

Approximation Algorithms

Top Venues

Theor. Comput. Sci.

Publications

Bogdan Armaselu
Randomized Algorithm for the Maximum-Profit Routing Problem. CoRR (2023)
Bogdan Armaselu
Approximation algorithms for some extensions of the maximum profit routing problem. J. Comb. Optim. 45 (1) (2023)
Bogdan Armaselu
Extensions of the Maximum Bichromatic Separating Rectangle Problem. Inf. 13 (10) (2022)
Bogdan Armaselu
Maximum-Profit Routing Problem with Multiple Vehicles per Site. CoRR (2021)
Bogdan Armaselu
Extensions of the Maximum Bichromatic Separating Rectangle Problem. CoRR (2021)
Bogdan Armaselu
Extensions of the Maximum Bichromatic Separating Rectangle Problem. CCCG (2021)
Bogdan Armaselu
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box. CoRR (2020)
Bogdan Armaselu
An APX for the Maximum-Profit Routing Problem with Variable Supply. CoRR (2020)
Bogdan Armaselu, Ovidiu Daescu
Dynamic minimum bichromatic separating circle. Theor. Comput. Sci. 774 (2019)
Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain
Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma. PSB (2017)
Bogdan Armaselu, Ovidiu Daescu
Maximum Area Rectangle Separating Red and Blue Points. CoRR (2017)
Bogdan Armaselu, Ovidiu Daescu
Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. PETRA (2017)
Bogdan Armaselu, Ovidiu Daescu
Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper. PETRA (2016)
Bogdan Armaselu, Ovidiu Daescu
Maximum Area Rectangle Separating Red and Blue Points. CCCG (2016)
Bogdan Armaselu, Ovidiu Daescu
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. CoRR (2016)
Bogdan Armaselu, Ovidiu Daescu
Algorithms for fair partitioning of convex polygons. Theor. Comput. Sci. 607 (2015)
Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey
Whole slide images stitching for osteosarcoma detection. ICCABS (2015)
Bogdan Armaselu, Ovidiu Daescu
Dynamic Minimum Bichromatic Separating Circle. COCOA (2015)
Bogdan Armaselu, Ovidiu Daescu
Algorithms for Fair Partitioning of Convex Polygons. COCOA (2014)