default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIldikó Schlotter
Person information
- affiliation: Budapest University of Technology and Economics, Hungary
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Ildikó Schlotter, Katarína Cechlárová, Diana Trellová:
Parameterized complexity of candidate nomination for elections based on positional scoring rules. Auton. Agents Multi Agent Syst. 38(2): 28 (2024)- [j21]Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena
, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. 357: 34-50 (2024) - [j20]Haris Aziz, Ildikó Schlotter, Toby Walsh:
Computational complexity of necessary envy-freeness. Math. Soc. Sci. 127: 86-98 (2024) - [j19]Ildikó Schlotter:
Recognizing when a preference system is close to admitting a master list. Theor. Comput. Sci. 994: 114445 (2024) - [c21]Jiehua Chen, Ildikó Schlotter, Sofia Simola:
Parameterized Algorithms for Optimal Refugee Resettlement. ECAI 2024: 3413-3420 - [c20]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. SODA 2024: 3724-3746 - [c19]Ildikó Schlotter:
Shortest Two Disjoint Paths in Conservative Graphs. STACS 2024: 57:1-57:17 - [c18]Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT 2024: 30:1-30:17 - [i18]Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR abs/2404.07516 (2024) - [i17]Jiehua Chen, Ildikó Schlotter, Sofia Simola:
Parameterized Algorithms for Optimal Refugee Resettlement. CoRR abs/2408.08392 (2024) - 2023
- [j18]Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym:
Complexity of stability in trading networks. Int. J. Game Theory 52(3): 629-648 (2023) - [c17]Ildikó Schlotter:
Recognizing When a Preference System is Close to Admitting a Master List. WALCOM 2023: 317-329 - [i16]Ildikó Schlotter:
Shortest two disjoint paths in conservative graphs. CoRR abs/2307.12602 (2023) - [i15]Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. CoRR abs/2308.12653 (2023) - [i14]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. CoRR abs/2310.19455 (2023) - 2022
- [j17]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022) - [c16]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. SODA 2022: 103-123 - [i13]Ildikó Schlotter, Ágnes Cseh:
Maximum-utility popular matchings with bounded instability. CoRR abs/2205.02189 (2022) - [i12]Ildikó Schlotter, András Sebö:
Shortest Odd Paths in Conservative Graphs: Connections and Complexity. CoRR abs/2211.12862 (2022) - [i11]Ildikó Schlotter:
Recognizing when a preference system is close to admitting a master list. CoRR abs/2212.03521 (2022) - 2021
- [j16]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. Algorithmica 83(5): 1559-1603 (2021) - [c15]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home? WINE 2021: 244-261 - [i10]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The core of housing markets from an agent's perspective: Is it worth sprucing up your home? CoRR abs/2110.06875 (2021) - [i9]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - 2020
- [j15]Matthias Mnich, Ildikó Schlotter:
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82(5): 1136-1188 (2020) - [c14]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237
2010 – 2019
- 2019
- [i8]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. CoRR abs/1912.01854 (2019) - 2018
- [j14]Ildikó Schlotter, Katarína Cechlárová:
A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80(1): 258-278 (2018) - [j13]Ildikó Schlotter, Katarína Cechlárová:
Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80(11): 3428-3430 (2018) - [i7]Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym:
Complexity of Stability in Trading Networks. CoRR abs/1805.08758 (2018) - 2017
- [j12]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77(1): 84-115 (2017) - [c13]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. ADT 2017: 284-299 - [c12]Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter:
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. ADT 2017: 300-314 - [c11]Matthias Mnich, Ildikó Schlotter:
Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT 2017: 320-332 - [i6]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. CoRR abs/1705.11060 (2017) - 2016
- [j11]Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter:
Refining the complexity of the sports elimination problem. Discret. Appl. Math. 199: 172-186 (2016) - [c10]Haris Aziz, Ildikó Schlotter, Toby Walsh:
Control of Fair Division. IJCAI 2016: 67-73 - [i5]Matthias Mnich, Ildikó Schlotter:
Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR abs/1602.08230 (2016) - 2015
- [j10]Tibor Jordán, Ildikó Schlotter:
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. J. Discrete Algorithms 30: 29-44 (2015) - [i4]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. CoRR abs/1501.00387 (2015) - 2014
- [j9]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. Algorithmica 68(1): 41-61 (2014) - 2013
- [j8]Dániel Marx, Ildikó Schlotter:
Cleaning Interval Graphs. Algorithmica 65(2): 275-316 (2013) - [j7]Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter:
Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1): 39-49 (2013) - 2012
- [j6]Dániel Marx, Ildikó Schlotter:
Obtaining a Planar Graph by Vertex Deletion. Algorithmica 62(3-4): 807-822 (2012) - [j5]Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. Algorithmica 64(1): 126-151 (2012) - 2011
- [j4]Dániel Marx, Ildikó Schlotter:
Stable assignment with couples: Parameterized complexity and local search. Discret. Optim. 8(1): 25-40 (2011) - [j3]Péter Biró, Robert W. Irving, Ildikó Schlotter:
Stable matching with couples: An empirical study. ACM J. Exp. Algorithmics 16 (2011) - [c9]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. AAAI 2011: 726-731 - [c8]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142 - 2010
- [b1]Ildikó Schlotter:
Parameterized Complexity of Graph Modification and Stable Matching Problems. Budapest University of Technology and Economics, Hungary, 2010 - [j2]Dániel Marx, Ildikó Schlotter:
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. Algorithmica 58(1): 170-187 (2010) - [c7]Katarína Cechlárová, Ildikó Schlotter:
Computing the Deficiency of Housing Markets with Duplicate Houses. IPEC 2010: 72-83 - [c6]Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. IPEC 2010: 107-122 - [c5]Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter:
Bin Packing with Fixed Number of Bins Revisited. SWAT 2010: 260-272 - [c4]Dániel Marx, Ildikó Schlotter:
Parameterized Complexity of the Arc-Preserving Subsequence Problem. WG 2010: 244-255 - [i3]Dániel Marx, Ildikó Schlotter:
Cleaning Interval Graphs. CoRR abs/1003.1260 (2010) - [i2]Britta Dorn, Ildikó Schlotter:
Multivariate Analyis of Swap Bribery. CoRR abs/1011.1338 (2010)
2000 – 2009
- 2009
- [j1]Dániel Marx, Ildikó Schlotter:
Parameterized graph cleaning problems. Discret. Appl. Math. 157(15): 3258-3267 (2009) - [c3]Dániel Marx, Ildikó Schlotter:
Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC 2009: 300-311 - 2008
- [c2]Dániel Marx, Ildikó Schlotter:
Parameterized Graph Cleaning Problems. WG 2008: 287-299 - [i1]Dániel Marx, Ildikó Schlotter:
Obtaining a Planar Graph by Vertex Deletion. CoRR abs/0812.4919 (2008) - 2007
- [c1]Dániel Marx, Ildikó Schlotter:
Obtaining a Planar Graph by Vertex Deletion. WG 2007: 292-303
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
