2 citations · 2 across the 15 of their papers we have counts for
6 papers · 1 filter
Complexity, approximation, and extension of proper -edge-weightings
Péter Madarasi, Máté Simon
For distinct integers and , an -edge-weighting assigns or to each edge and labels each vertex by the sum of its incident weights. Such a weighting is proper…
Proper -edge-weightings of trees
Péter Madarasi
Let and be distinct real weights. An -edge-weighting of a tree assigns one of these weights to each edge and is proper if adjacent vertices have different sums of…
The Complexity of Kemeny Aggregation with Three Rankings
Péter Madarasi
The Kemeny rule aggregates rankings by minimizing their total Kendall-tau distance from an aggregate order. We prove that Kemeny Score is NP-complete for exactly three unweighted r…
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 -matching, selected time edges sharing an endpoint…
Asymptotically Faster Algorithms for Recognizing -Sparse Graphs
Bence Deák, Péter Madarasi
For fixed integers with , we study the problem of deciding whether a graph is -sparse, a notion arising in combinatorial optimization and rigidity…
Polytopes of alternating sign matrices with dihedral symmetries
Péter Madarasi
We study the convex hulls of alternating sign matrices invariant under subgroups of the dihedral group of the square. For each non-trivial symmetry class, the symmetry…