• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 28 matches

• 2024
• 
  Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
  Permutation Tutte polynomial. Eur. J. Comb. 120: 104003 (2024)
• 
  Kristóf Bérczi, Gergely Csáji, Tamás Király:
  Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. 147: 407-428 (2024)
• 
  Péter Biró, Gergely Csáji:
  Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Games Econ. Behav. 145: 217-238 (2024)
• 
  Gergely Kál Csáji, Tamás Király, Yu Yokoi:
  Solving the Maximum Popular Matching Problem with Matroid Constraints. SIAM J. Discret. Math. 38(3): 2226-2242 (2024)
• 
  Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
  Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS 2024: 2153-2155
• 
  Gergely Csáji:
  A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems. AAMAS 2024: 409-415
• 
  Yuhang Bai, Kristóf Bérczi, Gergely Kál Csáji, Tamás Schwarcz:
  Approximating maximum-size properly colored forests. CoRR abs/2402.00834 (2024)
• 
  Gergely Csáji:
  Popularity and Perfectness in One-sided Matching Markets with Capacities. CoRR abs/2403.00598 (2024)
• 
  Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
  Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024)
• 2023
• 
  Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
  On the complexity of packing rainbow spanning trees. Discret. Math. 346(4): 113297 (2023)
• 
  Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
  Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial. Eur. J. Comb. 110: 103678 (2023)
• 
  Jiehua Chen, Gergely Csáji:
  Optimal Capacity Modification for Many-To-One Matching Problems. AAMAS 2023: 2880-2882
• 
  Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola:
  Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS 2023: 251-259
• 
  Haris Aziz, Gergely Csáji, Ágnes Cseh:
  Computational Complexity of k-Stable Matchings. SAGT 2023: 311-328
• 
  Gergely Kál Csáji, Tamás Király, Yu Yokoi:
  Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA 2023: 103-113
• 
  Jiehua Chen, Gergely Csáji:
  Optimal Capacity Modification for Many-To-One Matching Problems. CoRR abs/2302.01815 (2023)
• 
  Gergely Csáji:
  A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems. CoRR abs/2304.02558 (2023)
• 
  Haris Aziz, Gergely Csáji, Ágnes Cseh:
  Computational complexity of k-stable matchings. CoRR abs/2307.03794 (2023)
• 
  Gergely Csáji:
  Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings. CoRR abs/2310.12269 (2023)
• 
  Gergely Csáji:
  Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences. CoRR abs/2310.14288 (2023)
• 
  Gergely Csáji, David F. Manlove, Iain McBride, James Trimble:
  Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples. CoRR abs/2311.00405 (2023)
• 
  Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
  Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR abs/2312.16653 (2023)
• 2022
• 
  Gergely Csáji:
  On the complexity of stable hypergraph matching, stable multicommodity flow and related problems. Theor. Comput. Sci. 931: 1-16 (2022)
• 
  Péter Biró, Gergely Csáji:
  Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences. CoRR abs/2202.05484 (2022)
• 
  Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
  Manipulating the outcome of stable matching and roommates problems. CoRR abs/2204.13485 (2022)
• 
  Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
  On the complexity of packing rainbow spanning trees. CoRR abs/2206.11924 (2022)
• 
  Gergely Kál Csáji, Tamás Király, Yu Yokoi:
  Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. CoRR abs/2208.09583 (2022)
• 
  Gergely Kál Csáji, Tamás Király, Yu Yokoi:
  Solving the Maximum Popular Matching Problem with Matroid Constraints. CoRR abs/2209.02195 (2022)