The following pages link to Nimrod Talmon (Q519898):
Displaying 42 items.
- The complexity of finding effectors (Q519899) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Can we create large \(k\)-cores by adding few edges? (Q1625143) (← links)
- Structured proportional representation (Q1686072) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Distributed monitoring of election winners (Q2289007) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Sybil-resilient conductance-based community growth (Q2330574) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- In the beginning there were \(n\) agents: founding and amending a constitution (Q2695431) (← links)
- Iterative deliberation via metric aggregation (Q2695437) (← links)
- Democratic forking: choosing sides with social choice (Q2695454) (← links)
- Large-Scale Election Campaigns: Combinatorial Shift Bribery (Q2800947) (← links)
- Combinatorial Voter Control in Elections (Q2922604) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)
- Multi-player Diffusion Games on Graph Classes (Q2948467) (← links)
- The Complexity of Degree Anonymization by Graph Contractions (Q2948472) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- Elections with Few Candidates: Prices, Weights, and Covering Problems (Q3449547) (← links)
- Elections with Few Voters: Candidate Control Can Be Easy (Q4600728) (← links)
- Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting (Q4909572) (← links)
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation (Q4989327) (← links)
- Multiwinner Rules with Variable Number of Winners (Q4999205) (← links)
- Committee selection with multimodal preferences (Q4999213) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- Opinion diffusion and campaigning on society graphs (Q5103726) (← links)
- (Q5111890) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← links)
- Multi-Player Diffusion Games on Graph Classes (Q5856441) (← links)
- Complexity of Shift Bribery in Committee Elections (Q5868881) (← links)
- Robustness among multiwinner voting rules (Q5894693) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5920105) (← links)
- Correction to: Opinion diffusion and campaigning on society graphs (Q6042099) (← links)
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules (Q6066767) (← links)
