Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Seb{\H{o}}, Andr{\'a}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Eight-fifth approximation for the path TSP
András Sebŏ
Lecture Notes in Computer Science
7801
, 2013, pp. 362-374
The chromatic gap and its extremes
András Gyárfás
,
András Sebŏ
,
Nicolas Trotignon
Journal of Combinatorial Theory Series B
102
(5), 2012, pp. 1155-1178
An excluded minor characterization of Seymour graphs
Alexander Ageev
,
Yohann Benchetrit
,
András Sebŏ
,
Zoltán Szigeti
Lecture Notes in Computer Science
6655
, 2011, pp. 1-13
Minconvex factors of prescribed size in graphs
Nicola Apollonio
,
András Sebŏ
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1297-1310
Cyclic orders: Equivalence and duality
Pierre Charbit
,
András Sebŏ
Combinatorica
28
(2), 2008, pp. 131-143
Characterizations of total dual integrality
Edwin O'Shea
,
András Sebŏ
Lecture Notes in Computer Science
4513
, 2007, pp. 382-396
Minmax relations for cyclically ordered digraphs
András Sebŏ
Journal of Combinatorial Theory Series B
97
(4), 2007, pp. 518-552
Minsquare factors and maxfix covers of graphs
Nicola Apollonio
,
András Sebŏ
Lecture Notes in Computer Science
3064
, 2004, pp. 388-400
The path-packing structure of graphs
András Sebŏ
,
László Szegŏ
Lecture Notes in Computer Science
3064
, 2004, pp. 256-270
Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
András Sebŏ
,
Jens Vygen
Combinatorica
34
(6), 2003, pp. 597-629
Connected joins in graphs
András Sebŏ
,
Eric Tannier
Lecture Notes in Computer Science
2081
, 2001, pp. 383-395
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition
Michael Lomonosov
,
András Sebŏ
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 221-234
Circuit packings on surfaces with at most three cross-caps
András Sebŏ
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 433-446
General antifactors of graphs
András Sebŏ
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 174-184
Integer plane multiflows with a fixed number of demands
András Sebŏ
Journal of Combinatorial Theory Series B
59
(2), 1993, pp. 163-171
On multiflow problems
András Frank
,
Alexander V. Karzanov
,
András Sebŏ
Proceedings of the 2nd International Conference on Integer Programming and Combinatorial Optimization, IPCO'92 (Pittsburgh, PA, May 25-27, 1992)
, 1992, pp. 85-101
Forcing colorations and the strong perfect graph conjecture
András Sebŏ
Proceedings of the 2nd International Conference on Integer Programming and Combinatorial Optimization, IPCO'92 (Pittsburgh, PA, May 25-27, 1992)
, 1992, pp. 353-366
Undirected distances and the postman-structure of graphs
András Sebŏ
Journal of Combinatorial Theory Series B
49
, 1990, pp. 10-39