On metric generators of graphs A Sebő, E Tannier Mathematics of Operations Research 29 (2), 383-393, 2004 | 554 | 2004 |
Shorter tours by nicer ears: 7/5-approximation for the graph A Sebo, J Vygen TSP 3 (2), 597-629, 2014 | 207* | 2014 |
Hilbert bases, Caratheodory's theorem and combinatorial optimization A Sebö Proceedings of the 1st Integer Programming and Combinatorial Optimization …, 1990 | 148 | 1990 |
Coloring the maximal cliques of graphs G Bacsó, S Gravier, A Gyárfás, M Preissmann, A Sebo SIAM Journal on Discrete Mathematics 17 (3), 361-376, 2004 | 99 | 2004 |
Batch processing with interval graph compatibilities between tasks G Finke, V Jost, M Queyranne, A Sebő Discrete Applied Mathematics 156 (5), 556-568, 2008 | 97 | 2008 |
Ramsey‐type results for Gallai colorings A Gyárfás, GN Sárközy, A Sebő, S Selkow Journal of Graph Theory 64 (3), 233-243, 2010 | 95 | 2010 |
Flows, view obstructions, and the lonely runner W Bienia, L Goddyn, P Gvozdjak, A Sebő, M Tarsi Journal of combinatorial theory, Series B 72 (1), 1-9, 1998 | 90 | 1998 |
An introduction to empty lattice simplices A Sebő International Conference on Integer Programming and Combinatorial …, 1999 | 78 | 1999 |
Recognizing greedy structures Y Caro, A Sebő, M Tarsi Journal of Algorithms 20 (1), 137-156, 1996 | 78 | 1996 |
Eight-fifth approximation for the path TSP A Sebő International Conference on Integer Programming and Combinatorial …, 2013 | 67 | 2013 |
Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph J Cheriyan, A Sebo, Z Szigeti SIAM Journal on Discrete Mathematics 14 (2), 170-180, 2001 | 63 | 2001 |
Undirected distances and the postman-structure of graphs A Sebő Journal of Combinatorial Theory, Series B 49 (1), 10-39, 1990 | 48 | 1990 |
Coloring precolored perfect graphs J Kratochvíl, A Sebő Journal of Graph Theory 25 (3), 207-215, 1997 | 47 | 1997 |
Covering directed and odd cuts A Frank, éva Tardos, A Sebő Mathematical Programming at Oberwolfach II, 99-112, 1984 | 47 | 1984 |
Shorter tours by nicer ears: 7/5-approximation for the graph A Sebő, J Vygen Combinatorica 34 (5), 597-629, 2014 | 45* | 2014 |
Minconvex factors of prescribed size in graphs N Apollonio, A Sebő SIAM Journal on Discrete Mathematics 23 (3), 1297-1310, 2009 | 45* | 2009 |
On integer multiflow maximization A Frank, AV Karzanov, A Sebo SIAM Journal on Discrete Mathematics 10 (1), 158-170, 1997 | 43 | 1997 |
On two random search problems A Sebő Journal of Statistical Planning and Inference 11 (1), 23-31, 1985 | 43 | 1985 |
Multiflow feasibility: an annotated tableau G Naves, A Sebő Research Trends in Combinatorial Optimization: Bonn 2008, 261-283, 2009 | 39 | 2009 |
Optimal cuts in graphs and statistical mechanics JCA d'Auriac, M Preissmann, A Sebö Mathematical and Computer Modelling 26 (8-10), 1-11, 1997 | 37 | 1997 |