2 citations · 2 across the 15 of their papers we have counts for
7 papers · 1 filter
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…
Quadratic-Time Algorithm for the Maximum-Weight -Sparse Subgraph Problem
Bence Deák, Péter Madarasi
The family of -sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theo…
Efficient Algorithms and Implementations for Extracting Maximum-Size -Sparse Subgraphs
Péter Madarasi
A multigraph is -sparse if every subset induces at most edges. Finding a maximum-size -sparse subgraph i…
Simultaneous Network Design with Restricted Link Usage
Naonori Kakimura, Péter Madarasi, Jannik Matuschke +1
Given a digraph with two terminal vertices and as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to fin…
A graph isomorphism invariant based on neighborhood aggregation
Alpár Jüttner, Péter Madarasi
This paper presents a new graph isomorphism invariant, called -labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism prob…
The Simultaneous Assignment Problem
Péter Madarasi
This paper introduces the Simultaneous assignment problem. Let us given a graph with a weight and a capacity function on its edges, and a set of its subgraphs along with a degree u…