Andrzej Lingas
11 – 20 of 111
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- Are unique subgraphs not easier to find?
- Extreme Witnesses and Their Applications
- Determining the consistency of resolved triplets and fan triplets
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Approximation schemes for capacitated geometric network design
- 2017
-
Efficiently Correcting Matrix Products
Gasieniec, Leszek ; Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
;
Pagh, Rasmus
and
Tokuyama, Takeshi
(2017)
In Algorithmica
79(2).
p.428-443
Mark
- The snow team problem : (Clearing Directed subgraphs by mobile agents)
-
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
;
Gąsieniec, Leszek
;
Klasing, Ralf
;
Min, Jie
and
Radzik, Tomasz
(2017)
10139.
p.229-240
Mark
- Bounds for semi-disjoint bilinear forms in a unit-cost computational model