default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephane Durocher
Person information
- affiliation: University of Manitoba, Winnipeg, Manitoba, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i22]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. CoRR abs/2402.00336 (2024)- 2023
- [j51]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. Int. J. Comput. Geom. Appl. 33(1&2): 25-41 (2023) - [c80]Stephane Durocher, Shahin Kamali, Pouria Zamani Nezhad:
Online Square Packing with Predictions. CCCG 2023: 9-18 - [c79]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Disks. CCCG 2023: 19-25 - [c78]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
CCOSKEG Discs in Simple Polygons. CCCG 2023: 129-152 - [c77]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. GD (2) 2023: 3-17 - [c76]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. WADS 2023: 179-192 - [c75]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. WALCOM 2023: 23-35 - [i21]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted k-Steiner Tree Problem. CoRR abs/2306.08504 (2023) - [i20]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. CoRR abs/2309.01001 (2023) - [i19]Stephane Durocher, Alexandre Leblanc, Spencer Szabados:
Curve Stabbing Depth: Data Depth for Plane Curves. CoRR abs/2311.07907 (2023) - 2022
- [j50]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the restricted k-Steiner tree problem. J. Comb. Optim. 44(4): 2893-2918 (2022) - [c74]Mathieu Marsot, Stefanie Wuhrer, Jean-Sébastien Franco, Stephane Durocher:
A Structured Latent Space for Human Body Motion Generation. 3DV 2022: 557-566 - [c73]Stephane Durocher, Alexandre Leblanc, Sachini Rajapakse:
Computing Batched Depth Queries and the Depth of a Set of Points. CCCG 2022: 113-120 - [c72]Stephane Durocher, Spencer Szabados:
Curve Stabbing Depth: Data Depth for Plane Curves. CCCG 2022: 121-128 - [i18]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. CoRR abs/2208.06122 (2022) - 2021
- [j49]Kelly Ramsay, Stephane Durocher, Alexandre Leblanc:
Robustness and asymptotics of the projection median. J. Multivar. Anal. 181: 104678 (2021) - [c71]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. COCOON 2021: 203-214 - [i17]Mathieu Marsot, Stefanie Wuhrer, Jean-Sébastien Franco, Stephane Durocher:
Multi-frame sequence generator of 4D human body motion. CoRR abs/2106.04387 (2021) - [i16]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. CoRR abs/2108.12464 (2021) - 2020
- [j48]Stephane Durocher, Shahin Kamali:
Foreword. Comput. Geom. 90: 101652 (2020) - [j47]Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 30(1): 1-17 (2020) - [j46]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. 64(7): 1292-1306 (2020) - [c70]Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour:
Non-Crossing Matching of Online Points. CCCG 2020: 233-239 - [c69]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted 1-Steiner Tree Problem. COCOON 2020: 448-459 - [c68]Md Yeakub Hassan, Ullash Saha, Noman Mohammed, Stephane Durocher, Avery Miller:
Efficient Privacy-Preserving Approaches for Trajectory Datasets. DASC/PiCom/CBDCom/CyberSciTech 2020: 612-619 - [c67]Stephane Durocher, Md Yeakub Hassan:
Clustering Moving Entities in Euclidean Space. SWAT 2020: 22:1-22:14
2010 – 2019
- 2019
- [j45]Stephane Durocher, Debajyoti Mondal:
Drawing plane triangulations with few segments. Comput. Geom. 77: 27-39 (2019) - [j44]Kelly Ramsay, Stephane Durocher, Alexandre Leblanc:
Integrated rank-weighted depth. J. Multivar. Anal. 173: 51-69 (2019) - [j43]Stephane Durocher, Robby Singh:
A simple linear-space data structure for constant-time range minimum query. Theor. Comput. Sci. 770: 51-61 (2019) - [j42]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer:
A time-space trade-off for computing the k-visibility region of a point in a polygon. Theor. Comput. Sci. 789: 13-21 (2019) - [j41]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791: 76-86 (2019) - [c66]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher:
Watchtower for k-crossing Visibility. CCCG 2019: 203-209 - [c65]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21 - [i15]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. CoRR abs/1904.06760 (2019) - 2018
- [j40]Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. Int. J. Comput. Geom. Appl. 28(4): 381-398 (2018) - [j39]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. SIAM J. Discret. Math. 32(4): 2703-2719 (2018) - [e1]Stephane Durocher, Shahin Kamali:
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada. 2018 [contents] - [i14]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon Simplification by Minimizing Convex Corners. CoRR abs/1812.05656 (2018) - 2017
- [j38]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
Guarding orthogonal art galleries with sliding cameras. Comput. Geom. 65: 12-26 (2017) - [j37]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. Int. J. Comput. Geom. Appl. 27(4): 241-254 (2017) - [j36]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding monotone art galleries with sliding cameras in linear time. J. Discrete Algorithms 44: 39-47 (2017) - [j35]Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. J. Graph Algorithms Appl. 21(4): 433-453 (2017) - [j34]Stephane Durocher, Alexandre Leblanc, Matthew Skala:
The projection median as a weighted average. J. Comput. Geom. 8(1): 78-104 (2017) - [j33]Stephane Durocher, Saeed Mehrabi:
Computing conforming partitions of orthogonal polygons with minimum stabbing number. Theor. Comput. Sci. 689: 157-168 (2017) - [c64]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CCCG 2017: 19-24 - [c63]Stephane Durocher, Sahar Mehrpour:
Interference Minimization in k-Connected Wireless Networks. CCCG 2017: 113-119 - [c62]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. WALCOM 2017: 308-319 - [i13]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CoRR abs/1702.08380 (2017) - 2016
- [j32]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. Algorithmica 74(1): 344-366 (2016) - [j31]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and colorability of geometric graphs. Comput. Geom. 56: 1-18 (2016) - [c61]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
On the Biplanar Crossing Number of Kn. CCCG 2016: 93-100 - [c60]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - [c59]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. ICALP 2016: 10:1-10:13 - [r1]Stephane Durocher, Leszek Gasieniec, Prudence W. H. Wong:
Routing in Geometric Networks. Encyclopedia of Algorithms 2016: 1871-1875 - [i12]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. CoRR abs/1602.07816 (2016) - [i11]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. CoRR abs/1603.02853 (2016) - 2015
- [j30]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica 72(4): 901-913 (2015) - [j29]Stephane Durocher, David S. Gunderson, Pak Ching Li, Matthew Skala:
Cycle-maximal triangle-free graphs. Discret. Math. 338(2): 274-290 (2015) - [j28]Stephane Durocher, Debajyoti Mondal:
Plane 3-Trees: Embeddability and Approximation. SIAM J. Discret. Math. 29(1): 405-420 (2015) - [j27]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Searching on a line: A complete characterization of the optimal solution. Theor. Comput. Sci. 569: 24-42 (2015) - [j26]Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman:
On graphs that are not PCGs. Theor. Comput. Sci. 571: 78-87 (2015) - [j25]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579: 64-73 (2015) - [j24]Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low space data structures for geometric range mode query. Theor. Comput. Sci. 581: 97-101 (2015) - [j23]Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar, Fabian Kuhn:
Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position. IEEE/ACM Trans. Netw. 23(4): 1078-1091 (2015) - [c58]Stephane Durocher, Robert Fraser:
Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks. CCCG 2015 - [c57]Stephane Durocher, Pak Ching Li, Saeed Mehrabi:
Guarding Orthogonal Terrains. CCCG 2015 - [c56]Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, Csaba D. Tóth:
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. GD 2015: 447-459 - [c55]Yeganeh Bahoo, Andrea Bunt, Stephane Durocher, Sahar Mehrpour:
Drawing Graphs Using Body Gestures. GD 2015: 561-562 - [c54]Debajyoti Mondal, Hadi Hemmati, Stephane Durocher:
Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection. ICST 2015: 1-10 - [c53]Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. SOFSEM 2015: 140-151 - 2014
- [j22]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5(1): 14-40 (2014) - [j21]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. Theory Comput. Syst. 55(4): 719-741 (2014) - [c52]Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low Space Data Structures for Geometric Range Mode Query. CCCG 2014 - [c51]Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. CCCG 2014 - [c50]Stephane Durocher, Debajyoti Mondal:
Drawing Plane Triangulations with Few Segments, pp. 40-45. CCCG 2014 - [c49]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. COCOA 2014: 113-125 - [c48]Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan:
Indexed Geometric Jumbled Pattern Matching. CPM 2014: 110-119 - [c47]Stephane Durocher, Debajyoti Mondal:
Trade-Offs in Planar Polyline Drawings. GD 2014: 306-318 - [c46]Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. GD 2014: 392-403 - [c45]Stephane Durocher, Saeed Mehrabi:
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. IWOCA 2014: 140-152 - [c44]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. LATIN 2014: 156-167 - [c43]Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. LATIN 2014: 294-305 - [c42]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. SWAT 2014: 98-109 - 2013
- [j20]Stephane Durocher, Jason Morrison:
Foreword. Comput. Geom. 46(2): 119 (2013) - [j19]Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster optimal algorithms for segment minimization with small maximal value. Discret. Appl. Math. 161(3): 317-329 (2013) - [j18]Prosenjit Bose, Paz Carmi, Stephane Durocher:
Bounding the locality of distributed routing algorithms. Distributed Comput. 26(1): 39-58 (2013) - [j17]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - [j16]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust nonparametric Simplification of Polygonal Chains. Int. J. Comput. Geom. Appl. 23(6): 427-442 (2013) - [j15]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(3): 301-328 (2013) - [c41]Stephane Durocher:
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query. Space-Efficient Data Structures, Streams, and Algorithms 2013: 48-60 - [c40]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - [c39]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182 - [c38]Debajyoti Mondal, Yang Wang, Stephane Durocher:
Robust Solvers for Square Jigsaw Puzzles. CRV 2013: 249-256 - [c37]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. ESA 2013: 205-216 - [c36]Stephane Durocher, Debajyoti Mondal:
On Balanced ✛-Contact Representations. GD 2013: 143-154 - [c35]Stephane Durocher, Saeed Mehrabi:
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results. MFCS 2013: 314-324 - [c34]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. MFCS 2013: 325-336 - [c33]Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Top-k Color Queries on Tree Paths. SPIRE 2013: 109-115 - [c32]Stephane Durocher, Debajyoti Mondal:
Plane 3-trees: Embeddability and Approximation - (Extended Abstract). WADS 2013: 291-303 - [c31]Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman:
On Graphs That Are Not PCGs. WALCOM 2013: 310-321 - [c30]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and Colorability of Geometric Graphs. WG 2013: 237-248 - [i10]Stephane Durocher, Saeed Mehrabi:
New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras. CoRR abs/1303.2162 (2013) - [i9]Stephane Durocher, Robert Fraser, Saeed Mehrabi:
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. CoRR abs/1308.2757 (2013) - [i8]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. CoRR abs/1310.1048 (2013) - 2012
- [j14]Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams:
Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16: 287-307 (2012) - [c29]Stephane Durocher, Saeed Mehrabi, Matthew Skala, Mohammad Abdul Wahid:
The Cover Contact Graph of Discs Touching a Line. CCCG 2012: 59-64 - [c28]Sudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat:
Hamiltonian Paths and Cycles in Planar Graphs. COCOA 2012: 83-94 - [c27]Stephane Durocher, Saeed Mehrabi:
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number. COCOON 2012: 228-239 - [c26]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Nonparametric Data Approximation of Point Sets via Data Reduction. ISAAC 2012: 319-331 - [c25]Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar:
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position. SIROCCO 2012: 85-98 - [c24]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. STACS 2012: 290-301 - [c23]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. SWAT 2012: 295-306 - [c22]Stephane Durocher, Debajyoti Mondal:
On the Hardness of Point-Set Embeddability - (Extended Abstract). WALCOM 2012: 148-159 - [i7]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction. CoRR abs/1205.6717 (2012) - 2011
- [j13]Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. Comput. Geom. 44(5): 286-302 (2011) - [j12]Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young:
A note on improving the performance of approximation algorithms for radiation therapy. Inf. Process. Lett. 111(7): 326-333 (2011) - [j11]Therese Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing polygons from scanner data. Theor. Comput. Sci. 412(32): 4161-4172 (2011) - [j10]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala:
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c21]Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. CCCG 2011 - [c20]