The following pages link to András Sebő (Q210363):
Displaying 50 items.
- (Q376555) (redirect page) (← links)
- Complements of nearly perfect graphs (Q376556) (← links)
- 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 (Q484552) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Minmax relations for cyclically ordered digraphs (Q885290) (← links)
- Cyclic orders: equivalence and duality (Q949788) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- On two random search problems (Q1058449) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- Integer plane multiflows with a mixed number of demands (Q1322028) (← links)
- General antifactors of graphs (Q1325259) (← links)
- Flows, view obstructions, and the lonely runner (Q1386416) (← links)
- On critical edges in minimal imperfect graphs (Q1924138) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- A particular timetable problem: Terminal scheduling (Q2276867) (← links)
- A generalized cut-condition for multiflows in matroids (Q2366020) (← links)
- The saleman's improved tours for fundamental classes (Q2401149) (← links)
- Layers and matroids for the traveling salesman's paths (Q2417048) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- A Berge-keeping operation for graphs (Q2433716) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Ear-slicing for matchings in hypergraphs (Q2657060) (← links)
- Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph (Q2706198) (← links)
- (Q2758338) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- Ramsey-type results for Gallai colorings (Q3055920) (← links)
- On Integer Multiflow Maximization (Q3128211) (← links)
- Covering directed and odd cuts (Q3220093) (← links)
- (Q3360195) (← links)
- (Q3471824) (← links)
- Optimizing diversity (Q3503453) (← links)
- Generating All Sets With Bounded Unions (Q3529508) (← links)
- Minconvex Factors of Prescribed Size in Graphs (Q3583302) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- (Q3763889) (← links)
- A particular timetable problem: terminal scheduling (Q3766555) (← links)
- Total dual integrality implies local strong unimodularity (Q3771976) (← links)
- (Q3840345) (← links)
- (Q3840352) (← links)
- (Q4234145) (← links)
- (Q4234160) (← links)
- (Q4263727) (← links)
