András Sebö - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 63 from 63

2024

How many matchings cover the nodes of a graph?Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer. mp, 203(1):271-284, January 2024. [doi]

2023

Boxicity and Interval-Orders: Petersen and the Complements of Line GraphsMarco Caoduro, András Sebö. gd 2023: 283-295 [doi]

2022

Integer plane multiflow maximisation: one-quarter-approximation and gapsNaveen Garg 0001, Nikhil Kumar 0001, András Sebö. mp, 195(1):403-419, 2022. [doi]

2021

The salesman's improved tours for fundamental classesSylvia C. Boyd, András Sebö. mp, 186(1):289-307, 2021. [doi]

2020

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-ApproximationNaveen Garg, Nikhil Kumar, András Sebö. ipco 2020: 144-157 [doi]

Ear-Slicing for Matchings in HypergraphsAndrás Sebö. gc, 36(6):1947-1951, 2020. [doi]

2019

The Salesman's Improved Paths through ForestsAndrás Sebö, Anke van Zuylen. JACM, 66(4), 2019. [doi]

2018

Layers and matroids for the traveling salesman's pathsFrans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen. orl, 46(1):60-63, 2018. [doi]

2017

The Saleman's Improved Tours for Fundamental ClassesSylvia C. Boyd, András Sebö. ipco 2017: 111-122 [doi]

2016

Preface: Graph theory and combinatoricsAndrás Sebö, Zoltán Szigeti. DAM, 209:1, 2016. [doi]

The Salesman's Improved Paths: A 3/2+1/34 ApproximationAndrás Sebö, Anke van Zuylen. focs 2016: 118-127 [doi]

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 subgraphsAndrás Sebö, Jens Vygen. combinatorica, 34(5):597-629, 2014. [doi]

2013

Eight-Fifth Approximation for the Path TSPAndrás Sebö. ipco 2013: 362-374 [doi]

2012

The chromatic gap and its extremesAndrás Gyárfás, András Sebö, Nicolas Trotignon. JCT, 102(5):1155-1178, 2012. [doi]

Alternatives for testing total dual integralityEdwin O'Shea, András Sebö. mp, 132(1-2):57-78, 2012. [doi]

2011

An Excluded Minor Characterization of Seymour GraphsAlexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti. ipco 2011: 1-13 [doi]

2010

Ramsey-type results for Gallai coloringsAndrás Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow. jgt, 64(3):233-243, 2010. [doi]

2008

2007

Optimizing diversityYannick Frein, Benjamin Lévêque, András Sebö. endm, 29:73-77, 2007. [doi]

Minmax relations for cyclically ordered digraphsAndrás Sebö. JCT, 97(4):518-552, 2007. [doi]

Characterizations of Total Dual IntegralityEdwin O Shea, András Sebö. ipco 2007: 382-396 [doi]

2006

A Berge-keeping operation for graphsAndrás Sebö. DM, 306(19-20):2582-2592, 2006. [doi]

2004

Minsquare Factors and Maxfix Covers of GraphsNicola Apollonio, András Sebö. ipco 2004: 388-400 [doi]

Coloring the Maximal Cliques of GraphsGábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö. siamdm, 17(3):361-376, 2004. [doi]

On Metric Generators of GraphsAndrás Sebö, Eric Tannier. mor, 29(2):383-393, 2004. [doi]

The Path-Packing Structure of GraphsAndrás Sebö, László Szegö. ipco 2004: 256-270 [doi]

2003

Imperfect and Nonideal Clutters: A Common ApproachGrigor Gasparyan, Myriam Preissmann, András Sebö. combinatorica, 23(2):283-302, 2003. [doi]

2001

Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning SubgraphJoseph Cheriyan, András Sebö, Zoltán Szigeti. siamdm, 14(2):170-180, 2001. [doi]

Integer multiflows and metric packings beyond the cut conditionKarina Marcus, András Sebö. DM, 239(1-3):13-31, 2001. [doi]

