research
∙
07/31/2023
Boundedness for proper conflict-free and odd colorings
The proper conflict-free chromatic number, χ_pcf(G), of a graph G is the...
share
research
∙
08/23/2021
Approximation and parameterized algorithms to find balanced connected partitions of graphs
Partitioning a connected graph into k vertex-disjoint connected subgraph...
research
∙
07/29/2021
A tight lower bound for the online bounded space hypercube bin packing problem
In the d-dimensional hypercube bin packing problem, a given list of d-di...
research
∙
11/13/2019
Integer Programming Approaches to Balanced Connected k-Partition
We address the problem of partitioning a vertex-weighted connected graph...
research
∙
07/25/2017