default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Király
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j40]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
Finding spanning trees with perfect matchings. Discret. Appl. Math. 371: 137-147 (2025)- 2024
- [j39]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) - [j38]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) - [j37]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) - [j36]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) - [c18]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA 2024: 22:1-22:19 - [c17]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Splitting-Off in Hypergraphs. ICALP 2024: 23:1-23:20 - [c16]Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
Multiway Cuts with a Choice of Representatives. MFCS 2024: 25:1-25:17 - [i23]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR abs/2402.10861 (2024) - [i22]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) - [i21]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) - [i20]Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
Multiway Cuts with a Choice of Representatives. CoRR abs/2407.03877 (2024) - [i19]Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024) - [i18]Gergely Csáji, Tamás Király, Zsuzsa Mészáros-Karkus:
The NTU Partitioned Matching Game for International Kidney Exchange Programs. CoRR abs/2409.01452 (2024) - [i17]Tamás Fleiner, András Frank, Tamás Király:
A new approach to bipartite stable matching optimization. CoRR abs/2409.04885 (2024) - [i16]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Rainbow Arborescence Conjecture. CoRR abs/2412.15457 (2024) - 2023
- [j35]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) - [j34]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) - [j33]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) - [j32]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) - [c15]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 - [i15]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
- [j31]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) - [j30]Tamás Király, Yu Yokoi:
Equitable partitions into matchings and coverings in mixed graphs. Discret. Math. 345(1): 112651 (2022) - [j29]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) - [j28]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) - [j27]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) - [c14]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 - [i14]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) - [i13]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) - [i12]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) - [i11]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) - [i10]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) - [i9]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022) - 2021
- [i8]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR abs/2107.09897 (2021) - [i7]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - 2020
- [j26]Tamás Király, Zsuzsa Mészáros-Karkus:
Finding strongly popular b-matchings in bipartite graphs. Eur. J. Comb. 88: 103105 (2020) - [j25]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - [j24]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184(1): 411-443 (2020) - [c13]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237 - [c12]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178
2010 – 2019
- 2019
- [j23]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019) - [c11]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. IPCO 2019: 115-127 - [i6]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR abs/1911.12138 (2019) - [i5]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. CoRR abs/1912.01854 (2019) - 2018
- [j22]Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap:
Blocking optimal structures. Discret. Math. 341(7): 1864-1872 (2018) - [j21]Tamás Király:
Base polyhedra and the linking property. J. Comb. Optim. 36(3): 671-677 (2018) - [c10]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. SODA 2018: 1393-1406 - [i4]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. CoRR abs/1807.09735 (2018) - [i3]Tamás Király, Yu Yokoi:
Equitable Partitions into Matchings and Coverings in Mixed Graphs. CoRR abs/1811.07856 (2018) - 2017
- [j20]Tamás Király, Zsuzsa Mészáros-Karkus:
Finding strongly popular b-matchings in bipartite graphs. Electron. Notes Discret. Math. 61: 735-741 (2017) - [c9]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - 2016
- [j19]Tamás Király, Júlia Pap:
An extension of Lehman's theorem and ideal set functions. Discret. Appl. Math. 209: 251-263 (2016) - [j18]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi:
Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. 30(3): 1758-1774 (2016) - [c8]Attila Bernáth, Tamás Király:
Blocking Optimal k-Arborescences. SODA 2016: 1682-1694 - [i2]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - 2015
- [i1]Attila Bernáth, Tamás Király:
Blocking optimal k-arborescences. CoRR abs/1507.04207 (2015) - 2014
- [j17]András Frank, Tamás Király, Júlia Pap, David Pritchard:
Characterizing and recognizing generalized polymatroids. Math. Program. 146(1-2): 245-273 (2014) - 2013
- [j16]Tamás Király, Júlia Pap:
Stable Multicommodity Flows. Algorithms 6(1): 161-168 (2013) - [j15]Attila Bernáth, Tamás Király, Erika R. Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László A. Végh:
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21(4): 699-712 (2013) - [j14]Tamás Király, Júlia Pap:
PPAD-completeness of polyhedral versions of Sperner's Lemma. Discret. Math. 313(15): 1594-1599 (2013) - 2012
- [j13]Attila Bernáth, Tamás Király:
A unifying approach to splitting-off. Comb. 32(4): 373-401 (2012) - [j12]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree bounded matroids and submodular flows. Comb. 32(6): 703-720 (2012) - 2011
- [j11]Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau:
On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. 25(4): 1792-1803 (2011) - [c7]Tamás Király, Lap Chi Lau:
Degree Bounded Forest Covering. IPCO 2011: 315-323
2000 – 2009
- 2009
- [j10]Tamás Király, Jácint Szabó:
A note on parity constrained orientations. Comb. 29(5): 619-628 (2009) - [j9]Tamás Király, Júlia Pap:
A note on kernels and Sperner's Lemma. Discret. Appl. Math. 157(15): 3327-3331 (2009) - [j8]Attila Bernáth, Tamás Király:
Covering skew-supermodular functions by hypergraphs of minimum total size. Oper. Res. Lett. 37(5): 345-350 (2009) - 2008
- [j7]Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti:
Recent results on well-balanced orientations. Discret. Optim. 5(4): 663-676 (2008) - [j6]Tamás Király, Lap Chi Lau:
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. J. Comb. Theory B 98(6): 1233-1252 (2008) - [j5]Tamás Király, Júlia Pap:
Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron. Math. Oper. Res. 33(2): 283-290 (2008) - [c6]András Frank, Tamás Király:
A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization 2008: 87-126 - [c5]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272 - [c4]Attila Bernáth, Tamás Király:
A New Approach to Splitting-Off. IPCO 2008: 401-415 - 2006
- [c3]Tamás Király, Lap Chi Lau:
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS 2006: 283-292 - 2004
- [j4]Tamás Király:
Covering symmetric supermodular functions by uniform hypergraphs. J. Comb. Theory B 91(2): 185-200 (2004) - [c2]Tamás Király, Márton Makai:
On Polyhedra Related to Even Factors. IPCO 2004: 416-430 - 2003
- [j3]András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2): 373-383 (2003) - [j2]András Frank, Tamás Király, Zoltán Király:
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131(2): 385-400 (2003) - [j1]András Frank, Tamás Király:
Combined connectivity augmentation and orientation problems. Discret. Appl. Math. 131(2): 401-419 (2003) - 2001
- [c1]András Frank, Tamás Király:
Combined Connectivity Augmentation and Orientation Problems. IPCO 2001: 130-144
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 2025-04-24 21:05 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:
