8 citations · 31 across the 33 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Strong NP-Completeness of Unrestricted Balanced Mobiles
Andrei Popa, Alexandru Popa
A mobile is a rooted full binary tree whose leaves carry positive integer weights. The imbalance of an internal node is the absolute difference between the total weights of its two…
cs.CC2018
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}…
cs.CC2014
A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979]. Given a pattern p and a text t, the goal is to find a…