research
∙
09/07/2023
Looms
A pair (A,B) of hypergraphs is called orthogonal if |a ∩ b|=1 for every ...
share
research
∙
01/24/2023
Tight infinite matrices
We give a simple proof of a recent result of Gollin and Joó: if a possib...
research
∙
10/21/2022
Short rainbow cycles for families of matchings and triangles
A generalization of the famous Caccetta–Häggkvist conjecture, suggested ...
research
∙
05/09/2022
Visual Encoding and Debiasing for CTR Prediction
Extracting expressive visual features is crucial for accurate Click-Thro...
research
∙
10/27/2021
Rainbow cycles for families of matchings
Given a graph G and a coloring of its edges, a subgraph of G is called r...
research
∙
04/16/2021
On the power of random greedy algorithms
In this paper we solve two problems of Esperet, Kang and Thomasse as wel...
research
∙
11/18/2020
Prague dimension of random graphs
The Prague dimension of graphs was introduced by Nesetril, Pultr and Rod...
research
∙
08/09/2020
Big Networks: A Survey
A network is a typical expressive form of representing complex systems i...
research
∙
09/20/2019
EATEN: Entity-aware Attention for Single Shot Visual Text Extraction
Extracting entity from images is a crucial part of many OCR applications...
research
∙
09/06/2019
Bounds on Ramsey Games via Alterations
This note contains a refined alteration approach for constructing H-free...
research
∙
11/16/2017
