Schlotter, Ildikó

1. The popular assignment problem: when cardinality is more important than popularity
   2021/10/21 by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik +2 · 2 citations
   #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Cleaning Interval Graphs
   2010/03/05 by Dániel Marx, Ildikó Schlotter, Marx, Dániel +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #semigroups and automata theory
3. Odd Paths, Cycles and T-joins: Connections and Algorithms
   2022/11/23 by Ildikó Schlotter, András Sebő, Schlotter, Ildikó +1 · 2 citations
   Computer Science · Engineering · #05C12 #68Q17 (Primary) 05C85 #68Q25 (Secondary) #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #graph theory and CDMA systems
4. Obtaining a Proportional Allocation by Deleting Items
   2017/05/31 by Dorn, Britta, de Haan, Ronald, Schlotter, Ildikó · 1 citation
   #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Multiagent Systems (cs.MA)
5. Popular Branchings and Their Dual Certificates
   2019/12/04 by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik +2 · 1 citation
   #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
   2023/08/24 by Alpár Jüttner, Csaba Király, Jüttner, Alpár +9 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems