The following pages link to Pino Persiano (Q235663):
Displayed 24 items.
- (Q1283932) (redirect page) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Optimal pebble motion on a tree (Q1854411) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- (Q2753727) (← links)
- (Q2762511) (← links)
- (Q3152809) (← links)
- (Q4250414) (← links)
- (Q4395324) (← links)
- (Q4448743) (← links)
- (Q4450730) (← links)
- (Q4536655) (← links)
- Constrained bipartite edge coloring with applications to wavelength routing (Q4571980) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Efficient wavelength routing on directed fiber trees (Q4595507) (← links)
- A new approach to optimal planning of robot motion on a tree with obstacles (Q4595513) (← links)
- (Q4791663) (← links)
- (Q4941916) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Approximation and Online Algorithms (Q5896924) (← links)
- Edge coloring of bipartite graphs with constraints (Q5958313) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)