  |
Items where Author is "Schlotter, Ildikó"
Group by: Item Type | No Grouping Jump to: Article Number of items: 4. ArticleSchlotter, Ildikó and Cechlárová, Katarína and Trellová, Diana (2024) Parameterized Complexity of Candidate Nomination for Elections based on Positional Scoring Rules. AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 38. No.-28. ISSN 1387-2532 (print); 1573-7454 (online) Jüttner, Alpár and Király, Csaba and Mendoza-Cadena, Lydia Mirabel and Pap, Gyula and Schlotter, Ildikó and Yamaguchi, Yutaro (2024) Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. DISCRETE APPLIED MATHEMATICS : THE JOURNAL OF COMBINATORIAL ALGORITHMS, INFORMATICS AND COMPUTATIONAL SCIENCES, 357. pp. 34-50. ISSN 0166-218X (print); 1872-6771 (online) Kavitha, Telikepalli and Király, Tamás and Matuschke, Jannik and Schlotter, Ildikó and Schmidt-Kraepelin, Ulrike (2021) Popular Branchings and Their Dual Certificates. MATHEMATICAL PROGRAMMING : A PUBLICATION OF THE MATHEMATICAL OPTIMIZATION SOCIETY. pp. 1-29. ISSN 0025-5610 (print); 1436-4646 (online) Jordán, Tibor and Schlotter, Ildikó (2014) Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. JOURNAL OF DISCRETE ALGORITHMS, 30. pp. 29-44. ISSN 1570-8667 |
