Cosmin Bonchis

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