Predicting algorithmic complexity through structure analysis and compression. - Zoltán Ádám Mann; Pál András Papp (Appl. Soft Comput., 2013)

Formula partitioning revisited. - Zoltán Ádám Mann; Pál András Papp (POS@SAT, 2014)

Guiding SAT Solving by Formula Partitioning. - Zoltán Ádám Mann; Pál András Papp (Int. J. Artif. Intell. Tools, 2017)

Stabilization Time in Minority Processes. - Pál András Papp; Roger Wattenhofer (ISAAC, 2019)

Stabilization Time in Weighted Minority Processes. - Pál András Papp; Roger Wattenhofer (STACS, 2019)

A General Stabilization Bound for Influence Propagation in Graphs. - Pál András Papp; Roger Wattenhofer (ICALP, 2020)

Network-Aware Strategies in Financial Systems. - Pál András Papp; Roger Wattenhofer (ICALP, 2020)

On the Hardness of Red-Blue Pebble Games. - Pál András Papp; Roger Wattenhofer (SPAA, 2020)

Sequential Defaulting in Financial Networks. - Pál András Papp; Roger Wattenhofer (ITCS, 2021)

Stabilization Bounds for Influence Propagation from a Random Initial State. - Pál András Papp; Roger Wattenhofer (MFCS, 2021)

DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. - Pál András Papp; Karolis Martinkus; Lukas Faber; Roger Wattenhofer (NeurIPS, 2021)

Debt Swapping for Risk Mitigation in Financial Networks. - Pál András Papp; Roger Wattenhofer (EC, 2021)

Default Ambiguity: Finding the Best Solution to the Clearing Problem. - Pál András Papp; Roger Wattenhofer (WINE, 2021)

Two-Class (r, k)-Coloring: Coloring with Service Guarantees. - Pál András Papp; Roland Schmid; Valentin Stoppiello; Roger Wattenhofer (CoRR, 2021)

A Study of Influence Propagation in Social and Financial Networks. - Pál András Papp (2021)

An Introduction to Graph Neural Networks from a Distributed Computing Perspective. - Pál András Papp; Roger Wattenhofer (ICDCIT, 2022)

A Theoretical Comparison of Graph Neural Network Extensions. - Pál András Papp; Roger Wattenhofer (ICML, 2022)

Agent-based Graph Neural Networks. - Karolis Martinkus; Pál András Papp; Benedikt Schesch; Roger Wattenhofer (ICLR, 2023)

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. - Pál András Papp; Georg Anegg; Albert-Jan Nicholas Yzelman (SPAA, 2023)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (IPDPS (Workshops), 2024)

Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. - Toni Böhnlein; Pál András Papp; Albert-Jan Nicholas Yzelman (SPAA, 2024)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models. - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (SPAA, 2024)

Efficient Parallel Scheduling for Sparse Triangular Solvers. - Toni Böhnlein; Pál András Papp; Raphael S. Steiner; Albert-Jan Nicholas Yzelman (IPDPS (Workshops), 2025)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs. - Toni Böhnlein; Pál András Papp; Albert-Jan Nicholas Yzelman (SIROCCO, 2025)

DAG Scheduling in the BSP Model. - Pál András Papp; Georg Anegg; Albert-Jan Yzelman (SOFSEM (2), 2025)

The Impact of Partial Computations on the Red-Blue Pebble Game. - Pál András Papp; Aleksandros Sobczyk; Albert-Jan Nicholas Yzelman (SPAA, 2025)

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions. - Pál András Papp; Toni Böhnlein; A. N. Yzelman (CoRR, 2025)