Chien-Chung Huang

Publications (16)
Projects (0)

Showing 16 publications

2017

New algorithms for maximum weight matching and a decomposition theorem

Chien-Chung Huang, T. Kavitha

Mathematics of Operations Research. Vol. 42 (2), p. 411-426

Journal article

2016

Fair Matchings and Related Problems

Chien-Chung Huang, T. Kavitha, K. Mehlhorn et al

Algorithmica. Vol. 74 (3), p. 1184-1203

Journal article

2016

A combinatorial approximation algorithm for graph balancing with light hyper edges

Chien-Chung Huang, S. Ott

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 57

Paper in proceeding

2016

Exact and approximation algorithms for weighted matroid intersection

Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama

27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016; Arlington; United States; 10 January 2016 through 12 January 2016. Vol. 1, p. 430-444

Paper in proceeding

2016

Priority mutual exclusion: Specification and algorithm

Chien-Chung Huang, P. Jayanti

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9888 LNCS, p. 385-398

Paper in proceeding

2015

Improved approximation algorithms for two variants of the stable marriage problem with ties

Chien-Chung Huang, T. Kavitha

Mathematical Programming, Series B. Vol. 154 (1-2), p. 353-380

Journal article

2015

A fully polynomial-time approximation scheme for speed scaling with sleep state

A. Antoniadis, Chien-Chung Huang, S. Ott

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 2015-January (January), p. 1102-

Paper in proceeding

2015

Á. Cseh, Chien-Chung Huang, T. Kavitha

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9134, p. 367-379

Paper in proceeding

2015

A tight approximation bound for the stable marriage problem with restricted ties

Chien-Chung Huang, K. Iwama, S. Miyazaki et al

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 40, p. 361-380

Paper in proceeding

2015

Maintaining Near-Popular Matchings

S. Bhattacharya, M. Hoefer, Chien-Chung Huang et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9135, p. 504-515

Paper in proceeding

2015

On the uniqueness of equilibrium in atomic splittable routing games

U. Bhaskar, L. Fleischer, D. Hoy et al

Mathematics of Operations Research. Vol. 40 (3), p. 634-654

Journal article

2014

New results for non-preemptive speed scaling

Chien-Chung Huang, S. Ott

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8635 LNCS (PART 2), p. 360-371

Paper in proceeding

2014

Optimal coordination mechanisms for multi-job scheduling games

F. Abed, J.R. Correa, Chien-Chung Huang

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8737 LNCS, p. 13-24

Paper in proceeding

2014

An improved approximation algorithm for the stable marriage problem with one-sided ties

Chien-Chung Huang, T. Kavitha

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8494 LNCS, p. 297-308

Paper in proceeding

2013

Fair matchings and related problems

Chien-Chung Huang, T. Kavitha, K. Mehlhorn et al

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 24, p. 339-350

Paper in proceeding

2013

How to pack your items when you have to buy your knapsack

A. Antoniadis, Chien-Chung Huang, S. Ott et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8087 LNCS, p. 62-73

Paper in proceeding

Download publication list

You can download this list to your computer.

Filter and download publication list

As logged in user (Chalmers employee) you find more export functions in MyResearch.

You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:

Zotero Connector
Mendeley Web Importer

The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.

There are no projects.

There might be more projects where Chien-Chung Huang participates, but you have to be logged in as a Chalmers employee to see them.