| Publication | Date of Publication | Type |
|---|
A parallel algorithm for solving the coloring problem on trapezoid graphs
Information Processing Letters | 2016-05-26 | Paper |
Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph
Information Processing Letters | 2013-04-04 | Paper |
| scientific article; zbMATH DE number 5711694 (Why is no real title available?) | 2010-05-25 | Paper |
A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges
Discrete Applied Mathematics | 2010-05-05 | Paper |
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Information Processing Letters | 2010-03-24 | Paper |
| scientific article; zbMATH DE number 1788713 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788725 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1741098 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1511680 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1287894 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1404254 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1398066 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398065 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398079 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398098 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1372665 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322324 (Why is no real title available?) | 1999-11-02 | Paper |
| scientific article; zbMATH DE number 1117869 (Why is no real title available?) | 1998-09-27 | Paper |
| scientific article; zbMATH DE number 1076489 (Why is no real title available?) | 1997-10-20 | Paper |
| scientific article; zbMATH DE number 992410 (Why is no real title available?) | 1997-03-18 | Paper |
A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs
Discrete Applied Mathematics | 1995-08-10 | Paper |
A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
Journal of the Operations Research Society of Japan | 1995-08-01 | Paper |
On the equivalence in complexity among three computation problems on maximum number of edge-disjoint \(s\)-\(t\) paths in a probabilistic graph
Information Processing Letters | 1994-09-25 | Paper |
Edge-disjoint packings of graphs
Discrete Applied Mathematics | 1994-06-08 | Paper |
Deciding whether graph \(G\) has page number one is in NC
Information Processing Letters | 1993-01-04 | Paper |
On the tree packing problem
Discrete Applied Mathematics | 1992-06-28 | Paper |
Chain packing in graphs
Algorithmica | 1991-01-01 | Paper |
