default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTristram Bogart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j13]Tristram Bogart, Christopher O'Neill
, Kevin Woods:
Numerical Semigroups via Projections and via Quotients. Discret. Comput. Geom. 74(1): 114-134 (2025)- 2022
- [j12]Tristram Bogart, João Gouveia, Juan Camilo Torres:
An Algebraic Approach to Projective Uniqueness with an Application to Order Polytopes. Discret. Comput. Geom. 67(2): 462-491 (2022) - [j11]Tristram Bogart, Kevin Woods:
A Plethora of Polynomials: A Toolbox for Counting Problems. Am. Math. Mon. 129(3): 203-222 (2022) - 2021
- [j10]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Algebraic Curves. SIAM J. Discret. Math. 35(4): 2946-2970 (2021) - 2020
- [j9]Tristram Bogart, John Goodrick, Kevin Woods:
A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems. SIAM J. Discret. Math. 34(4): 2363-2387 (2020) - 2019
- [j8]Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods:
Parametric Presburger arithmetic: complexity of counting and quantifier elimination. Math. Log. Q. 65(2): 237-250 (2019) - 2018
- [j7]Tristram C. Bogart, Edward D. Kim:
Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count. Comb. 38(1): 75-114 (2018) - 2017
- [j6]Jarod Alper, Tristram Bogart, Mauricio Velasco:
A Lower Bound for the Determinantal Complexity of a Hypersurface. Found. Comput. Math. 17(3): 829-836 (2017) - 2012
- [j5]Matthias Beck, Tristram Bogart, Tu Pham:
Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs. Electron. J. Comb. 19(3): 42 (2012) - [j4]Tristram Bogart, Ray Hemmecke, Sonja Petrovic:
Universal Gröbner Bases of Colored Partition Identities. Exp. Math. 21(4): 395-401 (2012) - [j3]Tristram Bogart, Eric Katz:
Obstructions to Lifting Tropical Curves in Surfaces in 3-Space. SIAM J. Discret. Math. 26(3): 1050-1067 (2012) - 2010
- [j2]Tristram Bogart, Annie Raymond, Rekha R. Thomas:
Small Chvátal Rank. Math. Program. 124(1-2): 45-68 (2010) - 2007
- [j1]Tristram Bogart, Anders Nedergaard Jensen, David E Speyer, Bernd Sturmfels, Rekha R. Thomas:
Computing tropical varieties. J. Symb. Comput. 42(1-2): 54-73 (2007)
Informal and Other Publications
- 2022
- [i4]Tristram Bogart, Juan Andrés Valero:
Bounds on Determinantal Complexity of Two Types of Generalized Permanents. CoRR abs/2202.13016 (2022) - 2020
- [i3]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Curves. CoRR abs/2007.14829 (2020) - 2018
- [i2]Tristram Bogart, John Goodrick, Danny Nguyen, Kevin Woods:
Parametric Presburger Arithmetic: Complexity of Counting and Quantifier Elimination. CoRR abs/1802.00974 (2018) - 2015
- [i1]Jarod Alper, Tristram Bogart, Mauricio Velasco:
A lower bound for the determinantal complexity of a hypersurface. CoRR abs/1505.02205 (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 2025-07-07 21:17 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:
