András Sebö

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 23

Top Topics

Approximation Ratio

Traveling Salesman

Top Venues

Publications

András Sebö
Tashkinov-Trees: An Annotated Proof. Graphs Comb. 40 (1) (2024)
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
How many matchings cover the nodes of a graph? Math. Program. 203 (1) (2024)
Marco Caoduro, András Sebö
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. CoRR (2023)
Marco Caoduro, András Sebö
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. GD (1) (2023)
Marco Caoduro, András Sebö
Packing, Hitting, and Coloring Squares. CoRR (2022)
Naveen Garg, Nikhil Kumar, András Sebö
Integer plane multiflow maximisation: one-quarter-approximation and gaps. Math. Program. 195 (1) (2022)
Ildikó Schlotter, András Sebö
Shortest Odd Paths in Conservative Graphs: Connections and Complexity. CoRR (2022)
Sylvia C. Boyd, András Sebö
The salesman's improved tours for fundamental classes. Math. Program. 186 (1) (2021)
Naveen Garg, Nikhil Kumar, András Sebö
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. IPCO (2020)
András Sebö
Ear-Slicing for Matchings in Hypergraphs. Graphs Comb. 36 (6) (2020)
Naveen Garg, Nikhil Kumar, András Sebö
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. CoRR (2020)
András Sebö
Color-critical Graphs and Hereditary Hypergraphs. CoRR (2019)
András Sebö
Ear-Slicing for Matchings in Hypergraphs. CoRR (2019)
András Sebö, Anke van Zuylen
The Salesman's Improved Paths through Forests. J. ACM 66 (4) (2019)
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
How many matchings cover the nodes of a graph? CoRR (2018)
Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46 (1) (2018)
Sylvia C. Boyd, András Sebö
The Salesman's Improved Tours for Fundamental Classes. CoRR (2017)
Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
Layers and Matroids for the Traveling Salesman's Paths. CoRR (2017)
Sylvia C. Boyd, András Sebö
The Saleman's Improved Tours for Fundamental Classes. IPCO (2017)
András Sebö, Zoltán Szigeti
Preface: Graph theory and combinatorics. Discret. Appl. Math. 209 (2016)
András Sebö, Anke van Zuylen
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio. CoRR (2016)
András Sebö, Anke van Zuylen
The Salesman's Improved Paths: A 3/2+1/34 Approximation. FOCS (2016)
Yohann Benchetrit, András Sebö
Ear-decompositions and the complexity of the matching polytope. CoRR (2015)
András Sebö, Jens Vygen
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. Comb. 34 (5) (2014)
András Sebö
Eight-Fifth Approximation for the Path TSP. IPCO (2013)
András Gyárfás, András Sebö, Nicolas Trotignon
The chromatic gap and its extremes. J. Comb. Theory, Ser. B 102 (5) (2012)
Edwin O'Shea, András Sebö
Alternatives for testing total dual integrality. Math. Program. 132 (1-2) (2012)
András Sebö
Eight Fifth Approximation for TSP Paths CoRR (2012)
András Sebö, Jens Vygen
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. CoRR (2012)
Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti
An Excluded Minor Characterization of Seymour Graphs. IPCO (2011)
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
Ramsey-type results for Gallai colorings. J. Graph Theory 64 (3) (2010)
Frédéric Meunier, András Sebö
Paintshop, odd cycles and necklace splitting. Discret. Appl. Math. 157 (4) (2009)
András Sebö
Path Partitions, Cycle Covers and Integer Decomposition. Graph Theory, Computational Intelligence and Thought (2009)
Nicola Apollonio, András Sebö
Minconvex Factors of Prescribed Size in Graphs. SIAM J. Discret. Math. 23 (3) (2009)
Pierre Charbit, András Sebö
Cyclic orders: Equivalence and duality. Comb. 28 (2) (2008)
Guyslain Naves, András Sebö
Multiflow Feasibility: An Annotated Tableau. Bonn Workshop of Combinatorial Optimization (2008)
Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156 (5) (2008)
Myriam Preissmann, András Sebö
Graphic Submodular Function Minimization: A Graphic Approach and Applications. Bonn Workshop of Combinatorial Optimization (2008)
Yannick Frein, Benjamin Lévêque, András Sebö
Generating All Sets With Bounded Unions. Comb. Probab. Comput. 17 (5) (2008)
Yannick Frein, Benjamin Lévêque, András Sebö
Optimizing diversity CoRR (2007)
Yannick Frein, Benjamin Lévêque, András Sebö
Optimizing diversity. Electron. Notes Discret. Math. 29 (2007)
Edwin O'Shea, András Sebö
Characterizations of Total Dual Integrality. IPCO (2007)
András Sebö
Minmax relations for cyclically ordered digraphs. J. Comb. Theory, Ser. B 97 (4) (2007)
András Sebö
A Berge-keeping operation for graphs. Discret. Math. 306 (19-20) (2006)
Nicola Apollonio, András Sebö
Minsquare Factors and Maxfix Covers of Graphs. IPCO (2004)
András Sebö, Eric Tannier
On Metric Generators of Graphs. Math. Oper. Res. 29 (2) (2004)
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17 (3) (2004)
András Sebö, László Szegö
The Path-Packing Structure of Graphs. IPCO (2004)
Grigor Gasparyan, Myriam Preissmann, András Sebö
Imperfect and Nonideal Clutters: A Common Approach. Comb. 23 (2) (2003)
Joseph Cheriyan, András Sebö, Zoltán Szigeti
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. SIAM J. Discret. Math. 14 (2) (2001)
András Sebö, Eric Tannier
Connected Joins in Graphs. IPCO (2001)
Karina Marcus, András Sebö
Integer multiflows and metric packings beyond the cut condition. Discret. Math. 239 (1-3) (2001)
András Sebö
An Introduction to Empty Lattice Simplices. IPCO (1999)
András Sebö, Zeev Waksman
Optimal Binary Trees with Order Constraints. Discret. Appl. Math. 91 (1-3) (1999)
András Sebö
Characterizing Noninteger Polyhedra with 0-1 Constraints. IPCO (1998)
Joseph Cheriyan, András Sebö, Zoltán Szigeti
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. IPCO (1998)
Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi
Flows, View Obstructions, and the Lonely Runner. J. Comb. Theory, Ser. B 72 (1) (1998)
Jan Kratochvíl, András Sebö
Coloring precolored perfect graphs. J. Graph Theory 25 (3) (1997)
András Sebö
Potentials in Undirected Graphs and Planar Multiflows. SIAM J. Comput. 26 (2) (1997)
András Frank, Alexander V. Karzanov, András Sebö
On Integer Multiflow Maximization. SIAM J. Discret. Math. 10 (1) (1997)
Beth Novick, András Sebö
On Ideal Clutters, Metrics and Multiflows. IPCO (1996)
András Sebö
The connectivity of minimal imperfect graphs. J. Graph Theory 23 (1) (1996)
Yair Caro, András Sebö, Michael Tarsi
Recognizing Greedy Structures. J. Algorithms 20 (1) (1996)
András Sebö
On Critical Edges in Minimal Imperfect Graphs. J. Comb. Theory, Ser. B 67 (1) (1996)
Beth Novick, András Sebö
On Combinatorial Properties of Binary Spaces. IPCO (1995)
Karina Marcus, András Sebö
On Integer Multiflows and Metric Packings in Matroids. Combinatorics and Computer Science (1995)
András Sebö
General Antifactors of Graphs. J. Comb. Theory, Ser. B 58 (2) (1993)
András Sebö
Integer Plane Multiflows with a Fixed Number of Demands. J. Comb. Theory, Ser. B 59 (2) (1993)
András Sebö
Circuit packings on surfaces with at most three cross-caps. IPCO (1993)
Werner Schwärzler, András Sebö
A generalized cut-condition for multiflows in matroids. Discret. Math. 113 (1-3) (1993)
Michael Lomonosov, András Sebö
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. IPCO (1993)
András Frank, Alexander V. Karzanov, András Sebö
On Multiflow Problems. IPCO (1992)
András Sebö
Forcing Colorations and the Strong Perfect Graph Conjecture. IPCO (1992)
András Sebö
Undirected distances and the postman-structure of graphs. J. Comb. Theory, Ser. B 49 (1) (1990)
Jean Fonlupt, András Sebö
On the Clique-Rank and the Coloration of Perfect Graphs. IPCO (1990)
András Sebö
The Cographic Multiflow Problem: An Epilogue. Polyhedral Combinatorics (1990)
András Sebö
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. IPCO (1990)
András Sebö
The Schrijver system of odd join polyhedra. Comb. 8 (1) (1988)
András Sebö
A quick proof of Seymour's theorem on t-joins. Discret. Math. 64 (1) (1987)
Albertus M. H. Gerards, András Sebö
Total dual integrality implies local strong unimodularity. Math. Program. 38 (1) (1987)
András Sebö
-join structure of graphs. Math. Program. 36 (2) (1986)