• 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 84 matches

• 2024
• 
  Péter Biró, Sándor Bozóki, Tamás Király, Alexandru Kristály:
  Optimization methods and algorithms. Central Eur. J. Oper. Res. 32(1): 1-9 (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)
• 
  Tamás Molnár, Géza Király:
  Forest Disturbance Monitoring Using Cloud-Based Sentinel-2 Satellite Imagery and Machine Learning. J. Imaging 10(1): 14 (2024)
• 
  Kristóf Bérczi, Tamás Király, Simon Omlor:
  Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27(2): 151-164 (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)
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
  Splitting-Off in Hypergraphs. ICALP 2024: 23:1-23:20
• 
  Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
  Multiway Cuts with a Choice of Representatives. MFCS 2024: 25:1-25:17
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
  Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR abs/2402.10861 (2024)
• 
  Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
  Finding Spanning Trees with Perfect Matchings. CoRR abs/2407.02958 (2024)
• 
  Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
  Matroid Intersection under Minimum Rank Oracle. CoRR abs/2407.03229 (2024)
• 
  Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
  Multiway Cuts with a Choice of Representatives. CoRR abs/2407.03877 (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)
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai:
  Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180: 106340 (2023)
• 
  Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
  Hypergraph characterization of split matroids. J. Comb. Theory A 194: 105697 (2023)
• 
  Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
  Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37(2): 1311-1330 (2023)
• 
  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
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
  Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR abs/2307.08555 (2023)
• 2022
• 
  Gergo Gombos, Dávid Kis, Lilla Tóthmérész, Tamás Király, Szilveszter Nádas, Sándor Laki:
  Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology. IEEE Access 10: 120312-120328 (2022)
• 
  Tamás Király, Yu Yokoi:
  Equitable partitions into matchings and coverings in mixed graphs. Discret. Math. 345(1): 112651 (2022)
• 
  Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
  Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B 157: 294-345 (2022)
• 
  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)
• 
  Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
  Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910: 48-53 (2022)
• 
  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
• 
  Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
  Hypergraph characterization of split matroids. CoRR abs/2202.04371 (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)
• 
  Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
  Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022)

skipping 54 more matches