default search action
Chuang-Chieh Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Bo-Hsin Lin, Chuang-Chieh Lin, Chih-Chieh Hung, Chien-Chang Chen, Yu-Hsin Chen:
On the Identifiability of Artificial Financial Time Series. J. Inf. Sci. Eng. 40(3): 567-579 (2024) - [j7]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin
, An-Tzu Teng, Ke-Wei Fu:
Multiagent learning for competitive opinion optimization. Theor. Comput. Sci. 1017: 114787 (2024) - [i3]Yongge Yang, Yu-Ching Lee, Po-An Chen, Chuang-Chieh Lin:
Robustness of Online Proportional Response in Stochastic Online Fisher Markets: a Decentralized Approach. CoRR abs/2406.00160 (2024) - 2023
- [j6]Chuang-Chieh Lin
Group Formation by Group Joining and Opinion Updates Via Multi-Agent Online Gradient Ascent [AI-eXplained]. IEEE Comput. Intell. Mag. 18(4): 60-61 (2023) - [c5]Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. IWOCA 2023: 392-403 - [c4]Chih-Chieh Hung
Air Pollution Source Tracing Framework: Leveraging Microsensors and Wind Analysis for Pollution Source Identification. TAAI (2) 2023: 142-154 - [i2]Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
On the Efficiency of An Election Game of Two or More Parties: How Bad Can It Be? CoRR abs/2303.14405 (2023) - 2022
- [c3]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin
Multiagent Learning for Competitive Opinion Optimization (Extended Abstract). ICS 2022: 61-72 - 2021
- [j5]Chuang-Chieh Lin
How good is a two-party election game? Theor. Comput. Sci. 871: 79-93 (2021) - 2020
- [i1]Chuang-Chieh Lin
How Good Is a Two-Party Election Game? CoRR abs/2001.05692 (2020)
2010 – 2019
- 2018
- [c2]Chuang-Chieh Lin
Efficient Mechanisms for Peer Grading and Dueling Bandits. ACML 2018: 740-755 - 2013
- [j4]Maw-Shang Chang
Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. 113(22-24): 852-857 (2013) - 2011
- [j3]Maw-Shang Chang
A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49(3): 576-587 (2011) - 2010
- [j2]Maw-Shang Chang
An improved algorithm for the red-blue hitting set problem with the consecutive ones property. Inf. Process. Lett. 110(20): 845-848 (2010) - [j1]Maw-Shang Chang
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. 47(2): 342-367 (2010)
2000 – 2009
- 2008
- [c1]Maw-Shang Chang
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77
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 2024-09-21 23:35 CEST 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: