BibTeX records: Tze-Heng Ma

download as .bib file

@article{DBLP:journals/siamcomp/HsuM99,
  author       = {Wen{-}Lian Hsu and
                  Tze{-}Heng Ma},
  title        = {Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs
                  and Interval Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {28},
  number       = {3},
  pages        = {1004--1020},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0097539792224814},
  doi          = {10.1137/S0097539792224814},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HsuM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YuCM98,
  author       = {Chang{-}Wu Yu and
                  Gen{-}Huey Chen and
                  Tze{-}Heng Ma},
  title        = {On the Complexity of the \emph{k}-Chain Subgraph Cover Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {205},
  number       = {1-2},
  pages        = {85--98},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0304-3975(97)00036-4},
  doi          = {10.1016/S0304-3975(97)00036-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YuCM98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/JouCLM96,
  author       = {Min{-}Jen Jou and
                  Gerard J. Chang and
                  Chiang Lin and
                  Tze{-}Heng Ma},
  title        = {A finiteness theorem for maximal independent sets},
  journal      = {Graphs Comb.},
  volume       = {12},
  number       = {1},
  pages        = {321--326},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01858464},
  doi          = {10.1007/BF01858464},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/JouCLM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MaS94,
  author       = {Tze{-}Heng Ma and
                  Jeremy P. Spinrad},
  title        = {An O(n{\({^2}\)}) Algorithm for Undirected Split Decompositon},
  journal      = {J. Algorithms},
  volume       = {16},
  number       = {1},
  pages        = {154--160},
  year         = {1994},
  url          = {https://doi.org/10.1006/jagm.1994.1007},
  doi          = {10.1006/JAGM.1994.1007},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MaS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MaS94a,
  author       = {Tze{-}Heng Ma and
                  Jeremy P. Spinrad},
  title        = {On the 2-Chain Subgraph Cover and Related Problems},
  journal      = {J. Algorithms},
  volume       = {17},
  number       = {2},
  pages        = {251--268},
  year         = {1994},
  url          = {https://doi.org/10.1006/jagm.1994.1034},
  doi          = {10.1006/JAGM.1994.1034},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MaS94a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/HoKMS92,
  author       = {Jan{-}Ming Ho and
                  Ming{-}Tat Ko and
                  Tze{-}Heng Ma and
                  Ting{-}Yi Sung},
  editor       = {Toshihide Ibaraki and
                  Yasuyoshi Inagaki and
                  Kazuo Iwama and
                  Takao Nishizeki and
                  Masafumi Yamashita},
  title        = {Algorithms for Rectilinear Optimal Multicast Tree Problem},
  booktitle    = {Algorithms and Computation, Third International Symposium, {ISAAC}
                  '92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {650},
  pages        = {106--115},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-56279-6\_63},
  doi          = {10.1007/3-540-56279-6\_63},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/HoKMS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isa/HsuM91,
  author       = {Wen{-}Lian Hsu and
                  Tze{-}Heng Ma},
  editor       = {Wen{-}Lian Hsu and
                  Richard C. T. Lee},
  title        = {Substitution Decomposition on Chordal Graphs and Applications},
  booktitle    = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
                  Republic of China, December 16-18, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {557},
  pages        = {52--60},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/3-540-54945-5\_49},
  doi          = {10.1007/3-540-54945-5\_49},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/isa/HsuM91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/MaS91,
  author       = {Tze{-}Heng Ma and
                  Jeremy P. Spinrad},
  editor       = {Alok Aggarwal},
  title        = {An O(n\({}^{\mbox{2}}\)) Time Algorithm for the 2-Chain Cover Problem
                  and Related Problems},
  booktitle    = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
                  Algorithms, 28-30 January 1991, San Francisco, California, {USA}},
  pages        = {363--372},
  publisher    = {{ACM/SIAM}},
  year         = {1991},
  url          = {http://dl.acm.org/citation.cfm?id=127787.127852},
  timestamp    = {Thu, 05 Jul 2018 07:28:55 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/MaS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/MaS90,
  author       = {Tze{-}Heng Ma and
                  Jeremy P. Spinrad},
  editor       = {David S. Johnson},
  title        = {Split Decomposition of Undirected Graphs},
  booktitle    = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  22-24 January 1990, San Francisco, California, {USA}},
  pages        = {252--260},
  publisher    = {{SIAM}},
  year         = {1990},
  url          = {http://dl.acm.org/citation.cfm?id=320176.320205},
  timestamp    = {Thu, 05 Jul 2018 07:28:50 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/MaS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/MaS90,
  author       = {Tze{-}Heng Ma and
                  Jeremy P. Spinrad},
  editor       = {Rolf H. M{\"{o}}hring},
  title        = {Avoiding Matrix Multiplication},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
                  {WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {484},
  pages        = {61--71},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-53832-1\_31},
  doi          = {10.1007/3-540-53832-1\_31},
  timestamp    = {Fri, 17 Jul 2020 16:12:47 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/MaS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.