Emiliano Cristiani

Orcid: 0000-0002-7015-2371

According to our database1, Emiliano Cristiani authored at least 31 papers between 2007 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Kinetic description and macroscopic limit of swarming dynamics with continuous leader-follower transitions.
Math. Comput. Simul., 2025

2024
Numerical computation of generalized Wasserstein distances with applications to traffic model analysis.
CoRR, 2024

A macroscopic pedestrian model with variable maximal density.
CoRR, 2024

2023
An overview of some mathematical techniques and problems linking 3D vision to 3D printing.
CoRR, 2023

Inverting the Fundamental Diagram and Forecasting Boundary Conditions: How Machine Learning Can Improve Macroscopic Models for Traffic Flow.
CoRR, 2023

2021
Managing crowded museums: Visitors flow measurement, analysis, modeling, and optimization.
J. Comput. Sci., 2021

Macroscopic and Multi-Scale Models for Multi-Class Vehicular Dynamics with Uneven Space Occupancy: A Case Study.
Axioms, 2021

2020
Understanding Mass Transfer Directions via Data-Driven Models with Application to Mobile Phone Data.
SIAM J. Appl. Dyn. Syst., 2020

2019
Measurement and analysis of visitors' trajectories in crowded museums.
CoRR, 2019

2018
Reducing Complexity of Multiagent Systems with Symmetry Breaking: An Application to Opinion Dynamics with Polls.
Multiscale Model. Simul., 2018

Understanding Human Mobility Flows from Aggregated Mobile Phone Data.
CoRR, 2018

2016
Invisible Control of Self-Organizing Agents Leaving Unknown Environments.
SIAM J. Appl. Math., 2016

On the micro-to-macro limit for first-order traffic flow models on networks.
Networks Heterog. Media, 2016

2015
Modeling Rationality to Control Self-Organization of Crowds: An Environmental Approach.
SIAM J. Appl. Math., 2015

A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks.
Networks Heterog. Media, 2015

2014
Can Local Single-Pass Methods Solve Any Stationary Hamilton-Jacobi-Bellman Equation?
SIAM J. Sci. Comput., 2014

An easy-to-use algorithm for simulating traffic flow on networks: Theoretical study.
Networks Heterog. Media, 2014

3D Printers: A new challenge for mathematical modeling.
CoRR, 2014

2013
Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations.
Proceedings of the System Modeling and Optimization, 2013

2012
A Patchy Dynamic Programming Scheme for a Class of Hamilton-Jacobi-Bellman Equations.
SIAM J. Sci. Comput., 2012

Perspective Shape from Shading: Ambiguity Analysis and Numerical Approximations.
SIAM J. Imaging Sci., 2012

How can macroscopic models reveal self-organization in traffic flow?
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
Multiscale Modeling of Granular Flows with Application to Crowd Dynamics.
Multiscale Model. Simul., 2011

Numerical approximation of Nash equilibria for a class of non-cooperative differential games
CoRR, 2011

An adaptive domain-decomposition technique for parallelization of the fast marching method.
Appl. Math. Comput., 2011

Numerical schemes for advanced reflectance models for Shape from Shading.
Proceedings of the 18th IEEE International Conference on Image Processing, 2011

2010
Numerical algorithms for perspective shape from shading.
Kybernetika, 2010

An Efficient Data Structure and Accurate Scheme to Solve Front Propagation Problems.
J. Sci. Comput., 2010

2009
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations.
J. Sci. Comput., 2009

2007
Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications.
SIAM J. Numer. Anal., 2007

Some Remarks on Perspective Shape-from-Shading Models.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2007


  Loading...