András Sebö

According to our database, András Sebö authored at least 74 papers between 1986 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Tashkinov-Trees: An Annotated Proof.

András Sebö

Graphs Comb., February, 2024

How many matchings cover the nodes of a graph?

Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer

Math. Program., January, 2024

2023

Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs.

Marco Caoduro, András Sebö

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Integer plane multiflow maximisation: one-quarter-approximation and gaps.

Naveen Garg, Nikhil Kumar, András Sebö

Math. Program., 2022

Shortest Odd Paths in Conservative Graphs: Connections and Complexity.

Ildikó Schlotter, András Sebö

CoRR, 2022

Packing, Hitting, and Coloring Squares.

Marco Caoduro, András Sebö

CoRR, 2022

2021

The salesman's improved tours for fundamental classes.

Sylvia C. Boyd, András Sebö

Math. Program., 2021

2020

Ear-Slicing for Matchings in Hypergraphs.

András Sebö

Graphs Comb., 2020

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation.

Naveen Garg, Nikhil Kumar, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

The Salesman's Improved Paths through Forests.

András Sebö, Anke van Zuylen

J. ACM, 2019

Color-critical Graphs and Hereditary Hypergraphs.

András Sebö

CoRR, 2019

2018

Layers and matroids for the traveling salesman's paths.

Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen

Oper. Res. Lett., 2018

2017

The Saleman's Improved Tours for Fundamental Classes.

Sylvia C. Boyd, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Preface: Graph theory and combinatorics.

András Sebö, Zoltán Szigeti

Discret. Appl. Math., 2016

The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio.

András Sebö, Anke van Zuylen

CoRR, 2016

The Salesman's Improved Paths: A 3/2+1/34 Approximation.

András Sebö, Anke van Zuylen

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Ear-decompositions and the complexity of the matching polytope.

Yohann Benchetrit, András Sebö

CoRR, 2015

2014

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

Comb., 2014

2013

Eight-Fifth Approximation for the Path TSP.

András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Alternatives for testing total dual integrality.

Edwin O'Shea, András Sebö

Math. Program., 2012

The chromatic gap and its extremes.

András Gyárfás, András Sebö, Nicolas Trotignon

J. Comb. Theory B, 2012

Eight Fifth Approximation for TSP Paths

András Sebö

CoRR, 2012

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.

András Sebö, Jens Vygen

CoRR, 2012

2011

An Excluded Minor Characterization of Seymour Graphs.

Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Ramsey-type results for Gallai colorings.

András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow

J. Graph Theory, 2010

2009

Minconvex Factors of Prescribed Size in Graphs.

Nicola Apollonio, András Sebö

SIAM J. Discret. Math., 2009

Paintshop, odd cycles and necklace splitting.

Frédéric Meunier, András Sebö

Discret. Appl. Math., 2009

Path Partitions, Cycle Covers and Integer Decomposition.

András Sebö

Proceedings of the Graph Theory, 2009

2008

Batch processing with interval graph compatibilities between tasks.

Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö

Discret. Appl. Math., 2008

Generating All Sets With Bounded Unions.

Yannick Frein, Benjamin Lévêque, András Sebö

Comb. Probab. Comput., 2008

Cyclic orders: Equivalence and duality.

Pierre Charbit, András Sebö

Comb., 2008

Graphic Submodular Function Minimization: A Graphic Approach and Applications.

Myriam Preissmann, András Sebö

Proceedings of the Research Trends in Combinatorial Optimization, 2008

Multiflow Feasibility: An Annotated Tableau.

Guyslain Naves, András Sebö

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Minmax relations for cyclically ordered digraphs.

András Sebö

J. Comb. Theory B, 2007

Optimizing diversity.

Yannick Frein, Benjamin Lévêque, András Sebö

Electron. Notes Discret. Math., 2007

Characterizations of Total Dual Integrality.

Edwin O'Shea, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

