Andrzej Lingas
1 – 10 of 106
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- Forest-like abstract Voronoi diagrams in linear time
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- Extreme Witnesses and Their Applications
- Determining the consistency of resolved triplets and fan triplets
- Are unique subgraphs not easier to find?
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
- 3D Rectangulations and Geometric Matrix Multiplication
- Approximation schemes for capacitated geometric network design
- Clearing directed subgraphs by mobile agents : Variations on covering with paths