default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnau Padrol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Arnau Padrol
, Eva Philippe:
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations. Comb. 44(1): 63-123 (2024)- 2023
- [j18]Arnau Padrol, Vincent Pilaud, Germain Poullot:
Deformation cones of graph associahedra and nestohedra. Eur. J. Comb. 107: 103594 (2023) - 2021
- [j17]Leonardo Martínez-Sandoval, Arnau Padrol:
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem. J. Comb. Theory B 149: 23-51 (2021) - [i5]Arnau Padrol, Eva Philippe:
Sweeps, polytopes, oriented matroids, and allowable graphs of permutations. CoRR abs/2102.06134 (2021) - 2020
- [j16]Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
The ν-Tamari Lattice via ν-Trees, ν-Bracket Vectors, and Subword Complexes. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [i4]Leonardo Martínez-Sandoval, Arnau Padrol:
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem. CoRR abs/1909.01189 (2019) - 2018
- [j15]Francesco Grande, Arnau Padrol, Raman Sanyal:
Extension Complexity and Realization Spaces of Hypersimplices. Discret. Comput. Geom. 59(3): 621-642 (2018) - [j14]Alfredo Hubard, Arnau Padrol:
Stabbing convex subdivisions with k-flats. Electron. Notes Discret. Math. 68: 143-148 (2018) - 2017
- [j13]Karim A. Adiprasito, Arnau Padrol:
The universality theorem for neighborly polytopes. Comb. 37(2): 129-136 (2017) - [j12]Hao Chen, Arnau Padrol:
Scribability problems for polytopes. Eur. J. Comb. 64: 1-26 (2017) - [j11]Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
ν-Tamari lattices via subword complexes. Electron. Notes Discret. Math. 61: 215-221 (2017) - 2016
- [j10]Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
Tropical Catalan subdivisions. Electron. Notes Discret. Math. 54: 187-192 (2016) - [j9]Arnau Padrol:
Polytopes with few vertices and few facets. J. Comb. Theory A 142: 177-180 (2016) - [j8]Arnau Padrol:
Extension Complexity of Polytopes with Few Vertices or Facets. SIAM J. Discret. Math. 30(4): 2162-2176 (2016) - [i3]Arnau Padrol:
Extension complexity of polytopes with few vertices or facets. CoRR abs/1602.06894 (2016) - 2015
- [j7]Arnau Padrol, Julian Pfeifle:
Polygons as Sections of Higher-Dimensional Polytopes. Electron. J. Comb. 22(1): 1 (2015) - [j6]Karim A. Adiprasito, Arnau Padrol, Louis Theran:
Universality Theorems for Inscribed Polytopes and Delaunay Triangulations. Discret. Comput. Geom. 54(2): 412-431 (2015) - [j5]Benjamin Nill, Arnau Padrol:
The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes. Eur. J. Comb. 50: 159-179 (2015) - [j4]Hiroyuki Miyata, Arnau Padrol:
Enumerating Neighborly Polytopes and Oriented Matroids. Exp. Math. 24(4): 489-505 (2015) - [j3]Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
Dyck path triangulations and extendability. J. Comb. Theory A 131: 187-208 (2015) - 2014
- [j2]Arnau Padrol, Victor Muntés-Mulero:
Graph anonymization via metric embed-dings: Using classical anonymization for graphs. Intell. Data Anal. 18(3): 365-388 (2014) - [c2]Arnau Padrol, Louis Theran:
Delaunay triangulations with disconnected realization spaces. SoCG 2014: 163 - [i2]Karim A. Adiprasito, Arnau Padrol, Louis Theran:
Universality theorems for inscribed polytopes and Delaunay triangulations. CoRR abs/1406.7831 (2014) - 2013
- [b1]Arnau Padrol:
Neighborly and almost neighborly configurations, and their duals. Polytechnic University of Catalonia, Spain, 2013 - [j1]Arnau Padrol:
Many Neighborly Polytopes and Oriented Matroids. Discret. Comput. Geom. 50(4): 865-902 (2013) - [i1]Bernd Gonska, Arnau Padrol:
Neighborly inscribed polytopes and Delaunay triangulations. CoRR abs/1308.5798 (2013) - 2010
- [c1]Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Julian Pfeifle, Victor Muntés-Mulero:
Overlapping Community Search for social networks. ICDE 2010: 992-995
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 2025-01-21 00:06 CET 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:
