Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: F. H. Chang
@article{DBLP:journals/dam/ChangFHL09, author = {F. H. Chang and Hung{-}Lin Fu and Frank K. Hwang and B. C. Lin}, title = {The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks}, journal = {Discret. Appl. Math.}, volume = {157}, number = {1}, pages = {164--169}, year = {2009}, url = {https://doi.org/10.1016/j.dam.2008.05.006}, doi = {10.1016/J.DAM.2008.05.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChangFHL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChangGHL07, author = {F. H. Chang and J. Y. Guo and Frank K. Hwang and J. S. Lee}, title = {Counting disjoint 2-partitions for points in the plane}, journal = {Discret. Appl. Math.}, volume = {155}, number = {16}, pages = {2087--2092}, year = {2007}, url = {https://doi.org/10.1016/j.dam.2007.05.012}, doi = {10.1016/J.DAM.2007.05.012}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChangGHL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HwangC07, author = {Frank K. Hwang and F. H. Chang}, title = {The identification of positive clones in a general inhibitor model}, journal = {J. Comput. Syst. Sci.}, volume = {73}, number = {7}, pages = {1090--1094}, year = {2007}, url = {https://doi.org/10.1016/j.jcss.2007.03.005}, doi = {10.1016/J.JCSS.2007.03.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HwangC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChangCGHR06, author = {F. H. Chang and H. B. Chen and J. Y. Guo and Frank K. Hwang and Uriel G. Rothblum}, title = {One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions}, journal = {J. Comb. Optim.}, volume = {11}, number = {3}, pages = {321--339}, year = {2006}, url = {https://doi.org/10.1007/s10878-006-7911-5}, doi = {10.1007/S10878-006-7911-5}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChangCGHR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChangGH06, author = {F. H. Chang and J. Y. Guo and Frank K. Hwang}, title = {Wide-sense nonblocking for multi-log\({}_{\mbox{d}}\)N networks under various routing strategies}, journal = {Theor. Comput. Sci.}, volume = {352}, number = {1-3}, pages = {232--239}, year = {2006}, url = {https://doi.org/10.1016/j.tcs.2005.10.048}, doi = {10.1016/J.TCS.2005.10.048}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChangGH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/ChangH05, author = {F. H. Chang and Frank K. Hwang}, title = {Supermodularity in Mean-Partition Problems}, journal = {J. Glob. Optim.}, volume = {33}, number = {3}, pages = {337--347}, year = {2005}, url = {https://doi.org/10.1007/s10898-004-7391-z}, doi = {10.1007/S10898-004-7391-Z}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/ChangH05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChangGHL04, author = {F. H. Chang and J. Y. Guo and Frank K. Hwang and C. K. Lin}, title = {Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies}, journal = {Theor. Comput. Sci.}, volume = {314}, number = {3}, pages = {375--386}, year = {2004}, url = {https://doi.org/10.1016/j.tcs.2003.12.021}, doi = {10.1016/J.TCS.2003.12.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChangGHL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.