Péter Madarasi

According to our database, Péter Madarasi authored at least 15 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Asymptotically faster algorithms for recognizing (k,ℓ)-sparse graphs.

Bence Deák, Péter Madarasi

CoRR, April, 2026

Polytopes of alternating sign matrices with dihedral-subgroup symmetry.

Péter Madarasi

CoRR, February, 2026

2025

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

Bence Deák, Péter Madarasi

CoRR, November, 2025

Efficient Algorithms and Implementations for Extracting Maximum-Size (k,ℓ)-Sparse Subgraphs.

Péter Madarasi

CoRR, November, 2025

Separable convex optimization over indegree polytopes.

Nóra A. Borsik, Péter Madarasi

CoRR, September, 2025

Vertex-ordering and arc-partitioning problems.

Nóra A. Borsik, Péter Madarasi

CoRR, September, 2025

Simultaneous Network Design with Restricted Link Usage.

Naonori Kakimura, Péter Madarasi, Jannik Matuschke, Kitti Varga

CoRR, July, 2025

Prefix-bounded matrices.

Nóra A. Borsik, András Frank, Péter Madarasi, Tamás Takács

CoRR, May, 2025

2024

Matchings under distance constraints II.

Péter Madarasi

Ann. Oper. Res., January, 2024

2023

A graph isomorphism invariant based on neighborhood aggregation.

Alpár Jüttner, Péter Madarasi

CoRR, 2023

2022

Optimizations of a Multi-Agent System for a Real-World Warehouse Problem.

Botond Ács, László Dóra, Olivér Jakab, Alpár Jüttner, Péter Madarasi, László Z. Varga

SN Comput. Sci., 2022

2021

The Simultaneous Assignment Problem.

Péter Madarasi

CoRR, 2021

Matchings under distance constraints I.

Péter Madarasi

Ann. Oper. Res., 2021

2020

The Distance Matching Problem.

Péter Madarasi

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2018

VF2++ - An improved subgraph isomorphism algorithm.

Alpár Jüttner, Péter Madarasi

Discret. Appl. Math., 2018