Sourav Chakraborty 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nitesh Jha

> Home > Persons > Sourav Chakraborty 0001

Publications

2018
[i25]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1805-08953
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1805-08953
Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and maximum transitive relation contained in a given binary relation. CoRR abs/1805.08953 (2018)
2015
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/0001GJR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/0001GJR15
Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy:
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. COCOON 2015: 587-600
2014
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/csr/AcharyyaCJ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/AcharyyaCJ14
Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
Counting Popular Matchings in House Allocation Problems. CSR 2014: 39-51
2013
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AcharyyaCJ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AcharyyaCJ13
Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
Counting Popular Matchings in House Allocation Problems. CoRR abs/1312.3552 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.