Cosmin Bonchis

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 31

Top Topics

Cooperative Games

Disjoint Subsets

Image Sharpening

Top Venues

Publications

Victor Bogdan, Cosmin Bonchis, Ciprian Orhei
An Image Sharpening Technique Based on Dilated Filters and 2D-DWT Image Fusion. VISIGRAPP (3): VISAPP (2024)
Gabriel Istrate, Cosmin Bonchis, Victor Bogdan
Equilibria in multiagent online problems with predictions. CoRR (2024)
Gabriel Istrate, Cosmin Bonchis
A parametric worst-case approach to fairness in cooperative games with transferable utility. Theor. Comput. Sci. 940 (Part) (2023)
Alexandru Munteanu, Cosmin Bonchis, Victor Bogdan
In-situ Data Analysis for Determining Air Quality Influential Locations. A Case Study on Lombardy, Italy. IGARSS (2023)
Vlad Rochian, Cosmin Bonchis, Ionut Tepeneu
Worker-to-Task Skill-Based Assignment. AINA (3) (2023)
Gabriel Istrate, Cosmin Bonchis
Mechanism Design With Predictions for Obnoxious Facility Location. CoRR (2022)
Gabriel Istrate, Cosmin Bonchis
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. AAMAS (2022)
Gabriel Istrate, Cosmin Bonchis, Adrian Craciun
Kernelization, Proof Complexity and Social Choice. ICALP (2021)
Gabriel Istrate, Cosmin Bonchis, Adrian Craciun
Kernelization, Proof Complexity and Social Choice. CoRR (2021)
Ciprian Orhei, Victor Bogdan, Cosmin Bonchis
Dilated filters for edge detection algorithms. CoRR (2021)
Florin Rosu, Cosmin Bonchis, Eva Kaslik
Numerical simulation algorithm for fractional-order systems implemented in CUDA. SYNASC (2020)
Ciprian Orhei, Victor Bogdan, Cosmin Bonchis
Edge map response of dilated and reconstructed classical filters. SYNASC (2020)
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)
Gabriel Istrate, Cosmin Bonchis
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. CoRR (2020)
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)
Flavius Turcu, Cosmin Bonchis, Mohamed Najim
Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discret. Appl. Math. 272 (2020)
Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu
Attacking Power Indices by Manipulating Player Reliability. AAMAS (2019)
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 (2019)
Victor Bogdan, Cosmin Bonchis, Ciprian Orhei
Custom Extended Sobel Filters. CoRR (2019)
Gabriel Istrate, Cosmin Bonchis, Mircea Marin
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. CoRR (2019)
Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu
Attacking Power Indices by Manipulating Player Reliability. CoRR (2019)
Cosmin Bonchis, Eva Kaslik, Florin Rosu
HPC optimal parallel communication algorithm for the simulation of fractional-order systems. J. Supercomput. 75 (3) (2019)
Cosmin Bonchis, Gabriel Istrate, Vlad Rochian
The language (and series) of Hammersley-type processes. CoRR (2018)
Cosmin Bonchis, Gabriel Istrate, Vlad Rochian
The Language (and Series) of Hammersley-Type Processes. MCU (2018)
János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate
Computing a minimal partition of partial orders into heapable subsets. CoRR (2017)
Cosmin Bonchis, Eva Kaslik, Florin Rosu
HPC optimal parallel communication algorithm for the simulation of fractional-order systems. CoRR (2017)
Andrada Baban, Cosmin Bonchis, Alexandru Fikl, Florin Rosu
Parallel Simulations for Fractional-Order Systems. SYNASC (2016)
Gabriel Istrate, Cosmin Bonchis
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. DCFS (2016)
Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu
The Minimum Entropy Submodular Set Cover Problem. LATA (2016)
Gabriel Istrate, Cosmin Bonchis
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process. CoRR (2015)
Gabriel Istrate, Cosmin Bonchis
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. CPM (2015)
Cosmin Bonchis, Gabriel Istrate
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. Inf. Process. Lett. 114 (7) (2014)
Cosmin Bonchis, Gabriel Istrate
Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). CoRR (2014)
Cosmin Bonchis, Gabriel Istrate
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem CoRR (2012)
Cosmin Bonchis, Gabriel Istrate
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games CoRR (2012)
Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu
Information Theory over Multisets. Comput. Informatics 27 (3+) (2008)
Cosmin Bonchis, Gabriel Ciobanu, Graiela Ghergu, Cornel Izbasa
Data Compression on Multisets. Submultiset-Free Codes. SYNASC (2008)
Cosmin Bonchis, Cornel Izbasa, Gabriel Ciobanu
Number Encodings and Arithmetics over Multisets. SYNASC (2006)
Dana Petcu, Cosmin Bonchis, Cornel Izbasa
Symbolic Computations based on Grid Services. Int. J. Comput. Commun. Control 1 (1) (2006)
Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa
Encodings and Arithmetic Operations in Membrane Computing. TAMC (2006)
Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa, Dana Petcu
A Web-Based P Systems Simulator and Its Parallelization. UC (2005)