András Sebö - RankMe

84 papers A* 1B 19Journal 58Unranked 6

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