Bogdan Armaselu

22 papers C 2Misc 1Journal 13Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
On computing the maximum-volume bichromatic separating box.
Theor. Comput. Sci.
Bogdan Armaselu
2024 J jnl
Finding the largest separating rectangle among two point sets.
Theor. Comput. Sci.
Bogdan Armaselu
2023 J jnl
Approximation algorithms for some extensions of the maximum profit routing problem.
J. Comb. Optim.
Bogdan Armaselu
2023 J jnl
Randomized Algorithm for the Maximum-Profit Routing Problem.
CoRR
Bogdan Armaselu
2022 J jnl
Extensions of the Maximum Bichromatic Separating Rectangle Problem.
Inf.
Bogdan Armaselu
2021 — conf
Extensions of the Maximum Bichromatic Separating Rectangle Problem.
CCCG
Bogdan Armaselu
2021 J jnl
Extensions of the Maximum Bichromatic Separating Rectangle Problem.
CoRR
Bogdan Armaselu
2021 J jnl
Maximum-Profit Routing Problem with Multiple Vehicles per Site.
CoRR
Bogdan Armaselu
2020 J jnl
An APX for the Maximum-Profit Routing Problem with Variable Supply.
CoRR
Bogdan Armaselu
2020 J jnl
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box.
CoRR
Bogdan Armaselu
2019 J jnl
Dynamic minimum bichromatic separating circle.
Theor. Comput. Sci.
Bogdan Armaselu, Ovidiu Daescu
2017 Misc conf
Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma.
PSB
Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain
2017 — conf
Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities.
PETRA
Bogdan Armaselu, Ovidiu Daescu
2017 J jnl
Maximum Area Rectangle Separating Red and Blue Points.
CoRR
Bogdan Armaselu, Ovidiu Daescu
2017 — —
On the Geometric Separability of Bichromatic Point Sets.
Bogdan Armaselu
2016 J jnl
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint.
CoRR
Bogdan Armaselu, Ovidiu Daescu
2016 — conf
Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper.
PETRA
Bogdan Armaselu, Ovidiu Daescu
2016 — conf
Maximum Area Rectangle Separating Red and Blue Points.
CCCG
Bogdan Armaselu, Ovidiu Daescu
2015 J jnl
Algorithms for fair partitioning of convex polygons.
Theor. Comput. Sci.
Bogdan Armaselu, Ovidiu Daescu
2015 C conf
Dynamic Minimum Bichromatic Separating Circle.
COCOA
Bogdan Armaselu, Ovidiu Daescu
2015 — conf
Whole slide images stitching for osteosarcoma detection.
ICCABS
Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey
2014 C conf
Algorithms for Fair Partitioning of Convex Polygons.
COCOA
Bogdan Armaselu, Ovidiu Daescu