Péter Madarasi

List of EGRES technical reports

• Quadratic-Time Algorithm for the Maximum-Weight (k,l)-Sparse Subgraph Problem (Bence Deák, Péter Madarasi)
• Efficient Algorithms and Implementations for Extracting Maximum-Size (k,l)-Sparse Subgraphs (Péter Madarasi)
• Separable convex optimization over indegree polytopes (Nóra A. Borsik, Péter Madarasi)
• Simultaneous Network Design with Restricted Link Usage (Naonori Kakimura, Péter Madarasi, Jannik Matuschke, Kitti Varga)
• Prefix-bounded matrices (András Frank, Nóra A. Borsik, Péter Madarasi, Tamás Takács)
• Vertex-ordering and arc-partitioning problems (Nóra A. Borsik, Péter Madarasi)
• Matchings under distance constraints II. (Péter Madarasi)
• On vertex-coloring $\{a,b\}$-edge-weightings of graphs (Péter Madarasi, Máté Simon)
• Matchings under distance constraints I. (Péter Madarasi)
• A novel approach to graph isomorphism (Alpár Jüttner, Péter Madarasi)
• A Primal-Dual Approach for Large Scale Integer Problems (Alpár Jüttner, Péter Madarasi)
• VF2++ - An Improved Subgraph Isomorphism Algorithm (Alpár Jüttner, Péter Madarasi)

List of EGRES quick proofs

• Symmetry breaking when searching a graph with given property (Péter Madarasi)

---

Last modification: 24.5.2026. Please email your comments to Tamás Király!