Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Lawqueen Kanesh"'
Autor:
Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
Publikováno v:
Algorithmica. 84:3246-3275
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bfc79e607bb9d8463cb10cde40a95e8
https://doi.org/10.1007/s00453-022-01040-9
https://doi.org/10.1007/s00453-022-01040-9
Autor:
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8488835bceca4a0fac897c2e5a2532a3
https://doi.org/10.1137/1.9781611977554.ch143
https://doi.org/10.1137/1.9781611977554.ch143
Publikováno v:
CSR
Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is whether t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::483b6649a1ef8694a3ef921dd4cfc5d3
https://doi.org/10.1016/j.tcs.2021.03.008
https://doi.org/10.1016/j.tcs.2021.03.008
Publikováno v:
Theoretical Computer Science. 860:98-116
We know that Tree Contraction does not admit a polynomial kernel unless NP ⊆ coNP/poly , while Path Contraction admits a kernel with O ( k ) vertices. The starting point of this article is the following natural questions: What is the structure of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffa0d9df3183bac8b91557294a0d9781
https://doi.org/10.1016/j.tcs.2021.01.033
https://doi.org/10.1016/j.tcs.2021.01.033
Autor:
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
Publikováno v:
Combinatorial Algorithms
A digraph D is singly connected if for all ordered pairs of vertices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f2a5caf2831b32bac641adf19f3a9c9
http://europepmc.org/articles/PMC7254902
http://europepmc.org/articles/PMC7254902
Publikováno v:
Theory of Computing Systems. 64:1067-1093
Let π be a family of graphs. In the classical π-Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that G − S is in π. In this paper, we introdu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::458b51654dab1af1c946daef2fa8c29f
https://doi.org/10.1007/s00224-019-09964-6
https://doi.org/10.1007/s00224-019-09964-6
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030752415
CIAC
CIAC
Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is connected. In this paper, we initiate a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0be8e8cf620f6c0c8bc94a19467f8fa0
https://doi.org/10.1007/978-3-030-75242-2_21
https://doi.org/10.1007/978-3-030-75242-2_21
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
WG
An odd cycle transversal (oct, for short) in a graph is a set of vertices whose deletion will leave a graph without any odd cycles. The Odd Cycle Transversal (OCT) problem takes an undirected graph G and a non-negative integer k as input, and the obj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64619889f42f799d3041685bafe28ae5
https://doi.org/10.1007/978-3-030-86838-3_10
https://doi.org/10.1007/978-3-030-86838-3_10
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030500252
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2fdb8c418df78eed580130b9784b774
https://doi.org/10.1007/978-3-030-50026-9_18
https://doi.org/10.1007/978-3-030-50026-9_18
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
IWOCA
A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\), there is at most one path in D from u to v. In this paper, we study the Singly Connected Vertex Deletion (SCVD) problem: Given an n-vertex digraph D and a positive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dd8fc4d67b96db584932151355faea2
https://doi.org/10.1007/978-3-030-48966-3_18
https://doi.org/10.1007/978-3-030-48966-3_18