default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Sebö
Person information
- affiliation: Grenoble Institute of Technology, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]András Sebö:
Tashkinov-Trees: An Annotated Proof. Graphs Comb. 40(1): 4 (2024)- [j40]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): 271-284 (2024) - 2023
- [c26]Marco Caoduro, András Sebö:
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. GD (1) 2023: 283-295 - [i14]Marco Caoduro, András Sebö:
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. CoRR abs/2309.02062 (2023) - 2022
- [j39]Naveen Garg, Nikhil Kumar, András Sebö:
Integer plane multiflow maximisation: one-quarter-approximation and gaps. Math. Program. 195(1): 403-419 (2022) - [i13]Marco Caoduro, András Sebö:
Packing, Hitting, and Coloring Squares. CoRR abs/2206.02185 (2022) - [i12]Ildikó Schlotter, András Sebö:
Shortest Odd Paths in Conservative Graphs: Connections and Complexity. CoRR abs/2211.12862 (2022) - 2021
- [j38]Sylvia C. Boyd, András Sebö:
The salesman's improved tours for fundamental classes. Math. Program. 186(1): 289-307 (2021) - 2020
- [j37]András Sebö:
Ear-Slicing for Matchings in Hypergraphs. Graphs Comb. 36(6): 1947-1951 (2020) - [c25]Naveen Garg, Nikhil Kumar, András Sebö:
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. IPCO 2020: 144-157 - [i11]Naveen Garg, Nikhil Kumar, András Sebö:
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. CoRR abs/2002.10927 (2020)
2010 – 2019
- 2019
- [j36]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths through Forests. J. ACM 66(4): 28:1-28:16 (2019) - [i10]András Sebö:
Color-critical Graphs and Hereditary Hypergraphs. CoRR abs/1910.11302 (2019) - [i9]András Sebö:
Ear-Slicing for Matchings in Hypergraphs. CoRR abs/1912.05486 (2019) - 2018
- [j35]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46(1): 60-63 (2018) - [i8]Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer:
How many matchings cover the nodes of a graph? CoRR abs/1811.07327 (2018) - 2017
- [c24]Sylvia C. Boyd, András Sebö:
The Saleman's Improved Tours for Fundamental Classes. IPCO 2017: 111-122 - [i7]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and Matroids for the Traveling Salesman's Paths. CoRR abs/1703.07170 (2017) - [i6]Sylvia C. Boyd, András Sebö:
The Salesman's Improved Tours for Fundamental Classes. CoRR abs/1705.02385 (2017) - 2016
- [j34]András Sebö, Zoltán Szigeti:
Preface: Graph theory and combinatorics. Discret. Appl. Math. 209: 1 (2016) - [c23]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths: A 3/2+1/34 Approximation. FOCS 2016: 118-127 - [i5]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio. CoRR abs/1604.02486 (2016) - 2015
- [i4]Yohann Benchetrit, András Sebö:
Ear-decompositions and the complexity of the matching polytope. CoRR abs/1509.05586 (2015) - 2014
- [j33]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): 597-629 (2014) - 2013
- [c22]András Sebö:
Eight-Fifth Approximation for the Path TSP. IPCO 2013: 362-374 - 2012
- [j32]András Gyárfás, András Sebö, Nicolas Trotignon:
The chromatic gap and its extremes. J. Comb. Theory B 102(5): 1155-1178 (2012) - [j31]Edwin O'Shea, András Sebö:
Alternatives for testing total dual integrality. Math. Program. 132(1-2): 57-78 (2012) - [i3]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 abs/1201.1870 (2012) - [i2]András Sebö:
Eight Fifth Approximation for TSP Paths. CoRR abs/1209.3523 (2012) - 2011
- [c21]Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti:
An Excluded Minor Characterization of Seymour Graphs. IPCO 2011: 1-13 - 2010
- [j30]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): 233-243 (2010)
2000 – 2009
- 2009
- [j29]Frédéric Meunier, András Sebö:
Paintshop, odd cycles and necklace splitting. Discret. Appl. Math. 157(4): 780-793 (2009) - [j28]Nicola Apollonio, András Sebö:
Minconvex Factors of Prescribed Size in Graphs. SIAM J. Discret. Math. 23(3): 1297-1310 (2009) - [c20]András Sebö:
Path Partitions, Cycle Covers and Integer Decomposition. Graph Theory, Computational Intelligence and Thought 2009: 183-199 - 2008
- [j27]Pierre Charbit, András Sebö:
Cyclic orders: Equivalence and duality. Comb. 28(2): 131-143 (2008) - [j26]Yannick Frein, Benjamin Lévêque, András Sebö:
Generating All Sets With Bounded Unions. Comb. Probab. Comput. 17(5): 641-660 (2008) - [j25]Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö:
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156(5): 556-568 (2008) - [c19]Guyslain Naves, András Sebö:
Multiflow Feasibility: An Annotated Tableau. Bonn Workshop of Combinatorial Optimization 2008: 261-283 - [c18]Myriam Preissmann, András Sebö:
Graphic Submodular Function Minimization: A Graphic Approach and Applications. Bonn Workshop of Combinatorial Optimization 2008: 365-385 - 2007
- [j24]Yannick Frein, Benjamin Lévêque, András Sebö:
Optimizing diversity. Electron. Notes Discret. Math. 29: 73-77 (2007) - [j23]András Sebö:
Minmax relations for cyclically ordered digraphs. J. Comb. Theory B 97(4): 518-552 (2007) - [c17]Edwin O'Shea, András Sebö:
Characterizations of Total Dual Integrality. IPCO 2007: 382-396 - [i1]Yannick Frein, Benjamin Lévêque, András Sebö:
Optimizing diversity. CoRR abs/0711.2998 (2007) - 2006
- [j22]András Sebö:
A Berge-keeping operation for graphs. Discret. Math. 306(19-20): 2582-2592 (2006) - 2004
- [j21]András Sebö, Eric Tannier:
On Metric Generators of Graphs. Math. Oper. Res. 29(2): 383-393 (2004) - [j20]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): 361-376 (2004) - [c16]András Sebö, László Szegö:
The Path-Packing Structure of Graphs. IPCO 2004: 256-270 - [c15]Nicola Apollonio, András Sebö:
Minsquare Factors and Maxfix Covers of Graphs. IPCO 2004: 388-400 - 2003
- [j19]Grigor Gasparyan, Myriam Preissmann, András Sebö:
Imperfect and Nonideal Clutters: A Common Approach. Comb. 23(2): 283-302 (2003) - 2001
- [j18]Karina Marcus, András Sebö:
Integer multiflows and metric packings beyond the cut condition. Discret. Math. 239(1-3): 13-31 (2001) - [j17]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): 170-180 (2001) - [c14]András Sebö, Eric Tannier:
Connected Joins in Graphs. IPCO 2001: 383-395
1990 – 1999
- 1999
- [j16]András Sebö, Zeev Waksman:
Optimal Binary Trees with Order Constraints. Discret. Appl. Math. 91(1-3): 305-311 (1999) - [c13]András Sebö:
An Introduction to Empty Lattice Simplices. IPCO 1999: 400-414 - 1998
- [j15]Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi:
Flows, View Obstructions, and the Lonely Runner. J. Comb. Theory B 72(1): 1-9 (1998) - [c12]András Sebö:
Characterizing Noninteger Polyhedra with 0-1 Constraints. IPCO 1998: 37-52 - [c11]Joseph Cheriyan, András Sebö, Zoltán Szigeti:
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. IPCO 1998: 126-136 - 1997
- [j14]Jan Kratochvíl, András Sebö:
Coloring precolored perfect graphs. J. Graph Theory 25(3): 207-215 (1997) - [j13]András Sebö:
Potentials in Undirected Graphs and Planar Multiflows. SIAM J. Comput. 26(2): 582-603 (1997) - [j12]András Frank, Alexander V. Karzanov, András Sebö:
On Integer Multiflow Maximization. SIAM J. Discret. Math. 10(1): 158-170 (1997) - 1996
- [j11]Yair Caro, András Sebö, Michael Tarsi:
Recognizing Greedy Structures. J. Algorithms 20(1): 137-156 (1996) - [j10]András Sebö:
On Critical Edges in Minimal Imperfect Graphs. J. Comb. Theory B 67(1): 62-85 (1996) - [j9]András Sebö:
The connectivity of minimal imperfect graphs. J. Graph Theory 23(1): 77-85 (1996) - [c10]Beth Novick, András Sebö:
On Ideal Clutters, Metrics and Multiflows. IPCO 1996: 275-287 - 1995
- [c9]Karina Marcus, András Sebö:
On Integer Multiflows and Metric Packings in Matroids. Combinatorics and Computer Science 1995: 218-233 - [c8]Beth Novick, András Sebö:
On Combinatorial Properties of Binary Spaces. IPCO 1995: 212-227 - 1993
- [j8]Werner Schwärzler, András Sebö:
A generalized cut-condition for multiflows in matroids. Discret. Math. 113(1-3): 207-221 (1993) - [j7]András Sebö:
General Antifactors of Graphs. J. Comb. Theory B 58(2): 174-184 (1993) - [j6]András Sebö:
Integer Plane Multiflows with a Fixed Number of Demands. J. Comb. Theory B 59(2): 163-171 (1993) - [c7]Michael Lomonosov, András Sebö:
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. IPCO 1993: 221-234 - [c6]András Sebö:
Circuit packings on surfaces with at most three cross-caps. IPCO 1993: 433-446 - 1992
- [c5]András Frank, Alexander V. Karzanov, András Sebö:
On Multiflow Problems. IPCO 1992: 85-101 - [c4]András Sebö:
Forcing Colorations and the Strong Perfect Graph Conjecture. IPCO 1992: 353-366 - 1990
- [j5]András Sebö:
Undirected distances and the postman-structure of graphs. J. Comb. Theory B 49(1): 10-39 (1990) - [c3]András Sebö:
The Cographic Multiflow Problem: An Epilogue. Polyhedral Combinatorics 1990: 203-234 - [c2]Jean Fonlupt, András Sebö:
On the Clique-Rank and the Coloration of Perfect Graphs. IPCO 1990: 201-216 - [c1]András Sebö:
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. IPCO 1990: 431-455
1980 – 1989
- 1988
- [j4]András Sebö:
The Schrijver system of odd join polyhedra. Comb. 8(1): 103-116 (1988) - 1987
- [j3]András Sebö:
A quick proof of Seymour's theorem on t-joins. Discret. Math. 64(1): 101-103 (1987) - [j2]Albertus M. H. Gerards, András Sebö:
Total dual integrality implies local strong unimodularity. Math. Program. 38(1): 69-73 (1987) - 1986
- [j1]András Sebö:
Finding the t -join structure of graphs. Math. Program. 36(2): 123-134 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
