E-LIB Suche - Ergebnisse für: Parsa, Salman

1

Revisiting Graph Persistence for Updates and Efficiency:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Dey, Tamal K. ; Hou, Tao ; Parsa, Salman - p. 371-385 , 2023

2

Algorithms for Contractibility of Compressed Curves on 3-Ma..:

Chambers, Erin Wolf ; Lazarus, Francis ; de Mesmay, Arnaud.
Discrete & Computational Geometry. 70 (2022) 2 - p. 323-354 , 2022

Link: https://doi.org/10.1007/..

3

How to Morph Graphs on the Torus:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Chambers, Erin Wolf ; Erickson, Jeff ; Lin, Patrick. - p. 2759-2778 , 2021

Link: https://doi.org/10.1137/..

4

How to morph graphs on the torus:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Chambers, Erin Wolf ; Erickson, Jeff ; Lin, Patrick. - p. 2759-2778 , 2021

Link: https://dl.acm.org/doi/1..

5

Correction to: On the Links of Vertices in Simplicial d-Com..:

Parsa, Salman
Discrete & Computational Geometry. 64 (2020) 1 - p. 227-228 , 2020

Link: https://doi.org/10.1007/..

6

Hardness of Segment Cover, Contiguous SAT and Visibility wi..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Alipour, Sharareh ; Parsa, Salman - p. 350-363 , 2020

Link: https://doi.org/10.1007/..

7

On the Links of Vertices in Simplicial d-Complexes Embeddab..:

Parsa, Salman
Discrete & Computational Geometry. 59 (2017) 3 - p. 663-679 , 2017

Link: https://doi.org/10.1007/..

8

Deciding contractibility of a non-simple curve on the bound..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,

de Verdière, Éric Colin ; Parsa, Salman - p. 2691-2704 , 2017

Link: https://dl.acm.org/doi/1..

9

A Deterministic $$O(m \log {m})$$ O ( m log m ) Time Algori..:

Parsa, Salman
Discrete & Computational Geometry. 49 (2013) 4 - p. 864-878 , 2013

Link: https://doi.org/10.1007/..

10

A deterministic o(m log m) time algorithm for the reeb grap:

, In: Proceedings of the twenty-eighth annual symposium on Computational geometry,

Parsa, Salman - p. 269-276 , 2012

Link: https://dl.acm.org/doi/1..

11

Revisiting Graph Persistence for Updates and Efficiency:

Dey, Tamal K ; Hou, Tao ; Parsa, Salman
http://arxiv.org/abs/2302.12796. , 2023

Link: http://arxiv.org/abs/230..

12

Labeled Interleaving Distance for Reeb Graphs:

Lan, Fangfei ; Parsa, Salman ; Wang, Bei
http://arxiv.org/abs/2306.01186. , 2023

Link: http://arxiv.org/abs/230..

13

Minimum Height Drawings of Ordered Trees in Polynomial Time..:

Ophelders, Tim ; Parsa, Salman
https://dspace.library.uu.nl/handle/1874/426456. , 2022

Link: https://dspace.library.u..

14

Minimum Height Drawings of Ordered Trees in Polynomial Time..:

Parsa, Salman ; Ophelders, Tim
http://arxiv.org/abs/2203.08364. , 2022

Link: http://arxiv.org/abs/220..

15

Minimum Height Drawings of Ordered Trees in Polynomial Time..:

Ophelders, Tim ; Parsa, Salman
doi:10.4230/LIPIcs.SoCG.2022.55. , 2022

Link: https://doi.org/10.4230/..