Connected Joins in GraphsAndrás Sebö, Eric Tannier. ipco 2001: 383-395 [doi]

1999

Optimal Binary Trees with Order ConstraintsAndrás Sebö, Zeev Waksman. DAM, 91(1-3):305-311, 1999. [doi]

An Introduction to Empty Lattice SimplicesAndrás Sebö. ipco 1999: 400-414 [doi]

1998

Flows, View Obstructions, and the Lonely RunnerWojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi. JCT, 72(1):1-9, 1998. [doi]

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning SubgraphsJoseph Cheriyan, András Sebö, Zoltán Szigeti. ipco 1998: 126-136 [doi]

Characterizing Noninteger Polyhedra with 0-1 ConstraintsAndrás Sebö. ipco 1998: 37-52 [doi]

1997

On Integer Multiflow MaximizationAndrás Frank, Alexander V. Karzanov, András Sebö. siamdm, 10(1):158-170, 1997. [doi]

Coloring precolored perfect graphsJan Kratochvíl, András Sebö. jgt, 25(3):207-215, 1997. [doi]

Potentials in Undirected Graphs and Planar MultiflowsAndrás Sebö. SICOMP, 26(2):582-603, 1997.

1996

Recognizing Greedy StructuresYair Caro, András Sebö, Michael Tarsi. jal, 20(1):137-156, 1996.

On Ideal Clutters, Metrics and MultiflowsBeth Novick, András Sebö. ipco 1996: 275-287

The connectivity of minimal imperfect graphsAndrás Sebö. jgt, 23(1):77-85, 1996. [doi]

On Critical Edges in Minimal Imperfect GraphsAndrás Sebö. JCT, 67(1):62-85, 1996. [doi]

1995

On Integer Multiflows and Metric Packings in MatroidsKarina Marcus, András Sebö. cococ 1996: 218-233

On Combinatorial Properties of Binary SpacesBeth Novick, András Sebö. ipco 1995: 212-227

1993

On the geodesic-structure of graphs: a polyhedral approach to metric decompositionMichael Lomonosov, András Sebö. ipco 1993: 221-234

A generalized cut-condition for multiflows in matroidsWerner Schwärzler, András Sebö. DM, 113(1-3):207-221, 1993. [doi]

General Antifactors of GraphsAndrás Sebö. JCT, 58(2):174-184, 1993. [doi]

Integer Plane Multiflows with a Fixed Number of DemandsAndrás Sebö. JCT, 59(2):163-171, 1993. [doi]

Circuit packings on surfaces with at most three cross-capsAndrás Sebö. ipco 1993: 433-446

1992

On Multiflow ProblemsAndrás Frank, Alexander V. Karzanov, András Sebö. ipco 1992: 85-101

Forcing Colorations and the Strong Perfect Graph ConjectureAndrás Sebö. ipco 1992: 353-366

1990

On the Clique-Rank and the Coloration of Perfect GraphsJean Fonlupt, András Sebö. ipco 1990: 201-216

Undirected distances and the postman-structure of graphsAndrás Sebö. JCT, 49(1):10-39, 1990. [doi]

The Cographic Multiflow Problem: An EpilogueAndrás Sebö. dimacs 1990: 203-234

Hilbert Bases, Caratheodory s Theorem and Combinatorial OptimizationAndrás Sebö. ipco 1990: 431-455

1988

The Schrijver system of odd join polyhedraAndrás Sebö. combinatorica, 8(1):103-116, 1988.

1987

Total dual integrality implies local strong unimodularityAlbertus M. H. Gerards, András Sebö. mp, 38(1):69-73, 1987. [doi]

A quick proof of Seymour s theorem on t-joinsAndrás Sebö. DM, 64(1):101-103, 1987. [doi]

1986

t -join structure of graphsAndrás Sebö. mp, 36(2):123-134, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL