Mario Alberto López

Affiliations:
  • University of Denver, CO, USA


According to our database1, Mario Alberto López authored at least 61 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Separability, Boxicity, and Partial Orders.
Order, October, 2023

Extremal problems on ray sensor configurations.
Discret. Appl. Math., June, 2023

2022
Optimal placement of base stations in border surveillance using limited capacity drones.
Theor. Comput. Sci., 2022

Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones.
CoRR, 2022

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards.
CoRR, 2022

2021
Failure and Communication in a Synchronized Multi-drone System.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
On the robustness of a synchronized multi-robot system.
J. Comb. Optim., 2020

2019
GPU-based lightweight parallel processing toolset for LiDAR data for terrain analysis.
Environ. Model. Softw., 2019

A framework for synchronizing a team of aerial robots in communication-limited environments.
CoRR, 2019

2018
Computing the k-resilience of a synchronized multi-robot system.
J. Comb. Optim., 2018

2017
A General Framework for Synchronizing a Team of Robots Under Communication Constraints.
IEEE Trans. Robotics, 2017

Computing the coarseness with strips or boxes.
Discret. Appl. Math., 2017

On the barrier graph of an arrangement of ray sensors.
Discret. Appl. Math., 2017

2016
Resilience of a synchronized multi-agent system.
CoRR, 2016

2015
The synchronization problem for information exchange between aerial robots under communication constraints.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2014
Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geom. Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.
Int. J. Comput. Geom. Appl., 2014

2013
Drawing the double circle on a grid of minimum size
CoRR, 2013

2011
Fitting a two-joint orthogonal chain to a point set.
Comput. Geom., 2011

2008
Hausdorff approximation of 3D convex polytopes.
Inf. Process. Lett., 2008

Weighted Rectilinear Approximation of Points in the Plane.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Noisy Road Network Matching.
Proceedings of the Geographic Information Science, 5th International Conference, 2008

2007
A note on equipartition
CoRR, 2007

2006
Approximating a set of points by a step function.
J. Vis. Commun. Image Represent., 2006

On finding a widest empty 1-corner corridor.
Inf. Process. Lett., 2006

Locating an obnoxious plane.
Eur. J. Oper. Res., 2006

Building a Game Development Program.
Computer, 2006

Rectilinear Approximation of a Set of Points in the Plane.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

A Network-Based Indexing Method for Trajectories of Moving Objects.
Proceedings of the Advances in Information Systems, 4th International Conference, 2006

2005
Optimal projections onto grids and finite resolution images.
J. Vis. Commun. Image Represent., 2005

Hausdorff approximation of convex polygons.
Comput. Geom., 2005

2004
R-trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Fast Pursuit Of Mobile Nodes Using TPR Trees.
Int. J. Found. Comput. Sci., 2004

Computing Largest Empty Slabs.
Proceedings of the Computational Science and Its Applications, 2004

Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves.
Proceedings of the Database Systems for Advances Applications, 2004

2003
Optimal Point Set Projections onto Regular Grids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Optimal coverage paths in ad-hoc sensor networks.
Proceedings of IEEE International Conference on Communications, 2003

2002
Linear time approximation of 3D convex polytopes.
Comput. Geom., 2002

Analysis of half-space range search using the <i>k</i>-d search skip list.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Constrained polygon transformations for incremental floorplanning.
ACM Trans. Design Autom. Electr. Syst., 2001

High Dimensional Similarity Search With Space Filling Curves.
Proceedings of the 17th International Conference on Data Engineering, 2001

2000
The Effect of Buffering on the Performance of R-Trees.
IEEE Trans. Knowl. Data Eng., 2000

Efficient Approximation of Convex Polygons.
Int. J. Comput. Geom. Appl., 2000

Indexing the Positions of Continuously Moving Objects.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000

A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data.
Proceedings of the ACM-GIS 2000, 2000

Finding k-Closest-Pairs Efficiently for High Dimensional Data.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids.
J. Algorithms, 1999

Post-Optimization and Incremental Refinement of R-Trees.
Proceedings of the ACM-GIS '99, 1999

1998
A Special Case of Mahler's Conjecture.
Discret. Comput. Geom., 1998

On Optimal Node Splitting for R-trees.
Proceedings of the VLDB'98, 1998

A Greedy Algorithm for Bulk Loading R-Trees.
Proceedings of the ACM-GIS '98, 1998

1997
STR: A Simple and Efficient Algorithm for R-Tree Packing.
Proceedings of the Thirteenth International Conference on Data Engineering, 1997

1996
Efficient decomposition of polygons into L-shapes with application to VLSI layouts.
ACM Trans. Design Autom. Electr. Syst., 1996

Efficient net extraction for restricted orientation designs [VLSI layout].
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

A Buffer Model for Evaluating the Performance of R-Tree Packing Algorithms.
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1996

Partitioning Algorithms for Corner Stitching.
Proceedings of the 6th Great Lakes Symposium on VLSI (GLS-VLSI '96), 1996

1995
On Computing Connected Components of Line Segments.
IEEE Trans. Computers, 1995

1994
A Class of Static and Dynamic Hierarchical Interconnection Networks.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

1993
Generalized intersection searching problems.
Int. J. Comput. Geom. Appl., 1993

Tightly Connected Hierarchical Interconnection Networks for Parallel Processors.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

A fast algorithm for VLSI net extraction.
Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993


  Loading...