default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo de Wolff
Person information
- affiliation: Technische Universität Braunschweig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Timo de Wolff
, Janin Heuer:
Initial Application of SONC to Lyapunov Stability of Dynamical Systems. ISSAC 2024: 361-370- [i11]Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller, Timo de Wolff:
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion. CoRR abs/2401.16149 (2024) - 2023
- [j11]Elisenda Feliu, Nidhi Kaihnsa, Timo de Wolff, Oguzhan Yürük:
Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks. SIAM J. Appl. Dyn. Syst. 22(3): 2024-2053 (2023) - [i10]Sabrina Ammann, Maximilian Hess, Debora Ramacciotti, Sándor P. Fekete, Paulina L. A. Goedicke, David Gross, Andreea Lefterovici, Tobias J. Osborne, Michael Perk, Antonio Rotundo, S. E. Skelton, Sebastian Stiller, Timo de Wolff:
Realistic Runtime Analysis for Quantum Simplex Computation. CoRR abs/2311.09995 (2023) - 2022
- [j10]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. Found. Comput. Math. 22(2): 365-387 (2022) - [j9]Jacob Hartzer, Olivia Röhrig, Timo de Wolff, Oguzhan Yürük:
Initial steps in the classification of maximal mediated sets. J. Symb. Comput. 109: 404-425 (2022) - [j8]Jens Forsgård, Timo de Wolff:
The Algebraic Boundary of the Sonc-Cone. SIAM J. Appl. Algebra Geom. 6(3): 468-502 (2022) - [i9]Christoph Brauer, Niklas Breustedt, Timo de Wolff, Dirk A. Lorenz:
Learning Variational Models with Unrolling and Bilevel Optimization. CoRR abs/2209.12651 (2022) - 2020
- [c6]Mareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff:
Global optimization via the dual SONC cone and linear programming. ISSAC 2020: 138-145 - [c5]Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff:
Computing the real isolated points of an algebraic hypersurface. ISSAC 2020: 297-304 - [e1]Anna Maria Bigatti, Jacques Carette, James H. Davenport, Michael Joswig, Timo de Wolff:
Mathematical Software - ICMS 2020 - 7th International Conference, Braunschweig, Germany, July 13-16, 2020, Proceedings. Lecture Notes in Computer Science 12097, Springer 2020, ISBN 978-3-030-52199-8 [contents] - [i8]Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff:
Computing the Real Isolated Points of an Algebraic Hypersurface. CoRR abs/2008.10331 (2020)
2010 – 2019
- 2019
- [j7]Mareike Dressler, Sadik Iliman, Timo de Wolff:
An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming. J. Symb. Comput. 91: 149-172 (2019) - [j6]Thorsten Jörgens, Thorsten Theobald, Timo de Wolff:
Imaginary projections of polynomials. J. Symb. Comput. 91: 181-199 (2019) - [j5]Jens Forsgård, Laura Felicia Matusevich, Nathan Mehlhop, Timo de Wolff:
Lopsided approximation of amoebas. Math. Comput. 88(315): 485-500 (2019) - [c4]Adam Kurpisz, Timo de Wolff:
New Dependencies of Hierarchies in Polynomial Optimization. ISSAC 2019: 251-258 - [c3]Victor Magron, Henning Seidler, Timo de Wolff:
Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials. ISSAC 2019: 291-298 - [c2]Xiaoxian Tang, Timo de Wolff, Rukai Zhao:
A New Method for Computing Elimination Ideals of Likelihood Equations. ISSAC 2019: 339-346 - [i7]Victor Magron, Henning Seidler, Timo de Wolff:
Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials. CoRR abs/1902.02123 (2019) - [i6]Adam Kurpisz, Timo de Wolff:
New Dependencies of Hierarchies in Polynomial Optimization. CoRR abs/1903.04996 (2019) - [i5]Alperen Ali Ergür, Timo de Wolff:
A Polyhedral Homotopy Algorithm For Real Zeros. CoRR abs/1910.01957 (2019) - 2018
- [c1]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. MFCS 2018: 82:1-82:17 - [i4]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. CoRR abs/1802.10004 (2018) - [i3]Henning Seidler, Timo de Wolff:
An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization. CoRR abs/1808.08431 (2018) - [i2]Xiaoxian Tang, Timo de Wolff, Rukai Zhao:
Computing Elimination Ideals and Discriminants of Likelihood Equations. CoRR abs/1810.05620 (2018) - 2017
- [j4]Mareike Dressler, Sadik Iliman, Timo de Wolff:
A Positivstellensatz for Sums of Nonnegative Circuit Polynomials. SIAM J. Appl. Algebra Geom. 1(1): 536-555 (2017) - 2016
- [j3]Sadik Iliman, Timo de Wolff:
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming. SIAM J. Optim. 26(2): 1128-1146 (2016) - [i1]Jens Forsgård, Laura Felicia Matusevich, Nathan Mehlhop, Timo de Wolff:
Lopsided Approximation of Amoebas. CoRR abs/1608.08663 (2016) - 2015
- [j2]Sadik Iliman, Timo de Wolff:
Separating inequalities for nonnegative polynomials that are not sums of squares. J. Symb. Comput. 68: 181-194 (2015) - [j1]Thorsten Theobald, Timo de Wolff:
Approximating amoebas and coamoebas by sums of squares. Math. Comput. 84(291): 455-473 (2015)
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-20 21:15 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:
