# Rémy Belmonte

> Ph.D. Universitetet i Bergen 2013

**Wikidata**: [Q102413691](https://www.wikidata.org/wiki/Q102413691)  
**Source**: https://4ort.xyz/entity/remy-belmonte

Here’s the structured biographical entry for Rémy Belmonte based on the provided source material:

---

## Summary  
Rémy Belmonte is a French computer scientist specializing in algorithmic graph theory and computational complexity theory. He earned his Ph.D. from the University of Bergen in 2013 and has held research positions at Kyoto University, Kwansei Gakuin University, and Gustave Eiffel University. His work focuses on theoretical computer science, particularly graph algorithms and complexity classification.

---

## Biography  
- **Born**: 1987  
- **Education**:  
  - Ph.D. in algorithmic graph theory, University of Bergen (2010–2013)  
  - M.Sc. in theoretical computer science, University of Montpellier (2008–2010)  
  - B.Sc. in computer science, University of Montpellier (2005–2008)  
- **Known for**: Contributions to algorithmic graph theory and computational complexity  
- **Employer(s)**:  
  - Gustave Eiffel University (2022–present)  
  - Kyoto University (2013–2015, postdoctoral researcher)  
  - Kwansei Gakuin University (2015–2016, postdoctoral researcher)  
  - University of Electro-Communications (2016–2020, assistant professor)  
  - Paris Dauphine University (2021–2022, research assistant)  
- **Field(s)**: Computer science, algorithmic graph theory, computational complexity theory  

---

## Contributions  
Rémy Belmonte's research centers on algorithmic graph theory and computational complexity, with a focus on classifying problems by their inherent difficulty. During his Ph.D. at the University of Bergen (2010–2013), supervised by Pinar Heggernes, he investigated graph algorithms and their applications. His postdoctoral work at Kyoto University (2013–2015) and Kwansei Gakuin University (2015–2016) expanded his contributions to theoretical computer science. As an assistant professor at the University of Electro-Communications (2016–2020), he further developed his expertise in complexity theory. His publications and collaborations have advanced understanding in graph-based problem-solving and computational limits.

---

## FAQs  
### Q: What is Rémy Belmonte's primary research focus?  
A: Belmonte specializes in algorithmic graph theory and computational complexity theory, studying how problems can be classified and solved efficiently.  

### Q: Where did Rémy Belmonte earn his Ph.D.?  
A: He completed his Ph.D. at the University of Bergen in 2013, focusing on algorithmic graph theory under advisor Pinar Heggernes.  

### Q: Which universities has Rémy Belmonte been affiliated with?  
A: He has worked at Kyoto University, Kwansei Gakuin University, University of Electro-Communications, Paris Dauphine University, and Gustave Eiffel University.  

---

## Why They Matter  
Rémy Belmonte's work in algorithmic graph theory and computational complexity has contributed to foundational knowledge in theoretical computer science. His research helps identify which problems can be solved efficiently and which are inherently difficult, influencing algorithm design and optimization. Collaborations with institutions like Kyoto University and Gustave Eiffel University have expanded the global reach of his contributions. Without his work, advancements in graph algorithms and complexity classification might lag, impacting fields like network analysis and artificial intelligence.  

---

## Notable For  
- Ph.D. in algorithmic graph theory from the University of Bergen (2013).  
- Postdoctoral research at Kyoto University and Kwansei Gakuin University.  
- Assistant professorship at the University of Electro-Communications (2016–2020).  
- Contributions to computational complexity theory and graph algorithms.  

---

## Body  
### Education  
- **Ph.D.**, University of Bergen (2010–2013): Focused on algorithmic graph theory under Pinar Heggernes.  
- **M.Sc.**, University of Montpellier (2008–2010): Specialized in theoretical computer science.  
- **B.Sc.**, University of Montpellier (2005–2008): Studied computer science.  

### Career  
- **Postdoctoral Researcher**: Kyoto University (2013–2015), Kwansei Gakuin University (2015–2016).  
- **Assistant Professor**: University of Electro-Communications (2016–2020).  
- **Research Assistant**: Paris Dauphine University (2021–2022).  
- **Current Role**: Employed at Gustave Eiffel University (since 2022).  

### Research Focus  
- Algorithmic graph theory.  
- Computational complexity theory.  

---

## Schema Markup  
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Rémy Belmonte",
  "jobTitle": "Computer Scientist",
  "worksFor": {"@type": "Organization", "name": "Gustave Eiffel University"},
  "birthDate": "1987",
  "alumniOf": [
    {"@type": "EducationalOrganization", "name": "University of Bergen"},
    {"@type": "EducationalOrganization", "name": "University of Montpellier"}
  ],
  "knowsAbout": ["algorithmic graph theory", "computational complexity theory"],
  "description": "French computer scientist specializing in algorithmic graph theory and computational complexity."
}

## References

1. Mathematics Genealogy Project
2. [Source](https://remybelmonte.wordpress.com/cv/)
3. [Source](https://remybelmonte.wordpress.com/about/)
4. [Source](https://remybelmonte.wordpress.com/wp-content/uploads/2023/10/cv-1-1.pdf)