The following pages link to Gianpaolo Oriolo (Q408177):
Displaying 39 items.
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Stable routing under the Spanning Tree Protocol (Q613335) (← links)
- (Q635517) (redirect page) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- A short proof of the VPN tree routing conjecture on ring networks (Q943799) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- Adaptivity in network interdiction (Q1675445) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs (Q1880259) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Single courier single restaurant meal delivery (without routing) (Q2294375) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- (Q2816034) (← links)
- The Online Replacement Path Problem (Q2849291) (← links)
- The VPN Problem with Concave Costs (Q3008029) (← links)
- (Q3109934) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- New Approaches for Virtual Private Network Design (Q3507517) (← links)
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs (Q3596357) (← links)
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property (Q4910807) (← links)
- (Q5111420) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs (Q5200491) (← links)
- (Q5365068) (← links)
- Domination Between Traffic Matrices (Q5388072) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- The Machine Duplication Problem in a Job Shop with Two Jobs (Q5689969) (← links)
- Automata, Languages and Programming (Q5716861) (← links)
- (Q5743477) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
