List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On-line recognition of interval graphs in O(m+n n) time | 2024-07-05 | Paper |
| PC-trees vs. PQ-trees Lecture Notes in Computer Science | 2002-11-04 | Paper |
| A Simple Test for the Consecutive Ones Property Journal of Algorithms | 2002-09-30 | Paper |
| A new planarity test Theoretical Computer Science | 2000-01-12 | Paper |
| Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs SIAM Journal on Computing | 1999-02-22 | Paper |
| An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs SIAM Journal on Computing | 1993-03-09 | Paper |
| Decomposition of perfect graphs Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3902680 (Why is no real title available?) | 1984-01-01 | Paper |
Research outcomes over time
This page was built for person: Wenlian Hsu
