The following pages link to Konstantinos Georgiou (Q312656):
Displaying 50 items.
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Stable marriage with general preferences (Q506532) (← links)
- Social exchange networks with distant bargaining (Q744107) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- Search-and-fetch with one robot on a disk (track: wireless and geometry) (Q1629940) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Symmetric rendezvous with advice: how to rendezvous in a disk (Q1713903) (← links)
- Priority evacuation from a disk using mobile robots (extended abstract) (Q1713933) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Evacuation from a disc in the presence of a faulty robot (Q1742766) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Weighted group search on a line (extended abstract) (Q2037831) (← links)
- The unit acquisition number of binomial random graphs (Q2048570) (← links)
- Probabilistically faulty searching on a half-line (extended abstract) (Q2081614) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Makespan trade-offs for visiting triangle edges (extended abstract) (Q2115869) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- The bike sharing problem (Q2232233) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Excuse me! or the courteous theatregoers' problem (Q2347004) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Lift-and-Project Methods for Set Cover and Knapsack (Q2842162) (← links)
- Network Bargaining with General Capacities (Q2849334) (← links)
- Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy (Q2911610) (← links)
- (Q2913812) (← links)
- On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities (Q2920127) (← links)
- Stable Marriage with General Preferences (Q2938643) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- God save the queen (Q3305734) (← links)
- (Q3386625) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities (Q3503845) (← links)
- Optimal Sherali-Adams Gaps from Pairwise Independence (Q3638873) (← links)
- Search on a Line by Byzantine Robots (Q4636509) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- Social Exchange Networks with Distant Bargaining (Q4925223) (← links)
- Better Balance by Being Biased (Q4962636) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits (Q5127186) (← links)
- (Q5226842) (← links)
- On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy (Q5326573) (← links)
- Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy (Q5390606) (← links)
- The Beachcombers’ Problem: Walking and Searching with Mobile Robots (Q5496146) (← links)
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection (Q5741729) (← links)
- (Q5743446) (← links)
