Expertini Research Research

Browse Research Papers

11+ open-access research outputs.

✕ Clear
🔍 raphael eidenbenz 📂 Computer Science
Showing 11 results for "raphael eidenbenz" in Computer Science
Computer Science Preprint PDF DOI

Peeling Rotten Potatoes for a Faster Approximation of Convex Cover

Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan · 2026

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm,…

Read Paper →
Computer Science Preprint PDF DOI

CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extraction

Hector R. Rodriguez, Jiechen Huang, Wenjian Yu · 2026

We present CapBench, a fully reproducible, multi-PDK dataset for capacitance extraction. The dataset is derived from open-source designs, including single-core CPUs, systems-on-chip, and media acceler…

Read Paper →
Computer Science Preprint PDF DOI

SceneGuard: Training-Time Voice Protection with Scene-Consistent Audible Background Noise

Rui Sang, Yuxuan Liu · 2025

Voice cloning technology poses significant privacy threats by enabling unauthorized speech synthesis from limited audio samples. Existing defenses based on imperceptible adversarial perturbations are …

Read Paper →
Computer Science Preprint PDF DOI

A Ratio-Based Shapley Value for Collaborative Machine Learning - Extended Version

Bjorn Filter, Ralf Moller, Ozgur Lutfu Ozcep · 2025

Collaborative machine learning enables multiple data owners to jointly train models for improved predictive performance. However, ensuring incentive compatibility and fair contribution-based rewards r…

Read Paper →
Computer Science Preprint PDF DOI

Leakage-Resilient Hardness Equivalence to Logspace Derandomization

Yakov Shalunov · 2023

Efficient derandomization has long been a goal in complexity theory, and a major recent result by Yanyi Liu and Rafael Pass identifies a new class of hardness assumption under which it is possible to …

Read Paper →
Computer Science Preprint PDF DOI

Game Implementation: What Are the Obstructions?

Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki, Sofia Simola, Manuel Sorge · 2022

In many applications, we want to influence the decisions of independent agents by designing incentives for their actions. We revisit a fundamental problem in this area, called GAME IMPLEMENTATION: Giv…

Read Paper →
Computer Science Preprint PDF DOI

Covering Polygons is Even Harder

Mikkel Abrahamsen · 2021

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is know…

Read Paper →
Computer Science Preprint PDF DOI

Improved Bounds for Online Dominating Sets of Trees

Koji M. Kobayashi · 2017

The online dominating set problem is an online variant of the minimum dominating set problem, which is one of the most important NP-hard problems on graphs. This problem is defined as follows: Given a…

Read Paper →
Computer Science Preprint PDF DOI

Approximability of Guarding Weak Visibility Polygons

Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy · 2014

The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon $P$, is fully guarded. In 1998, the problems of finding th…

Read Paper →
Computer Science Preprint PDF DOI

The Domino Problem of the Hyperbolic Plane Is Undecidable

Maurice Margenstern · 2007

In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The …

Read Paper →
Computer Science Preprint PDF DOI

Treillis de concepts et ontologies pour l'interrogation d'un annuaire de sources de donn\'{e}es biologiques (BioRegistry)

Nizar Messai (INRIA Lorraine - LORIA), Marie-Dominique Devignes (INRIA Lorraine - LORIA), Malika Smail-Tabbone (INRIA Lorraine - LORIA), Amedeo Napoli (INRIA Lorraine - LORIA) · 2005

Bioinformatic data sources available on the web are multiple and heterogenous. The lack of documentation and the difficulty of interaction with these data sources require users competence in both info…

Read Paper →