Minisum and Minimax Committee Election Rules for General Preference Types. - Dorothea Baumeister; Toni Böhnlein; Lisa Rey; Oliver Schaudt; Ann-Kathrin Selker (ECAI, 2016)

Algorithmic Decision-Making in Multi-Agent Systems: Votes and Prices. - Toni Böhnlein (Dr. Hut, 2018)

On the Complexity of Stackelberg Matroid Pricing Problems. - Toni Böhnlein; Oliver Schaudt (IWOCA, 2020)

On Vertex-Weighted Graph Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (CIAC, 2021)

Relaxed and Approximate Graph Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Mor Perry; Dror Rawitz (IWOCA, 2021)

Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. - Toni Böhnlein; Stefan Kratsch; Oliver Schaudt (Math. Program., 2021)

On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (MFCS, 2022)

Randomized Strategies for Non-additive 3-Slope Ski Rental. - Toni Böhnlein; Sapir Erlich; Zvi Lotker; Dror Rawitz (SIROCCO, 2022)

On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SWAT, 2022)

Vertex-Weighted Graphs: Realizable and Unrealizable Domains. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (WALCOM, 2022)

The generalized microscopic image reconstruction problem. - Amotz Bar-Noy; Toni Böhnlein; Zvi Lotker; David Peleg; Dror Rawitz (Discret. Appl. Math., 2022)

On vertex-weighted realizations of acyclic and general graphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (Theor. Comput. Sci., 2022)

Minimum Surgical Probing with Convexity Constraints. - Toni Böhnlein; Niccolò Di Marco; Andrea Frosini (IWOCA, 2023)

Degree Realization by Bipartite Multigraphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SIROCCO, 2023)

Stackelberg packing games. - Toni Böhnlein; Oliver Schaudt; Joachim Schauer (Theor. Comput. Sci., 2023)

Forcibly bipartite and acyclic (uni-)graphic sequences. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (Discret. Math., 2023)

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 2024)

Sparse Graphic Degree Sequences Have Planar Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 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)

Weighted microscopic image reconstruction. - Amotz Bar-Noy; Toni Böhnlein; Zvi Lotker; David Peleg; Dror Rawitz (Discret. Appl. Math., 2024)

Degree Realization by Bipartite Cactus Graphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (CIAC (1), 2025)

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)

Approximate realizations for outerplanaric degree sequences. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (J. Comput. Syst. Sci., 2025)

On Bipartite Graph Realizations of a Single Degree Sequence. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SIAM J. Discret. Math., 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)