default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGergely Csáji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
Permutation Tutte polynomial. Eur. J. Comb. 120: 104003 (2024)- [j6]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) - [j5]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) - [j4]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) - [c6]Gergely Csáji:
A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems. AAMAS 2024: 409-415 - [c5]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 - [i15]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) - [i14]Gergely Csáji:
Popularity and Perfectness in One-sided Matching Markets with Capacities. CoRR abs/2403.00598 (2024) - [i13]Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024) - 2023
- [j3]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) - [j2]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) - [c4]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 - [c3]Jiehua Chen, Gergely Csáji:
Optimal Capacity Modification for Many-To-One Matching Problems. AAMAS 2023: 2880-2882 - [c2]Haris Aziz, Gergely Csáji, Ágnes Cseh:
Computational Complexity of k-Stable Matchings. SAGT 2023: 311-328 - [c1]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 - [i12]Jiehua Chen, Gergely Csáji:
Optimal Capacity Modification for Many-To-One Matching Problems. CoRR abs/2302.01815 (2023) - [i11]Gergely Csáji:
A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems. CoRR abs/2304.02558 (2023) - [i10]Haris Aziz, Gergely Csáji, Ágnes Cseh:
Computational complexity of k-stable matchings. CoRR abs/2307.03794 (2023) - [i9]Gergely Csáji:
Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings. CoRR abs/2310.12269 (2023) - [i8]Gergely Csáji:
Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences. CoRR abs/2310.14288 (2023) - [i7]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) - [i6]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
- [j1]Gergely Csáji:
On the complexity of stable hypergraph matching, stable multicommodity flow and related problems. Theor. Comput. Sci. 931: 1-16 (2022) - [i5]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) - [i4]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) - [i3]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) - [i2]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) - [i1]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)
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-09-10 01:13 CEST 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:
