Tapan Kumar Pal

From MaRDI portal
Person:1590796

Available identifiers

zbMath Open pal.tapan-kumarMaRDI QIDQ1590796

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q36348622009-06-27Paper
Fuzzy preference ordering of interval numbers in decision problems2009-01-15Paper
Solving the shortest path problem with interval arcs2008-03-11Paper
Selection of programme slots of television channels for giving advertisement: a graph theoretic approach2007-05-18Paper
https://portal.mardi4nfdi.de/entity/Q33671182006-01-23Paper
https://portal.mardi4nfdi.de/entity/Q33671212006-01-23Paper
An efficient PRAM algorithm for maximum-weight independent set on permutation graphs2005-11-21Paper
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs2005-03-10Paper
An optimal parallel algorithm to construct a tree 3-spanner on interval graphs2005-03-07Paper
An optimal PRAM algorithm for a spanning tree on trapezoid graphs.2004-06-22Paper
Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs2004-03-15Paper
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs2004-03-08Paper
An efficient algorithm for finding all hinge vertices on trapezoid graphs2003-08-26Paper
An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs2003-08-06Paper
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs2002-12-11Paper
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27311302001-10-28Paper
An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs2001-06-26Paper
Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.2001-01-01Paper
On comparing interval numbers2000-12-21Paper
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs2000-08-24Paper
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44884422000-07-05Paper
https://portal.mardi4nfdi.de/entity/Q47188282000-01-04Paper
An efficient algorithm to generate all maximal independent sets on trapezoid graphs1999-10-25Paper
https://portal.mardi4nfdi.de/entity/Q38007341988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39336231980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38512791979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38749501979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38528181978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41795281978-01-01Paper
Extensions of Fixed Point Theorems of Rhoades and Ciric1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41240051977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41576811977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41576821977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41240061976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41485061976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41970421976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tapan Kumar Pal