Jörg Rothe

About Jörg Rothe

Jörg Rothe, With an exceptional h-index of 40 and a recent h-index of 25 (since 2020), a distinguished researcher at Heinrich-Heine-Universität Düsseldorf, specializes in the field of computational complexity, artificial intelligence, computational social choice, algorithmics.

His recent articles reflect a diverse array of research interests and contributions to the field:

Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode

Stability, Vertex Stability, and Unfrozenness for Special Graph Classes

Coalition formation games–preface

Core Stability in Altruistic Coalition Formation Games

Controlling weighted voting games by deleting or adding players with or without changing the quota

Fair and efficient allocation with few agent types, few item types, or small value levels

The possible winner with uncertain weights problem

Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games

Jörg Rothe Information

University

Position

Professor of Computer Science

Citations(all)

5947

Citations(since 2020)

2099

Cited By

5143

hIndex(all)

40

hIndex(since 2020)

25

i10Index(all)

127

i10Index(since 2020)

61

Email

University Profile Page

Heinrich-Heine-Universität Düsseldorf

Google Scholar

View Google Scholar Profile

Jörg Rothe Skills & Research Interests

computational complexity

artificial intelligence

computational social choice

algorithmics

Top articles of Jörg Rothe

Title

Journal

Author(s)

Publication Date

Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode

Christian Laußmann

Jörg Rothe

Tessa Seeger

2024/2/7

Stability, Vertex Stability, and Unfrozenness for Special Graph Classes

Theory of Computing Systems

Frank Gurski

Jörg Rothe

Robin Weishaupt

2024/2

Coalition formation games–preface

Annals of Mathematics and Artificial Intelligence

Judy Goldsmith

Jörg Rothe

2024/3/7

Core Stability in Altruistic Coalition Formation Games

Matthias Hoffjan

Anna Maria Kerkmann

Jörg Rothe

2024/3/6

Controlling weighted voting games by deleting or adding players with or without changing the quota

Annals of Mathematics and Artificial Intelligence

Joanna Kaczmarek

Jörg Rothe

2023/7/6

Fair and efficient allocation with few agent types, few item types, or small value levels

Artificial Intelligence

Trung Thanh Nguyen

Jörg Rothe

2023/1/1

The possible winner with uncertain weights problem

Journal of Computer and System Sciences

Dorothea Baumeister

Marc Neveling

Magnus Roos

Jörg Rothe

Lena Schend

...

2023/12/1

Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games

Joanna Kaczmarek

Jörg Rothe

Nimrod Talmon

2023/9/28

Complexity results and exact algorithms for fair division of indivisible items: a survey

Trung Thanh Nguyen

Jörg Rothe

2023/8/19

Altruism in coalition formation games

Annals of Mathematics and Artificial Intelligence

Anna Maria Kerkmann

Simon Cramer

Jörg Rothe

2023/7/31

The complexity of online bribery in sequential elections

Journal of Computer and System Sciences

Edith Hemaspaandra

Lane A Hemaspaandra

Jörg Rothe

2022/8/1

Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games.

Anna Maria Kerkmann

Jörg Rothe

2022/5/9

Voting for centrality

Ulrik Brandes

Christian Laußmann

Jörg Rothe

2022/5/9

Multi-Agent Systems: 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14–16, 2022, Proceedings

Dorothea Baumeister

Jörg Rothe

2022/12/10

Complexity of stability

Journal of Computer and System Sciences

Fabian Frei

Edith Hemaspaandra

Jörg Rothe

2022/2/1

Complexity of shift bribery for iterative voting rules

Annals of Mathematics and Artificial Intelligence

Cynthia Maushagen

Marc Neveling

Jörg Rothe

Ann-Kathrin Selker

2022/10

Altruistic hedonic games

Journal of Artificial Intelligence Research

Anna Maria Kerkmann

Nhan-Tam Nguyen

Anja Rey

Lisa Rey

Jörg Rothe

...

2022/9/20

A Closer Look at the Cake-Cutting Foundations through the Lens of Measure Theory

The 8th International Workshop on Computational Social Choice (COMSOC-21). Ed. by B. Zwicker and R. Meir. Available online at https://comsoc2021. net. technion. ac. il/accepted-papers/. Haifa, Israel: Technion-Israel Institute of Technology

Peter Kern

Daniel Neugebauer

Jörg Rothe

R Schilling

Dietrich Stoyan

...

2021

Collective Acceptability in Abstract Argumentation.

FLAP

Dorothea Baumeister

Daniel Neugebauer

Jörg Rothe

2021/7

Cutting a Cake Is Not Always a'Piece of Cake': A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory

arXiv preprint arXiv:2111.05402

Peter Kern

Daniel Neugebauer

Jörg Rothe

René L Schilling

Dietrich Stoyan

...

2021/11/9

See List of Professors in Jörg Rothe University(Heinrich-Heine-Universität Düsseldorf)

Co-Authors

H-index: 64
Vincent Conitzer

Vincent Conitzer

Duke University

H-index: 56
Mitsunori Ogihara

Mitsunori Ogihara

University of Miami

H-index: 47
Edith Elkind

Edith Elkind

University of Oxford

H-index: 46
Lane A. Hemaspaandra (premarriage name: Hemachandra)

Lane A. Hemaspaandra (premarriage name: Hemachandra)

University of Rochester

H-index: 46
Piotr Faliszewski

Piotr Faliszewski

Akademia Górniczo-Hutnicza

H-index: 42
Felix Brandt

Felix Brandt

Technische Universität München

academic-engine