98 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of BucharestRO15 papers
- Institut de Recherche en Informatique FondamentaleFR5 papers
- Kent State UniversityUS5 papers
- Université Paris CitéFR4 papers
- Département d'InformatiqueFR3 papers
- École Normale Supérieure - PSLFR3 papers
- Universitatea Națională de Știință și Tehnologie Politehnica BucureștiRO3 papers
- Telecom Italia LabIT2 papers
- Aix-Marseille UniversitéFR1 paper
- Argosy UniversityUS1 paper
- Beijing Institute for Brain DisordersCN1 paper
- Bucharest Emergency University Hospital1 paper
24 papers
SeLeRoSa: Sentence-Level Romanian Satire Detection Dataset
Răzvan-Alexandru Smădu, Andreea Iuga, Dumitru-Clementin Cercel +1
Satire, irony, and sarcasm are techniques typically used to express humor and critique, rather than deceive; however, they can occasionally be mistaken for factual reporting, akin…
Bow Metrics and Hyperbolicity
Feodor F. Dragan, Guillaume Ducoffe, Michel Habib +1
A ()-bow metric was defined in (Dragan & Ducoffe, 2023) as a far reaching generalization of an -metric (which is equivalent to a ()-bow metric). A graph is…
Practical Computation of Graph VC-Dimension
David Coudert, Mónika Csikós, Guillaume Ducoffe +1
For any set system , a subset is called \emph{shattered} if every results from the intersection of with some set in…
-Metric Graphs: Hyperbolicity
Feodor F. Dragan, Guillaume Ducoffe
A graph is called -metric () if it satisfies the following -metric property for every vertices and : if a shortest path between and a…
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…
-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…
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
Pierre Bergé, Guillaume Ducoffe, Michel Habib
On sparse graphs, Roditty and Williams [2013] proved that no -time algorithm achieves an approximation factor smaller than for the diameter prob…
Around the diameter of AT-free graphs
Guillaume Ducoffe
A graph algorithm is truly subquadratic if it runs in time on connected -edge graphs, for some positive . Roditty and Vassilevska Williams (STOC'13) prove…
Isometric embeddings in trees and their use in the diameter problem
Guillaume Ducoffe
We prove that given a discrete space with points which is either embedded in a system of trees, or the Cartesian product of trees, we can compute all eccentricities in…
Diameter computation on -minor free graphs and graphs of bounded (distance) VC-dimension
Guillaume Ducoffe, Michel Habib, Laurent Viennot
We propose to study unweighted graphs of constant distance VC-dimension as a broad generalization of many graph classes for which we can compute the diameter in truly subquadratic-…
Faster approximation algorithms for computing shortest cycles on weighted graphs
Guillaume Ducoffe
Given an -vertex -edge graph with non negative edge-weights, the girth of is the weight of a shortest cycle in . For any graph with polynomially bounded intege…
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani +3
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs and the \emph{anti-Ramsey number}…
Polynomial-time Recognition of 4-Steiner Powers
Guillaume Ducoffe
The -power of a given graph is obtained from by adding an edge between every two distinct vertices at a distance at most in . We call a -Steiner…
An output-sensitive algorithm for the minimization of 2-dimensional String Covers
Alexandru Popa, Andrei Tanasescu
String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis…
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
Guillaume Ducoffe, Alexandru Popa
We address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that…
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs
Guillaume Ducoffe, Alexandru Popa
We present a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some of their generalizations. This improves on [Dragan, WG'97], who proposed such a…
Fast approximation and exact computation of negative curvature parameters of graphs
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan +3
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov…
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
Feodor F. Dragan, Guillaume Ducoffe, Michel Habib +1
In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity)…
Heuristic algorithms for the min-max edge 2-coloring problem
Radu Stefan Mincu, Alexandru Popa
In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study sev…
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…
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…
Exploring the reproducibility of functional connectivity alterations in Parkinson's Disease
Liviu Badea, Mihaela Onu, Tao Wu +2
Since anatomic MRI is presently not able to directly discern neuronal loss in Parkinson's Disease (PD), studying the associated functional connectivity (FC) changes seems a promisi…
Language Modelling For Task-Oriented Domains
Cosmin Popovici, Paolo Baggia
This paper is focused on the language modelling for task-oriented domains and presents an accurate analysis of the utterances acquired by the Dialogos spoken dialogue system. Dialo…
Specialized Language Models using Dialogue Predictions
Cosmin Popovici, Paolo Baggia
This paper analyses language modeling in spoken dialogue systems for accessing a database. The use of several language models obtained by exploiting dialogue predictions gives bett…