Search Results - Pal, Sudebkumar Prasant

Refine Results
  1. 1
    Preface: CALDAM 2019

    Preface: CALDAM 2019 by Swami, Sarvottamananda, Pal, Sudebkumar Prasant

    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

    Efficient Prüfer-Like Coding and Counting Labelled Hypertrees by Shannigrahi, Saswata, Pal, Sudebkumar Prasant

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    System of unbiased representatives for a collection of bicolorings

    System of unbiased representatives for a collection of bicolorings by Balachandran, Niranjan, Mathew, Rogers, Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  4. 4
    Bisecting and D-secting families for set systems

    Bisecting and D-secting families for set systems by Balachandran, Niranjan, Mathew, Rogers, Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Guest Editors' foreword

    Guest Editors' foreword by Pal, Sudebkumar Prasant, Sadakane, Kunihiko

    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Induced-bisecting families of bicolorings for hypergraphs

    Induced-bisecting families of bicolorings for hypergraphs by Balachandran, Niranjan, Mathew, Rogers, Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Published in Discrete mathematics
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    A combinatorial approach for studying local operations and classical communication transformations of multipartite states

    A combinatorial approach for studying local operations and classical communication transformations of multipartite states by Singh, Sudhir Kumar, Pal, Sudebkumar Prasant, Kumar, Somesh, Srikanth, R.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    Guest Editors' Foreword

    Guest Editors' Foreword by Pal, Sudebkumar Prasant, Sadakane, Kunihiko

    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs

    Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs by Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    Algorithms for computing diffuse reflection paths in polygons

    Algorithms for computing diffuse reflection paths in polygons by Ghosh, Subir Kumar, Goswami, Partha Pratim, Maheshwari, Anil, Nandy, Subhas Chandra, Pal, Sudebkumar Prasant, Sarvattomananda, Swami

    Published in The Visual computer
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 11
    A combinatorial approach for studying local operations and classical communication transformationsof multipartite states

    A combinatorial approach for studying local operations and classical communication transformationsof multipartite states by Singh, Sudhir Kumar, Pal, Sudebkumar Prasant, Kumar, Somesh, Srikanth, R.

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  12. 12
    A combinatorial approach for studying local operations and classical communication transformations of multipartite states

    A combinatorial approach for studying local operations and classical communication transformations of multipartite states by Singh, Sudhir Kumar, Pal, Sudebkumar Prasant, Kumar, Somesh, Srikanth, R

    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications

    Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications by Pal, Sudebkumar Prasant, Kumar, Somesh, Srikanth, R

    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  14. 14
    A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections

    A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections by Brahma, Siddhartha, Pal, Sudebkumar Prasant, Sarkar, Dilip

    Published in Journal of geometry
    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  15. 15
    An algorithm for recognizing palm polygons

    An algorithm for recognizing palm polygons by SUBIR KUMAR GHOSH, ANIL MAHESHWARI, SUDEBKUMAR PRASANT PAL, VENI MADHAVAN, C. E

    Published in The Visual computer
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  16. 16
    Bisecting and D-secting families for set systems

    Bisecting and D-secting families for set systems by Balachandran, Niranjan, Rogers, Mathew, Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research

    A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research by Ghosh, Subir Kumar, Pal, Sudebkumar Prasant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Bicoloring covers for graphs and hypergraphs

    Bicoloring covers for graphs and hypergraphs by Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Strong \((r,p)\) Cover for Hypergraphs

    Strong \((r,p)\) Cover for Hypergraphs by Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    An extremal problem in proper \((r,p)\)-coloring of hypergraphs

    An extremal problem in proper \((r,p)\)-coloring of hypergraphs by Mishra, Tapas Kumar, Pal, Sudebkumar Prasant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: