The following pages link to András Sebö (Q210363):
Displaying 24 items.
- Potentials in Undirected Graphs and Planar Multiflows (Q4337630) (← links)
- (Q4344207) (← links)
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states (Q4466031) (← links)
- (Q4537757) (← links)
- On ideal clutters, metrics and multiflows (Q4645929) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)
- Recognizing Greedy Structures (Q4864437) (← links)
- The connectivity of minimal imperfect graphs (Q4892346) (← links)
- Eight-Fifth Approximation for the Path TSP (Q4911537) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- On combinatorial properties of binary spaces (Q5101417) (← links)
- The Salesman’s Improved Paths through Forests (Q5215457) (← links)
- Characterizations of Total Dual Integrality (Q5429281) (← links)
- On Metric Generators of Graphs (Q5704179) (← links)
- Integer Programming and Combinatorial Optimization (Q5712459) (← links)
- Integer Programming and Combinatorial Optimization (Q5712468) (← links)
- Integer multiflows and metric packings beyond the cut condition (Q5946745) (← links)
- Tashkinov-trees: an annotated proof (Q6184157) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio (Q6272351) (← links)
- Layers and Matroids for the Traveling Salesman's Paths (Q6284614) (← links)
- On integer multiflows and metric packings in matroids (Q6567682) (← links)
- Packing, hitting, and colouring squares (Q6654538) (← links)
- On the Boxicity of Line Graphs and of Their Complements (Q6761676) (← links)
