The following pages link to Anastasios Sidiropoulos (Q249466):
Displaying 50 items.
- Convergence and approximation in potential games (Q441854) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Randomly removing \(g\) handles at once (Q991176) (← links)
- Spectral concentration and greedy \(k\)-clustering (Q1624584) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- A Pseudo-approximation for the Genus of Hamiltonian Graphs (Q2851861) (← links)
- (Q2921660) (← links)
- (Q2921724) (← links)
- On distributing symmetric streaming computations (Q2930348) (← links)
- (Q2934633) (← links)
- Beyond the Euler Characteristic (Q2941563) (← links)
- Undecidability and intractability results concerning datalog programs and their persistency numbers (Q2946600) (← links)
- Fat polygonal partitions with applications to visualization and embeddings (Q2968104) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Planarizing an Unknown Surface (Q3167402) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Approximate Greedy Clustering and Distance Selection for Graph Metrics (Q3387276) (← links)
- Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
- Computing the Gromov-Hausdorff Distance for Metric Trees (Q3459891) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction (Q3541784) (← links)
- Low-distortion embeddings of general metrics into the line (Q3581393) (← links)
- Online Embeddings (Q3588411) (← links)
- (Q3602875) (← links)
- (Q3602898) (← links)
- Metric embeddings with outliers (Q4575780) (← links)
- Algorithmic Interpretations of Fractal Dimension (Q4580136) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Quasimetric Embeddings and Their Applications (Q4598225) (← links)
- The limited blessing of low dimensionality (Q4635529) (← links)
- A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs (Q4635535) (← links)
- Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces (Q4636431) (← links)
- Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. (Q4636448) (← links)
- Ordinal embeddings of minimum relaxation (Q4962751) (← links)
- (Q5088977) (← links)
- (Q5111721) (← links)
- (Q5115789) (← links)
- (Q5116530) (← links)
- (Q5136247) (← links)
- On the geometry of graphs with a forbidden minor (Q5172718) (← links)
- Polylogarithmic approximation for Euler genus on bounded degree graphs (Q5212757) (← links)
- On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs (Q5236215) (← links)
- (Q5365099) (← links)
- (Q5368902) (← links)
- Randomly removing g handles at once (Q5370737) (← links)
