| 2010 | ||
|---|---|---|
| j12 | Shao Chin Sung, Dinko Dimitrov: Computational complexity in additive hedonic games. European Journal of Operational Research 203(3): 635-639 (2010) | |
| 2007 | ||
| j11 | Dinko Dimitrov, Shao Chin Sung, Yongsheng Xu: Procedural group identification. Mathematical Social Sciences 54(2): 137-146 (2007) | |
| j10 | Shao Chin Sung, Dinko Dimitrov: On core membership testing for hedonic coalition formation games. Oper. Res. Lett. 35(2): 155-158 (2007) | |
| 2006 | ||
| j9 | Dinko Dimitrov, Peter Borm, Ruud Hendrickx, Shao Chin Sung: Simple Priorities and Core Stability in Hedonic Games. Social Choice and Welfare 26(2): 421-433 (2006) | |
| 2005 | ||
| j8 | Ondrej Cepek, Shao Chin Sung: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & OR 32: 3265-3271 (2005) | |
| j7 | Shao Chin Sung, Milan Vlach: Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. J. Scheduling 8(5): 453-460 (2005) | |
| 2004 | ||
| j6 | Shao Chin Sung, Keisuke Tanaka: Limiting negations in bounded-depth circuits: An extension of Markov's theorem. Inf. Process. Lett. 90(1): 15-20 (2004) | |
| j5 | Shao Chin Sung, Milan Vlach: Competitive envy-free division. Social Choice and Welfare 23(1): 103-111 (2004) | |
| 2003 | ||
| j4 | Takashi Mihara, Shao Chin Sung: Deterministic polynomial-time quantum algorithms for Simon's problem. Computational Complexity 12(3-4): 162-175 (2003) | |
| j3 | Kanesan Muthusamy, Shao Chin Sung, Milan Vlach, Hiroaki Ishii: Scheduling with fuzzy delays and fuzzy precedences. Fuzzy Sets and Systems 134(3): 387-395 (2003) | |
| j2 | Shao Chin Sung, Milan Vlach: Single machine scheduling to minimize the number of late jobs under uncertainty. Fuzzy Sets and Systems 139(2): 421-430 (2003) | |
| c3 | Shao Chin Sung, Keisuke Tanaka: Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. ISAAC 2003: 108-116 | |
| 2002 | ||
| j1 | Shao Chin Sung, Keisuke Tanaka: An exponential gap with the removal of one negation gate. Inf. Process. Lett. 82(3): 155-157 (2002) | |
| 2000 | ||
| c2 | ||
| 1998 | ||
| c1 | Takashi Mihara, Shao Chin Sung: A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. ISAAC 1998: 229-236 | |
| 1 | Hideaki Abe | |
| 2 | Peter Borm | |
| 3 | Ondrej Cepek | |
| 4 | Dinko Dimitrov | |
| 5 | Ruud Hendrickx | |
| 6 | Hiroaki Ishii | |
| 7 | Takashi Mihara | |
| 8 | Kanesan Muthusamy | |
| 9 | Keisuke Tanaka | |
| 10 | Milan Vlach | |
| 11 | Yongsheng Xu |
Colors in the list of coauthors
Last update Mon May 20 01:31:38 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page