2 citations · 5 across the 10 of their papers we have counts for
12 papers
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Konstantinos Georgiou, Claude Gravel, Lazar Mandic +1
Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance , must follow the same randomized strategy to meet as quickly as possible…
Online Drone Coverage of Targets on a Line
Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis +5
We study a problem of online targets coverage by a drone or a sensor that is equipped with a camera or an antenna of fixed half-angle of view . The targets to be monitored appea…
Optimal Average Disk-Inspection via Fermat's Principle
Konstantinos Georgiou
This work resolves the optimal average-case cost of the Disk-Inspection problem, a variant of Bellman's 1955 lost-in-a-forest problem. In Disk-Inspection, a mobile agent starts at…
Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
Konstantinos Georgiou, Caleb Jones, Matthew Madej
We consider the problem of minimizing the worst-case search time for a hidden point target in the plane using multiple mobile agents of differing speeds, all starting from a common…
Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
James Conley, Konstantinos Georgiou
We consider unit-speed mobile agents initially positioned at the center of a unit disk, tasked with inspecting all points on the disk's perimeter. A perimeter point is consider…
Multi-Agent Search-Type Problems on Polygons
Konstantinos Georgiou, Caleb Jones, Jesse Lucier
We present several advancements in search-type problems for fleets of mobile agents operating in two dimensions under the wireless model. Potential hidden target locations are equi…
Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
Konstantinos Georgiou, Xin Wang
We consider \emph{weighted group search on a disk}, which is a search-type problem involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is to r…
Ocassionally Secure: A Comparative Analysis of Code Generation Assistants
Ran Elgedawy, Porter Dosch, John Sadik +8
Large Language Models (LLMs) are being increasingly utilized in various applications, with code generations being a notable example. While previous research has shown that LLMs…
The Fagnano Triangle Patrolling Problem
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat
We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) id…
Overcoming Probabilistic Faults in Disoriented Linear Search
Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis
We consider search by mobile agents for a hidden, idle target, placed on the infinite line. Feasible solutions are agent trajectories in which all agents reach the target sooner or…
Triangle Evacuation of 2 Agents in the Wireless Model
Konstantinos Georgiou, Woojin Jang
The input to the \emph{Triangle Evacuation} problem is a triangle . Given a starting point on the perimeter of the triangle, a feasible solution to the problem consists of…
A Study of Knowledge Sharing related to Covid-19 Pandemic in Stack Overflow
Konstantinos Georgiou, Nikolaos Mittas, Lefteris Angelis +1
The Covid-19 outbreak, beyond its tragic effects, has changed to an unprecedented extent almost every aspect of human activity throughout the world. At the same time, the pandemic…