A Berge-keeping operation for graphs.

András Sebö

Discret. Math., 2006

2004

Coloring the Maximal Cliques of Graphs.

Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö

SIAM J. Discret. Math., 2004

On Metric Generators of Graphs.

András Sebö, Eric Tannier

Math. Oper. Res., 2004

The Path-Packing Structure of Graphs.

András Sebö, László Szegö

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Minsquare Factors and Maxfix Covers of Graphs.

Nicola Apollonio, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Imperfect and Nonideal Clutters: A Common Approach.

Grigor Gasparyan, Myriam Preissmann, András Sebö

Comb., 2003

2001

Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph.

Joseph Cheriyan, András Sebö, Zoltán Szigeti

SIAM J. Discret. Math., 2001

Integer multiflows and metric packings beyond the cut condition.

Karina Marcus, András Sebö

Discret. Math., 2001

Connected Joins in Graphs.

András Sebö, Eric Tannier

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

1999

Optimal Binary Trees with Order Constraints.

András Sebö, Zeev Waksman

Discret. Appl. Math., 1999

An Introduction to Empty Lattice Simplices.

András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Flows, View Obstructions, and the Lonely Runner.

Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi

J. Comb. Theory B, 1998

Characterizing Noninteger Polyhedra with 0-1 Constraints.

András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.

Joseph Cheriyan, András Sebö, Zoltán Szigeti

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

On Integer Multiflow Maximization.

András Frank, Alexander V. Karzanov, András Sebö

SIAM J. Discret. Math., 1997

Potentials in Undirected Graphs and Planar Multiflows.

András Sebö

SIAM J. Comput., 1997

Coloring precolored perfect graphs.

Jan Kratochvíl, András Sebö

J. Graph Theory, 1997

1996

The connectivity of minimal imperfect graphs.

András Sebö

J. Graph Theory, 1996

On Critical Edges in Minimal Imperfect Graphs.

András Sebö

J. Comb. Theory B, 1996

Recognizing Greedy Structures.

Yair Caro, András Sebö, Michael Tarsi

J. Algorithms, 1996

On Ideal Clutters, Metrics and Multiflows.

Beth Novick, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

On Combinatorial Properties of Binary Spaces.

Beth Novick, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

On Integer Multiflows and Metric Packings in Matroids.

Karina Marcus, András Sebö

Proceedings of the Combinatorics and Computer Science, 1995

1993

General Antifactors of Graphs.

András Sebö

J. Comb. Theory B, 1993

Integer Plane Multiflows with a Fixed Number of Demands.

András Sebö

J. Comb. Theory B, 1993

A generalized cut-condition for multiflows in matroids.

Werner Schwärzler, András Sebö

Discret. Math., 1993

Circuit packings on surfaces with at most three cross-caps.

András Sebö

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

On the geodesic-structure of graphs: a polyhedral approach to metric decomposition.

Michael Lomonosov, András Sebö

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Forcing Colorations and the Strong Perfect Graph Conjecture.

András Sebö

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

On Multiflow Problems.

András Frank, Alexander V. Karzanov, András Sebö

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Undirected distances and the postman-structure of graphs.

András Sebö

J. Comb. Theory B, 1990

Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization.

András Sebö

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

On the Clique-Rank and the Coloration of Perfect Graphs.

Jean Fonlupt, András Sebö

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

The Cographic Multiflow Problem: An Epilogue.

András Sebö

Proceedings of the Polyhedral Combinatorics, 1990

1988

The Schrijver system of odd join polyhedra.

András Sebö

Comb., 1988

1987

Total dual integrality implies local strong unimodularity.

Albertus M. H. Gerards, András Sebö

Math. Program., 1987

A quick proof of Seymour's theorem on t-joins.

András Sebö

Discret. Math., 1987

1986

Finding the <i>t</i> -join structure of graphs.

András Sebö

Math. Program., 1986