Péter Madarasi

works on

computational complexity 1 kemeny rule 1 mallows model 1 np-completeness 1 ranking aggregation 1 social choice 1

From the 1 of 11 linked papers with an AI index.

collaborators

11 papers

math.CO2026

Proper ${a, b}$ -edge-weightings of trees

Péter Madarasi

Let $a$ and $b$ be distinct real weights. An ${a, b}$ -edge-weighting of a tree assigns one of these weights to each edge and is proper if adjacent vertices have different sums of…

cs.GT2026

The Complexity of Kemeny Aggregation with Three Rankings

PÃ©ter Madarasi

The paper proves that computing the Kemeny optimal ranking is NP‑complete even with exactly three unweighted rankings, and shows related winner and recognition problems are Σ₂^p‑co…

cs.DS2026

Temporal matching in trees

MÃ¡rk Hunor JuhÃ¡sz, PÃ©ter Madarasi

We study maximum matching problems in temporal graphs whose underlying graph is a tree. We consider two temporal models. In a $I^$ -matching, selected time edges sharing an endpoint…

cs.DS2026

Asymptotically Faster Algorithms for Recognizing $(k, ℓ)$ -Sparse Graphs

Bence DeÃ¡k, Bence Deák, PÃ©ter Madarasi +1

The family of $(k, ℓ)$ -sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theor…

math.CO2026

Polytopes of alternating sign matrices with dihedral symmetries

We study the convex hulls of $n \times n$ alternating sign matrices invariant under subgroups of the dihedral group of the square. For each non-trivial symmetry class, the symmetry…

cs.DS2025

Quadratic-Time Algorithm for the Maximum-Weight $(k, ℓ)$ -Sparse Subgraph Problem

The family of $(k, ℓ)$ -sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theo…