◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Paul

12 papers hereh-index 8171 citations25 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • last author8

Across the 12 of 12 papers where every author was matched, so the position is known.

fields
  • cs.IT4
  • cs.DM3
  • cs.CG2
  • math.CO2
  • cs.CC1
same name
  • S. Paul — 250 papers, h 43
  • S. Paul — 59 papers, h 9
  • S. Paul — 53 papers
  • S. Paul — 39 papers, h 11
  • S. Paul — 34 papers, h 20
  • S. Paul — 32 papers, h 11

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedTransitivity on subclasses of bipartite graphs

2 citations · 7 across the 10 of their papers we have counts for

collaborators
Showing 2022Show all

4 papers · 1 filter

math.CO2022★ 1 cited

Transitivity on subclasses of chordal graphs

Subhabrata Paul, Kamal Santra

Let G=(V,E) be a graph, where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V, we say A \textit{dominates} B if every ver…

cs.IT2022★ 1 cited

A Direct Construction of Cross Z-Complementary Sets with Flexible Lengths and Large Zero Correlation Zone

Praveen Kumar, Sudhan Majhi, Subhabrata Paul

This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z…

cs.IT2022★ 1 cited

A Direct Construction of Cross Z-Complementary Sequence Sets with Large Set Size

Praveen Kumar, Sudhan Majhi, Subhabrata Paul

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end an…

cs.DM2022★ 2 cited

Transitivity on subclasses of bipartite graphs

Subhabrata Paul, Kamal Santra

Let G=(V,E) be a graph where V and E are the vertex and edge set, respectively. For two disjoint subsets A and B, we say A dominates B if every vertex of B is adja…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.