Spremljaj
Ildikó Schlotter
Ildikó Schlotter
Centre for Economic and Regional Studies, Institute of Economics
Preverjeni e-poštni naslov na cs.bme.hu
Naslov
Navedeno
Navedeno
Leto
Bin packing with fixed number of bins revisited
K Jansen, S Kratsch, D Marx, I Schlotter
Journal of Computer and System Sciences 79 (1), 39-49, 2013
1262013
Obtaining a planar graph by vertex deletion
D Marx, I Schlotter
Algorithmica 62 (3), 807-822, 2012
99*2012
Multivariate complexity analysis of swap bribery
B Dorn, I Schlotter
Algorithmica 64 (1), 126-151, 2012
742012
Stable assignment with couples: Parameterized complexity and local search
D Marx, I Schlotter
Discrete Optimization 8 (1), 25-40, 2011
652011
Parameterized complexity of Eulerian deletion problems
M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter
Algorithmica 68, 41-61, 2014
562014
Campaign management under approval-driven voting rules
I Schlotter, P Faliszewski, E Elkind
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 726-731, 2011
56*2011
Stable matching with couples: An empirical study
P Biró, RW Irving, I Schlotter
Journal of Experimental Algorithmics (JEA) 16, 1.1-1.27, 2011
562011
Parameterized complexity and local search approaches for the stable marriage problem with ties
D Marx, I Schlotter
Algorithmica 58 (1), 170-187, 2010
542010
Cleaning interval graphs
D Marx, I Schlotter
Algorithmica 65, 275-316, 2013
232013
Control of fair division
H Aziz, IA Schlotter, T Walsh
IJCAI, 2016
212016
Computing the deficiency of housing markets with duplicate houses
K Cechlárová, I Schlotter
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
192010
Stable marriage with covering constraints–a complete computational trichotomy
M Mnich, I Schlotter
International Symposium on Algorithmic Game Theory, 320-332, 2017
152017
Having a hard time? Explore parameterized complexity
B Dorn, I Schlotter
Trends in Computational Social Choice, 209-230, 2017
132017
Popular branchings and their dual certificates
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Integer Programming and Combinatorial Optimization: 21st International …, 2020
122020
Refining the complexity of the sports elimination problem
K Cechlárová, E Potpinková, I Schlotter
Discrete Applied Mathematics 199, 172-186, 2016
122016
Stable matchings with covering constraints: A complete computational trichotomy
M Mnich, I Schlotter
Algorithmica 82 (5), 1136-1188, 2020
112020
Popular branchings and their dual certificates
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Mathematical Programming 192 (1), 567-595, 2022
102022
Parameterized graph cleaning problems
D Marx, I Schlotter
Discrete applied mathematics 157 (15), 3258-3267, 2009
92009
Complexity of stability in trading networks
T Fleiner, Z Jankó, I Schlotter, A Teytelboym
arXiv preprint arXiv:1805.08758, 2018
82018
A connection between sports and matroids: How many teams can we beat?
I Schlotter, K Cechlárová
Algorithmica 80, 258-278, 2018
82018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20