| Year |
Citation |
Score |
| 2023 |
Casel K, Fernau H, Grigoriev A, Schmid ML, Whitesides S. Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discrete & Computational Geometry. 69: 937-980. PMID 37181463 DOI: 10.1007/s00454-022-00414-8 |
0.344 |
|
| 2018 |
Bremner D, Devillers O, Glisse M, Lazard S, Liotta G, Mchedlidze T, Moroz G, Whitesides S, Wismath S. Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ Discrete Mathematics & Theoretical Computer Science. 20: 1-11. DOI: 10.23638/Dmtcs-20-1-1 |
0.397 |
|
| 2018 |
Arleo A, Binucci C, Giacomo ED, Evans WS, Grilli L, Liotta G, Meijer H, Montecchiani F, Whitesides S, Wismath SK. Visibility representations of boxes in 2.5 dimensions Computational Geometry: Theory and Applications. 72: 19-33. DOI: 10.1016/J.Comgeo.2018.02.007 |
0.418 |
|
| 2016 |
Eppstein D, Kindermann P, Kobourov S, Liotta G, Lubiw A, Maignan A, Mondal D, Vosoughpour H, Whitesides S, Wismath S. On the planar split thickness of graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9644: 403-415. DOI: 10.1007/S00453-017-0328-Y |
0.455 |
|
| 2015 |
Rahmati Z, Abam MA, King V, Whitesides S, Zarei A. A simple, faster method for kinetic proximity problems Computational Geometry: Theory and Applications. 48: 342-359. DOI: 10.1016/J.Comgeo.2014.12.002 |
0.479 |
|
| 2014 |
Rahmati Z, Abam MA, King V, Whitesides S. Kinetic k-Semi-Yao graph and its applications Computational Geometry: Theory and Applications. DOI: 10.1016/J.Comgeo.2015.11.001 |
0.409 |
|
| 2013 |
Durocher S, Mondal D, Nishat RI, Whitesides S. A note on minimum-segment drawings of planar graphs Journal of Graph Algorithms and Applications. 17: 301-328. DOI: 10.7155/Jgaa.00295 |
0.411 |
|
| 2013 |
Rahmati Z, Whitesides SH, King V. Kinetic and stationary point-set embeddability for plane graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7704: 279-290. DOI: 10.1007/978-3-642-36763-2_25 |
0.327 |
|
| 2013 |
Bremner D, Evans W, Frati F, Heyer L, Kobourov SG, Lenhart WJ, Liotta G, Rappaport D, Whitesides SH. On representing graphs by touching cuboids Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7704: 187-198. DOI: 10.1007/978-3-642-36763-2_17 |
0.345 |
|
| 2013 |
Rahmati Z, King V, Whitesides S. Kinetic data structures for all nearest neighbors and closest pair in the plane Proceedings of the Annual Symposium On Computational Geometry. 137-144. |
0.337 |
|
| 2013 |
Allen R, Heyer L, Nishat RI, Whitesides S. Grid proximity graphs: LOGs, GIGs and GIRLs Cccg 2013 - 25th Canadian Conference On Computational Geometry. 241-246. |
0.335 |
|
| 2012 |
Mondal D, Nishat RI, Rahman MS, Whitesides S. Acyclic coloring with few division vertices Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7643: 86-99. DOI: 10.1016/J.Jda.2013.08.002 |
0.45 |
|
| 2012 |
Mondal D, Nishat RI, Whitesides S, Rahman MS. Acyclic colorings of graph subdivisions revisited Journal of Discrete Algorithms. 16: 90-103. DOI: 10.1016/J.Jda.2012.06.001 |
0.417 |
|
| 2012 |
Di Battista G, Kim E, Liotta G, Lubiw A, Whitesides S. The Shape of Orthogonal Cycles in Three Dimensions Discrete and Computational Geometry. 47: 461-491. DOI: 10.1007/S00454-011-9381-5 |
0.427 |
|
| 2012 |
Whitesides S. On three-dimensional graph drawing and embedding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7157: 3-4. DOI: 10.1007/978-3-642-28076-4_3 |
0.34 |
|
| 2011 |
Stolpner S, Whitesides S, Siddiqi K. Sampled medial loci for 3D shape representation Computer Vision and Image Understanding. 115: 695-706. DOI: 10.1016/J.Cviu.2010.10.014 |
0.346 |
|
| 2011 |
Chambers EW, Fekete SP, Hoffmann HF, Marinakis D, Mitchell JSB, Srinivasan V, Stege U, Whitesides S. Connecting a set of circles with minimum sum of radii Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6844: 183-194. DOI: 10.1016/J.Comgeo.2017.06.002 |
0.436 |
|
| 2011 |
Mondal D, Nishat RI, Whitesides S, Rahman MS. Acyclic colorings of graph subdivisions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7056: 247-260. DOI: 10.1007/978-3-642-25011-8_20 |
0.301 |
|
| 2010 |
Lazard S, Weibel C, Whitesides S, Zhang L. A Succinct 3D Visibility Skeleton Discrete Mathematics, Algorithms and Applications. 2: 567-589. DOI: 10.1142/S1793830910000899 |
0.317 |
|
| 2010 |
Chambers E, Erickson A, Fekete S, Lenchner J, Sember J, Venkatesh S, Stege U, Stolpner S, Weibel C, Whitesides S. Connectivity graphs of uncertainty regions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6507: 434-445. DOI: 10.1007/S00453-016-0191-2 |
0.464 |
|
| 2010 |
Fellows M, Giannopoulos P, Knauer C, Paul C, Rosamond F, Whitesides S, Yu N. Milling a graph with turn costs: A parameterized complexity perspective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6410: 123-134. DOI: 10.1007/978-3-642-16926-7_13 |
0.315 |
|
| 2009 |
Whitesides S. Intractability in graph drawing and geometry: FPT approaches Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5874: 20-23. DOI: 10.1007/978-3-642-10217-2_5 |
0.361 |
|
| 2009 |
Giordano F, Liotta G, Whitesides SH. Embeddability problems for upward planar digraphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5417: 242-253. DOI: 10.1007/978-3-642-00219-9-23 |
0.33 |
|
| 2008 |
Giannopoulos P, Knauer C, Whitesides S. Parameterized complexity of geometric problems Computer Journal. 51: 372-384. DOI: 10.1093/Comjnl/Bxm053 |
0.43 |
|
| 2008 |
Demaine ED, Erickson J, Kriz̧anc D, Meijer H, Morin P, Overmars M, Whitesides S. Realizing partitions respecting full and partial order information Journal of Discrete Algorithms. 6: 51-58. DOI: 10.1016/J.Jda.2006.10.004 |
0.38 |
|
| 2008 |
Dujmović V, Fellows MR, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Whitesides S, Wood DR. On the parameterized complexity of layered graph drawing Algorithmica (New York). 52: 267-292. DOI: 10.1007/S00453-007-9151-1 |
0.68 |
|
| 2008 |
Fellows MR, Knauer C, Nishimura N, Ragde P, Rosamond F, Stege U, Thilikos DM, Whitesides S. Faster fixed-parameter tractable algorithms for matching and packing problems Algorithmica (New York). 52: 167-176. DOI: 10.1007/S00453-007-9146-Y |
0.443 |
|
| 2007 |
Devillers O, Dujmović V, Everett H, Hornus S, Whitesides S, Wismath S. Maintaining visibility information of planar point sets with a moving viewpoint International Journal of Computational Geometry and Applications. 17: 297-304. DOI: 10.1142/S0218195907002343 |
0.648 |
|
| 2007 |
Brönnimann H, Devillers O, Dujmović V, Everett H, Glisse M, Goaoc X, Lazard S, Na HS, Whitesides S. Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra Siam Journal On Computing. 37: 522-551. DOI: 10.1137/S0097539705447116 |
0.655 |
|
| 2007 |
Ada A, Coggan M, Di Marco P, Doyon A, Flookes L, Heilala S, Kim E, Wing JLO, Preville-Ratelle LF, Whitesides S, Yu N. On bus graph realizability Cccg 2007 - 19th Canadian Conference On Computational Geometry. 229-232. |
0.32 |
|
| 2007 |
Kim E, Liotta G, Whitesides S. A note on drawing direction-constrained paths in 3D Cccg 2007 - 19th Canadian Conference On Computational Geometry. 193-196. |
0.3 |
|
| 2006 |
Dujmović V, Fellows M, Hallett M, Kitching M, Liotta G, Mccartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood DR. A fixed-parameter approach to 2-layer planarization Algorithmica (New York). 45: 159-182. DOI: 10.1007/s00453-005-1181-y |
0.388 |
|
| 2005 |
Suderrnan M, Whitesides S. Experiments with the fixed-parameter approach for two-layer planarization Journal of Graph Algorithms and Applications. 9: 149-163. DOI: 10.7155/Jgaa.00103 |
0.412 |
|
| 2005 |
Rao M, Dudek G, Whitesides S. Randomized algorithms for minimum distance localization Springer Tracts in Advanced Robotics. 17: 393-408. DOI: 10.1177/0278364907081234 |
0.322 |
|
| 2005 |
Brönnimann H, Everett H, Lazard S, Sottile F, Whitesides S. Transversals to line segments in three-dimensional space Discrete and Computational Geometry. 34: 381-390. DOI: 10.1007/S00454-005-1183-1 |
0.376 |
|
| 2004 |
Dujmovic V, Whitesides S. An efficient fixed parameter tractable algorithm for 1-sided crossing minimization Algorithmica (New York). 40: 15-31. DOI: 10.1007/S00453-004-1093-2 |
0.654 |
|
| 2003 |
Streinu I, Whitesides S. Rectangle visibility graphs: Characterization, construction, and compaction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2607: 26-37. |
0.389 |
|
| 2002 |
Agarwal PK, Biedl T, Lazard S, Robbins S, Suri S, Whitesides S. Curvature-constrained shortest paths in a convex polygon Siam Journal On Computing. 31: 1814-1851. DOI: 10.1137/S0097539700374550 |
0.431 |
|
| 2002 |
Battista GD, Liotta G, Lubiw A, Whitesides S. Embedding problems for paths with direction constrained edges Theoretical Computer Science. 289: 897-917. DOI: 10.1016/S0304-3975(01)00408-X |
0.466 |
|
| 2002 |
Biedl T, Demaine E, Demaine M, Lazard S, Lubiw A, O'Rourke J, Robbins S, Streinu I, Toussaint G, Whitesides S. A note on reconfiguring tree linkages: Trees can lock Discrete Applied Mathematics. 117: 293-297. DOI: 10.1016/S0166-218X(01)00229-3 |
0.34 |
|
| 2002 |
Dujmovic V, Fellows M, Hallett M, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood DR. A fixed-parameter approach to two-layer planarization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2265: 1-15. |
0.669 |
|
| 2001 |
Biedl T, Demaine E, Demaine M, Lazard S, Lubiw A, O'rourke J, Overmars M, Robbins S, Streinu I, Toussaint G, Whitesides S. Locked and Unlocked Polygonal Chains in Three Dimensions Discrete and Computational Geometry. 26: 269-281. DOI: 10.1007/S00454-001-0038-7 |
0.358 |
|
| 2000 |
Eades P, Symvonis A, Whitesides S. Three-dimensional orthogonal graph drawing algorithms Discrete Applied Mathematics. 103: 55-87. DOI: 10.1016/S0166-218X(00)00172-4 |
0.433 |
|
| 1999 |
Biedl TC, Shermer TC, Whitesides S, Wismath SK. Bounds for Orthogonal 3-D Graph Drawing Journal of Graph Algorithms and Applications. 3: 63-79. DOI: 10.7155/Jgaa.00018 |
0.455 |
|
| 1999 |
Biedl T, Marks J, Ryall K, Whitesides S. Graph multidrawing: Finding nice drawings without defining nice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1547: 347-355. DOI: 10.1007/3-540-37623-2_26 |
0.32 |
|
| 1998 |
Everett H, Stojmenovic I, Valtr P, Whitesides S. The largest k-ball in a d-dimensional box Computational Geometry: Theory and Applications. 11: 59-67. DOI: 10.1016/S0925-7721(98)00022-4 |
0.34 |
|
| 1998 |
Liotta G, Lubiw A, Meijer H, Whitesides SH. The rectangle of influence drawability problem Computational Geometry: Theory and Applications. 10: 1-22. |
0.375 |
|
| 1997 |
Biedl T, Shermer T, Whitesides S, Wismath S. Orthogonal 3-D graph drawing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1353: 76-86. DOI: 10.1007/3-540-63938-1_52 |
0.36 |
|
| 1997 |
Eades P, Symvonis A, Whitesides S. Two algorithms for three dimensional orthogonal graph drawing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1190: 139-154. DOI: 10.1007/3-540-62495-3_44 |
0.374 |
|
| 1996 |
Alt H, Godau M, Whitesides S. Universal 3-Dimensional visibility representations for graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1027: 8-19. DOI: 10.1016/S0925-7721(97)00015-1 |
0.469 |
|
| 1996 |
Eades P, Whitesides S. The logic engine and the realization problem for nearest neighbor graphs Theoretical Computer Science. 169: 23-37. DOI: 10.1016/S0304-3975(97)84223-5 |
0.442 |
|
| 1996 |
Eades P, Stirk C, Whitesides S. The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings Information Processing Letters. 60: 97-103. DOI: 10.1016/S0020-0190(96)00133-0 |
0.386 |
|
| 1996 |
Eades P, Whitesides S. The Realization Problem for Euclidean Minimum Spanning Trees is NP-Hard Algorithmica (New York). 16: 60-82. DOI: 10.1007/Bf02086608 |
0.334 |
|
| 1996 |
Tanenbaum PJ, Whitesides S. Simultaneous dominance representation of multiple posets Order. 13: 351-364. DOI: 10.1007/Bf00405594 |
0.335 |
|
| 1996 |
Fekete SP, Houle ME, Whitesides S. New results on a visibility representation of graphs in 3D Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1027: 234-241. |
0.361 |
|
| 1995 |
Eades P, Whitesides S. Nearest neighbour graph realizability is NP-hard Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 911: 245-256. |
0.335 |
|
| 1994 |
Eades P, Whitesides S. Drawing graphs in two layers Theoretical Computer Science. 131: 361-374. DOI: 10.1016/0304-3975(94)90179-1 |
0.406 |
|
| 1993 |
Bellantoni S, Ben-Arroyo Hartman I, Przytycka T, Whitesides S. Grid intersection graphs and boxicity Discrete Mathematics. 114: 41-49. DOI: 10.1016/0012-365X(93)90354-V |
0.447 |
|
| 1985 |
Hopcroft J, Joseph D, Whitesides S. On the Movement of Robot Arms in 2-Dimensional Bounded Regions Siam Journal On Computing. 14: 315-333. DOI: 10.1137/0214025 |
0.384 |
|
| 1984 |
Whitesides SH. A Method for Solving Certain Graph Recognition and Optimization Problems, with Applications to Perfect Graphs North-Holland Mathematics Studies. 88: 281-297. DOI: 10.1016/S0304-0208(08)72941-4 |
0.357 |
|
| 1984 |
Chvátal V, Graham RL, Perold AF, Whitesides SH. Combinatorial Designs Related to the Perfect Graph Conjecture North-Holland Mathematics Studies. 88: 197-206. DOI: 10.1016/S0304-0208(08)72935-9 |
0.317 |
|
| 1983 |
Whitesides SH. Edge-colored complete graphs with alternating cycles Discrete Mathematics. 46: 299-304. DOI: 10.1016/0012-365X(83)90124-3 |
0.324 |
|
| 1979 |
Chvátal V, Graham RL, Perold AF, Whitesides SH. Combinatorial designs related to the strong perfect graph conjecture Discrete Mathematics. 26: 83-92. DOI: 10.1016/0012-365X(79)90114-6 |
0.391 |
|
| Show low-probability matches. |