Oscar Morales-Ponce

Orcid: 0000-0002-9645-1257

According to our database1, Oscar Morales-Ponce authored at least 43 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal Delivery with a Faulty Drone.
CoRR, 2024

Linear Search for an Escaping Target with Unknown Speed.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023
Delivery to Safety with Two Cooperating Robots.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

The Snow Plow Problem: Perpetual Maintenance by Mobile Agents on the Line.
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2022
Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots.
Theor. Comput. Sci., 2022

Line Search for an Oblivious Moving Target.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Robotic Sorting on the Grid.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021
Computing the Optimal Longest Queue Length in Torus Networks.
Proceedings of the Theory and Practice of Natural Computing, 2021

Message Delivery in the Plane by Robots with Different Speeds.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

The Pony Express Communication Problem.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Gathering in the plane of location-aware robots in the presence of spies.
Theor. Comput. Sci., 2020

Overweight Object Transportation with a Set of Collaborative Robots.
Proceedings of the 16th International Conference on Distributed Computing in Sensor Systems, 2020

Synchronous Robotic Framework.
Proceedings of the 16th International Conference on Distributed Computing in Sensor Systems, 2020

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments.
Proceedings of the Structural Information and Communication Complexity, 2019

2018
How to Stop Disagreeing and Start Cooperatingin the Presence of Asymmetric Packet Loss.
Sensors, 2018

2016
Strong connectivity of sensor networks with double antennae.
Theor. Comput. Sci., 2016

Distributed algorithms for barrier coverage using relocatable sensors.
Distributed Comput., 2016

Optimal Queue Length in Torus Networks with Traffic Signals.
CoRR, 2016

Connectivity with directional antennas in the symmetric communication model.
Comput. Geom., 2016

Neighbor Discovery in a Sensor Network with Directional Antennae.
Ad Hoc Sens. Wirel. Networks, 2016

2015
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae.
Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.
Inf. Comput., 2015

Monitoring the Plane with Rotating Radars.
Graphs Comb., 2015

2014
A kernel-based architecture for safe cooperative vehicular functions.
Proceedings of the 9th IEEE International Symposium on Industrial Embedded Systems, 2014

Driving with Confidence: Local Dynamic Maps That Provide LoS for the Gulliver Test-Bed.
Proceedings of the Computer Safety, Reliability, and Security, 2014

Cooperation with disagreement correction in the presence of communication failures.
Proceedings of the 17th International IEEE Conference on Intelligent Transportation Systems, 2014

Vehicular Coordination via a Safety Kernel in the Gulliver Test-Bed.
Proceedings of the 34th International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops), Madrid, Spain, June 30, 2014

2013
Strongly connected orientations of plane graphs.
Discret. Appl. Math., 2013

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Approximation Algorithms for the Antenna Orientation Problem.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Strong Connectivity of Wireless Sensor Networks with Double Directional Antennae in 3D.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs.
Discret. Math. Algorithms Appl., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discret. Math. Algorithms Appl., 2012

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs.
Proceedings of the Computer Science - Theory and Applications, 2012

Stretch Factor in Wireless Sensor Networks with Directional Antennae.
Proceedings of the Combinatorial Optimization and Applications, 2012

Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 11th International Conference, 2012

2011
Maintaining Connectivity in Sensor Networks Using Directional Antennae.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Planar Subgraphs without Low-Degree Nodes.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010
Strong Orientations of Planar Graphs with Bounded Stretch Factor.
Proceedings of the Structural Information and Communication Complexity, 2010


  Loading...