default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Pilaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Jean Cardinal, Vincent Pilaud:
Rectangulotopes. CoRR abs/2404.17349 (2024)- 2023
- [j25]Arnau Padrol
, Vincent Pilaud, Germain Poullot:
Deformation cones of graph associahedra and nestohedra. Eur. J. Comb. 107: 103594 (2023) - [j24]Vincent Pilaud, Guillermo Pineda-Villavicencio, Julien Ugon:
Edge connectivity of simplicial polytopes. Eur. J. Comb. 113: 103752 (2023) - [j23]Doriann Albertin, Vincent Pilaud:
The Canonical Complex of the Weak Order. Order 40(2): 349-370 (2023) - 2022
- [j22]Aram Dermenjian, Christophe Hohlweg, Thomas McConville, Vincent Pilaud:
The Facial Weak Order on Hyperplane Arrangements. Discret. Comput. Geom. 67(1): 166-202 (2022) - 2021
- [j21]Doriann Albertin, Vincent Pilaud, Julian Ritter:
Removahedral Congruences versus Permutree Congruences. Electron. J. Comb. 28(4) (2021) - 2020
- [j20]Vincent Pilaud:
Cambrian triangulations and their tropical realizations. Eur. J. Comb. 83 (2020) - [i7]Vincent Pilaud, Viviane Pons, Daniel Tamayo Jiménez:
Permutree sorting. CoRR abs/2007.07802 (2020)
2010 – 2019
- 2019
- [j19]Thibault Manneville, Vincent Pilaud:
Geometric Realizations of the Accordion Complex of a Dissection. Discret. Comput. Geom. 61(3): 507-540 (2019) - [j18]Vincent Pilaud:
Hopf algebras on decorated noncrossing arc diagrams. J. Comb. Theory A 161: 486-507 (2019) - 2018
- [j17]Carsten Lange, Vincent Pilaud:
Associahedra Via Spines. Comb. 38(2): 443-486 (2018) - [j16]Vincent Pilaud:
Brick polytopes, lattice quotients, and Hopf algebras. J. Comb. Theory A 155: 418-457 (2018) - 2017
- [j15]Amir-Hossein Bateni, Thibault Manneville, Vincent Pilaud:
On quadrangulations and Stokes complexes. Electron. Notes Discret. Math. 61: 107-113 (2017) - [j14]Vincent Pilaud, Viviane Pons:
Permutrees. Electron. Notes Discret. Math. 61: 987-993 (2017) - [j13]Thibault Manneville, Vincent Pilaud:
Compatibility fans for graphical nested complexes. J. Comb. Theory A 150: 36-107 (2017) - 2016
- [j12]Jürgen Bokowski, Vincent Pilaud:
Quasi-configurations: Building blocks for point-line configurations. Ars Math. Contemp. 10(1): 99-112 (2016) - [j11]Cesar Ceballos, Vincent Pilaud:
The diameter of type D associahedra and the non-leaving-face property. Eur. J. Comb. 51: 109-124 (2016) - 2015
- [j10]Cesar Ceballos, Vincent Pilaud:
Cluster Algebras of Type D: Pseudotriangulations Approach. Electron. J. Comb. 22(4): 4 (2015) - [j9]Jürgen Bokowski, Vincent Pilaud:
On topological and geometric (1 9 4) configurations. Eur. J. Comb. 50: 4-17 (2015) - 2014
- [j8]Vincent Pilaud, Juanjo Rué:
Analytic combinatorics of chord and hyperchord diagrams with k crossings. Adv. Appl. Math. 57: 60-100 (2014) - [j7]Jürgen Bokowski, Vincent Pilaud:
Enumerating topological (nk)-configurations. Comput. Geom. 47(2): 175-186 (2014) - [i6]Jürgen Bokowski, Vincent Pilaud:
Quasi-configurations: building blocks for point-line configurations. CoRR abs/1403.7939 (2014) - 2013
- [i5]Jürgen Bokowski, Vincent Pilaud:
On topological and geometric $(19_4)$ configurations. CoRR abs/1309.3201 (2013) - 2012
- [j6]Vincent Pilaud, Michel Pocchiola:
Multitriangulations, Pseudotriangulations and Primitive Sorting Networks. Discret. Comput. Geom. 48(1): 142-191 (2012) - [j5]Vincent Pilaud, Francisco Santos:
The brick polytope of a sorting network. Eur. J. Comb. 33(4): 632-662 (2012) - [j4]Minghui Jiang, Vincent Pilaud, Pedro J. Tejada:
On a Dispersion Problem in Grid Labeling. SIAM J. Discret. Math. 26(1): 39-51 (2012) - [i4]Jürgen Bokowski, Vincent Pilaud:
Enumerating topological $(n_k)$-configurations. CoRR abs/1210.0306 (2012) - 2011
- [j3]Julien Ferté, Vincent Pilaud, Michel Pocchiola:
On the Number of Simple Arrangements of Five Double Pseudolines. Discret. Comput. Geom. 45(2): 279-302 (2011) - [j2]Benjamin Matschke, Julian Pfeifle, Vincent Pilaud:
Prodsimplicial-Neighborly Polytopes. Discret. Comput. Geom. 46(1): 100-131 (2011) - [c3]Jürgen Bokowski, Vincent Pilaud:
On the generation of topological (nk)-configurations. CCCG 2011 - 2010
- [c2]Minghui Jiang, Vincent Pilaud, Pedro J. Tejada:
On a dispersion problem in grid labeling. CCCG 2010: 75-78 - [i3]Julien Ferté, Vincent Pilaud, Michel Pocchiola:
On the number of simple arrangements of five double pseudolines. CoRR abs/1009.1575 (2010) - [i2]Vincent Pilaud:
Multitriangulations, pseudotriangulations and some problems of realization of polytopes. CoRR abs/1009.1605 (2010) - [i1]Vincent Pilaud, Michel Pocchiola:
Multitriangulations, pseudotriangulations and primitive sorting networks. CoRR abs/1009.5344 (2010)
2000 – 2009
- 2009
- [j1]Vincent Pilaud, Francisco Santos:
Multitriangulations as Complexes of Star Polygons. Discret. Comput. Geom. 41(2): 284-317 (2009) - [c1]Jürgen Bokowski, Vincent Pilaud:
On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon. CCCG 2009: 41-44
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-06-10 20:28 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:
