research
∙
09/11/2021
Exact defective colorings of graphs
An exact (k,d)-coloring of a graph G is a coloring of its vertices with ...
share
research
∙
10/16/2020
Restless reachability problems in temporal graphs
We study a family of reachability problems under waiting-time restrictio...
research
∙
01/27/2020
Towards Quantifying the Distance between Opinions
Increasingly, critical decisions in public policy, governance, and busin...
research
∙
01/05/2020
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Combinatorial optimization problems arise in a wide range of application...
research
∙
09/12/2019
Learning Multi-Stage Sparsification for Maximum Clique Enumeration
We propose a multi-stage learning approach for pruning the search space ...
research
∙
05/15/2019
Perfect Italian domination on planar and regular graphs
A perfect Italian dominating function of a graph G=(V,E) is a function f...
research
∙
05/12/2019
Complexity of fall coloring for restricted graph classes
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), ...
research
∙
02/22/2019
