Cosmin Bonchis

CoRR, 2024

An Image Sharpening Technique Based on Dilated Filters and 2D-DWT Image Fusion.

[BibT_eX]

[DOI]

Proceedings of the 19th International Joint Conference on Computer Vision, 2024

2023

A parametric worst-case approach to fairness in cooperative games with transferable utility.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

In-situ Data Analysis for Determining Air Quality Influential Locations. A Case Study on Lombardy, Italy.

[BibT_eX]

[DOI]

Alexandru Munteanu

Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2023

Worker-to-Task Skill-Based Assignment.

[BibT_eX]

[DOI]

Vlad Rochian

Ionut Tepeneu

Proceedings of the Advanced Information Networking and Applications, 2023

2022

Mechanism Design With Predictions for Obnoxious Facility Location.

[BibT_eX]

[DOI]

CoRR, 2022

Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Dilated filters for edge detection algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

Kernelization, Proof Complexity and Social Choice.

[BibT_eX]

[DOI]

Adrian Craciun

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

On the heapability of finite partial orders.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms.

[BibT_eX]

[DOI]

Flavius Turcu

Mohamed Najim

Discret. Appl. Math., 2020

Numerical simulation algorithm for fractional-order systems implemented in CUDA.

[BibT_eX]

[DOI]

Florin Rosu

Eva Kaslik

Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2020

Edge map response of dilated and reconstructed classical filters.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2020

It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities.

[BibT_eX]

[DOI]

Claudiu Gatina

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

HPC optimal parallel communication algorithm for the simulation of fractional-order systems.

[BibT_eX]

[DOI]

Eva Kaslik

Florin Rosu

J. Supercomput., 2019

Custom Extended Sobel Filters.

[BibT_eX]

[DOI]

CoRR, 2019

Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm.

[BibT_eX]

[DOI]

Mircea Marin

CoRR, 2019

It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities.

[BibT_eX]

[DOI]

Claudiu Gatina

CoRR, 2019

Attacking Power Indices by Manipulating Player Reliability.

[BibT_eX]

[DOI]

Alin Brîndusescu

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

The Language (and Series) of Hammersley-Type Processes.

[BibT_eX]

[DOI]

Vlad Rochian

Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

2017

Computing a minimal partition of partial orders into heapable subsets.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Parallel Simulations for Fractional-Order Systems.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

The Minimum Entropy Submodular Set Cover Problem.

[BibT_eX]

[DOI]

Liviu P. Dinu

Proceedings of the Language and Automata Theory and Applications, 2016

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games).

[BibT_eX]

[DOI]

CoRR, 2014

2012

A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games

[BibT_eX]

[DOI]

CoRR, 2012

2008

Information Theory over Multisets.

[BibT_eX]

[DOI]

Gabriel Ciobanu

Comput. Informatics, 2008

Data Compression on Multisets. Submultiset-Free Codes.

[BibT_eX]

[DOI]

Proceedings of the SYNASC 2008, 2008

2006

Symbolic Computations based on Grid Services.

[BibT_eX]

[DOI]

Dana Petcu

Int. J. Comput. Commun. Control, 2006

Encodings and Arithmetic Operations in Membrane Computing.

[BibT_eX]

[DOI]

Gabriel Ciobanu

Proceedings of the Theory and Applications of Models of Computation, 2006

Number Encodings and Arithmetics over Multisets.

[BibT_eX]

[DOI]