default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFernando Mário de Oliveira Filho
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin:
A Recursive Theta Body for Hypergraphs. Comb. 43(5): 909-938 (2023)- 2022
- [j9]Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
:
Complete positivity and distance-avoiding sets. Math. Program. 191(2): 487-558 (2022) - [j8]David de Laat, Fabrício Caluza Machado, Fernando Mário de Oliveira Filho, Frank Vallentin:
k-Point semidefinite programming bounds for equiangular lines. Math. Program. 194(1): 533-567 (2022)
2010 – 2019
- 2018
- [j7]Fabrício Caluza Machado, Fernando Mário de Oliveira Filho:
Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry. Exp. Math. 27(3): 362-369 (2018) - [i3]Fernando Mário de Oliveira Filho, Frank Vallentin:
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension. CoRR abs/1808.02346 (2018) - 2017
- [j6]Maria Dostert, Cristóbal Guzmán, Fernando Mário de Oliveira Filho, Frank Vallentin:
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. Discret. Comput. Geom. 58(2): 449-481 (2017) - 2016
- [j5]Tamás Keleti, Máté Matolcsi, Fernando Mário de Oliveira Filho, Imre Z. Ruzsa:
Better Bounds for Planar Sets Avoiding Unit Distances. Discret. Comput. Geom. 55(3): 642-661 (2016) - 2014
- [j4]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. Theory Comput. 10: 77-105 (2014) - 2012
- [c2]Fernando Mário de Oliveira Filho, Regina Serrão Lanzillotti, Rosa Maria Esteves Moreira da Costa, Raquel Gonçalves, Paula Ventura Martins, Luís Alfredo Vidal de Carvalho:
ARVET AND SAPTEPT: A Virtual Environment and a System Supported by Fuzzy Logic in Virtual Reality Exposure Therapy for PTSD Patients. ICCSA Workshops 2012: 103-107 - 2010
- [c1]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) 2010: 31-42 - [i2]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck inequalities for semidefinite programs with rank constraint. CoRR abs/1011.1754 (2010)
2000 – 2009
- 2009
- [i1]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The positive semidefinite Grothendieck problem with rank constraint. CoRR abs/0910.5765 (2009) - 2006
- [j3]Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some formulations for the group steiner tree problem. Discret. Appl. Math. 154(13): 1877-1884 (2006) - [j2]Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
New Reduction Techniques for the Group Steiner Tree Problem. SIAM J. Optim. 17(4): 1176-1188 (2006) - 2004
- [j1]Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some Formulations for the Group Steiner Tree Problem. Electron. Notes Discret. Math. 18: 127-132 (2004)
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-04-25 05:56 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:
