Tamás Király

From MaRDI portal
Person:298983

Available identifiers

zbMath Open kiraly.tamasMaRDI QIDQ298983

List of research outcomes





PublicationDate of PublicationType
Manipulating the outcome of stable marriage and roommates problems2024-11-06Paper
Solving the maximum popular matching problem with matroid constraints2024-07-31Paper
The popular assignment problem: when cardinality is more important than popularity2024-07-19Paper
Scheduling with non-renewable resources: minimizing the sum of completion times2024-05-30Paper
Approximation algorithms for matroidal and cardinal generalizations of stable matching2024-05-14Paper
Optimization methods and algorithms2024-05-13Paper
Matroid Intersection under Restricted Oracles2023-06-27Paper
On the complexity of packing rainbow spanning trees2023-02-21Paper
Analyzing Residual Random Greedy for monotone submodular maximization2023-01-30Paper
Hypergraph characterization of split matroids2022-11-29Paper
Popular Branchings and Their Dual Certificates2022-10-14Paper
Minimizing submodular functions on diamonds via generalized fractional matroid matchings2022-09-23Paper
On the complexity of packing rainbow spanning trees2022-06-23Paper
Approximation by lexicographically maximal solutions in matching and matroid intersection problems2022-03-23Paper
Popular branchings and their dual certificates2022-03-22Paper
Equitable partitions into matchings and coverings in mixed graphs2021-10-27Paper
Global and fixed-terminal cuts in digraphs2021-07-28Paper
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems2021-07-21Paper
Scheduling with non-renewable resources: minimizing the sum of completion times2021-02-04Paper
A tight \(\sqrt{2} \)-approximation for linear 3-cut2020-10-21Paper
Improving the integrality gap for multiway cut2020-08-28Paper
Finding strongly popular \(b\)-matchings in bipartite graphs2020-06-16Paper
Improving the integrality gap for multiway cut2020-02-06Paper
https://portal.mardi4nfdi.de/entity/Q52282212019-08-09Paper
Beating the 2-approximation factor for global bicut2019-08-06Paper
Stable multicommodity flows2019-03-26Paper
Base polyhedra and the linking property2018-12-06Paper
Blocking Optimal k-Arborescences2018-07-16Paper
Blocking optimal structures2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q46079802018-03-15Paper
Finding strongly popular \(b\)-matchings in bipartite graphs2018-01-18Paper
A Survey on Covering Supermodular Functions2017-04-07Paper
Covering intersecting bi-set families under matroid constraints2016-09-09Paper
Algorithms for multiplayer multicommodity flow problems2016-06-29Paper
An extension of Lehman's theorem and ideal set functions2016-06-21Paper
Characterizing and recognizing generalized polymatroids2014-08-29Paper
Degree bounded matroids and submodular flows2014-05-05Paper
A unifying approach to splitting-off2014-05-05Paper
\(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma2014-01-17Paper
On Disjoint Common Bases in Two Matroids2012-03-15Paper
Degree Bounded Forest Covering2011-06-24Paper
https://portal.mardi4nfdi.de/entity/Q29996552011-05-16Paper
Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron2011-04-27Paper
A note on parity constrained orientations2010-08-13Paper
A note on kernels and Sperner's Lemma2010-04-28Paper
Covering skew-supermodular functions by hypergraphs of minimum total size2009-11-17Paper
Merging hyperedges to meet edge-connectivity requirements2009-03-30Paper
https://portal.mardi4nfdi.de/entity/Q36176622009-03-30Paper
https://portal.mardi4nfdi.de/entity/Q36176632009-03-30Paper
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs2008-12-08Paper
Recent results on well-balanced orientations2008-11-19Paper
Degree Bounded Matroids and Submodular Flows2008-06-10Paper
A New Approach to Splitting-Off2008-06-10Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Covering symmetric supermodular functions by uniform hypergraphs2004-08-06Paper
On decomposing a hypergraph into \(k\) connected sub-hypergraphs2003-10-14Paper
On the orientation of graphs and hypergraphs2003-10-14Paper
Combined connectivity augmentation and orientation problems2003-10-14Paper
https://portal.mardi4nfdi.de/entity/Q45377412002-06-20Paper

Research outcomes over time

This page was built for person: Tamás Király