| Publication | Date of Publication | Type |
|---|
Diametral path graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Complexity of diameter on AT-free graphs is linear
| 2022-08-31 | Paper |
Consecutive retrieval property -- revisited
Information Processing Letters | 2016-06-16 | Paper |
An approximation algorithm for clustering graphs with dominating diametral path
Information Processing Letters | 2016-06-01 | Paper |
Scheduling real-time divisible loads with advance reservations
Real-Time Systems | 2012-07-30 | Paper |
Real-time scheduling of divisible loads in cluster computing environments
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Decomposition tree and indecomposable coverings
Discussiones Mathematicae Graph Theory | 2011-10-05 | Paper |
Partially critical indecomposable graphs
| 2010-05-05 | Paper |
Dealing with Missing Data: Algorithms Based on Fuzzy Set and Rough Set Theories
Transactions on Rough Sets IV | 2008-03-18 | Paper |
SARM — Succinct Association Rule Mining: An Approach to Enhance Association Mining
Lecture Notes in Computer Science | 2008-03-17 | Paper |
Discovering Partial Periodic Sequential Association Rules with Time Lag in Multiple Sequences for Prediction
Lecture Notes in Computer Science | 2008-03-17 | Paper |
scientific article; zbMATH DE number 5194763 (Why is no real title available?)
| 2007-09-24 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Rough Sets and Current Trends in Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Rough Sets and Current Trends in Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 2209405 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2190098 (Why is no real title available?)
| 2005-08-01 | Paper |
Monotone concepts for formal concept analysis
Discrete Applied Mathematics | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2113958 (Why is no real title available?)
| 2004-11-05 | Paper |
scientific article; zbMATH DE number 2089468 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1983151 (Why is no real title available?)
| 2003-09-18 | Paper |
Routing in sparse splitting optical networks with multicast traffic.
Computer Networks | 2003-08-07 | Paper |
scientific article; zbMATH DE number 1931895 (Why is no real title available?)
| 2003-06-20 | Paper |
Dominating Pair Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Concept based retrieval using generalized retrieval functions
Fundamenta Informaticae | 2002-02-28 | Paper |
Concept approximations based on rough sets and similarity measures
International Journal of Applied Mathematics and Computer Science | 2002-02-19 | Paper |
scientific article; zbMATH DE number 1696733 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1696735 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1696739 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1440080 (Why is no real title available?)
| 2000-05-07 | Paper |
scientific article; zbMATH DE number 1414315 (Why is no real title available?)
| 2000-03-16 | Paper |
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Discrete Applied Mathematics | 2000-01-17 | Paper |
scientific article; zbMATH DE number 1308950 (Why is no real title available?)
| 1999-12-05 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
1-tough cocomparability graphs are hamiltonian
Discrete Mathematics | 1997-08-10 | Paper |
Algorithms for the boundary selection problem
Algorithmica | 1997-06-30 | Paper |
scientific article; zbMATH DE number 975401 (Why is no real title available?)
| 1997-05-19 | Paper |
scientific article; zbMATH DE number 975397 (Why is no real title available?)
| 1997-03-09 | Paper |
scientific article; zbMATH DE number 969102 (Why is no real title available?)
| 1997-01-22 | Paper |
scientific article; zbMATH DE number 861416 (Why is no real title available?)
| 1996-09-29 | Paper |
scientific article; zbMATH DE number 842876 (Why is no real title available?)
| 1996-06-05 | Paper |
scientific article; zbMATH DE number 718663 (Why is no real title available?)
| 1995-07-11 | Paper |
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
SIAM Journal on Computing | 1994-08-14 | Paper |
scientific article; zbMATH DE number 436083 (Why is no real title available?)
| 1993-11-11 | Paper |
Hamiltonian cycle is polynomial on cocomparability graphs
Discrete Applied Mathematics | 1993-01-17 | Paper |
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
Order | 1993-01-16 | Paper |
scientific article; zbMATH DE number 4131663 (Why is no real title available?)
| 1990-01-01 | Paper |
Path Problems in Structured Graphs
The Computer Journal | 1986-01-01 | Paper |
Organization of clustered files for consecutive retrieval
ACM Transactions on Database Systems | 1984-01-01 | Paper |
On Scheduling with Ready Times to Minimize Mean Flow Time
The Computer Journal | 1983-01-01 | Paper |
