default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBogdan Armaselu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Bogdan Armaselu:
Finding the largest separating rectangle among two point sets. Theor. Comput. Sci. 1017: 114778 (2024)- 2023
- [j4]Bogdan Armaselu:
Approximation algorithms for some extensions of the maximum profit routing problem. J. Comb. Optim. 45(1): 26 (2023) - [i7]Bogdan Armaselu:
Randomized Algorithm for the Maximum-Profit Routing Problem. CoRR abs/2305.07838 (2023) - 2022
- [j3]Bogdan Armaselu:
Extensions of the Maximum Bichromatic Separating Rectangle Problem. Inf. 13(10): 476 (2022) - 2021
- [c8]Bogdan Armaselu:
Extensions of the Maximum Bichromatic Separating Rectangle Problem. CCCG 2021: 237-247 - [i6]Bogdan Armaselu:
Extensions of the Maximum Bichromatic Separating Rectangle Problem. CoRR abs/2106.13439 (2021) - [i5]Bogdan Armaselu:
Maximum-Profit Routing Problem with Multiple Vehicles per Site. CoRR abs/2109.05404 (2021) - 2020
- [i4]Bogdan Armaselu:
An APX for the Maximum-Profit Routing Problem with Variable Supply. CoRR abs/2007.09282 (2020) - [i3]Bogdan Armaselu:
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box. CoRR abs/2012.12846 (2020)
2010 – 2019
- 2019
- [j2]Bogdan Armaselu, Ovidiu Daescu:
Dynamic minimum bichromatic separating circle. Theor. Comput. Sci. 774: 133-142 (2019) - 2017
- [c7]Bogdan Armaselu, Ovidiu Daescu:
Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. PETRA 2017: 13-16 - [c6]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: 195-206 - [i2]Bogdan Armaselu, Ovidiu Daescu:
Maximum Area Rectangle Separating Red and Blue Points. CoRR abs/1706.03268 (2017) - 2016
- [c5]Bogdan Armaselu, Ovidiu Daescu:
Maximum Area Rectangle Separating Red and Blue Points. CCCG 2016: 244-251 - [c4]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: 75 - [i1]Bogdan Armaselu, Ovidiu Daescu:
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. CoRR abs/1612.01038 (2016) - 2015
- [j1]Bogdan Armaselu, Ovidiu Daescu:
Algorithms for fair partitioning of convex polygons. Theor. Comput. Sci. 607: 351-362 (2015) - [c3]Bogdan Armaselu, Ovidiu Daescu:
Dynamic Minimum Bichromatic Separating Circle. COCOA 2015: 688-697 - [c2]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: 1-5 - 2014
- [c1]Bogdan Armaselu, Ovidiu Daescu:
Algorithms for Fair Partitioning of Convex Polygons. COCOA 2014: 53-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
