1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2026
Conflict-Free Coloring Planar Graphs with 4 Colors
Petr Hliněný, Lukáš Málik
We efficiently conflict-free color every planar graph with 4 colors. An (open-neighborhood) conflict-free coloring assigns colors to vertices in a way that every vertex v has a nei…
cs.CL2023
LEIA: Linguistic Embeddings for the Identification of Affect
Segun Taofeek Aroyehun, Lukas Malik, Hannah Metzler +3
The wealth of text data generated by social media has enabled new kinds of analysis of emotions with language models. These models are often trained on small and costly datasets of…
cs.LG2022★ 1 cited
Extreme compression of sentence-transformer ranker models: faster inference, longer battery life, and less storage on edge devices
Amit Chaulwar, Lukas Malik, Maciej Krajewski +4
Modern search systems use several large ranker models with transformer architectures. These models require large computational resources and are not suitable for usage on devices w…