Maria Saumell

Orcid: 0000-0002-4704-2609

Affiliations:
  • Czech Technical University in Prague, Czech Republic


According to our database1, Maria Saumell authored at least 36 papers between 2010 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing Largest Minimum Color-Spanning Intervals of Imprecise Points.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints.
Inf. Process. Lett., March, 2023

2022
Minimum color spanning circle of imprecise points.
Theor. Comput. Sci., 2022

2021
Terrain prickliness: theoretical grounds for low complexity viewsheds.
CoRR, 2021

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

Minimum Color Spanning Circle in Imprecise Setup.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Hamiltonicity for convex shape Delaunay and Gabriel graphs.
Comput. Geom., 2020

2018
Colored ray configurations.
Comput. Geom., 2018

The dual diameter of triangulations.
Comput. Geom., 2018

Minimal Obstructions for Partial Representations of Interval Graphs.
Electron. J. Comb., 2018

Stabbing Circles for Sets of Segments in the Plane.
Algorithmica, 2018

2017
Peeling Potatoes Near-Optimally in Near-Linear Time.
SIAM J. Comput., 2017

Column planarity and partially-simultaneous geometric embedding.
J. Graph Algorithms Appl., 2017

A Median-Type Condition for Graph Tiling.
Electron. Notes Discret. Math., 2017

Extending Partial Representations of Proper and Unit Interval Graphs.
Algorithmica, 2017

2015
Optimally bracing grid frameworks with holes.
Theor. Comput. Sci., 2015

10-Gabriel graphs are Hamiltonian.
Inf. Process. Lett., 2015

Geometric Biplane Graphs II: Graph Augmentation.
Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs Comb., 2015

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon.
Discret. Math. Theor. Comput. Sci., 2015

Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

2014
Terrain Visibility with Multiple Viewpoints.
Int. J. Comput. Geom. Appl., 2014

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geom. Appl., 2014

Making triangulations 4-connected using flips.
Comput. Geom., 2014

Column Planarity and Partial Simultaneous Geometric Embedding.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Measuring regularity of convex polygons.
Comput. Aided Des., 2013

Convex hull alignment through translation.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

Improving Shortest Paths in the Delaunay Triangulation.
Int. J. Comput. Geom. Appl., 2012

2011
On the number of higher order Delaunay triangulations.
Theor. Comput. Sci., 2011

On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010


  Loading...