Andrzej Lingas
1 – 10 of 100
- 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?
- Forest-like abstract Voronoi diagrams in linear time
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
- 3D Rectangulations and Geometric Matrix Multiplication
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- 2017
- The snow team problem : (Clearing Directed subgraphs by mobile agents)
- Bounds for semi-disjoint bilinear forms in a unit-cost computational model
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
- Determining the consistency of resolved triplets and fan triplets
- A fast deterministic detection of small pattern graphs in graphs without large cliques