10.9k citations
- Centre National de la Recherche ScientifiqueFR128 papers
- Université Clermont AuvergneFR88 papers
- Institut PascalFR65 papers
- Aix-Marseille UniversitéFR57 papers
- Czech Technical University in PragueCZ54 papers
- Lyon 1 UniversitéFR54 papers
- University of ManchesterGB54 papers
- Brookhaven National LaboratoryUS53 papers
- Charles UniversityCZ53 papers
- Czech Academy of SciencesCZ53 papers
- Johannes Gutenberg University MainzDE53 papers
- Joint Institute for Nuclear ResearchRU53 papers
276 papers
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
A set of vertices in a graph is a dominating set of if every vertex not in has a neighbor in , where two vertices are neighbors if they are adjacent. The dominat…
Reproducible AI Requires Reproducible Randomness
Anthony Bertrand, Tom Schmitt, Engelbert Mephu Nguifo +1
Pseudorandom number generators (PRNGs) constitute indispensable computational tools across multiple scientific domains, including Monte Carlo simulations, stochastic computing, and…
Hybrid MKNF with Classical Negation in the Rule Component
Arun Raveendran Nair Sheela, Christophe Rey, Florence De Grancey
Hybrid MKNF knowledge bases under the well-founded semantics integrate Description Logics with Logic Programming. However, they do not support classical negation in the rule compon…
Algorithms and complexity for geodetic sets on interval and chordal graphs
Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2
We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set of vertices of a graph is a \textit{geodetic se…
Dominance and symmetry-breaking rules for the Graph Burning Problem
Nice Prado, Rafael Colares
The Graph Burning Problem (GBP) is a NP-Hard combinatorial optimization problem that models the propagation of influence or contagion in a network. The propagation is represented t…
Optimal Linear Interpolation under Differential Information: application to the prediction of perfect flows
Soumyodeep Mukhopadhyay, Didier Rullière, Rodolphe Le Riche +3
Approximation of functions satisfying partial differential equations (PDEs) is paramount for simulation of physical fluid flows and other problems in physics. Recently, physics-inf…