Algorithms and computation. 4th international symposium, ISAAC '93, Hong Kong, December 15--17, 1993. Proceedings (Q1311466)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms and computation. 4th international symposium, ISAAC '93, Hong Kong, December 15--17, 1993. Proceedings
scientific article

    Statements

    Algorithms and computation. 4th international symposium, ISAAC '93, Hong Kong, December 15--17, 1993. Proceedings (English)
    0 references
    0 references
    21 December 1993
    0 references
    The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Das, Gautam; Heffernan, Paul J.}, Constructing degree-3 spanners with other sparseness properties, 11-20 [Zbl 0925.05037] \textit{Fürer, Martin; Subramanian, C. R.; Veni Madhavan, C. E.}, Coloring random graphs in polynomial expected time, 31-37 [Zbl 0925.05047] \textit{Asano, Takao}, Graphical degree sequence problems with connectivity requirements, 38-47 [Zbl 0925.05040] \textit{Dessmark, Anders; Jansen, Klaus; Lingas, Andrzej}, The maximum \(k\)-dependent and \(f\)-dependent set problem, 88-97 [Zbl 0925.05062] \textit{Kloks, T.}, Treewidth of circle graphs, 108-117 [Zbl 0925.05063] \textit{Srivastav, Anand; Stangier, Peter}, On quadratic lattice approximations, 176-184 [Zbl 0925.68216] \textit{Fujito, Toshihiro}, A 2/3-approximation of the matroid matching problem, 185-190 [Zbl 0925.05026] \textit{Ruskey, Frank}, Simple combinatorial Gray codes constructed by reversing sublists, 201-208 [Zbl 0925.94101] \textit{Leung, Hing}, Separating exponentially ambiguous NFA from polynomially ambiguous NFA, 221-229 [Zbl 0925.68324] \textit{Han, Yenjo; Hemaspaandra, Lane A.; Thierauf, Thomas}, Threshold computation and cryptographic security, 230-239 [Zbl 0925.94095] \textit{Book, Ronald V.}, Relativizing complexity classes with random oracles, 250-258 [Zbl 0925.68182] \textit{Ripphausen-Lipa, Heike; Wagner, Dorothea; Weihe, Karsten}, Linear time algorithms for disjoint two-face patrhs problems in planar graphs, 343-352 [Zbl 0925.05057] \textit{Meinel, Christoph; Waack, Stephan}, Separating complexity classes related to bounded alternating \(\omega\)-branching programs, 379-388 [Zbl 0925.68185] \textit{Tani, Seiichiro; Hamaguchi, Kiyoharu; Yajima, Shuzo}, The complexity of the optimal variable ordering problems of shared binary decision diagrams, 389-398 [Zbl 0925.68198] \textit{Kavvdias, Dimitris; Papadimitriou, Christos; Sideri, Martha}, On Horn envelopes and hypergraph transversals. (Extended abstract), 399-405 [Zbl 0925.03036] \textit{Aggarwal, Alok; Tokuyama, Takeshi}, Consecutive interval query and dynamic programming on intervals, 466-475 [Zbl 0925.90374] \textit{Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide}, Vehicle scheduling on a tree with release and handling times, 486-495 [Zbl 0925.90223] \textit{Chang, Gerard J.; Pandu Rangan, C.; Coorg, Satyan R.}, Weighted independent perfect domination on cocomparability graphs, 506-514 [Zbl 0925.05044]
    0 references
    0 references
    Hong Kong (HK)
    0 references
    Symposium
    0 references
    Proceedings
    0 references
    ISAAC '93
    0 references
    Algorithms
    0 references
    Computation
    0 references
    0 references