The following pages link to Mia Persson (Q477586):
Displayed 18 items.
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Extreme witnesses and their applications (Q1799232) (← links)
- Pushing the online matrix-vector conjecture off-line and identifying its easy cases (Q2327098) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING (Q2841981) (← links)
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272) (← links)
- Extreme Witnesses and Their Applications (Q3467863) (← links)
- The Online Freeze-Tag Problem (Q3525792) (← links)
- Competitive Online Clique Clustering (Q4924652) (← links)
- Simple Iterative Heuristics for Correlation Clustering (Q5116365) (← links)
- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) (Q5385937) (← links)
- Fundamentals of Computation Theory (Q5900800) (← links)
- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs (Q6102272) (← links)