Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Panda, B.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
B.S. Panda
,
S. Paul
,
D. Pradhan
Theoretical Computer Science
573
, 2015, pp. 26-42
A linear time algorithm for liar's domination problem in proper interval graphs
B.S. Panda
,
S. Paul
Information Processing Letters
113
(19-21), 2013, pp. 815-822
Complexity of distance paired-domination problem in graphs
Gerard J. Chang
,
B.S. Panda
,
D. Pradhan
Theoretical Computer Science
459
, 2012, pp. 89-99
L(2, 1)
-labeling of dually chordal graphs and strongly orderable graphs
B.S. Panda
,
Preeti Goel
Information Processing Letters
112
(13), 2012, pp. 552-556
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
B.S. Panda
,
D. Pradhan
Information Processing Letters
110
(23), 2010, pp. 1067-1073
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
B.S. Panda
,
Sajal K. Das
Information Processing Letters
109
(18), 2009, pp. 1041-1046
On tree 3-spanners in directed path graphs
B.S. Panda
,
Anita Das
Networks
50
(3), 2007, pp. 203-210
Parallel recognition algorithms for chordal\_planar graphs and planar
k
-trees
B.S. Panda
,
Sajal K. Das
Journal Parallel Distributed Computing
65
(8), 2005, pp. 922-926
A linear time recognition algorithm for proper interval graphs
B.S. Panda
,
Sajal K. Das
Information Processing Letters
87
(3), 2003, pp. 153-161
Parallel algorithms for Hamiltonian 2-separator chordal graphs
B.S. Panda
,
Vijay Natarajan
,
S.K. Das
Parallel Processing Letters
12
(1), 2002, pp. 51-64
The separator theorem for rooted directed vertex graphs
B.S. Panda
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 156-162
New linear time algorithms for generating perfect elimination orderings of chordal graphs
B.S. Panda
Information Processing Letters
58
(3), 1996, pp. 111-115
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
B.S. Panda
,
S.P. Mohanty
Information Processing Letters
49
, 1994, pp. 139-143