default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToni Böhnlein
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148: 103588 (2025)- 2024
- [j6]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted microscopic image reconstruction. Discret. Appl. Math. 345: 17-33 (2024) - [c18]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. IWOCA 2024: 98-110 - [c17]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS 2024: 1:1-1:16 - [c16]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Sparse Graphic Degree Sequences Have Planar Realizations. MFCS 2024: 18:1-18:17 - [c15]Toni Böhnlein
, Pál András Papp, Albert-Jan Nicholas Yzelman:
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. SPAA 2024: 285-287 - [i2]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. CoRR abs/2405.03278 (2024) - [i1]Toni Böhnlein, Pál András Papp, A. N. Yzelman:
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. CoRR abs/2409.03898 (2024) - 2023
- [j5]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Forcibly bipartite and acyclic (uni-)graphic sequences. Discret. Math. 346(7): 113460 (2023) - [j4]Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg packing games. Theor. Comput. Sci. 943: 16-35 (2023) - [c14]Toni Böhnlein, Niccolò Di Marco, Andrea Frosini:
Minimum Surgical Probing with Convexity Constraints. IWOCA 2023: 136-147 - [c13]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Degree Realization by Bipartite Multigraphs. SIROCCO 2023: 3-17 - 2022
- [j3]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The generalized microscopic image reconstruction problem. Discret. Appl. Math. 321: 402-416 (2022) - [j2]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. 922: 81-95 (2022) - [c12]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. MFCS 2022: 14:1-14:15 - [c11]Toni Böhnlein, Sapir Erlich, Zvi Lotker, Dror Rawitz:
Randomized Strategies for Non-additive 3-Slope Ski Rental. SIROCCO 2022: 62-78 - [c10]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). SWAT 2022: 1:1-1:17 - [c9]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM 2022: 315-327 - 2021
- [j1]Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program. 187(1): 653-695 (2021) - [c8]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Vertex-Weighted Graph Realizations. CIAC 2021: 90-102 - [c7]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz:
Relaxed and Approximate Graph Realizations. IWOCA 2021: 3-19 - [c6]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. SOFSEM 2021: 373-386 - 2020
- [c5]Toni Böhnlein, Oliver Schaudt:
On the Complexity of Stackelberg Matroid Pricing Problems. IWOCA 2020: 83-96
2010 – 2019
- 2019
- [c4]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The Generalized Microscopic Image Reconstruction Problem. ISAAC 2019: 42:1-42:15 - [c3]Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg Packing Games. WADS 2019: 239-253 - 2018
- [b1]Toni Böhnlein:
Algorithmic Decision-Making in Multi-Agent Systems: Votes and Prices. University of Cologne, Germany, Dr. Hut 2018, ISBN 978-3-8439-3673-6, pp. 1-178 - 2017
- [c2]Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. ICALP 2017: 46:1-46:13 - 2016
- [c1]Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker:
Minisum and Minimax Committee Election Rules for General Preference Types. ECAI 2016: 1656-1657
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
