default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiehua Chen 0001
Person information
- affiliation: Technische Universität Wien, Austria
- affiliation (former): Technische Universität Berlin, Germany
Other persons with the same name
- Jiehua Chen 0002 — Southern Medical University, Guangzhou, China
- Jiehua Chen 0003 — Zhejiang University of Technology, Hangzhou, China
- Jiehua Chen 0004 — China Railway Tunnel Group Co. Ltd, Langfang, China
- Jiehua Chen 0005 — Huawei Inc., Shengzhen, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A note on clustering aggregation for binary clusterings. Oper. Res. Lett. 52: 107052 (2024)- [c38]Jiehua Chen, William S. Zwicker:
Cutsets and EF1 Fair Division of Graphs. AAMAS 2024: 2192-2194 - [i40]Jiehua Chen, William S. Zwicker:
Cutsets and EF1 Fair Division of Graphs. CoRR abs/2402.05884 (2024) - 2023
- [c37]Jiehua Chen, Seyedeh Negar Layegh Khavidaki, Sebastian Vincent Haydn, Sofia Simola
, Manuel Sorge:
Game Implementation: What Are the Obstructions? AAAI 2023: 5557-5564 - [c36]Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola:
Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS 2023: 251-259 - [c35]Jiehua Chen, Gergely Csáji:
Optimal Capacity Modification for Many-To-One Matching Problems. AAMAS 2023: 2880-2882 - [c34]Jiehua Chen, Christian Hatschka, Sofia Simola:
Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. ECAI 2023: 397-404 - [c33]Esra Ceylan, Jiehua Chen, Sanjukta Roy:
Optimal Seat Arrangement: What Are the Hard and Easy Cases? IJCAI 2023: 2563-2571 - [i39]Jiehua Chen, Gergely Csáji:
Optimal Capacity Modification for Many-To-One Matching Problems. CoRR abs/2302.01815 (2023) - [i38]Esra Ceylan, Jiehua Chen, Sanjukta Roy:
Optimal Seat Arrangement: What Are the Hard and Easy Cases? CoRR abs/2305.10381 (2023) - [i37]Jiehua Chen, Christian Hatschka, Sofia Simola:
Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. CoRR abs/2307.16864 (2023) - [i36]Jiehua Chen, Jiong Guo, Yinghui Wen:
Algorithms and Complexity for Congested Assignments. CoRR abs/2312.07431 (2023) - 2022
- [c32]Jiehua Chen, Martin Lackner, Jan Maly:
Participatory Budgeting with Donations and Diversity Constraints. AAAI 2022: 9323-9330 - [c31]Jiehua Chen, Sanjukta Roy:
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. ESA 2022: 36:1-36:16 - [c30]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. LATIN 2022: 273-289 - [i35]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. CoRR abs/2201.09691 (2022) - [i34]Jiehua Chen, Sanjukta Roy:
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. CoRR abs/2202.12006 (2022) - [i33]Jiehua Chen, Gergely Csáj, Sanjukta Roy, Sofia Simola:
Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. CoRR abs/2203.09655 (2022) - [i32]Laurent Bulteau, Jiehua Chen:
2-Dimensional Euclidean Preferences. CoRR abs/2205.14687 (2022) - [i31]Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki, Sofia Simola, Manuel Sorge:
Game Implementation: What Are the Obstructions? CoRR abs/2212.00699 (2022) - [i30]Markus Brill, Jiehua Chen, Andreas Darmann, David M. Pennock, Matthias Greger:
Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). Dagstuhl Reports 12(7): 1-18 (2022) - 2021
- [j19]Jiehua Chen, Sven Grottke:
Small one-dimensional Euclidean preference profiles. Soc. Choice Welf. 57(1): 117-144 (2021) - [j18]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Trans. Economics and Comput. 9(4): 20:1-20:55 (2021) - [c29]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. IJCAI 2021: 89-95 - [c28]Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge:
On (Coalitional) Exchange-Stable Matching. SAGT 2021: 205-220 - [c27]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 2021: 796-809 - [i29]Jiehua Chen, Martin Lackner, Jan Maly:
Participatory Budgeting with Donations and Diversity Constraints. CoRR abs/2104.15075 (2021) - [i28]Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge:
On (Coalitional) Exchange-Stable Matching. CoRR abs/2105.05725 (2021) - [i27]Jiehua Chen, Sanjukta Roy:
Euclidean 3D Stable Roommates is NP-hard. CoRR abs/2108.03868 (2021) - 2020
- [j17]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agents Multi Agent Syst. 34(2): 53 (2020) - [c26]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. AAAI 2020: 1830-1837 - [c25]Jiehua Chen, Robert Ganian, Thekla Hamm:
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. IJCAI 2020: 146-152 - [i26]Jiehua Chen, Robert Ganian, Thekla Hamm:
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. CoRR abs/2001.10087 (2020) - [i25]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
On Dynamic Parameterized k-Path. CoRR abs/2006.00571 (2020) - [i24]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. CoRR abs/2011.12259 (2020)
2010 – 2019
- 2019
- [c24]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Trade-Offs. EC 2019: 41-59 - [c23]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA 2019: 28:1-28:16 - [i23]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Trade-offs. CoRR abs/1902.10535 (2019) - [i22]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR abs/1903.05975 (2019) - [i21]Jiehua Chen:
Computational Complexity of Stable Marriage and Stable Roommates and Their Variants. CoRR abs/1904.08196 (2019) - [i20]Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger:
Good Things Come to Those Who Swap Objects on Paths. CoRR abs/1905.04219 (2019) - [i19]Jiehua Chen:
Stable Matchings in Divorce Graphs. CoRR abs/1906.12274 (2019) - [i18]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. CoRR abs/1907.01375 (2019) - 2018
- [j16]Jiehua Chen, Ugo Paavo Finnendahl:
On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles. Discret. Math. 341(5): 1225-1236 (2018) - [j15]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized complexity of team formation in social networks. Theor. Comput. Sci. 717: 26-36 (2018) - [c22]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How Hard Is It to Satisfy (Almost) All Roommates?. ICALP 2018: 35:1-35:15 - [c21]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC 2018: 24:1-24:13 - [c20]Jiehua Chen, Rolf Niedermeier, Piotr Skowron:
Stable Marriage with Multi-Modal Preferences. EC 2018: 269-286 - [i17]Jiehua Chen, Rolf Niedermeier, Piotr Skowron:
Stable Marriage with Multi-Modal Preferences. CoRR abs/1801.02693 (2018) - [i16]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR abs/1807.06469 (2018) - [i15]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A Note on Clustering Aggregation. CoRR abs/1807.08949 (2018) - [i14]Jiehua Chen, Sven Grottke:
Small One-Dimensional Euclidean Preference Profiles. CoRR abs/1810.06461 (2018) - 2017
- [j14]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. J. Artif. Intell. Res. 59: 133-173 (2017) - [j13]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [j12]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j11]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48(2): 409-432 (2017) - [c19]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017: 390-396 - [c18]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT 2017: 315-330 - [c17]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC 2017: 348-361 - [i13]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR abs/1701.05108 (2017) - [i12]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How hard is it to satisfy (almost) all roommates? CoRR abs/1707.04316 (2017) - [i11]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
A Parameterized View on Multi-Layer Cluster Editing. CoRR abs/1709.09100 (2017) - 2016
- [b1]Jiehua Chen:
Exploiting structure in computationally hard voting problems. Technical University of Berlin, Germany, 2016, ISBN 978-3-7983-2825-9, pp. 1-278 - [j10]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j9]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79: 61-73 (2016) - [c16]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized Complexity of Team Formation in Social Networks. AAIM 2016: 137-149 - [i10]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR abs/1611.08892 (2016) - 2015
- [j8]René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - [j7]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j6]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - [j5]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [j4]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [j3]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. 4(1): 5:1-5:28 (2015) - [c15]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c14]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. IJCAI 2015: 164-170 - [i9]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i8]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: Finitely many obstructions are not enough. CoRR abs/1506.03838 (2015) - [i7]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. CoRR abs/1509.02424 (2015) - [i6]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference~profiles~nearby? CoRR abs/1509.04595 (2015) - 2014
- [j2]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [c13]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c12]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c11]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [c10]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [i5]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i4]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i3]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i2]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - [i1]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014) - 2013
- [j1]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
A characterization of the single-crossing domain. Soc. Choice Welf. 41(4): 989-998 (2013) - [c9]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013: 30-44 - [c8]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are There Any Nicely Structured Preference Profiles Nearby? IJCAI 2013: 62-68 - [c7]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - [c6]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - 2012
- [c5]Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012: 1292-1298 - [c4]Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier:
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond 2012: 318-363 - 2011
- [c3]Jiehua Chen, Sven Grottke, Jan Sablatnig, Ruedi Seiler, Adam Wolisz:
Scalability of a distributed virtual environment based on a structured peer-to-peer architecture. COMSNETS 2011: 1-8
2000 – 2009
- 2008
- [c2]Jan Sablatnig, Jiehua Chen, Ruedi Seiler, Sven Grottke, Andreas Köpke, Adam Wolisz:
Adam A Testbed for Distributed Virtual Environments. ICDCS Workshops 2008: 84-89 - [c1]Sven Grottke, Jan Sablatnig, Jiehua Chen, Ruedi Seiler, Andreas Köpke, Adam Wolisz:
Measures for Inconsistency in Distributed Virtual Environments. ICPADS 2008: 859-864
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-08-05 20:20 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:
