Calculated based on number of publications stored in Pure and citations from Scopus
Calculated based on number of publications stored in Pure and citations from Scopus
Calculated based on number of publications stored in Pure and citations from Scopus
20072024

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2020

    A Survey on Capacitated Covering and Related Problems

    Kao, M. J., Feb 2020, Indo - Taiwan 2nd International Conference on Computing, Analytics and Networks, Indo-Taiwan ICAN 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 266-272 7 p. 9181321. (Indo - Taiwan 2nd International Conference on Computing, Analytics and Networks, Indo-Taiwan ICAN 2020 - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2019

    An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity

    Tu, H. L., Kao, M. J. & Lee, D. T., 2019, New Trends in Computer Technologies and Applications - 23rd International Computer Symposium, ICS 2018, Revised Selected Papers. Chang, C-Y., Lin, C-C. & Lin, H-H. (eds.). Springer Verlag, p. 468-475 8 p. (Communications in Computer and Information Science; vol. 1013).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • The Multi-service Location Problems

    Yu, H. I., Kao, M. J. & Lee, D. T., 2019, New Trends in Computer Technologies and Applications - 23rd International Computer Symposium, ICS 2018, Revised Selected Papers. Chang, C-Y., Lin, C-C. & Lin, H-H. (eds.). Springer Verlag, p. 507-515 9 p. (Communications in Computer and Information Science; vol. 1013).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2018

    Approximation algorithm for vertex cover with multiple covering constraints

    Hong, E. & Kao, M. J., 1 Dec 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Liao, C-S., Hsu, W-L. & Lee, D-T. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 43:1-43:11 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations
  • 2017

    Iterative partial rounding for vertex cover with hard capacities

    Kao, M. J., Jan 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 2638-2653 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    9 Scopus citations
  • Tight approximation for partial vertex cover with hard capacities

    Shiau, J. Y., Kao, M. J., Lin, C. C. & Lee, D. T., 1 Dec 2017, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2016

    O(f) bi-approximation for capacitated covering with hard capacities

    Kao, M. J., Tu, H. L. & Lee, D. T., 1 Dec 2016, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S-H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 40.1-40.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 64).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2014

    Online dynamic power management with hard real-time guarantees

    Chen, J. J., Kao, M. J., Lee, D. T., Rutter, I. & Wagner, D., 1 Mar 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 25. p. 226-238 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • 2013

    Optimal time-convex hull under the Lp metrics

    Dai, B. S., Kao, M. J. & Lee, D. T., 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. p. 268-279 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8037 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • 2012

    Competitive design and analysis for machine-minimizing job scheduling problem

    Kao, M. J., Chen, J. J., Rutter, I. & Wagner, D., 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, p. 75-84 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    8 Scopus citations
  • 2011

    Capacitated domination: Constant factor approximations for planar graphs

    Kao, M. J. & Lee, D. T., 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 494-503 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • The density maximization problem in graphs

    Kao, M. J., Katz, B., Krug, M., Lee, D. T., Rutter, I. & Wagner, D., 2011, Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Proceedings. p. 25-36 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6842 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2010

    Approximation algorithms for the capacitated domination problem

    Kao, M. J. & Chen, H. L., 2010, Frontiers in Algorithmics - 4th International Workshop, FAW 2010, Proceedings. p. 185-196 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6213 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • 2007

    Capacitated domination problem

    Kao, M. J. & Liao, C. S., 2007, Algorithms and Computation - 18th International Symposium, ISAAC 2007, Proceedings. Springer Verlag, p. 256-267 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4835 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations