default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfredo Hubard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Niloufar Fuladi, Alfredo Hubard
, Arnaud de Mesmay:
Short Topological Decompositions of Non-orientable Surfaces. Discret. Comput. Geom. 72(2): 783-830 (2024)- [i7]Alfredo Hubard, Hugo Parlier:
Crossing lemmas for k-systems of arcs. CoRR abs/2403.15261 (2024) - 2023
- [c10]Alfredo Hubard, Andrew Suk:
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems. SoCG 2023: 41:1-41:15 - [c9]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate Crossing Number and Signed Reversal Distance. GD (1) 2023: 95-109 - [i6]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate crossing number and signed reversal distance. CoRR abs/2308.10666 (2023) - 2022
- [c8]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-Orientable Surfaces. SoCG 2022: 41:1-41:16 - [i5]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-Orientable Surfaces. CoRR abs/2203.06659 (2022) - [i4]Alfredo Hubard, Andrew Suk:
Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems. CoRR abs/2212.01311 (2022)
2010 – 2019
- 2018
- [j7]Alfredo Hubard, Arnau Padrol:
Stabbing convex subdivisions with k-flats. Electron. Notes Discret. Math. 68: 143-148 (2018) - [c7]Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager:
Consistent Sets of Lines with no Colorful Incidence. SoCG 2018: 17:1-17:14 - [i3]Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager:
Consistent sets of lines with no colorful incidence. CoRR abs/1803.06267 (2018) - 2017
- [j6]Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. Discret. Comput. Geom. 58(1): 1-29 (2017) - [j5]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. Discret. Comput. Geom. 58(4): 921-945 (2017) - 2016
- [c6]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. SoCG 2016: 43:1-43:16 - [i2]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest path embeddings of graphs on surfaces. CoRR abs/1602.06778 (2016) - 2015
- [j4]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. Discret. Comput. Geom. 53(3): 587-620 (2015) - [c5]Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec:
Limits of Order Types. SoCG 2015: 300-314 - [c4]Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. SoCG 2015: 599-614 - 2014
- [c3]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. SoCG 2014: 335 - [i1]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. CoRR abs/1408.4036 (2014) - 2012
- [j3]Boris Bukh, Alfredo Hubard:
Space Crossing Numbers. Comb. Probab. Comput. 21(3): 358-373 (2012) - 2011
- [j2]Alfredo Hubard, Luis Montejano, Emiliano Mora, Andrew Suk:
Order Types of Convex Bodies. Order 28(1): 121-130 (2011) - [c2]Boris Bukh, Alfredo Hubard:
Space crossing numbers. SCG 2011: 163-170 - 2010
- [c1]Wei-Chih Lu, Matt Tierney, Jay Chen, Faiz Kazi, Alfredo Hubard, Jesus Garcia Pasquel, Lakshminarayanan Subramanian, Bharat Rao:
UjU: SMS-based applications made easy. ACM DEV 2010: 16
2000 – 2009
- 2008
- [j1]Imre Bárány, Alfredo Hubard, Jesús Jerónimo:
Slicing Convex Sets and Measures by a Hyperplane. Discret. Comput. Geom. 39(1-3): 67-75 (2008)
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-23 20:34 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:
