- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

A Gallai-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Gallai-colorings occur in various contexts such as the theory of partially… (More)

- András Sebő
- IPCO
- 2013

We prove the approximation ratio 8/5 for the metric {s,t}-path-TSP, and more generally for shortest connected T-joins.
The algorithm that achieves this ratio is the simple "Best of Many" version… (More)

The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature… (More)

- András Sebő
- 2007

We prove a range of minmax theorems about cycle packing and covering in digraphs whose vertices are cyclically ordered, a notion promoted by Bessy and Thomasse in their beautiful proof of the… (More)

- András Sebő
- 1985

Abstract The paper is concerned with static search on a finite set. An unknown subset of cardinality k of the finite set is to be found by testing its subsets. We investigate two problems: in the… (More)

- András Sebő
- 1996

An edge of a graph is calledcritical, if deleting it the stability number of the graph increases, and a nonedge is calledco-critical, if adding it to the graph the size of the maximum clique… (More)

- András Sebő
- 1988

Graphs for which the set oft-joins andt-cuts has “the max-flow-min-cut property”, i.e. for which the minimal defining system of thet-join polyhedron is totally dual integral, have been characterized… (More)

- András Sebő, Eric Tannier
- 2004

We study generators of metric spaces—sets of points with the property that every point of the space is uniquely determined by the distances from their elements. Such generators put a light on… (More)

- András Sebő
- 1996

fr ABSTRACT We prove that partitionable graphs are 2w - 2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w - 2. The proof of the con- nectivity… (More)

- András Sebő
- 2009

A polyhedron P has the integer decomposition property , if every integer vector in kP is the sum of k integer vectors in P . We explain that the projections of polyhedra defined by totally unimodular… (More)