◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Etienne Birmelé

10 papers hereh-index 14771 citations47 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author1
  • middle author4
  • last author1

Across the 9 of 10 papers where every author was matched, so the position is known.

fields
  • stat.AP4
  • cs.CC2
  • stat.ME2
  • cs.DS1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20072018
most citedEvery longest circuit of a 3-connected, K3,3​-minor free graph has a chord

6 citations · 16 across the 9 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CC2016

Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem

Etienne Birmelé, Fabien De Montgolfier, Léo Planche

The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.