2024 [ nach oben ]

Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily Partitioning subclasses of chordal graphs with few deletionsTheoretical Computer Science 2024: 114288
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
In the (Vertex) \(k\)-Way Cut problem, input is an undirected graph \(G\), an integer \(s\), and the goal is to find a subset \(S\) of edges (vertices) of size at most \(s\), such that \(G-S\) has at least \(k\) connected components. Downey et al. [Electr. Notes Theor. Comput. Sci. 2003] showed that \(k\)-Way Cut is W[1]-hard parameterized by \( k \). However, Kawarabayashi and Throup [FOCS 2011] showed that the problem is fixed-parameter tractable (FPT) in general graphs with respect to the parameter \(s\) and provided a \( \mathcal{O(s^s^\mathcal{O(s) n^2) \) time algorithm, where \(n \) denotes the number of vertices in \(G \). The best-known algorithm for this problem runs in time \(s^{\mathcal{O(s) n^\mathcal{O(1)}\) given by Lokshtanov et al. [ACM Tran. of Algo. 2021]. On the other hand, Vertex \(k\)-Way Cut is W[1]-hard with respect to either of the parameters, \(k\) or \(s\) or \(k+s\). These algorithmic results motivate us to look at the problems on special classes of graphs. In this paper, we consider the (Vertex) \(k\)-Way Cut problem on subclasses of chordal graphs and obtain the following results. We first give a sub-exponential FPT algorithm for \(k\)-Way Cut running in time \(2^{\mathcal{O(\sqrt{s} \log s) n^\mathcal{O(1)}\) on chordal graphs. It is known that Vertex \(k\)-Way Cut is W[1]-hard on chordal graphs, in fact on split graphs, parameterized by \(k+s\). We complement this hardness result by designing polynomial-time algorithms for Vertex \(k\)-Way Cut on interval graphs, circular-arc graphs and permutation graphs.
@article{DBLP:journals/tcs/JanaSSSV24, abstract = {In the (Vertex) \(k\)-Way Cut problem, input is an undirected graph \(G\), an integer \(s\), and the goal is to find a subset \(S\) of edges (vertices) of size at most \(s\), such that \(G-S\) has at least \(k\) connected components. Downey et al. [Electr. Notes Theor. Comput. Sci. 2003] showed that \(k\)-Way Cut is W[1]-hard parameterized by \( k \). However, Kawarabayashi and Throup [FOCS 2011] showed that the problem is fixed-parameter tractable (FPT) in general graphs with respect to the parameter \(s\) and provided a \( \mathcal{O}(s^{s^{\mathcal{O}(s)}} n^2) \) time algorithm, where \(n \) denotes the number of vertices in \(G \). The best-known algorithm for this problem runs in time \(s^{\mathcal{O}(s)} n^{\mathcal{O}(1)}\) given by Lokshtanov et al. [ACM Tran. of Algo. 2021]. On the other hand, Vertex \(k\)-Way Cut is W[1]-hard with respect to either of the parameters, \(k\) or \(s\) or \(k+s\). These algorithmic results motivate us to look at the problems on special classes of graphs. In this paper, we consider the (Vertex) \(k\)-Way Cut problem on subclasses of chordal graphs and obtain the following results. We first give a sub-exponential FPT algorithm for \(k\)-Way Cut running in time \(2^{\mathcal{O}(\sqrt{s} \log s)} n^{\mathcal{O}(1)}\) on chordal graphs. It is known that Vertex \(k\)-Way Cut is W[1]-hard on chordal graphs, in fact on split graphs, parameterized by \(k+s\). We complement this hardness result by designing polynomial-time algorithms for Vertex \(k\)-Way Cut on interval graphs, circular-arc graphs and permutation graphs.}, author = {Jana, Satyabrata and Saha, Souvik and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, journal = {Theoretical Computer Science}, keywords = {shailyverma tcs year2024}, pages = 114288, title = {Partitioning subclasses of chordal graphs with few deletions}, year = 2024 }

Andreev, Nikita; Bliznets, Ivan; Kundu, Madhumita; Saurabh, Saket; Tripathi, Vikash; Verma, Shaily Parameterized Complexity of Paired DominationInternational Workshop on Combinatorial Algorithms (IWOCA) 2024: 523–536
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph \(G\) on \(n\) vertices, a dominating set \(D\) (set of vertices such that \(N[D]=V(G)\)) is called a paired dominating set of \(G\), if \(G[D]\) has perfect matching. In the Paired Domination problem, given a graph \(G\) and a positive integer \(k\), the task is to check whether \(G\) has a paired dominating set of size at most \(k\). The problem is a variant of the Dominating Set problem, and hence inherits most of the hardness of the Dominating Set problem; however, the same cannot be said about the algorithmic results. In this paper, we study the problem from the perspective of parameterized complexity, both from solution and structural parameterization, and obtain the following results. 1. We design an (non-trivial) exact exponential algorithm running in time \(1.7159^n\). 2. It admits Strong Exponential Time Hypothesis (SETH) optimal algorithm parameterized by the treewidth \(tw\) of the graph \(G\). The algorithm runs in time \(4^{tw}n^O(1)}\) and unless SETH fails, there is no algorithm running in time \((4-\epsilon)^twn^O(1)}\) for any \(\epsilon >0\). 3. We design an algorithm parameterized by the distance to cluster graphs. We complement this result by proving that the problem does not admit a polynomial kernel under this parameterization and under parameterization by vertex cover number. 4. Paired Domination admits a polynomial kernel on graphs that exclude a biclique \(K_{i,j}\). 5. We also prove that one of the counting versions of Paired Domination parameterized by cliquewidth admits \(n^{2cw+O(1)}\) time algorithm parameterized by cliquewidth (\(cw\)). However, it does not admit an FPT algorithm unless #SETH is false.
@inproceedings{andreev2024parameterized, abstract = {The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph \(G\) on \(n\) vertices, a dominating set \(D\) (set of vertices such that \(N[D]=V(G)\)) is called a paired dominating set of \(G\), if \(G[D]\) has perfect matching. In the Paired Domination problem, given a graph \(G\) and a positive integer \(k\), the task is to check whether \(G\) has a paired dominating set of size at most \(k\). The problem is a variant of the Dominating Set problem, and hence inherits most of the hardness of the Dominating Set problem; however, the same cannot be said about the algorithmic results. In this paper, we study the problem from the perspective of parameterized complexity, both from solution and structural parameterization, and obtain the following results. 1. We design an (non-trivial) exact exponential algorithm running in time \(1.7159^n\). 2. It admits Strong Exponential Time Hypothesis (SETH) optimal algorithm parameterized by the treewidth \(tw\) of the graph \(G\). The algorithm runs in time \(4^{tw}n^{O(1)}\) and unless SETH fails, there is no algorithm running in time \((4-\epsilon)^{tw}n^{O(1)}\) for any \(\epsilon >0\). 3. We design an algorithm parameterized by the distance to cluster graphs. We complement this result by proving that the problem does not admit a polynomial kernel under this parameterization and under parameterization by vertex cover number. 4. Paired Domination admits a polynomial kernel on graphs that exclude a biclique \(K_{i,j}\). 5. We also prove that one of the counting versions of Paired Domination parameterized by cliquewidth admits \(n^{2cw+O(1)}\) time algorithm parameterized by cliquewidth (\(cw\)). However, it does not admit an FPT algorithm unless #SETH is false.}, author = {Andreev, Nikita and Bliznets, Ivan and Kundu, Madhumita and Saurabh, Saket and Tripathi, Vikash and Verma, Shaily}, booktitle = {International Workshop on Combinatorial Algorithms (IWOCA)}, keywords = {sys:relevantfor:ae iwoca shailyverma year2024}, organization = {Springer}, pages = {523–536}, title = {Parameterized Complexity of Paired Domination}, year = 2024 }

2023 [ nach oben ]

Bhyravarapu, Sriram; Jana, Satyabrata; Kanesh, Lawqueen; Saurabh, Saket; Verma, Shaily Parameterized Algorithms for Eccentricity Shortest Path ProblemInternational Workshop on Combinatorial Algorithms (IWOCA) 2023: 74–86
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Given an undirected graph \(G=(V,E) \) and an integer \(\ell\), the Eccentricity Shortest Path Problem (ESP) problem asks to check if there exists a shortest path \(P\) such that for every vertex \(vin V(G)\), there is a vertex \(w\in P\) such that \(d_G(v,w)\leq \ell\), where \(d_G(v,w)\) represents the distance between \(v\) and \(w\) in \(G\). Dragan and Leitert [Theor. Comput. Sci. 2017] studied the optimization version of this problem which asks to find the minimum \(\ell\) for ESP and showed that it is sf NP-hard even on planar bipartite graphs with maximum degree 3. They also showed that ESP is sf W[2]-hard when parameterized by \(\ell \). On the positive side, Kucera and Suchy [IWOCA 2021] showed that ESP is fixed-parameter tractable (FPT) when parameterized by modular width, cluster vertex deletion set, maximum leaf number, or the combined parameters disjoint paths deletion set and \( \ell \). It was asked as an open question in the same paper, if ESP is FPT parameterized by disjoint paths deletion set or feedback vertex set. We answer these questions and obtain the following results. We prove that ESP is FPT when parameterized by disjoint paths deletion set, split vertex deletion set, or the combined parameters feedback vertex set and \(\ell\). Moreover, we design a \((1+\epsilon)\)-factor FPT approximation algorithm when parameterized by the feedback vertex set number. We also show that ESP is W[2]-hard when parameterized by the chordal vertex deletion set.
@inproceedings{DBLP:conf/iwoca/BhyravarapuJK0V23, abstract = {Given an undirected graph \(G=(V,E) \) and an integer \(\ell\), the Eccentricity Shortest Path Problem (ESP) problem asks to check if there exists a shortest path \(P\) such that for every vertex \(v\in V(G)\), there is a vertex \(w\in P\) such that \(d_G(v,w)\leq \ell\), where \(d_G(v,w)\) represents the distance between \(v\) and \(w\) in \(G\). Dragan and Leitert [Theor. Comput. Sci. 2017] studied the optimization version of this problem which asks to find the minimum \(\ell\) for ESP and showed that it is {sf NP}-hard even on planar bipartite graphs with maximum degree 3. They also showed that ESP is {sf W}[2]-hard when parameterized by \(\ell \). On the positive side, Kucera and Suchy [IWOCA 2021] showed that ESP is fixed-parameter tractable (FPT) when parameterized by modular width, cluster vertex deletion set, maximum leaf number, or the combined parameters disjoint paths deletion set and \( \ell \). It was asked as an open question in the same paper, if ESP is FPT parameterized by disjoint paths deletion set or feedback vertex set. We answer these questions and obtain the following results. We prove that ESP is FPT when parameterized by disjoint paths deletion set, split vertex deletion set, or the combined parameters feedback vertex set and \(\ell\). Moreover, we design a \((1+\epsilon)\)-factor FPT approximation algorithm when parameterized by the feedback vertex set number. We also show that ESP is W[2]-hard when parameterized by the chordal vertex deletion set.}, author = {Bhyravarapu, Sriram and Jana, Satyabrata and Kanesh, Lawqueen and Saurabh, Saket and Verma, Shaily}, booktitle = {International Workshop on Combinatorial Algorithms (IWOCA)}, keywords = {shailyverma year2023}, pages = {74–86}, title = {Parameterized Algorithms for Eccentricity Shortest Path Problem}, year = 2023 }

Ashok, Pradeesha; Das, Sayani; Kanesh, Lawqueen; Saurabh, Saket; Tomar, Avi; Verma, Shaily Burn and WinInternational Workshop on Combinatorial Algorithms (IWOCA) 2023: 36–48
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Given a graph \(G\) and an integer \(k\), the graph burning problem asks whether the graph \(G\) can be burned in at most \(k\) rounds. Graph burning is a model for information spreading in a network, where we study how fast the information spreads in the network through its vertices. In each round, the fire is started at an unburned vertex and the fire spreads to all its neighbors in the next round, burning all of them and so on. The minimum number of rounds required to burn the whole graph \(G\) is called the burning number of \(G\). Graph burning problem is NP-hard even for the union of disjoint paths. Moreover, the problem is known to be W[1]-hard when parameterized by the burning number and para-NP-hard when parameterized by treewidth. In this paper, we give a fixed-parameter tractable (FPT) algorithm for graph burning problem when parameterized by treewidth and burning number of the graph. Y. Kobayashi and Y. Otachi [Algorithmica 2022] proved that the problem is FPT parameterized by distance to cographs and gave a double exponential time FPT algorithm when parameterized by distance to split graphs. We improve these results partially and give an FPT algorithm for the problem when parameterized by distance to cographs \(\cap\) split graphs (threshold graphs) that runs in \(2^{\mathcal{O(k\ln k)}\). We also design a kernel for the problem in trees. Furthermore, we give an exact algorithm to find the burning number of a graph that runs in time \(4^n n^\mathcal{O(1)}\), where \(n\) is the number of vertices in the input graph.
@inproceedings{DBLP:conf/iwoca/AshokDK0TV23, abstract = {Given a graph \(G\) and an integer \(k\), the graph burning problem asks whether the graph \(G\) can be burned in at most \(k\) rounds. Graph burning is a model for information spreading in a network, where we study how fast the information spreads in the network through its vertices. In each round, the fire is started at an unburned vertex and the fire spreads to all its neighbors in the next round, burning all of them and so on. The minimum number of rounds required to burn the whole graph \(G\) is called the burning number of \(G\). Graph burning problem is NP-hard even for the union of disjoint paths. Moreover, the problem is known to be W[1]-hard when parameterized by the burning number and para-NP-hard when parameterized by treewidth. In this paper, we give a fixed-parameter tractable (FPT) algorithm for graph burning problem when parameterized by treewidth and burning number of the graph. Y. Kobayashi and Y. Otachi [Algorithmica 2022] proved that the problem is FPT parameterized by distance to cographs and gave a double exponential time FPT algorithm when parameterized by distance to split graphs. We improve these results partially and give an FPT algorithm for the problem when parameterized by distance to cographs \(\cap\) split graphs (threshold graphs) that runs in \(2^{\mathcal{O}(k\ln k)}\). We also design a kernel for the problem in trees. Furthermore, we give an exact algorithm to find the burning number of a graph that runs in time \(4^n n^{\mathcal{O}(1)}\), where \(n\) is the number of vertices in the input graph.}, author = {Ashok, Pradeesha and Das, Sayani and Kanesh, Lawqueen and Saurabh, Saket and Tomar, Avi and Verma, Shaily}, booktitle = {International Workshop on Combinatorial Algorithms (IWOCA)}, keywords = {shailyverma year2023}, pages = {36–48}, title = {Burn and Win}, year = 2023 }

Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily Partitioning Subclasses of Chordal Graphs with Few DeletionsConference on Algorithms and Complexity (CIAC) 2023: 293–307
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
In the (Vertex) \(k\)-Way Cut problem, input is an undirected graph \(G\), an integer \(s\), and the goal is to find a subset \(S\) of edges (vertices) of size at most \(s\), such that \(G-S\) has at least \(k\) connected components. Downey et al. [Electr. Notes Theor. Comput. Sci. 2003] showed that \(k\)-Way Cut is W[1]-hard parameterized by \( k \). However, Kawarabayashi and Throup [FOCS 2011] showed that the problem is fixed-parameter tractable (FPT) in general graphs with respect to the parameter \(s\) and provided a \(\mathcal{O(s^s^\mathcal{O(s) n^2) \) time algorithm, where \(n \) denotes the number of vertices in \(G \). The best-known algorithm for this problem runs in time \(s^{\mathcal{O(s) n^\mathcal{O(1)}\) given by Lokshtanov et al. [ACM Tran. of Algo. 2021]. On the other hand, Vertex \(k\)-Way Cut is W[1]-hard with respect to either of the parameters, \(k\) or \(s\) or \(k+s\). These algorithmic results motivate us to look at the problems on special classes of graphs. In this paper, we consider the (Vertex) \(k\)-Way Cut problem on subclasses of chordal graphs and obtain the following results. (i) We first give a sub-exponential FPT algorithm for \(k\)-Way Cut running in time \(2^{\mathcal{O(\sqrt{s} \log s) n^\mathcal{O(1)}\) on chordal graphs. (ii) It is known that Vertex \(k\)-Way Cut is W[1]-hard on chordal graphs, in fact on split graphs, parameterized by \(k+s\). We complement this hardness result by designing polynomial-time algorithms for Vertex \(k\)-Way Cut on interval graphs, circular-arc graphs and permutation graphs.
@inproceedings{DBLP:conf/ciac/JanaSSSV23, abstract = {In the (Vertex) \(k\)-Way Cut problem, input is an undirected graph \(G\), an integer \(s\), and the goal is to find a subset \(S\) of edges (vertices) of size at most \(s\), such that \(G-S\) has at least \(k\) connected components. Downey et al. [Electr. Notes Theor. Comput. Sci. 2003] showed that \(k\)-Way Cut is W[1]-hard parameterized by \( k \). However, Kawarabayashi and Throup [FOCS 2011] showed that the problem is fixed-parameter tractable (FPT) in general graphs with respect to the parameter \(s\) and provided a \(\mathcal{O}(s^{s^{\mathcal{O}(s)}} n^2) \) time algorithm, where \(n \) denotes the number of vertices in \(G \). The best-known algorithm for this problem runs in time \(s^{\mathcal{O}(s)} n^{\mathcal{O}(1)}\) given by Lokshtanov et al. [ACM Tran. of Algo. 2021]. On the other hand, Vertex \(k\)-Way Cut is W[1]-hard with respect to either of the parameters, \(k\) or \(s\) or \(k+s\). These algorithmic results motivate us to look at the problems on special classes of graphs. In this paper, we consider the (Vertex) \(k\)-Way Cut problem on subclasses of chordal graphs and obtain the following results. (i) We first give a sub-exponential FPT algorithm for \(k\)-Way Cut running in time \(2^{\mathcal{O}(\sqrt{s} \log s)} n^{\mathcal{O}(1)}\) on chordal graphs. (ii) It is known that Vertex \(k\)-Way Cut is W[1]-hard on chordal graphs, in fact on split graphs, parameterized by \(k+s\). We complement this hardness result by designing polynomial-time algorithms for Vertex \(k\)-Way Cut on interval graphs, circular-arc graphs and permutation graphs.}, author = {Jana, Satyabrata and Saha, Souvik and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, booktitle = {Conference on Algorithms and Complexity (CIAC)}, keywords = {ciac shailyverma year2023}, pages = {293–307}, title = {Partitioning Subclasses of Chordal Graphs with Few Deletions}, year = 2023 }

Paul, Subhabrata; Pradhan, Dinabandhu; Verma, Shaily Vertex-edge domination in interval and bipartite permutation graphsDiscuss. Math. Graph Theory 2023: 947–963
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Given a graph \(G = (V,E)\), a vertex \(u \in V\) ve-dominates all edges incident to any vertex of \(N_G[u]\). A set \(D \subseteq V\) is a vertex-edge dominating set if for any edge \(e \in E\), there exists a vertex \(u \in D\) such that \(u\) ve-dominates \(e\). Given a graph \(G\), our goal is to find a minimum cardinality ve-dominating set of \(G\). In this paper, we designed two linear time algorithms to find a minimum cardinality ve-dominating set for interval and bipartite permutation graphs.
@article{DBLP:journals/dmgt/PaulPV23, abstract = {Given a graph \(G = (V,E)\), a vertex \(u \in V\) ve-dominates all edges incident to any vertex of \(N_G[u]\). A set \(D \subseteq V\) is a vertex-edge dominating set if for any edge \(e \in E\), there exists a vertex \(u \in D\) such that \(u\) ve-dominates \(e\). Given a graph \(G\), our goal is to find a minimum cardinality ve-dominating set of \(G\). In this paper, we designed two linear time algorithms to find a minimum cardinality ve-dominating set for interval and bipartite permutation graphs.}, author = {Paul, Subhabrata and Pradhan, Dinabandhu and Verma, Shaily}, journal = {Discuss. Math. Graph Theory}, keywords = {dmgt shailyverma year2023}, pages = {947–963}, title = {Vertex-edge domination in interval and bipartite permutation graphs}, year = 2023 }

2022 [ nach oben ]

Bhyravarapu, Sriram; Jana, Satyabrata; Panolan, Fahad; Saurabh, Saket; Verma, Shaily List Homomorphism: Beyond the Known BoundariesTheoretical Informatics: Latin American Symposium (LATIN) 2022 2022: 593–609
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Given two graphs \(G\) and \(H\), and a list \(L(u)V(H)\) associated with each \(uV(G)\), a list homomorphism from \(G\) to \(H\) is a mapping \(f:V(G)V(H)\) such that (i) for all \(uV(G)\), \(f(u) L(u)\), and (ii) for all \(u,vV(G)\), if \(uvE(G)\) then \(f(u)f(v)E(H)\). The List Homomorphism problem asks whether there exists a list homomorphism from \(G\) to \(H\). Enright, Stewart and Tardos SIAM J. Discret. Math., 2014 showed that the List Homomorphism problem can be solved in \( \mathcal{O(n^{k^2}-3k+4) \) time on graphs where every connected induced subgraph of \(G\) admits ``a multichain ordering'' that includes permutation graphs, biconvex graphs, and interval graphs, where \(n=|V(G)|\) and \(k=|V(H)|\). We prove that List Homomorphism parameterized by \(k\) even when \(G\) is a bipartite permutation graph is W1-hard. In fact, our reduction implies that it is not solvable in time \(n^o(k)\), unless the Exponential Time Hypothesis (ETH) fails. We complement this result with a matching upper bound and another positive result. We design a \(O(n^8k+3)\) time algorithm for List Homomorphism on bipartite graphs that admit a multichain ordering that includes the class of bipartite permutation graphs and biconvex graphs. Moreover, we show that for bipartite graph \(G\) that admits a multichain ordering, List Homomorphism is fixed parameter tractable when parameterized by \(k\) and the number of layers in the multichain ordering of \(G\). In addition, we study a variant of List Homomorphism called List Locally Surjective Homomorphism. We prove that List Locally Surjective Homomorphism parameterized by the number of vertices in \(H\) is wh, even when \(G\) is a chordal graph and \(H\) is a split graph.
@inproceedings{DBLP:conf/latin/BhyravarapuJP0V22, abstract = {Given two graphs \(G\) and \(H\), and a list \(L(u)V(H)\) associated with each \(uV(G)\), a list homomorphism from \(G\) to \(H\) is a mapping \(f:V(G)V(H)\) such that (i) for all \(uV(G)\), \(f(u) L(u)\), and (ii) for all \(u,vV(G)\), if \(uvE(G)\) then \(f(u)f(v)E(H)\). The List Homomorphism problem asks whether there exists a list homomorphism from \(G\) to \(H\). Enright, Stewart and Tardos SIAM J. Discret. Math., 2014 showed that the List Homomorphism problem can be solved in \( \mathcal{O}(n^{k^2}-3k+4) \) time on graphs where every connected induced subgraph of \(G\) admits ``a multichain ordering'' that includes permutation graphs, biconvex graphs, and interval graphs, where \(n=|V(G)|\) and \(k=|V(H)|\). We prove that List Homomorphism parameterized by \(k\) even when \(G\) is a bipartite permutation graph is W1-hard. In fact, our reduction implies that it is not solvable in time \(n^o(k)\), unless the Exponential Time Hypothesis (ETH) fails. We complement this result with a matching upper bound and another positive result. We design a \(O(n^8k+3)\) time algorithm for List Homomorphism on bipartite graphs that admit a multichain ordering that includes the class of bipartite permutation graphs and biconvex graphs. Moreover, we show that for bipartite graph \(G\) that admits a multichain ordering, List Homomorphism is fixed parameter tractable when parameterized by \(k\) and the number of layers in the multichain ordering of \(G\). In addition, we study a variant of List Homomorphism called List Locally Surjective Homomorphism. We prove that List Locally Surjective Homomorphism parameterized by the number of vertices in \(H\) is wh, even when \(G\) is a chordal graph and \(H\) is a split graph.}, author = {Bhyravarapu, Sriram and Jana, Satyabrata and Panolan, Fahad and Saurabh, Saket and Verma, Shaily}, booktitle = {Theoretical Informatics: Latin American Symposium (LATIN) 2022}, keywords = {shailyverma year2022}, pages = {593–609}, title = {List Homomorphism: Beyond the Known Boundaries}, year = 2022 }

Verma, Shaily; Fu, Hung-Lin; Panda, B. S. Adjacent vertex distinguishing total coloring in split graphsDiscret. Math. 2022: 113061
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
An adjacent vertex distinguishing (AVD)-total coloring of a graph \(G\) is a total coloring such that any two adjacent vertices \(u\) and \(v\) have the distinct set of colors, that is, \(C(u)neq C(v)\), where \(C(v)\) is the set of colors of the edges incident on \(v\) and the color of \(v\). The adjacent vertex distinguishing (AVD)-total chromatic number of a graph \(G\), \(\chi_a''(G)\) is the minimum integer \(k\) such that there exists an AVD-total coloring of \(G\) using \(k\) colors. It is known that \(\chi_a''(G)\geq \Delta+1\), where \(\Delta\) is the maximum degree of the graph. The AVD-total coloring conjecture states that for any graph \(G\), \(\chi_a''(G)\leq \Delta+3\). In this paper, we study the AVD-total coloring in split graphs. We prove the AVD-total coloring conjecture for split graphs and classify certain classes of split graphs according to their AVD-total chromatic number.
@article{DBLP:journals/dm/VermaFP22, abstract = {An adjacent vertex distinguishing (AVD)-total coloring of a graph \(G\) is a total coloring such that any two adjacent vertices \(u\) and \(v\) have the distinct set of colors, that is, \(C(u)\neq C(v)\), where \(C(v)\) is the set of colors of the edges incident on \(v\) and the color of \(v\). The adjacent vertex distinguishing (AVD)-total chromatic number of a graph \(G\), \(\chi_a''(G)\) is the minimum integer \(k\) such that there exists an AVD-total coloring of \(G\) using \(k\) colors. It is known that \(\chi_a''(G)\geq \Delta+1\), where \(\Delta\) is the maximum degree of the graph. The AVD-total coloring conjecture states that for any graph \(G\), \(\chi_a''(G)\leq \Delta+3\). In this paper, we study the AVD-total coloring in split graphs. We prove the AVD-total coloring conjecture for split graphs and classify certain classes of split graphs according to their AVD-total chromatic number.}, author = {Verma, Shaily and Fu, Hung-Lin and Panda, B. S.}, journal = {Discret. Math.}, keywords = {shailyverma year2022}, pages = 113061, title = {Adjacent vertex distinguishing total coloring in split graphs}, year = 2022 }

Derbisz, Jan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily A Polynomial Kernel for Bipartite Permutation Vertex DeletionAlgorithmica 2022: 3246–3275
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
In a permutation graph, vertices represent the elements of a permutation, and edges represent pairs of elements that are reversed by the permutation. In the sc Permutation Vertex Deletion problem, given an undirected graph \(G\) and an integer \(k\), the objective is to test whether there exists a vertex subset \(S subseteq V(G)\) such that \(|S| \leq k\) and \(G-S\) is a permutation graph. The parameterized complexity of Permutation Vertex Deletion is a well-known open problem. Bożyk et al. [IPEC 2020] initiated a study on this problem by requiring that \(G-S\) be a bipartite permutation graph (a permutation graph that is bipartite). They called this the Bipartite Permutation Vertex Deletion (BPVD) problem. They showed that the problem admits a factor 9-approximation algorithm as well as a fixed parameter tractable (FPT) algorithm running in time \(\mathcal{O(9^k |V(G)|^{9})\). Moreover, they posed the question whether BPVD admits a polynomial kernel. We resolve this question in the affirmative by designing a polynomial kernel for BPVD. In particular, we obtain the following: Given an instance \((G,k)\) of BPVD, in polynomial time we obtain an equivalent instance \((G',k')\) of BPVD such that \(k'\leq k\), and \(|V(G')|+|E(G')| leq k^\mathcal{O(1)}\).
@article{DBLP:journals/algorithmica/DerbiszKMSSV22, abstract = {In a permutation graph, vertices represent the elements of a permutation, and edges represent pairs of elements that are reversed by the permutation. In the {sc Permutation Vertex Deletion} problem, given an undirected graph \(G\) and an integer \(k\), the objective is to test whether there exists a vertex subset \(S \subseteq V(G)\) such that \(|S| \leq k\) and \(G-S\) is a permutation graph. The parameterized complexity of Permutation Vertex Deletion is a well-known open problem. Bożyk et al. [IPEC 2020] initiated a study on this problem by requiring that \(G-S\) be a bipartite permutation graph (a permutation graph that is bipartite). They called this the Bipartite Permutation Vertex Deletion (BPVD) problem. They showed that the problem admits a factor 9-approximation algorithm as well as a fixed parameter tractable (FPT) algorithm running in time \(\mathcal{O}(9^k |V(G)|^{9})\). Moreover, they posed the question whether BPVD admits a polynomial kernel. We resolve this question in the affirmative by designing a polynomial kernel for BPVD. In particular, we obtain the following: Given an instance \((G,k)\) of BPVD, in polynomial time we obtain an equivalent instance \((G',k')\) of BPVD such that \(k'\leq k\), and \(|V(G')|+|E(G')| \leq k^{\mathcal{O}(1)}\).}, author = {Derbisz, Jan and Kanesh, Lawqueen and Madathil, Jayakrishnan and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, journal = {Algorithmica}, keywords = {shailyverma year2022}, pages = {3246–3275}, title = {A Polynomial Kernel for Bipartite Permutation Vertex Deletion}, year = 2022 }

Ramanujan, M. S.; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily An Exact Algorithm for Knot-Free Vertex DeletionMathematical Foundations of Computer Science (MFCS) 2022: 78:1–78:15
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
The study of the Knot-Free Vertex Deletion problem emerges from its application in the resolution of deadlocks called knots, detected in a classical distributed computation model, that is, the OR-model. A strongly connected subgraph \(Q\) of a digraph \(D\) with at least two vertices is said to be a knot if there is no arc \((u,v)\) of \(D\) with \(u in V(Q)\) and \(v notin V(Q)\) (no-out neighbors of the vertices in \(Q\)). Given a directed graph \(D\), the Knot-Free Vertex Deletion problem asks to compute a minimum-size subset \(Ssubset V(D)\) such that \(D[V\setminus S]\) contains no knots. There is no exact algorithm known for the problem in the literature that is faster than the trivial \(\mathcal{O^\star(2^n)\) brute-force algorithm. In this paper, we obtain the first non-trivial upper bound for the problem by designing an exact algorithm running in time \(\mathcal{O^\star(1.576^n)\), where \(n\) is the size of the vertex set in \(D\).
@inproceedings{ramanujan2022exact, abstract = {The study of the Knot-Free Vertex Deletion problem emerges from its application in the resolution of deadlocks called knots, detected in a classical distributed computation model, that is, the OR-model. A strongly connected subgraph \(Q\) of a digraph \(D\) with at least two vertices is said to be a knot if there is no arc \((u,v)\) of \(D\) with \(u \in V(Q)\) and \(v \notin V(Q)\) (no-out neighbors of the vertices in \(Q\)). Given a directed graph \(D\), the Knot-Free Vertex Deletion problem asks to compute a minimum-size subset \(S\subset V(D)\) such that \(D[V\setminus S]\) contains no knots. There is no exact algorithm known for the problem in the literature that is faster than the trivial \(\mathcal{O}^\star(2^n)\) brute-force algorithm. In this paper, we obtain the first non-trivial upper bound for the problem by designing an exact algorithm running in time \(\mathcal{O}^\star(1.576^n)\), where \(n\) is the size of the vertex set in \(D\).}, author = {Ramanujan, M. S. and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, booktitle = {Mathematical Foundations of Computer Science (MFCS)}, keywords = {sys:relevantfor:ae mfcs shailyverma year2022}, pages = {78:1–78:15}, title = {An Exact Algorithm for Knot-Free Vertex Deletion}, year = 2022 }