Jitender S. Deogun

Available identifiers

zbMath Open deogun.jitender-sWikidataQ102303088 ScholiaQ102303088MaRDI QIDQ290197

List of research outcomes

Publication	Date of Publication	Type
Diametral path graphs	2024-02-28	Paper
Rankings of graphs	2024-01-05	Paper
Complexity of diameter on AT-free graphs is linear	2022-08-31	Paper
Consecutive retrieval property -- revisited	2016-06-16	Paper
An approximation algorithm for clustering graphs with dominating diametral path	2016-06-01	Paper
Scheduling real-time divisible loads with advance reservations	2012-07-30	Paper
Real-time scheduling of divisible loads in cluster computing environments	2012-03-07	Paper
Decomposition tree and indecomposable coverings	2011-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q3558631	2010-05-05	Paper
Dealing with Missing Data: Algorithms Based on Fuzzy Set and Rough Set Theories	2008-03-18	Paper
SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining	2008-03-17	Paper
Discovering Partial Periodic Sequential Association Rules with Time Lag in Multiple Sequences for Prediction	2008-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q3592867	2007-09-24	Paper
Rough Sets and Current Trends in Computing	2006-11-01	Paper
Rough Sets and Current Trends in Computing	2006-11-01	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing	2006-06-27	Paper
Computing and Combinatorics	2006-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q5692370	2005-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5462155	2005-08-01	Paper
Monotone concepts for formal concept analysis	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4825692	2004-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q3046892	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4427038	2003-09-18	Paper
Routing in sparse splitting optical networks with multicast traffic.	2003-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q4709276	2003-06-20	Paper
Dominating Pair Graphs	2003-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q2775880	2002-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q2772802	2002-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q2766971	2002-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q2766976	2002-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q2766982	2002-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q4950071	2000-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q4942652	2000-03-16	Paper
On the vertex ranking problem for trapezoid, circular-arc and other graphs	2000-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4256006	1999-12-05	Paper
Rankings of Graphs	1998-05-11	Paper
1-tough cocomparability graphs are hamiltonian	1997-08-10	Paper
Algorithms for the boundary selection problem	1997-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q5284078	1997-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q5284074	1997-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q5284570	1997-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4871150	1996-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q4862336	1996-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4320674	1995-07-11	Paper
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs	1994-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q3139868	1993-11-11	Paper
Hamiltonian cycle is polynomial on cocomparability graphs	1993-01-17	Paper
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q3033325	1990-01-01	Paper
Path Problems in Structured Graphs	1986-01-01	Paper
Organization of clustered files for consecutive retrieval	1984-01-01	Paper
On Scheduling with Ready Times to Minimize Mean Flow Time	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jitender S. Deogun