Toni Böhnlein

According to our database, Toni Böhnlein authored at least 17 papers between 2016 and 2024.

Collaborative distances:

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

2024

Weighted microscopic image reconstruction.

Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz

Discret. Appl. Math., March, 2024

2023

Forcibly bipartite and acyclic (uni-)graphic sequences.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Discret. Math., July, 2023

Stackelberg packing games.

Toni Böhnlein, Oliver Schaudt, Joachim Schauer

Theor. Comput. Sci., 2023

Degree Realization by Bipartite Multigraphs.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Proceedings of the Structural Information and Communication Complexity, 2023

Minimum Surgical Probing with Convexity Constraints.

Toni Böhnlein, Niccolò Di Marco, Andrea Frosini

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

On vertex-weighted realizations of acyclic and general graphs.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Theor. Comput. Sci., 2022

The generalized microscopic image reconstruction problem.

Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz

Discret. Appl. Math., 2022

Vertex-Weighted Graphs: Realizable and Unrealizable Domains.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Proceedings of the WALCOM: Algorithms and Computation, 2022

On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper).

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Randomized Strategies for Non-additive 3-Slope Ski Rental.

Toni Böhnlein, Sapir Erlich, Zvi Lotker, Dror Rawitz

Proceedings of the Structural Information and Communication Complexity, 2022

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

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting.

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

Math. Program., 2021

Relaxed and Approximate Graph Realizations.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

On Vertex-Weighted Graph Realizations.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

On the Complexity of Stackelberg Matroid Pricing Problems.

Toni Böhnlein, Oliver Schaudt

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2018

Algorithmic Decision-Making in Multi-Agent Systems: Votes and Prices.

Toni Böhnlein

PhD thesis, 2018

2016

Minisum and Minimax Committee Election Rules for General Preference Types.

Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016