| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Jitender S. Deogun 48 Sherri K. Harms , Jitender S. Deogun, Tsegaye Tadesse : Discovering Sequential Association Rules with Constraints and Time Lags in Multiple Sequences. ISMIS 2002 : 432-441 47 Sherri K. Harms , Jitender S. Deogun, Jamil Saquer , Tsegaye Tadesse : Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. ICDM 2001 : 603-606 46 Ali H. Alsaffar , Jitender S. Deogun, Hayri Sever : Optimal Queries in Information Filtering. ISMIS 2000 : 435-443 45 Minkoo Kim , Ali H. Alsaffar , Jitender S. Deogun, Vijay V. Raghavan : On Modeling of Concept Based Retrieval in Generalized Vector Spaces. ISMIS 2000 : 453-462 44 Jamil Saquer , Jitender S. Deogun: Using Closed Itemsets for Discovering Representative Association Rules. ISMIS 2000 : 495-504 43 Min Ouyang , Michel Toulouse , Krishnaiyan Thulasiraman , Fred Glover , Jitender S. Deogun: Multilevel cooperative search: application to the circuit/hypergraph partitioning problem. ISPD 2000 : 192-198 42 Maher Ali , Jitender S. Deogun: Optical QoS in Multicast Wavelength-Routed Networks. LCN 2000 : 497- 41 Jamil Saquer , Jitender S. Deogun: A Fuzzy Approach for Approximating Formal Concepts. Rough Sets and Current Trends in Computing 2000 : 269-276 40 Maher Ali , Byrav Ramamurthy , Jitender S. Deogun: Routing and wavelength assignment with power considerations in optical networks. Computer Networks 32 (5): 539-555 (2000) 39 Ali H. Alsaffar , Jitender S. Deogun, Vijay V. Raghavan , Hayri Sever : Enhancing Concept-Based Retrieval Based on Minimal Term Sets. JIIS 14 (2-3): 155-173 (2000) 38 Aladdin Hafez , Jitender S. Deogun, Vijay V. Raghavan : The Item-Set Tree: A Data Structure for Data Mining. DaWaK 1999 : 183-192 37 Ali H. Alsaffar , Jitender S. Deogun, Vijay V. Raghavan , Hayri Sever : Concept Based Retrieval by Minimal Term Sets. ISMIS 1999 : 114-122 36 Jamil Saquer , Jitender S. Deogun: Formal Rough Concept Analysis. RSFDGrC 1999 : 91-99 35 Jitender S. Deogun, K. Gopalakrishnan : Consecutive Retrieval Property-Revisited. Information Processing Letters 69 (1): 15-20 (1999) 34 Jitender S. Deogun, Hayri Sever , Vijay V. Raghavan : Structural Abstractions of Hypertext Documents for Web-Based Retrieval. DEXA Workshop 1998 : 385-390 33 Vijay V. Raghavan , Jitender S. Deogun, Hayri Sever : Introduction (Special Topic Issue: Knowledge Discovery and Data Mining). JASIS 49 (5): 397-402 (1998) 32 Jitender S. Deogun, Suresh K. Choubey , Vijay V. Raghavan , Hayri Sever : Feature Selection and Effective Classifiers. JASIS 49 (5): 423-434 (1998) 31 Jitender S. Deogun, Roger M. Kieckhafer , A. W. Krings : Stability and Performance of List Scheduling With External Process Delays. Real-Time Systems 15 (1): 5-38 (1998) 30 Hans L. Bodlaender , Jitender S. Deogun, Klaus Jansen , Ton Kloks , Dieter Kratsch , Haiko Müller , Zsolt Tuza : Rankings of Graphs. SIAM Journal on Discrete Mathematics 11 (1): 168-181 (1998) 29 Jay N. Bhuyan , Jitender S. Deogun, Vijay V. Raghavan : Algorithms for the Boundary Selection Problem. Algorithmica 17 (2): 133-161 (1997) 28 Jitender S. Deogun, Dieter Kratsch , George Steiner : An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Information Processing Letters 61 (3): 121-127 (1997) 27 Jitender S. Deogun, Vijay V. Raghavan , Hayri Sever : Exploiting Upper Approximation in the Rough Set Methodology. KDD 1995 : 69-74 26 Jitender S. Deogun, Dieter Kratsch : Diametral Path Graphs. WG 1995 : 344-357 25 Sanjiv K. Bhatia , Jitender S. Deogun, Vijay V. Raghavan : Conceptual Query Formulation and Retrieval. JIIS 5 (3): 183-209 (1995) 24 Sibabrata Ray , Hong Jiang , Jitender S. Deogun: A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors. SAC 1994 : 473-477 23 Jitender S. Deogun, Ton Kloks , Dieter Kratsch , Haiko Müller : On Vertex Ranking for Permutations and Other Graphs. STACS 1994 : 747-758 22 Jitender S. Deogun, George Steiner : Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. SIAM J. Comput. 23 (3): 520-552 (1994) 21 Sanjiv K. Bhatia , Jitender S. Deogun: Cluster Characterization in Information Retrieval. SAC 1993 : 721-728 20 Jitender S. Deogun, George Steiner : Hamiltonian Cycle is Polynomial on Cocomparability Graphs. Discrete Applied Mathematics 39 (2): 165-172 (1992) 19 Sanjiv K. Bhatia , Jitender S. Deogun, Vijay V. Raghavan : User Profiles for Information Retrieval. ISMIS 1991 : 102-111 18 Sanjiv K. Bhatia , Jitender S. Deogun, Vijay V. Raghavan : Query Formulation Through Knowledge Acquisition. ML 1991 : 250-254 17 Yong Zhang , Vijay V. Raghavan , Jitender S. Deogun: An Object-Oriented Modelling of the History of Optimal Retrievals. SIGIR 1991 : 241-250 16 Massimo Ancona , Leila De Floriani , Jitender S. Deogun: Structured Spanning Trees. The Computer Journal 33 (4): 344-355 (1990) 15 Naveed A. Sherwani , Jitender S. Deogun: A New Heuristic for Single Row Routing Problems. DAC 1989 : 167-172 14 Elisabetta Bruzzone , Leila De Floriani , Jitender S. Deogun, Massimo Ancona , Kunwarjit S. Bagga : Structured Graph Models: An Efficient Tool for VLSI Desgin. Great Lakes Computer Science Conference 1989 : 307-312 13 Sanjiv K. Bhatia , Jitender S. Deogun, Vijay V. Raghavan : Formation of Categories in Document Classification Systems. Great Lakes Computer Science Conference 1989 : 91-97 12 Jay N. Bhuyan , Jitender S. Deogun, Vijay V. Raghavan : Near-Optimal Algorithms for the Boundary Selection Problem in User-Oriented Information Retrieval. IFIP Congress 1989 : 275-280 11 Z. Fang , Jitender S. Deogun: Closure Properties of Certain Classes of Languages Under Generalized Morphic Replication. The Computer Journal 31 (4): 325-329 (1988) 10 Vijay V. Raghavan , Jitender S. Deogun: Optimal Determination of User-Oriented Clusters. SIGIR 1987 : 140-146 9 Jitender S. Deogun, M. C. Kong : On Periodic Scheduling of Time-Critical Tasks. IFIP Congress 1986 : 791-796 8 Jitender S. Deogun, Vijay V. Raghavan : User-Oriented Document Clustering: A Framework for Learning in Information Retrieval. SIGIR 1986 : 157-163 7 Massimo Ancona , Leila De Floriani , Jitender S. Deogun: Path Problems in Structured Graphs. The Computer Journal 29 (6): 553-563 (1986) 6 Prakash V. Ramanan , Jitender S. Deogun, C. L. Liu : A Personnel Assignment Problem. J. Algorithms 5 (1): 132-144 (1984) 5 Jitender S. Deogun, Vijay V. Raghavan , Thomas K. W. Tsou : Organization of Clustered Files for Consecutive Retrieval. TODS 9 (4): 646-671 (1984) 4 Thomas K. W. Tsuo , Lawrence V. Saxton , Vijay V. Raghavan , Jitender S. Deogun: Consecutive Retrieval with Redundancy Organization of Clustered Files. IFIP Congress 1983 : 533-537 3 Jitender S. Deogun: On Scheduling with Ready Times to Minimize Mean Flow Time. The Computer Journal 26 (4): 320-328 (1983) 2 Jitender S. Deogun, Vijay V. Raghavan : Query Directed Partitioning Scheme for Securing Statistical Databases. SSDBM 1981 : 285-293 1 M. I. Dessouky , Jitender S. Deogun: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time. SIAM J. Comput. 10 (1): 192-202 (1981)  DiSC'02 © 2003 Association for Computing Machinery |
