default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChien-Chung Huang 0001
Person information
- affiliation: ENS Paris, Department of Computer Science, Paris, France
- affiliation (former): Chalmers University of Technology, Gothenburg, Sweden
- affiliation (former): Humboldt University of Berlin, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (PhD): Dartmouth College, Department of Computer Science, Hanover, NH, USA
Other persons with the same name
- Chien-Chung Huang (aka: Chien Chung Huang) — disambiguation page
- Chien-Chung Huang 0002 (aka: Chien Chung Huang 0002) — United Microelectronics Corporation (UMC), Advanced Technology Development Division, Tainan City, Taiwan
- Chien-Chung Huang 0003 (aka: Chien-Chung (Edward) Huang) — George Mason University, Fairfax, VA, USA (and 1 more)
- Chien-Chung Huang 0004 — Academia Sinica, Institute of Information Science, Taipei, Taiwan
- Chien-Chung Huang 0005 — Tunghai University, Department of Computer Science, Taichung, Taiwan (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Chien-Chung Huang, François Sellier
:
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints. Algorithmica 86(11): 3598-3628 (2024)- [c44]Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai:
An FPTAS for Connectivity Interdiction. IPCO 2024: 210-223 - [c43]Chien-Chung Huang, François Sellier:
Robust Sparsification for Matroid Intersection with Applications. SODA 2024: 2916-2940 - 2023
- [j26]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. 70(4): 1266-1291 (2023) - [j25]Chien-Chung Huang, Justin Ward:
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective. SIAM J. Discret. Math. 37(2): 1053-1078 (2023) - [j24]Chien-Chung Huang, François Sellier:
Matroid-constrained vertex cover. Theor. Comput. Sci. 965: 113977 (2023) - [i18]Chien-Chung Huang, François Sellier:
Matroid-Constrained Vertex Cover. CoRR abs/2306.04342 (2023) - [i17]Chien-Chung Huang, François Sellier:
Robust Sparsification for Matroid Intersection with Applications. CoRR abs/2310.16827 (2023) - 2022
- [j23]Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang:
Vizing's and Shannon's Theorems for Defective Edge Colouring. Electron. J. Comb. 29(4) (2022) - [j22]Chien-Chung Huang, Naonori Kakimura:
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. Theory Comput. Syst. 66(1): 354-394 (2022) - [j21]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. SIAM J. Discret. Math. 36(1): 355-382 (2022) - [c42]Chien-Chung Huang, François Sellier:
Maximum Weight b-Matchings in Random-Order Streams. ESA 2022: 68:1-68:14 - [c41]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP 2022: 37:1-37:20 - [c40]Chien-Chung Huang, François Sellier:
Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms. SWAT 2022: 27:1-27:15 - [i16]Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang:
Vizing's and Shannon's Theorems for defective edge colouring. CoRR abs/2201.11548 (2022) - [i15]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR abs/2205.14978 (2022) - [i14]Chien-Chung Huang, François Sellier:
Maximum Weight b-Matchings in Random-Order Streams. CoRR abs/2207.03863 (2022) - 2021
- [j20]Chien-Chung Huang, Naonori Kakimura:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. Algorithmica 83(3): 879-902 (2021) - [j19]Chien-Chung Huang, Telikepalli Kavitha:
Popularity, Mixed Matchings, and Self-Duality. Math. Oper. Res. 46(2): 405-427 (2021) - [j18]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. 35(2): 752-769 (2021) - [c39]Chien-Chung Huang, François Sellier:
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint. APPROX-RANDOM 2021: 14:1-14:18 - [c38]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP 2021: 80:1-80:18 - [i13]Chien-Chung Huang, Theophile Thiery, Justin Ward:
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. CoRR abs/2102.09679 (2021) - [i12]Chien-Chung Huang, François Sellier:
Semi-Streaming Algorithms for Submodular Function Maximization under $b$-Matching Constraint. CoRR abs/2107.13071 (2021) - 2020
- [j17]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Algorithmica 82(4): 1006-1032 (2020) - [c37]Chien-Chung Huang, Theophile Thiery, Justin Ward:
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. APPROX-RANDOM 2020: 62:1-62:19 - [i11]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR abs/2001.01715 (2020) - [i10]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. CoRR abs/2002.05477 (2020) - [i9]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen:
Approximating maximum integral multiflows on bounded genus graphs. CoRR abs/2005.00575 (2020) - [i8]Chien-Chung Huang, Justin Ward:
FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives. CoRR abs/2011.06268 (2020)
2010 – 2019
- 2019
- [b1]Chien-Chung Huang:
Graph Matching, Matroid Intersection, and Beyond. (Couplage, L'Intersection de Matroïdes, et Au-Delà). ENS, Paris, France, 2019 - [j16]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State. Algorithmica 81(9): 3725-3745 (2019) - [j15]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177(1-2): 85-112 (2019) - [c36]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa:
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM 2019: 32:1-32:21 - [c35]Chien-Chung Huang, Naonori Kakimura:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. WADS 2019: 438-451 - 2018
- [i7]Chien-Chung Huang, Naonori Kakimura:
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. CoRR abs/1802.06212 (2018) - 2017
- [j14]Chien-Chung Huang, Telikepalli Kavitha:
New Algorithms for Maximum Weight Matching and a Decomposition Theorem. Math. Oper. Res. 42(2): 411-426 (2017) - [j13]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. 31(4): 2348-2377 (2017) - [c34]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM 2017: 11:1-11:14 - [c33]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. FOCS 2017: 168-179 - [c32]Chien-Chung Huang, Telikepalli Kavitha:
Popularity, Mixed Matchings, and Self-duality. SODA 2017: 2294-2310 - [i6]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. CoRR abs/1708.03903 (2017) - 2016
- [j12]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. Algorithmica 74(3): 1184-1203 (2016) - [c31]Chien-Chung Huang, Sebastian Ott:
A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges. ESA 2016: 49:1-49:15 - [c30]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA 2016: 430-444 - [c29]Chien-Chung Huang, Prasad Jayanti:
Priority Mutual Exclusion: Specification and Algorithm. DISC 2016: 385-398 - [r1]Chien-Chung Huang:
Hospitals/Residents Problems with Quota Lower Bounds. Encyclopedia of Algorithms 2016: 930-932 - [i5]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings with two-sided preferences and one-sided ties. CoRR abs/1603.07168 (2016) - 2015
- [j11]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games. Math. Oper. Res. 40(3): 634-654 (2015) - [j10]Chien-Chung Huang, Telikepalli Kavitha:
Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154(1-2): 353-380 (2015) - [j9]Fidaa Abed, Chien-Chung Huang:
Coordinating oligopolistic players in unrelated machine scheduling. Theor. Comput. Sci. 570: 40-54 (2015) - [c28]Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. APPROX-RANDOM 2015: 361-380 - [c27]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) 2015: 367-379 - [c26]Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner:
Maintaining Near-Popular Matchings. ICALP (2) 2015: 504-515 - [c25]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. SODA 2015: 1102-1113 - [i4]Chien-Chung Huang, Sebastian Ott:
A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges. CoRR abs/1507.07396 (2015) - 2014
- [c24]Fidaa Abed, José R. Correa, Chien-Chung Huang:
Optimal Coordination Mechanisms for Multi-job Scheduling Games. ESA 2014: 13-24 - [c23]Chien-Chung Huang, Telikepalli Kavitha:
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. IPCO 2014: 297-308 - [c22]Chien-Chung Huang, Sebastian Ott:
New Results for Non-Preemptive Speed Scaling. MFCS (2) 2014: 360-371 - [i3]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. CoRR abs/1407.0892 (2014) - 2013
- [j8]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013) - [j7]Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. Algorithmica 66(1): 187-210 (2013) - [j6]Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings in the stable marriage problem. Inf. Comput. 222: 180-194 (2013) - [j5]Chien-Chung Huang:
Collusion in Atomic Splittable Routing Games. Theory Comput. Syst. 52(4): 763-801 (2013) - [j4]Antonios Antoniadis, Chien-Chung Huang:
Non-preemptive speed scaling. J. Sched. 16(4): 385-394 (2013) - [j3]Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. SIAM J. Discret. Math. 27(1): 43-62 (2013) - [c21]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. FSTTCS 2013: 339-350 - [c20]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae:
How to Pack Your Items When You Have to Buy Your Knapsack. MFCS 2013: 62-73 - 2012
- [c19]Fidaa Abed, Chien-Chung Huang:
Preemptive Coordination Mechanisms for Unrelated Machines. ESA 2012: 12-23 - [c18]Chien-Chung Huang, Telikepalli Kavitha:
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. SODA 2012: 1400-1412 - [c17]Antonios Antoniadis, Chien-Chung Huang:
Non-preemptive Speed Scaling. SWAT 2012: 249-260 - 2011
- [j2]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings. Algorithmica 61(3): 738-757 (2011) - [c16]Florin Constantin, Malvika Rao, Chien-Chung Huang, David C. Parkes:
On Expressing Value Externalities in Position Auctions. AAAI 2011: 644-649 - [c15]Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. ESA 2011: 167-179 - [c14]Chien-Chung Huang:
Collusion in Atomic Splittable Routing Games. ICALP (2) 2011: 564-575 - [c13]Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings in the Stable Marriage Problem. ICALP (1) 2011: 666-677 - [c12]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226 - 2010
- [j1]Chien-Chung Huang:
Circular Stable Matching and 3-way Kidney Transplant. Algorithmica 58(1): 137-150 (2010) - [c11]Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang:
The Price of Collusion in Series-Parallel Networks. IPCO 2010: 313-326 - [c10]Vibhor Bhatt, Chien-Chung Huang:
Group mutual exclusion in O(log n) RMR. PODC 2010: 45-54 - [c9]Chien-Chung Huang:
Classified Stable Matching. SODA 2010: 1235-1253 - [i2]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. CoRR abs/1006.2063 (2010)
2000 – 2009
- 2009
- [c8]Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. FSTTCS 2009: 227-238 - [c7]Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang:
Equilibria of atomic flow games are not unique. SODA 2009: 748-757 - [i1]Chien-Chung Huang:
Classified Stable Matching. CoRR abs/0907.1779 (2009) - 2008
- [c6]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings. SWAT 2008: 127-137 - 2007
- [c5]Chien-Chung Huang:
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems. ESA 2007: 558-569 - [c4]Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Using Nash Implementation to Achieve Better Frugality Ratios. ISAAC 2007: 377-389 - [c3]Chien-Chung Huang:
Cheating to Get Better Roommates in a Random Stable Matching. STACS 2007: 453-464 - 2006
- [c2]Chien-Chung Huang:
Cheating by Men in the Gale-Shapley Stable Matching Algorithm. ESA 2006: 418-431 - 2005
- [c1]Chien-Chung Huang, Kuan-Ming Lin, Lee-Feng Chien:
Automatic Training Corpora Acquisition through Web Mining. Web Intelligence 2005: 193-199
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
