Francisco Santos

According to our database1, Francisco Santos authored at least 63 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The EKR property for flag pure simplicial complexes without boundary.
J. Comb. Theory, Ser. A, 2020

Triangulations and a Discrete Brunn-Minkowski Inequality in the Plane.
Discret. Comput. Geom., 2020

Average Betti Numbers of Induced Subcomplexes in Triangulations of Manifolds.
Electron. J. Comb., 2020

Blockchain-based Traceability of Carbon Footprint: A Solidity Smart Contract for Ethereum.
Proceedings of the 22nd International Conference on Enterprise Information Systems, 2020

Multivariate Analysis to Assist Decision-Making in Many-objective Engineering Optimization Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
Non-spanning lattice 3-polytopes.
J. Comb. Theory, Ser. A, 2019

Short proof of two cases of Chvátal's conjecture.
Discret. Math., 2019

2018
A Polyhedral Method for Sparse Systems with Many Positive Solutions.
SIAM J. Appl. Algebra Geom., 2018

The complete classification of empty lattice 4-simplices.
Electron. Notes Discret. Math., 2018

Enumeration of Lattice 3-Polytopes by Their Number of Lattice Points.
Discret. Comput. Geom., 2018

2017
Hirsch polytopes with exponentially long combinatorial segments.
Math. Program., 2017

Classification of empty lattice 4-simplices of width larger than 2.
Electron. Notes Discret. Math., 2017

2016
Lattice 3-Polytopes with Six Lattice Points.
SIAM J. Discret. Math., 2016

Lattice 3-Polytopes with Few Lattice Points.
SIAM J. Discret. Math., 2016

The maximum diameter of pure simplicial complexes and pseudo-manifolds.
Electron. Notes Discret. Math., 2016

Enumerating lattice 3-polytopes.
Electron. Notes Discret. Math., 2016

2015
Many non-equivalent realizations of the associahedron.
Comb., 2015

2014
On Sumsets and Convex Hull.
Discret. Comput. Geom., 2014

On the Feasibility of Inter-flow Network Coding Over Random Wireless Mesh Networks.
Proceedings of the Mobile Networks and Management - 6th International Conference, 2014

2013
Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

Recent progress on the combinatorial diameter of polyhedra and simplicial complexes.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
The brick polytope of a sorting network.
Eur. J. Comb., 2012

Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids.
Discret. Comput. Geom., 2012

2011
Collaborative Location Privacy with Rational Users.
Proceedings of the Decision and Game Theory for Security - Second International Conference, 2011

2010
Transforming Triangulations on Nonplanar Surfaces.
SIAM J. Discret. Math., 2010

A counterexample to the Hirsch conjecture
CoRR, 2010

2009
Graphs of transportation polytopes.
J. Comb. Theory, Ser. A, 2009

Triple-loop networks with arbitrarily many minimum distance diagrams.
Discret. Math., 2009

Multitriangulations as Complexes of Star Polygons.
Discret. Comput. Geom., 2009

2008
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory, Ser. A, 2008

On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups.
Discret. Comput. Geom., 2008

Lattice Points in Minkowski Sums.
Electron. J. Comb., 2008

2007
Lattice Delone simplices with super-exponential volume.
Eur. J. Comb., 2007

Combinatorial pseudo-triangulations.
Discret. Math., 2007

2005
The Polytope of Non-Crossing Graphs on a Planar Point Set.
Discret. Comput. Geom., 2005

Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom., 2005

On the number of facets of three-dimensional Dirichlet stereohedra III: Cubic group.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Non-Crossing Frameworks with Non-Crossing Reciprocals.
Discret. Comput. Geom., 2004

Triangulations of polytopes and algebraic geometry.
Proceedings of the Symbolic and Algebraic Computation, 2004

2003
A better upper bound on the number of triangulations of a planar point set.
J. Comb. Theory, Ser. A, 2003

Higher Lawrence configurations.
J. Comb. Theory, Ser. A, 2003

Asymptotically Efficient Triangulations of the d-Cube.
Discret. Comput. Geom., 2003

Transforming triangulations of polygons on non planar surfaces
CoRR, 2003

2002
The Number of Triangulations of the Cyclic Polytope C (n, n-4).
Discret. Comput. Geom., 2002

Asymptotically efficient triangulations of the <i>d</i>-cube.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Extremal Properties for Dissections of Convex 3-Polytopes.
SIAM J. Discret. Math., 2001

Assymptotically efficient triangulations of the d-cube<sup>*</sup>.
Electron. Notes Discret. Math., 2001

Realizable but not Strongly Euclidean Oriented Matroids.
Eur. J. Comb., 2001

On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections.
Discret. Comput. Geom., 2001

Detection of phases in sugar crystallization using wavelets.
Proceedings of the 2001 International Conference on Image Processing, 2001

Classification of microorganisms using image processing techniques.
Proceedings of the 2001 International Conference on Image Processing, 2001

Counting triangulations and pseudo-triangulations of wheels.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
The Generalized Baues Problem for Cyclic Polytopes I.
Eur. J. Comb., 2000

Fiber Polytopes for the Projections between Cyclic Polytopes.
Eur. J. Comb., 2000

Triangulations with Very Few Geometric Bistellar Neighbors.
Discret. Comput. Geom., 2000

The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected.
Discret. Comput. Geom., 2000

1999
The Number of Geometric Bistellar Neighbors of a Triangulation.
Discret. Comput. Geom., 1999

On bisectors for convex distance functions in 3-space.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedr.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996
Inscribing a Symmetric Body in an Ellipse.
Inf. Process. Lett., 1996

On Delaunay Oriented Matroids for Convex Distance Functions.
Discret. Comput. Geom., 1996

1994
On Delaunay oriented Matroids.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
On the Topological Shape of Planar Voronoi Diagrams.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993


  Loading...