| Publication | Date of Publication | Type |
|---|
The Fagnano triangle patrolling problem
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
Triangle evacuation of 2 agents in the wireless model \& the power of choosing a starting point
Journal of Computer and System Sciences | 2025-09-29 | Paper |
Weighted group search on the disk \& improved lower bounds for priority evacuation
Journal of Computer and System Sciences | 2025-08-21 | Paper |
Makespan trade-offs for visiting triangle edges
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
| Weighted group search on the disk and improved LP-based lower bounds for priority evacuation | 2025-02-28 | Paper |
Overcoming probabilistic faults in disoriented linear search
Theoretical Computer Science | 2024-10-07 | Paper |
| Evacuation from a disk for robots with asymmetric communication | 2024-09-11 | Paper |
| Optimal circle search despite the presence of faulty robots | 2024-04-05 | Paper |
Bargaining in networks with socially-aware agents
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering | 2024-03-25 | Paper |
Overcoming probabilistic faults in disoriented linear search
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Average case -- worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model
Algorithms for Sensor Systems | 2023-10-20 | Paper |
Algorithms for \(p\)-Faulty Search on a half-line
Algorithmica | 2023-08-17 | Paper |
Search on a Line by Byzantine Robots
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Triangle evacuation of 2 agents in the wireless model (extended abstract)
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Optimal circle search despite the presence of faulty robots
Information Processing Letters | 2023-06-05 | Paper |
Lower bounds for shoreline searching with 2 or more robots
(available as arXiv preprint) | 2023-02-07 | Paper |
Evacuating from \(\ell_p\) unit disks in the wireless model
Theoretical Computer Science | 2023-01-30 | Paper |
Weighted group search on a line \& implications to the priority evacuation problem
Theoretical Computer Science | 2022-11-17 | Paper |
Probabilistically faulty searching on a half-line (extended abstract)
(available as arXiv preprint) | 2022-10-13 | Paper |
Energy consumption of group search on a line
(available as arXiv preprint) | 2022-07-21 | Paper |
Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
(available as arXiv preprint) | 2022-06-24 | Paper |
Makespan trade-offs for visiting triangle edges (extended abstract)
(available as arXiv preprint) | 2022-03-22 | Paper |
The bike sharing problem
(available as arXiv preprint) | 2021-10-04 | Paper |
The unit acquisition number of binomial random graphs
The Electronic Journal of Combinatorics | 2021-08-09 | Paper |
| Weighted group search on a line (extended abstract) | 2021-07-08 | Paper |
Treasure evacuation with one robot on a disk
Theoretical Computer Science | 2021-01-25 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Theoretical Computer Science | 2021-01-25 | Paper |
| Evacuating robots from a disk using face-to-face communication | 2021-01-05 | Paper |
Patrolling a path connecting a set of points with unbalanced frequencies of visits
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
God save the queen
(available as arXiv preprint) | 2020-08-11 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Lecture Notes in Computer Science | 2020-03-03 | Paper |
Priority evacuation from a disk: the case of \(n = 1,2,3\)
Theoretical Computer Science | 2020-01-16 | Paper |
Lower Bounds for Shoreline Searching with 2 or More Robots
(available as arXiv preprint) | 2020-01-13 | Paper |
scientific article; zbMATH DE number 7088261 (Why is no real title available?)
(available as arXiv preprint) | 2019-08-01 | Paper |
| scientific article; zbMATH DE number 7088261 (Why is no real title available?) | 2019-08-01 | Paper |
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Black-box reductions for cost-sharing mechanism design | 2019-05-10 | Paper |
Black-box reductions for cost-sharing mechanism design
Games and Economic Behavior | 2019-03-29 | Paper |
Symmetric rendezvous with advice: how to rendezvous in a disk
(available as arXiv preprint) | 2019-01-30 | Paper |
Priority evacuation from a disk using mobile robots (extended abstract)
(available as arXiv preprint) | 2019-01-30 | Paper |
| Search-and-fetch with one robot on a disk (track: wireless and geometry) | 2018-12-07 | Paper |
Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Lift-and-project methods for set cover and knapsack
Algorithmica | 2018-10-18 | Paper |
Search on a line by Byzantine robots
(available as arXiv preprint) | 2018-04-19 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
Know when to persist: deriving value from a stream buffer
Theoretical Computer Science | 2018-03-13 | Paper |
Evacuating two robots from multiple unknown exits in a circle
Theoretical Computer Science | 2017-12-20 | Paper |
Distributed patrolling with two-speed robots (and an application to transportation)
Operations Research and Enterprise Systems | 2017-04-28 | Paper |
Stable marriage with general preferences
Theory of Computing Systems | 2017-02-01 | Paper |
Know when to persist: deriving value from a stream buffer (extended abstract)
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
The beachcombers' problem: walking and searching with mobile robots
Theoretical Computer Science | 2015-12-11 | Paper |
Excuse me! or the courteous theatregoers' problem
Theoretical Computer Science | 2015-05-26 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Theoretical Computer Science | 2015-05-18 | Paper |
Stable marriage with general preferences. Extended abstract
Algorithmic Game Theory | 2015-01-14 | Paper |
Social exchange networks with distant bargaining
Theoretical Computer Science | 2014-10-06 | Paper |
The beachcombers' problem: walking and searching with mobile robots
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Network bargaining with general capacities
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Lift-and-project methods for set cover and knapsack
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Automata, Languages, and Programming | 2013-08-06 | Paper |
Social exchange networks with distant bargaining
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Lecture Notes in Computer Science | 2013-06-07 | Paper |
| On the tightening of the standard SDP for vertex cover with _1 inequalities | 2012-10-24 | Paper |
SDP gaps from pairwise independence
Theory of Computing | 2012-09-27 | Paper |
| Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy | 2012-08-31 | Paper |
| Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods | 2012-04-24 | Paper |
Integrality gaps of 2-o(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy
SIAM Journal on Computing | 2011-04-04 | Paper |
Random maximal independent sets and the unfriendly theater seating arrangement problem
Discrete Mathematics | 2009-12-15 | Paper |
Optimal Sherali-Adams Gaps from Pairwise Independence
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Complexity and Algorithms for Well-Structured k-SAT Instances
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
