Schlotter, Ildikó

scientific associate

Mechanism design

Careerline

Languages

Research topics

Awards

Studies

Research stays

Teaching

Presentations

Employment history

Publications

Languages
Awards
Studies
Research stays
Teaching
Presentations
Employment history
Publications

Careerline

Languages

English, fluent (intermediate level C language exam)

German, basic level (intermediate level C language exam)

Spanish, basic level

Research topics

algorithm theory

parametric complexity theory

preference-based pairings

computational science of social decisions

Awards

2023

Bolyai Scholarship

2011

Junior Prima prize

2011

Gyula Farkas Memorial Award (János Bolyai Mathematical Society)

2009

Faculty Outstanding Young Instructor award (BME Faculty of Electrical Engineering and Informatics)

Studies

2005 - 2010

University of Technology and Economics of Budapest, Doctoral School of Informatics Sciences, PhD

2000 - 2005

University of Technology and Economics of Budapest, Faculty of Electrical Engineering and Informatics, technical computer scientist

Research stays

Teaching

2011-

University of Technology and Economics of Budapest
Faculty of Electrical Engineering and Informatics
(currently inactive)

2011-2011

University of Technology and Economics of Budapest
Faculty of Electrical Engineering and Informatics

2008-2010

University of Technology and Economics of Budapest
Villamosmérnöki és Informatikai Kar

Presentations

Employment history

2020-

Economic and Regional Science Research Center
Institute of Economics
scientific associate

2011-

University of Technology and Economics of Budapest
Faculty of Electrical Engineering and Informatics
Department of Computer Science and Information Theory
associate professor

2011-2011

University of Technology and Economics of Budapest
Faculty of Electrical Engineering and Informatics
Department of Computer Science and Information Theory
assistant professor

2008-2010

University of Technology and Economics of Budapest
Faculty of Electrical Engineering and Informatics
Department of Computer Science and Information Theory
teaching assistant

2010-2011

Eötvös Loránd University
Institute of Mathematics
Department of Operations Research
Research Assistant

Publications

2023

T. Fleiner, Zs. Jankó, I. Schlotter, A. Teytelboym: Complexity of stability in trading networks. International Journal of Game Theory, volume 52, pp. 629-648, 2023.

2022

T. Kavitha, T. Király, J. Matuschke, I. Schlotter, U. Schmidt-Kraepelin: Popular branchings and their dual certificates. Mathematical Programming, volume 192, pp. 567-595, 2022.

2021

B. Dorn, R. de Haan, I. Schlotter: Obtaining a proportional allocation by deleting items. Algorithmica, volume 83, issue 5, pp. 1559-1603, 2021.

2020

M. Mnich, I. Schlotter: Stable marriage with covering constraints: A complete computational trichotomy. Algorithmica, volume 82, issue 1, pp. 1136-1188, 2020.

2018

K. Cechlárová, I. Schlotter: A connection between sports and matroids: How many teams can we beat? Algorithmica, volume 80, issue 1, pp. 258-278, 2018.

2017

B. Dorn, I. Schlotter: Having a Hard Time? Explore Parameterized Complexity! In: Trends in Computational Social Choice by Ulle Endriss (editor), AI Access, 2017.

2017

I. Schlotter, P. Faliszewski, E. Elkind: Campaign management under approval-driven voting rules. Algorithmica, volume 77, issue 1, pp. 84-115, 2017.

2016

K. Cechlárová, E. Potpinková, I. Schlotter: Refining the complexity of the sports elimination problem. Discrete Applied Mathematics, volume 199, pp. 172-186, 2016.

2015

T. Jordán, I. Schlotter: Parameterized complexity of Spare Capacity Allocation and the Multicost Steiner Subgraph problem. Journal of Discrete Algorithms, volume 30, pp. 29-44, 2015.

2014

M. Cygan, D. Marx, M. Pilipczuk, M. Pilipczuk, I. Schlotter: Parameterized complexity of Eulerian deletion problems. Algorithmica, volume 68, issue 1, pp. 41-61, 2014.

2013

K. Jansen, S. Kratsch, D. Marx, I. Schlotter: Bin packing with fixed number of bins revisited. Journal of Computer and System Sciences, volume 79, issue 1, pp. 39-49, 2013.

2013

D. Marx, I. Schlotter: Cleaning interval graphs. Algorithmica, volume 65, issue 2, pp. 275-316, 2013.

2012

B. Dorn, I. Schlotter: Multivariate complexity analysis of Swap Bribery. Algorithmica, volume 64, issue 1, pp. 126-151, 2012.

2012

D. Marx, I. Schlotter: Obtaining a planar graph by vertex deletion. Algorithmica, volume 62, issue 3, pp. 807-822, 2012.

2011

P. Biró, R.W. Irving, I. Schlotter: Stable matching with couples: An empirical study. Journal of Experimental Algorithmics, volume 16, May 2011, Article 1.2.

2011

D. Marx, I. Schlotter: Stable assignment with couples: parameterized complexity and local search. Discrete Optimization, volume 8, pp. 25-40, 2011.

2010

D. Marx, I. Schlotter: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica, volume 58, issue 1, pp. 170-187, 2010.

2009

D. Marx, I. Schlotter: Parameterized graph cleaning problems. Discrete Applied Mathematics, volume 157, issue 15, pp. 3258-3267, 2009.