Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Whitesides, Sue
156  Ergebnisse:
Personensuche X
?
1

Combinatorial Properties and Recognition of Unit Square Vis..:

Casel, Katrin ; Fernau, Henning ; Grigoriev, Alexander..
Discrete & Computational Geometry.  69 (2023)  4 - p. 937-980 , 2023
Link: https://doi.org/10.1007/..
 
?
2

1-Complex $s,t$ Hamiltonian Paths:Structure and Reconfigura..:

Nishat, Rahnuma Islam ; Srinivasan, Venkatesh ; Whitesides, Sue
Journal of Graph Algorithms and Applications.  27 (2023)  4 - p. 281-327 , 2023
Link: https://doi.org/10.7155/..
 
?
3

1-Complex s, t Hamiltonian Paths: Structure and Reconfigura..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Nishat, Rahnuma Islam ; Srinivasan, Venkatesh ; Whitesides, Sue - p. 59-70 , 2022
Link: https://doi.org/10.1007/..
 
?
4

The Hamiltonian Path Graph is Connected for Simple s, t Pat..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Nishat, Rahnuma Islam ; Srinivasan, Venkatesh ; Whitesides, Sue - p. 463-475 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular ..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Nishat, Rahnuma Islam ; Srinivasan, Venkatesh ; Whitesides, Sue - p. 501-515 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Nishat, Rahnuma Islam ; Whitesides, Sue - p. 325-337 , 2019
Link: https://doi.org/10.1007/..
 
?
7

Kinetic k-Semi-Yao graph and its applications:

Rahmati, Zahed ; Abam, Mohammad Ali ; King, Valerie.
Computational Geometry.  77 (2019)  - p. 10-26 , 2019
Link: https://doi.org/10.1016/..
 
?
8

Connecting a set of circles with minimum sum of radii:

Chambers, Erin W. ; Fekete, Sándor P. ; Hoffmann, Hella-Franziska...
Computational Geometry.  68 (2018)  - p. 62-76 , 2018
Link: https://doi.org/10.1016/..
 
?
9

Visibility representations of boxes in 2.5 dimensions:

Arleo, Alessio ; Binucci, Carla ; Di Giacomo, Emilio...
Computational Geometry.  72 (2018)  - p. 19-33 , 2018
Link: https://doi.org/10.1016/..
 
?
10

On the Planar Split Thickness of Graphs:

Eppstein, David ; Kindermann, Philipp ; Kobourov, Stephen...
Algorithmica.  80 (2017)  3 - p. 977-994 , 2017
Link: https://doi.org/10.1007/..
 
?
11

Connectivity Graphs of Uncertainty Regions:

Chambers, Erin ; Erickson, Alejandro ; Fekete, Sándor P....
Algorithmica.  78 (2016)  3 - p. 990-1019 , 2016
Link: https://doi.org/10.1007/..
 
?
12

A simple, faster method for kinetic proximity problems:

Rahmati, Zahed ; Abam, Mohammad Ali ; King, Valerie..
Computational Geometry.  48 (2015)  4 - p. 342-359 , 2015
Link: https://doi.org/10.1016/..
 
?
13

(Reverse) k-nearest neighbors for moving objects:

, In: Proceedings of the Seventh International Conference on Motion in Games,
Rahmati, Zahed ; King, Valerie ; Whitesides, Sue - p. 187 ff. , 2014
Link: https://dl.acm.org/doi/1..
 
?
14

Computing k-regret minimizing sets:

Chester, Sean ; Thomo, Alex ; Venkatesh, S..
Proceedings of the VLDB Endowment.  7 (2014)  5 - p. 389-400 , 2014
Link: https://doi.org/10.14778..
 
?
15

A Note on Minimum-Segment Drawings of Planar Graphs:

Durocher, Stephane ; Mondal, Debajyoti ; Nishat, Rahnuma Islam.
Journal of Graph Algorithms and Applications.  17 (2013)  3 - p. 301-328 , 2013
Link: https://doi.org/10.7155/..
 
1-15