National Institute for Research and Development in Informatics

output

20172025

most citedIsometric embeddings in trees and their use in the diameter problem

4 citations

6 papers

cs.CL2023★ 3 cited

Adversarial Capsule Networks for Romanian Satire Detection and Sentiment Analysis

Sebastian-Vasile Echim, Răzvan-Alexandru Smădu, Andrei-Marius Avram +2

Satire detection and sentiment analysis are intensively explored natural language processing (NLP) tasks that study the identification of the satirical tone from texts and extracti…

cs.DS2023

$α_{i}$ -Metric Graphs: Radius, Diameter and all Eccentricities

Feodor F. Dragan, Guillaume Ducoffe

We extend known results on chordal graphs and distance-hereditary graphs to much larger graph classes by using only a common metric property of these graphs. Specifically, a graph…

cs.DS2020★ 2 cited

Around the diameter of AT-free graphs

Guillaume Ducoffe

A graph algorithm is truly subquadratic if it runs in $O (m^{b})$ time on connected $m$ -edge graphs, for some positive $b < 2$ . Roditty and Vassilevska Williams (STOC'13) prove…

cs.DS2020★ 4 cited

Isometric embeddings in trees and their use in the diameter problem

Guillaume Ducoffe

We prove that given a discrete space with $n$ points which is either embedded in a system of $k$ trees, or the Cartesian product of $k$ trees, we can compute all eccentricities in…

cs.DS2017★ 1 cited

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

David Coudert, Guillaume Ducoffe, Alexandru Popa

Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so…

cs.CR2017

CRSTIP - An Assessment Scheme for Security Assessment Processes

Arthur-Jozsef Molnar, Jürgen Großmann

Complex networked systems are an integral part of today's support infrastructures. Due to their importance, these systems become more and more the target for cyber-attacks, sufferi…