The following pages link to Jörg Rothe (Q267647):
Displayed 50 items.
- A statistical approach to calibrating the scores of biased reviewers of scientific papers (Q267651) (← links)
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- The complexity of controlling candidate-sequential elections (Q526900) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Verification in incomplete argumentation frameworks (Q668774) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Generalized juntas and NP-hard sets (Q837194) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
- Upward separation for FewP and related classes (Q1341678) (← links)
- Easy sets and hard certificate schemes (Q1374784) (← links)
- Exact complexity of the winner problem for Young elections (Q1405784) (← links)
- Item:Q267647 (redirect page) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (Q1597764) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- The possible winner problem with uncertain weights revisited (Q2140520) (← links)
- Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← links)
- Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Complexity of stability (Q2237893) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Refugee allocation in the setting of hedonic games (Q2290371) (← links)
- Optimizing social welfare in social networks (Q2290372) (← links)