The following pages link to Jiehua Chen (Q342713):
Displaying 32 items.
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles (Q1709516) (← links)
- Stable roommate with narcissistic, single-peaked, and single-crossing preferences (Q1990314) (← links)
- Small one-dimensional Euclidean preference profiles (Q2058844) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- The one-dimensional Euclidean domain: finitely many obstructions are not enough (Q2397665) (← links)
- A characterization of the single-crossing domain (Q2453407) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- On (coalitional) exchange-stable matching (Q2670926) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- On Explaining Integer Vectors by Few Homogenous Segments (Q2842158) (← links)
- How to Put through Your Agenda in Collective Binary Decisions (Q2868543) (← links)
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (Q2872100) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Combinatorial Voter Control in Elections (Q2922604) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (Q3453561) (← links)
- (Q4523376) (← links)
- Elections with Few Voters: Candidate Control Can Be Easy (Q4600728) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- (Q5075765) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty (Q5278045) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)
- A note on clustering aggregation for binary clusterings (Q6556150) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
