Personal information

Emails & domains

Verified email domains

Activities

Collapse all

Works (28)

On minimum t-claw deletion in split graphs

Acta Informatica
2025-03 | Journal article
DOI: 10.1007/s00236-025-00482-2
Part of ISSN: 0001-5903
Part of ISSN: 1432-0525
Contributors: Sounaka Mishra
Source: Self-asserted source
0000-0001-8393-9109

Complexity of Near-3-Choosability Problem

Graphs and Combinatorics
2024-12 | Journal article
DOI: 10.1007/s00373-024-02837-x
Contributors: Sounaka Mishra; S. Rohini; Sagar S. Sawant
Source: check_circle
Crossref

On the complexity of minimum maximal acyclic matchings

Journal of Combinatorial Optimization
2024-08 | Journal article
DOI: 10.1007/s10878-024-01200-3
Part of ISSN: 1382-6905
Part of ISSN: 1573-2886
Contributors: Dr. Juhi Chaudhary; Sounaka Mishra; B. S. Panda
Source: Self-asserted source
0000-0001-8393-9109

On the complexity of co-secure dominating set problem

Information Processing Letters
2024-03 | Journal article
DOI: 10.1016/j.ipl.2023.106463
Part of ISSN: 0020-0190
Contributors: B S Panda; Soumyashree Rana; Sounaka Mishra
Source: Self-asserted source
0000-0001-8393-9109

Approximation algorithm for minimum q-dominator partization problem

Discrete Mathematics, Algorithms and Applications
2024-01 | Journal article
DOI: 10.1142/S1793830922501889
Contributors: Sayani Das; Sounaka Mishra
Source: check_circle
Crossref

On the Complexity of Minimum Maximal Acyclic Matchings

Lecture Notes in Computer Science
2022 | Book chapter
DOI: 10.1007/978-3-031-22105-7_10
Part of ISBN: 9783031221040
Part of ISBN: 9783031221057
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Contributors: Juhi Chaudhary; Sounaka Mishra; B. S. Panda
Source: Self-asserted source
0000-0001-8393-9109

On the complexity of minimum q-domination partization problems

Journal of Combinatorial Optimization
2022-03 | Journal article
DOI: 10.1007/s10878-021-00779-1
Contributors: Sayani Das; Sounaka Mishra
Source: check_circle
Crossref

Approximability of open k-monopoly problems

Theory of Computing Systems
2021-07-14 | Journal article
DOI: 10.1007/s00224-020-10027-4
Contributors: Sounaka Mishra; B. Arjuna Krishna; Shijin Rajakrishnan
Source: check_circle
Crossref

Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes

Discrete Mathematics, Algorithms and Applications
2020-12-27 | Journal article
DOI: 10.1142/S179383092050086X
Contributors: Sayani Das; Sounaka Mishra
Source: check_circle
Crossref

On approximability of optimization problems related to Red/Blue-split graphs

Theoretical Computer Science
2017 | Journal article
DOI: 10.1016/j.tcs.2017.06.008
EID:

2-s2.0-85021327153
Contributors: Mishra, S.; Rajakrishnan, S.; Saurabh, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality

Theoretical Computer Science
2017-01 | Journal article
DOI: 10.1016/j.tcs.2016.09.017
Contributors: Usha Mohan; Sivaramakrishnan Ramani; Sounaka Mishra
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Computational complexity of minimum P<inf>4</inf> vertex cover problem for regular and K <inf>1, 4</inf>-free graphs

Discrete Applied Mathematics
2015 | Journal article
DOI: 10.1016/j.dam.2014.10.033
EID:

2-s2.0-84930589539
Contributors: Safina Devi, N.; Mane, A.C.; Mishra, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

Journal of Discrete Algorithms
2015-07 | Journal article
DOI: 10.1016/j.jda.2015.03.002
Contributors: Sounaka Mishra; Ashwin Pananjady; N. Safina Devi
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization

Theoretical Computer Science
2014 | Journal article
DOI: 10.1016/j.tcs.2014.01.019
EID:

2-s2.0-84895925911
Contributors: Kumar, M.; Mishra, S.; Safina Devi, N.; Saurabh, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Complexity of majority monopoly and signed domination problems

Journal of Discrete Algorithms
2012 | Journal article
DOI: 10.1016/j.jda.2011.12.019
EID:

2-s2.0-84855548350
Contributors: Mishra, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Approximation algorithms for minimum chain vertex deletion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2011 | Book
DOI: 10.1007/978-3-642-19094-0_5
EID:

2-s2.0-79952259495
Contributors: Kumar, M.; Mishra, S.; Devi, N.S.; Saurabh, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On the maximum uniquely restricted matching for bipartite graphs

Electronic Notes in Discrete Mathematics
2011 | Journal article
DOI: 10.1016/j.endm.2011.05.059
EID:

2-s2.0-80053057723
Contributors: Mishra, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

The complexity of König subgraph problems and above-guarantee vertex cover

Algorithmica (New York)
2011 | Journal article
DOI: 10.1007/s00453-010-9412-2
EID:

2-s2.0-80955141210
Contributors: Mishra, S.; Raman, V.; Saurabh, S.; Sikdar, S.; Subramanian, C.R.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

König deletion sets and vertex covers above the matching size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2008 | Book
DOI: 10.1007/978-3-540-92182-0_73
EID:

2-s2.0-58549086600
Contributors: Mishra, S.; Raman, V.; Saurabh, S.; Sikdar, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

The complexity of finding subgraphs whose matching number equals the vertex cover number

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2007 | Book
EID:

2-s2.0-38149064415
Contributors: Mishra, S.; Raman, V.; Saurabh, S.; Sikdar, S.; Subramanian, C.R.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On approximability of linear ordering and related NP-optimization problems on graphs

Discrete Applied Mathematics
2004 | Journal article
DOI: 10.1016/S0166-218X(03)00444-X
EID:

2-s2.0-0347947234
Contributors: Mishra, S.; Sikdar, K.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Optimizing register spills for eager functional languages

Future Generation Computer Systems
2002 | Journal article
DOI: 10.1016/S0167-739X(02)00035-3
EID:

2-s2.0-0036532297
Contributors: Mishra, S.; Sikdar, K.; Satpathy, M.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On approximability of linear ordering and related NP-optimization problems on graphs (Extended abstract)

Electronic Notes in Discrete Mathematics
2001 | Journal article
EID:

2-s2.0-52549090497
Contributors: Mishra, S.; Sikdar, K.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)

Electronic Notes in Discrete Mathematics
2001 | Journal article
DOI: 10.1016/S1571-0653(05)80081-2
EID:

2-s2.0-0006833247
Contributors: Mishra, S.; Sikdar, K.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem

RAIRO - Theoretical Informatics and Applications
2001 | Journal article
DOI: 10.1051/ita:2001121
EID:

2-s2.0-17944381933
Contributors: Mishra, S.; Sikdar, K.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Optimizing register spills for eager functional languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2001 | Book
DOI: 10.1007/3-540-45718-6_15
EID:

2-s2.0-23044526884
Contributors: Mishra, S.; Sikdar, K.; Satpathy, M.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

On the hardness of approximating some np-optimization problems related to minimum linear ordering problem (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2000 | Book
EID:

2-s2.0-0006833050
Contributors: Mishra, S.; Sikdar, K.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier

Some new characterizations of matroids

Ars Combinatoria
1999 | Journal article
EID:

2-s2.0-0039107845
Contributors: Mishra, S.
Source: Self-asserted source
0000-0001-8393-9109 via Scopus - Elsevier
How many people are using ORCID?