Vissarion Fisikopoulos

CoRR, 2024

2023

A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2023

Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo.

[BibT_eX]

[DOI]

Marios Papachristou

ACM Trans. Math. Softw., June, 2023

Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises.

[BibT_eX]

[DOI]

Ludovic Calès

Comput. Geom., 2023

Randomized geometric tools for anomaly detection in stock markets.

[BibT_eX]

[DOI]

Cyril Bachelard

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Fast Floating-Point Filters for Robust Predicates.

[BibT_eX]

[DOI]

Tinko Bartels

Martin Weiser

CoRR, 2022

2021

volesti: Volume Approximation and Sampling for Convex Polytopes in R.

[BibT_eX]

[DOI]

R J., 2021

Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo.

[BibT_eX]

[DOI]

Marios Papachristou

CoRR, 2021

Geometric Algorithms for Sampling the Flux Space of Metabolic Networks.

[BibT_eX]

[DOI]

Haris Zafeiropoulos

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Efficient Sampling from Feasible Sets of SDPs and Volume Approximation.

[BibT_eX]

[DOI]

Panagiotis Repouskos

CoRR, 2020

Sampling the feasible sets of SDPs and volume approximation.

[BibT_eX]

[DOI]

Panagiotis Repouskos

ACM Commun. Comput. Algebra, 2020

Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2020, 2020

2019

Enumeration of 2-level polytopes.

[BibT_eX]

[DOI]

Adam Bohn

Yuri Faenza

Samuel Fiorini

Marco Macchia

Kanstantsin Pashkovich

Math. Program. Comput., 2019

Practical Volume Estimation by a New Annealing Schedule for Cooling Convex Bodies.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Practical Polytope Volume Approximation.

[BibT_eX]

[DOI]

Evangelos Anagnostopoulos

ACM Trans. Math. Softw., 2018

Algorithms for Deciding Membership in Polytopes of General Dimension.

[BibT_eX]

[DOI]

Evangelos Anagnostopoulos

CoRR, 2018

Polytope Membership in High Dimension.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises.

[BibT_eX]

[DOI]

Ludovic Calès

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Experimental Study of the Ehrhart Interpolation Polytope.

[BibT_eX]

[DOI]

Zafeirakis Zafeirakopoulos

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016

Efficient edge-skeleton computation for polytopes defined by oracles.

[BibT_eX]

[DOI]

Bernd Gärtner

J. Symb. Comput., 2016

Faster geometric algorithms via dynamic determinant computation.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Two-Level Polytopes with a Prescribed Facet.

[BibT_eX]

[DOI]

Samuel Fiorini

Marco Macchia

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2014

High-dimensional polytopes defined by oracles: algorithms, computations and applications

[BibT_eX]

[DOI]

PhD thesis, 2014

Efficient Random-Walk Methods for Approximating Polytope Volume.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

An Oracle-Based, output-Sensitive Algorithm for Projections of Resultant Polytopes.

[BibT_eX]

[DOI]

Christos Konaxis

Int. J. Comput. Geom. Appl., 2013

Combinatorics of 4-dimensional resultant polytopes.

[BibT_eX]

[DOI]

Alicia Dickenstein

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

An output-sensitive algorithm for computing projections of resultant polytopes.

[BibT_eX]

[DOI]

Christos Konaxis

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Efficient Computation of Newton Polytopes of Specialized Resultants

[BibT_eX]

[DOI]

Christos Konaxis

CoRR, 2011

Study of the effect of cost policies in the convergence of selfish strategies in Pure Nash Equilibria in Congestion Games

[BibT_eX]

[DOI]

CoRR, 2011

An implementation of range trees with fractional cascading in C++

[BibT_eX]

[DOI]