default search action
Lionel Pournin
Person information
- affiliation: Paris 13 University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Jean Cardinal, Lionel Pournin
, Mario Valencia-Pabon:
The rotation distance of brooms. Eur. J. Comb. 118: 103877 (2024) - [j15]Antoine Deza, Sebastian Pokutta, Lionel Pournin
The complexity of geometric scaling. Oper. Res. Lett. 52: 107057 (2024) - [j14]Antoine Deza, Shmuel Onn, Sebastian Pokutta, Lionel Pournin:
Kissing Polytopes. SIAM J. Discret. Math. 38(4): 2643-2664 (2024) - [i3]Jean Cardinal, Lionel Pournin:
The expansion of half-integral polytopes. CoRR abs/2402.14343 (2024) - 2023
- [i2]Hugo Parlier, Lionel Pournin:
Counting geodesics between surface triangulations. CoRR abs/2308.05688 (2023) - 2022
- [j13]Antoine Deza, Lionel Pournin
A linear optimization oracle for zonotope computation. Comput. Geom. 100: 101809 (2022) - 2021
- [j12]Antoine Deza, Jean-Baptiste Hiriart-Urruty, Lionel Pournin:
Polytopal balls arising in optimization. Contributions Discret. Math. 16(3): 125-138 (2021) - [c3]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. LAGOS 2021: 239-247 - [i1]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. CoRR abs/2106.16130 (2021) - 2020
- [j11]Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon:
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. Discret. Appl. Math. 281: 1 (2020) - [j10]Julien David, Lionel Pournin
Elementary moves on lattice polytopes. J. Comb. Theory A 172: 105200 (2020) - [j9]Anna Deza, Antoine Deza
Distance between vertices of lattice polytopes. Optim. Lett. 14(2): 309-326 (2020) - [j8]Anna Deza, Antoine Deza
Correction to: Distance between vertices of lattice polytopes. Optim. Lett. 14(2): 327-328 (2020)
2010 – 2019
- 2019
- [j7]Lionel Pournin
Eccentricities in the flip-graphs of convex polygons. J. Graph Theory 92(2): 111-129 (2019) - 2018
- [j6]Hugo Parlier
Modular flip-graphs of one-holed surfaces. Eur. J. Comb. 67: 158-173 (2018) - [c2]Julien David, Lionel Pournin, Rado Rakotonarivo:
A Markov chain for lattice polytopes. GASCom 2018: 132-139 - 2017
- [j5]Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62: 1-2 (2017) - 2013
- [j4]Lionel Pournin
The Flip-Graph of the 4-Dimensional Cube is Connected. Discret. Comput. Geom. 49(3): 511-530 (2013) - 2012
- [j3]Lionel Pournin
Weakly Regular Subdivisions. Discret. Comput. Geom. 47(1): 106-116 (2012) - [j2]Lionel Pournin
Lifting simplicial complexes to the boundary of convex polytopes. Discret. Math. 312(19): 2849-2862 (2012)
2000 – 2009
- 2008
- [c1]Lionel Pournin
From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis. Bonn Workshop of Combinatorial Optimization 2008: 347-363 - 2007
- [j1]Lionel Pournin
Constrained paths in the flip-graph of regular triangulations. Comput. Geom. 37(2): 134-140 (2007)
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-10-22 20:16 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: