default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeniamin Bogosel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Beniamin Bogosel, Dorin Bucur:
Polygonal Faber-Krahn inequality: Local minimality via validated computing. CoRR abs/2406.11575 (2024)- 2023
- [j14]Grégoire Allaire
, Martin Bihr, Beniamin Bogosel, Matías Godoy:
Accessibility constraints in structural optimization via distance functions. J. Comput. Phys. 484: 112083 (2023) - [i2]Beniamin Bogosel, Giuseppe C. Buttazzo, Édouard Oudet:
On the numerical approximation of Blaschke-Santaló diagrams using Centroidal Voronoi Tessellations. CoRR abs/2302.00603 (2023) - 2022
- [j13]Pedro R. S. Antunes, Beniamin Bogosel:
Parametric shape optimization using the support function. Comput. Optim. Appl. 82(1): 107-138 (2022) - [j12]Pedro R. S. Antunes, Beniamin Bogosel:
Correction to: Parametric shape optimization using the support function. Comput. Optim. Appl. 82(1): 139 (2022) - [i1]Beniamin Bogosel, Dorin Bucur:
On the Polygonal Faber-Krahn Inequality. CoRR abs/2203.16409 (2022) - 2021
- [j11]Grégoire Allaire, Beniamin Bogosel, Matías Godoy:
Shape Optimization of an Imperfect Interface: Steady-State Heat Diffusion. J. Optim. Theory Appl. 191(1): 169-201 (2021) - [j10]Abdelkader Al Sayed, Beniamin Bogosel, Antoine Henrot, Florent Nacry:
Maximization of the Steklov Eigenvalues With a Diameter Constraint. SIAM J. Math. Anal. 53(1): 710-729 (2021) - 2020
- [j9]Beniamin Bogosel, Vincent Perrollaz, Kilian Raschel, Amélie Trotignon:
3D positive lattice walks and spherical triangles. J. Comb. Theory A 172: 105189 (2020)
2010 – 2019
- 2018
- [j8]Beniamin Bogosel:
Efficient algorithm for optimizing spectral partitions. Appl. Math. Comput. 333: 61-75 (2018) - [j7]Beniamin Bogosel, Antoine Henrot, Ilaria Lucardesi:
Minimization of the Eigenvalues of the Dirichlet-Laplacian with a Diameter Constraint. SIAM J. Math. Anal. 50(5): 5337-5361 (2018) - 2017
- [j6]Beniamin Bogosel, Édouard Oudet:
Partitions of Minimal Length on Manifolds. Exp. Math. 26(4): 496-508 (2017) - [j5]Beniamin Bogosel, Doina Bucur, Alessandro Giacomini:
Optimal Shapes Maximizing the Steklov Eigenvalues. SIAM J. Math. Anal. 49(2): 1645-1680 (2017) - [j4]Beniamin Bogosel:
A Geometric Proof of the Siebeck-Marden Theorem. Am. Math. Mon. 124(5): 459-463 (2017) - 2016
- [j3]Beniamin Bogosel:
The method of fundamental solutions applied to boundary eigenvalue problems. J. Comput. Appl. Math. 306: 265-285 (2016) - [j2]Beniamin Bogosel, Édouard Oudet:
Qualitative and Numerical Analysis of a Spectral Problem with Perimeter Constraint. SIAM J. Control. Optim. 54(1): 317-340 (2016) - [j1]Beniamin Bogosel, Bozhidar Velichkov:
A Multiphase Shape Optimization Problem for Eigenvalues: Qualitative Study and Numerical Results. SIAM J. Numer. Anal. 54(1): 210-241 (2016)
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-07-19 19:16 CEST 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:
