Advanced search
Start date
Betweenand

Mário César San Felice

CV Lattes GoogleMyCitations ResearcherID ORCID


Universidade Federal de São Carlos (UFSCAR). Centro de Ciências Exatas e de Tecnologia (CCET)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

B.Sc. in Computer Engineering at State University of Campinas (2007), M.Sc. in Computer Science at State University of Campinas (2010), and Ph.D. in Computer Science at State University of Campinas (2015), with one year of research internship abroad at Cornell University. Postdoctoral researcher in Computer Science at University of São Paulo (2018) and, currently, is an adjunct professor at the Department of Computing of Federal University of São Carlos. Has experience with Algorithms and Combinatorial Optimization, working mainly on the following subjects: online algorithms, competitive analysis, approximation algorithms, facility location problems, network design problems, and randomized algorithms. (Source: Lattes Curriculum)

Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated June 12, 2021
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (2)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications2
Citations0
Cit./Article0.0
Data from Web of Science

DE LIMA, MURILO SANTOS; SAN FELICE, MARIO CESAR; LEE, ORLANDO. Group parking permit problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 172-194, . Web of Science Citations: 0. (14/18781-1, 15/11937-9, 17/11382-2)

SAN FELICE, MARIO CESAR; WILLIAMSON, DAVID P.; LEE, ORLANDO. A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem. ALGORITHMICA, v. 76, n. 4, p. 1139-1157, . Web of Science Citations: 0. (09/15535-1)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

FELICE, Mário César San. O problema do k-Servidor. Dissertação (Mestrado) -  Instituto de Computação.  Universidade Estadual de Campinas (UNICAMP).  (07/57997-6

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: