Tapan K. Pal

Available identifiers

zbMath Open pal.tapan-kumarMaRDI QIDQ1590796

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3634862	2009-06-27	Paper
Fuzzy preference ordering of interval numbers in decision problems	2009-01-15	Paper
Solving the shortest path problem with interval arcs	2008-03-11	Paper
Selection of programme slots of television channels for giving advertisement: a graph theoretic approach	2007-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q3367121	2006-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q3367118	2006-01-23	Paper
An efficient PRAM algorithm for maximum-weight independent set on permutation graphs	2005-11-21	Paper
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs	2005-03-10	Paper
An optimal parallel algorithm to construct a tree 3-spanner on interval graphs	2005-03-07	Paper
An optimal PRAM algorithm for a spanning tree on trapezoid graphs.	2004-06-22	Paper
Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs	2004-03-15	Paper
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs	2004-03-08	Paper
An efficient algorithm for finding all hinge vertices on trapezoid graphs	2003-08-26	Paper
An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs	2003-08-06	Paper
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs	2002-12-11	Paper
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs	2002-01-01	Paper
The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs	2001-10-28	Paper
An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs	2001-06-26	Paper
Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.	2001-01-01	Paper
On comparing interval numbers	2000-12-21	Paper
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs	2000-08-24	Paper
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs	2000-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4488442	2000-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q4718828	2000-01-04	Paper
An efficient algorithm to generate all maximal independent sets on trapezoid graphs	1999-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q3800734	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3933623	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3851279	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3874950	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3852818	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4179528	1978-01-01	Paper
Extensions of Fixed Point Theorems of Rhoades and Ciric	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4124005	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4157681	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4157682	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4124006	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4148506	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4197042	1976-01-01	Paper

Research outcomes over time

This page was built for person: Tapan K. Pal