The following pages link to Jitender Deogun (Q290197):
Displaying 50 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- (Q438192) (redirect page) (← links)
- Scheduling real-time divisible loads with advance reservations (Q438194) (← links)
- Real-time scheduling of divisible loads in cluster computing environments (Q666055) (← links)
- Algorithms for the boundary selection problem (Q675310) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Routing in sparse splitting optical networks with multicast traffic. (Q1398822) (← links)
- Monotone concepts for formal concept analysis (Q1885811) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- (Q2766971) (← links)
- (Q2766976) (← links)
- (Q2766982) (← links)
- Concept approximations based on rough sets and similarity measures (Q2772802) (← links)
- Concept based retrieval using generalized retrieval functions (Q2775880) (← links)
- (Q3033325) (← links)
- (Q3046892) (← links)
- (Q3139868) (← links)
- Decomposition tree and indecomposable coverings (Q3171415) (← links)
- Organization of clustered files for consecutive retrieval (Q3219806) (← links)
- (Q3558631) (← links)
- (Q3592867) (← links)
- On Scheduling with Ready Times to Minimize Mean Flow Time (Q3674053) (← links)
- Path Problems in Structured Graphs (Q3745869) (← links)
- (Q4256006) (← links)
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282) (← links)
- (Q4320674) (← links)
- Rankings of Graphs (Q4388986) (← links)
- (Q4427038) (← links)
- (Q4709276) (← links)
- Dominating Pair Graphs (Q4785689) (← links)
- (Q4825692) (← links)
- (Q4862336) (← links)
- (Q4871150) (← links)
- (Q4942652) (← links)
- (Q4950071) (← links)
- (Q5284074) (← links)
- (Q5284078) (← links)
- (Q5284570) (← links)
- Rough Sets and Current Trends in Computing (Q5394693) (← links)
- Rough Sets and Current Trends in Computing (Q5394740) (← links)
- Dealing with Missing Data: Algorithms Based on Fuzzy Set and Rough Set Theories (Q5449773) (← links)
- SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining (Q5450862) (← links)
- Discovering Partial Periodic Sequential Association Rules with Time Lag in Multiple Sequences for Prediction (Q5450875) (← links)
- (Q5462155) (← links)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (Q5475717) (← links)
- (Q5692370) (← links)
- Computing and Combinatorics (Q5716991) (← links)
