default search action
Cosmin Bonchis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Victor Bogdan, Cosmin Bonchis, Ciprian Orhei
:
An Image Sharpening Technique Based on Dilated Filters and 2D-DWT Image Fusion. VISIGRAPP (3): VISAPP 2024: 591-598 - [i16]Gabriel Istrate, Cosmin Bonchis, Victor Bogdan:
Equilibria in multiagent online problems with predictions. CoRR abs/2405.11873 (2024) - 2023
- [j7]Gabriel Istrate, Cosmin Bonchis:
A parametric worst-case approach to fairness in cooperative games with transferable utility. Theor. Comput. Sci. 940(Part): 189-205 (2023) - [c17]Vlad Rochian, Cosmin Bonchis, Ionut Tepeneu:
Worker-to-Task Skill-Based Assignment. AINA (3) 2023: 157-168 - [c16]Alexandru Munteanu
In-situ Data Analysis for Determining Air Quality Influential Locations. A Case Study on Lombardy, Italy. IGARSS 2023: 6756-6759 - 2022
- [c15]Gabriel Istrate, Cosmin Bonchis:
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. AAMAS 2022: 651-659 - [i15]Gabriel Istrate, Cosmin Bonchis:
Mechanism Design With Predictions for Obnoxious Facility Location. CoRR abs/2212.09521 (2022) - 2021
- [c14]Gabriel Istrate, Cosmin Bonchis, Adrian Craciun:
Kernelization, Proof Complexity and Social Choice. ICALP 2021: 135:1-135:21 - [i14]Gabriel Istrate, Cosmin Bonchis, Adrian Craciun:
Kernelization, Proof Complexity and Social Choice. CoRR abs/2104.13681 (2021) - [i13]Ciprian Orhei, Victor Bogdan, Cosmin Bonchis:
Dilated filters for edge detection algorithms. CoRR abs/2106.07395 (2021) - 2020
- [j6]Flavius Turcu, Cosmin Bonchis
Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discret. Appl. Math. 272: 90-99 (2020) - [j5]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca:
On the heapability of finite partial orders. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [c13]Gabriel Istrate, Cosmin Bonchis, Claudiu Gatina:
It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities. AAMAS 2020: 566-574 - [c12]Florin Rosu, Cosmin Bonchis, Eva Kaslik
Numerical simulation algorithm for fractional-order systems implemented in CUDA. SYNASC 2020: 63-66 - [c11]Ciprian Orhei
Edge map response of dilated and reconstructed classical filters. SYNASC 2020: 187-194 - [i12]Gabriel Istrate, Cosmin Bonchis:
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. CoRR abs/2011.13163 (2020)
2010 – 2019
- 2019
- [j4]Cosmin Bonchis, Eva Kaslik
HPC optimal parallel communication algorithm for the simulation of fractional-order systems. J. Supercomput. 75(3): 1014-1025 (2019) - [c10]Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu:
Attacking Power Indices by Manipulating Player Reliability. AAMAS 2019: 538-546 - [i11]Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu:
Attacking Power Indices by Manipulating Player Reliability. CoRR abs/1903.01165 (2019) - [i10]Gabriel Istrate, Cosmin Bonchis, Claudiu Gatina:
It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities. CoRR abs/1909.11084 (2019) - [i9]Gabriel Istrate, Cosmin Bonchis, Mircea Marin:
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. CoRR abs/1909.12353 (2019) - [i8]Victor Bogdan, Cosmin Bonchis, Ciprian Orhei:
Custom Extended Sobel Filters. CoRR abs/1910.00138 (2019) - 2018
- [c9]Cosmin Bonchis, Gabriel Istrate, Vlad Rochian:
The Language (and Series) of Hammersley-Type Processes. MCU 2018: 69-87 - [i7]Cosmin Bonchis, Gabriel Istrate, Vlad Rochian:
The language (and series) of Hammersley-type processes. CoRR abs/1802.03436 (2018) - 2017
- [i6]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate:
Computing a minimal partition of partial orders into heapable subsets. CoRR abs/1706.01230 (2017) - [i5]Cosmin Bonchis, Eva Kaslik, Florin Rosu:
HPC optimal parallel communication algorithm for the simulation of fractional-order systems. CoRR abs/1710.01133 (2017) - 2016
- [c8]Gabriel Istrate, Cosmin Bonchis:
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. DCFS 2016: 18-28 - [c7]Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu:
The Minimum Entropy Submodular Set Cover Problem. LATA 2016: 295-306 - [c6]Andrada Baban, Cosmin Bonchis, Alexandru Fikl
Parallel Simulations for Fractional-Order Systems. SYNASC 2016: 141-144 - 2015
- [c5]Gabriel Istrate, Cosmin Bonchis:
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. CPM 2015: 261-271 - [i4]Gabriel Istrate, Cosmin Bonchis:
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process. CoRR abs/1502.02045 (2015) - 2014
- [j3]Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. Inf. Process. Lett. 114(7): 360-364 (2014) - [i3]Cosmin Bonchis, Gabriel Istrate:
Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). CoRR abs/1402.4343 (2014) - 2012
- [i2]Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. CoRR abs/1207.7134 (2012) - [i1]Cosmin Bonchis, Gabriel Istrate:
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games. CoRR abs/1208.0283 (2012)
2000 – 2009
- 2008
- [j2]Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu:
Information Theory over Multisets. Comput. Informatics 27(3+): 441-451 (2008) - [c4]Cosmin Bonchis, Gabriel Ciobanu
Data Compression on Multisets. Submultiset-Free Codes. SYNASC 2008: 152-157 - 2006
- [j1]Dana Petcu
Symbolic Computations based on Grid Services. Int. J. Comput. Commun. Control 1(1): 33-39 (2006) - [c3]Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu:
Number Encodings and Arithmetics over Multisets. SYNASC 2006: 354-364 - [c2]Cosmin Bonchis, Gabriel Ciobanu
Encodings and Arithmetic Operations in Membrane Computing. TAMC 2006: 621-630 - 2005
- [c1]Cosmin Bonchis, Gabriel Ciobanu
A Web-Based P Systems Simulator and Its Parallelization. UC 2005: 58-69
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-08-05 20:21 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: