Tamás Király

Simon Omlor

J. Sched., April, 2024

Optimization methods and algorithms.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., March, 2024

Hypergraph Connectivity Augmentation in Strongly Polynomial Time.

[BibT_eX]

[DOI]

Shubhang Kulkarni

CoRR, 2024

2023

Matroid Intersection under Restricted Oracles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

On the complexity of packing rainbow spanning trees.

[BibT_eX]

[DOI]

Discret. Math., April, 2023

Hypergraph characterization of split matroids.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2023

Analyzing Residual Random Greedy for monotone submodular maximization.

[BibT_eX]

[DOI]

Aditya Pillai

Inf. Process. Lett., 2023

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time.

[BibT_eX]

[DOI]

Shubhang Kulkarni

CoRR, 2023

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching.

[BibT_eX]

[DOI]

Yu Yokoi

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Approximation by lexicographically maximal solutions in matching and matroid intersection problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Popular branchings and their dual certificates.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Math. Program., 2022

Minimizing submodular functions on diamonds via generalized fractional matroid matchings.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2022

Equitable partitions into matchings and coverings in mixed graphs.

[BibT_eX]

[DOI]

Yu Yokoi

Discret. Math., 2022

Solving the Maximum Popular Matching Problem with Matroid Constraints.

[BibT_eX]

[DOI]

Yu Yokoi

CoRR, 2022

Manipulating the outcome of stable matching and roommates problems.

[BibT_eX]

[DOI]

CoRR, 2022

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology.

[BibT_eX]

[DOI]

IEEE Access, 2022

The popular assignment problem: when cardinality is more important than popularity.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020

A tight $\sqrt{2}$-approximation for linear 3-cut.

[BibT_eX]

[DOI]

Vivek Madan

Math. Program., 2020

Improving the integrality gap for multiway cut.

[BibT_eX]

[DOI]

Vivek Madan

Math. Program., 2020

2019

Beating the 2-approximation factor for global bicut.

[BibT_eX]

[DOI]

Euiwoong Lee

Chao Xu

Math. Program., 2019

2018

Base polyhedra and the linking property.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Blocking optimal structures.

[BibT_eX]

[DOI]

Discret. Math., 2018

A tight -approximation for Linear 3-Cut.

[BibT_eX]

[DOI]

Vivek Madan

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Finding strongly popular b-matchings in bipartite graphs.

[BibT_eX]

[DOI]

Zsuzsa Mészáros-Karkus

Electron. Notes Discret. Math., 2017

Global and Fixed-Terminal Cuts in Digraphs.

[BibT_eX]

[DOI]

Euiwoong Lee

Chao Xu

Proceedings of the Approximation, 2017

2016

Covering Intersecting Bi-set Families under Matroid Constraints.

[BibT_eX]

[DOI]

Yusuke Kobayashi

SIAM J. Discret. Math., 2016

An extension of Lehman's theorem and ideal set functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Blocking Optimal <i>k</i>-Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Blocking optimal k-arborescences.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Characterizing and recognizing generalized polymatroids.

[BibT_eX]

[DOI]

Math. Program., 2014

2013

PPAD-completeness of polyhedral versions of Sperner's Lemma.

[BibT_eX]

[DOI]

Discret. Math., 2013

Algorithms for multiplayer multicommodity flow problems.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2013

Stable Multicommodity Flows.

[BibT_eX]

[DOI]

Algorithms, 2013

2012

Degree bounded matroids and submodular flows.

[BibT_eX]

[DOI]

Mohit Singh

Comb., 2012

A unifying approach to splitting-off.

[BibT_eX]

[DOI]

Comb., 2012

2011

On Disjoint Common Bases in Two Matroids.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

SIAM J. Discret. Math., 2011

Degree Bounded Forest Covering.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2009

Covering skew-supermodular functions by hypergraphs of minimum total size.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

A note on kernels and Sperner's Lemma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A note on parity constrained orientations.

[BibT_eX]

[DOI]

Jácint Szabó

Comb., 2009

2008

Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2008

Recent results on well-balanced orientations.

[BibT_eX]

[DOI]

Discret. Optim., 2008

A New Approach to Splitting-Off.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

A Survey on Covering Supermodular Functions.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2006

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2004

Covering symmetric supermodular functions by uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2004

On Polyhedra Related to Even Factors.

[BibT_eX]

[DOI]

Márton Makai

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

On the orientation of graphs and hypergraphs.

[BibT_eX]

[DOI]

Zoltán Király

Discret. Appl. Math., 2003

On decomposing a hypergraph into k connected sub-hypergraphs.

[BibT_eX]

[DOI]

Matthias Kriesell

Discret. Appl. Math., 2003

Combined connectivity augmentation and orientation problems.

[BibT_eX]

[DOI]