The following pages link to Nimrod Talmon (Q519898):
Displaying 13 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)
- Elections with Few Voters: Candidate Control Can Be Easy (Q4600728) (← links)
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation (Q4989327) (← links)
- Opinion diffusion and campaigning on society graphs (Q5103726) (← links)
- (Q5111890) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← 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)
