We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V (H)|o(|V (G)|). We also show an exponential-timeâ€¦ (More)

Subgraph Isomorphism is a very basic graph problem, where given two graphs G and H one is to check whether G is a subgraph of H . Despite its simple definition, the Subgraph Isomorphism problem turnsâ€¦ (More)

We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance d from the solution to the votes. We show Minimaxâ€¦ (More)

We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time 2â€¦ (More)

The fastest algorithms for edge coloring run in time 2mnO(1), where m and n are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes 2Î˜(n). This isâ€¦ (More)

We study the complexity of the Channel Assignment problem. By applying the meet-in-the-middle approach we get an algorithm for the $$\ell $$ â„“ -bounded Channel Assignment (when the edge weights areâ€¦ (More)

The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in k colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges ofâ€¦ (More)