#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1983

2018

- This year (5)
- Last 5 years (21)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- András Frank, Tamás Király, Matthias Kriesell
- Discrete Applied Mathematics
- 2003

By applying the matroid partition theorem of J. Edmonds [1] to a hypergraphic generalization of graphic matroids, due to M. Lorea [3], we obtain a generalization of Tutte’s disjoint trees theorem for… (More)

- Tamás Király, Lap Chi Lau, Mohit Singh
- IPCO
- 2008

We consider two related problems, the Minimum Bounded Degree Matroid Basis problem and the Minimum Bounded Degree Submodular Flow problem. The first problem is a generalization of the Minimum Bounded… (More)

- András Frank, Tamás Király, Zoltán Király
- Discrete Applied Mathematics
- 2003

Graph orientation is a well-studied area of combinatorial optimization, one that provides a link between directed and undirected graphs. An important class of questions that arise in this area… (More)

- Tamás Király, Júlia Pap
- Math. Oper. Res.
- 2008

- András Frank, Tamás Király
- IPCO
- 2001

Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and… (More)

- Tamás Király, Júlia Pap
- Discrete Applied Mathematics
- 2009

The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni andHolzmangave a shorter proof. Bothproofswere based on Scarf’s Lemma. In this note we show that a… (More)

- Tamás Király
- J. Comb. Theory, Ser. B
- 2004

We consider the problem of finding a uniform hypergraph that satisfies cut demands defined by a symmetric crossing supermodular set function. We give min-max formulas for both the degree specified… (More)

- Attila Bernáth, Tamás Király
- Oper. Res. Lett.
- 2009

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs. We prove the following generalization using a variation of Schrijver’s… (More)

- Attila Bernáth, Tamás Király
- SODA
- 2016

Given a digraph D = (V,A) and a positive integer k, an arc set F ⊆ A is called a k-arborescence if it is the disjoint union of k spanning arborescences. The problem of nding a minimum cost… (More)

- Tamás Király
- 2003

The objective of the thesis is to discuss edge-connectivity and related connectivity concepts in the context of undirected and directed hypergraphs. In particular, we focus on k-edgeconnectivity and… (More)