default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian Marius Deaconu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Javad Tayyebi
, Mihai-Lucian Rîtan, Adrian Marius Deaconu:
Widest Path in Networks with Gains/Losses. Axioms 13(2): 127 (2024)- [c3]Javad Tayyebi, Mihai-Lucian Rîtan, Adrian Marius Deaconu:
Generalized Maximum Capacity Path Problem with Loss Factors. ICORES 2024: 302-308 - 2023
- [j7]Javad Tayyebi, Adrian Marius Deaconu, Hamid Bigdeli, Malihe Niksirat:
Shortest path interdiction problem with convex piecewise-linear costs. Comput. Appl. Math. 42(7): 309 (2023) - [c2]Delia Spridon, Adrian Marius Deaconu, Laura Ciupala:
Fast CUDA Geomagnetic Map Builder. ICCSA (1) 2023: 126-138 - [c1]Adrian Marius Deaconu, Delia Spridon, Laura Ciupala:
Finding minimum loss path in big networks. ISPDC 2023: 39-44 - [i1]Adrian Marius Deaconu, Javad Tayyebi, Mihai-Lucian Rîtan:
Maximum capacity path problem with loss factors. CoRR abs/2312.05881 (2023) - 2021
- [j6]Razvan Udroiu, Adrian Marius Deaconu, Corina-Stefania Nanau:
Data Delivery in a Disaster or Quarantined Area Divided into Triangles Using DTN-Based Algorithms for Unmanned Aerial Vehicles. Sensors 21(11): 3572 (2021) - [j5]Adrian Marius Deaconu, Razvan Udroiu, Corina-Stefania Nanau:
Algorithms for Delivery of Data by Drones in an Isolated Area Divided into Squares. Sensors 21(16): 5472 (2021) - 2020
- [j4]Adrian Marius Deaconu, Javad Tayyebi:
Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks. IEEE Access 8: 225957-225966 (2020)
2000 – 2009
- 2008
- [j3]Adrian Marius Deaconu:
The inverse maximum flow problem considering l ∞ norm. RAIRO Oper. Res. 42(3): 401-414 (2008) - 2006
- [j2]Adrian Marius Deaconu:
A Cardinality Inverse Maximum Flow Problem. Sci. Ann. Cuza Univ. 16: 51-62 (2006) - 2004
- [j1]Adrian Marius Deaconu:
Iterative Algorithm for Construction of a Tree from its Pre-order and Post-order Traversals in Linear Time and Space. Sci. Ann. Cuza Univ. 14: 69-80 (2004)
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 2024-10-07 22:24 CEST 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:
