8 citations · 31 across the 33 of their papers we have counts for
8 papers · 1 filter
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}…
Analytic Geometry of Homogeneous Spaces
Alexandru Popa
The theory uses methods and language of linear algebra to study nonlinear spaces. These techniques can be used particularly to describe analytic geometry of non-linear elliptic, hy…
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization
Alexandru Popa, Andrei Tanasescu
Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon…
Hardness and algorithmic results for the approximate cover problem
Alexandru Popa, Andrei Tanasescu
In CPM 2017, Amir et al. introduce a problem, named \emph{approximate string cover} (\textbf{ACP}), motivated by many aplications including coding and automata theory, formal langu…
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…
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…