1 citations · 2 across the 12 of their papers we have counts for
5 papers · 1 filter
Romeo and Juliet Meeting in Forest Like Regions
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale +1
The game of rendezvous with adversaries is a game on a graph played by two players: Facilitator and Divider. Facilitator has two agents and Divider has a team of agents.…
Parameterized Complexity of Weighted Multicut in Trees
Esther Galby, Dániel Marx, Philipp Schepper +2
The Edge Multicut problem is a classical cut problem where given an undirected graph , a set of pairs of vertices , and a budget , the goal is to determine if th…
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh +1
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some ver…
Sparsification Lower Bound for Linear Spanners in Directed Graphs
Prafullkumar Tale
For , , and a graph , a spanning subgraph of is said to be an -spanner if $\dist(u, v, H) \le α\cdot \dist(u, v, G) + β$ holds for any pair of ve…
Reducing the Vertex Cover Number via Edge Contractions
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +2
The CONTRACTION(vc) problem takes as input a graph on vertices and two integers and , and asks whether one can contract at most edges to reduce the size of a min…