Andrzej Lingas
1 – 10 of 112
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
- Graphs with equal domination and covering numbers
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- 2019
- Lower bounds for Demorgan circuits of bounded negation width
- Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
-
On a Fire Fighter’s Problem
Klein, Rolf ; Langetepe, Elmar ; Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
and
Schwarzwald, Barbara
(2019)
In International Journal of Foundations of Computer Science
30(02).
p.231-246
Mark
-
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
Gasieniec, Leszek ; Jansson, Jesper LU ; Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
and
Persson, Mia
LU
(2019)
In Lecture Notes in Computer Science
11458.
p.156-169
Mark
- 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
- Clearing directed subgraphs by mobile agents : Variations on covering with paths
- 2018
-
3D Rectangulations and Geometric Matrix Multiplication
SAVONEN FLODERUS, PETER LU ; Jansson, Jesper ; Levcopoulos, Christos LU
;
Lingas, Andrzej
LU
and
SLEDNEU, DZMITRY
LU
(2018)
In Algorithmica
80(1).
p.136-154
Mark