![]() | ![]() |
| 2012 | ||
|---|---|---|
| 41 | 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 | |
| 40 | Stephane Durocher, Debajyoti Mondal: On the Hardness of Point-Set Embeddability - (Extended Abstract). WALCOM 2012: 148-159 | |
| 2011 | ||
| 39 | Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides: A Note on Minimum-Segment Drawings of Planar Graphs. CCCG 2011 | |
| 38 | Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala: Realizing Site Permutations. CCCG 2011 | |
| 37 | Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides: Embedding Plane 3-Trees in ℝ2 and ℝ3. Graph Drawing 2011: 39-51 | |
| 36 | Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala: Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255 | |
| 35 | Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams: Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. IWOCA 2011: 182-194 | |
| 34 | Therese C. Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young: Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. WADS 2011: 86-97 | |
| 33 | Stephane Durocher, Jason Morrison: Linear-Space Data Structures for Range Mode Query in Arrays CoRR abs/1101.4068: (2011) | |
| 32 | Stephane Durocher: A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query CoRR abs/1109.4460: (2011) | |
| 31 | Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar: Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position CoRR abs/1111.6689: (2011) | |
| 30 | 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) | |
| 29 | Therese C. 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) | |
| 28 | Therese C. Biedl, Stephane Durocher, Jack Snoeyink: Reconstructing polygons from scanner data. Theor. Comput. Sci. 412(32): 4161-4172 (2011) | |
| 27 | 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) | |
| 2010 | ||
| 26 | Stephane Durocher, David G. Kirkpatrick, Lata Narayanan: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wireless Networks 16(1): 227-235 (2010) | |
| 2009 | ||
| 25 | 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. ISAAC 2009: 203-212 | |
| 24 | Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger: Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. ISAAC 2009: 45-54 | |
| 23 | Therese C. Biedl, Stephane Durocher, Jack Snoeyink: Reconstructing Polygons from Scanner Data. ISAAC 2009: 862-871 | |
| 22 | Prosenjit Bose, Paz Carmi, Stephane Durocher: Bounding the locality of distributed routing algorithms. PODC 2009: 250-259 | |
| 21 | Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala: Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-229 | |
| 20 | Therese C. Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young: Fixed-Parameter Tractability and Improved Approximations for Segment Minimization CoRR abs/0905.4930: (2009) | |
| 19 | Stephane Durocher, David G. Kirkpatrick: The projection median of a set of points. Comput. Geom. 42(5): 364-375 (2009) | |
| 18 | Stephane Durocher, Christophe Paul: Kinetic maintenance of mobile k-centres on trees. Discrete Applied Mathematics 157(7): 1432-1446 (2009) | |
| 17 | Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan: Balancing Traffic Load Using One-Turn Rectilinear Routing. Journal of Interconnection Networks 10(1-2): 93-120 (2009) | |
| 2008 | ||
| 16 | Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan: Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. DIALM-POMC 2008: 79-86 | |
| 15 | Stephane Durocher, David G. Kirkpatrick, Lata Narayanan: On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. ICDCN 2008: 546-557 | |
| 14 | Christina Boucher, Daniel G. Brown, Stephane Durocher: On the Structure of Small Motif Recognition Instances. SPIRE 2008: 269-281 | |
| 13 | Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan: Balancing Traffic Load Using One-Turn Rectilinear Routing. TAMC 2008: 467-478 | |
| 12 | Stephane Durocher, David G. Kirkpatrick: Bounded-Velocity Approximation of Mobile Euclidean 2-Centres. Int. J. Comput. Geometry Appl. 18(3): 161-183 (2008) | |
| 2007 | ||
| 11 | Stephane Durocher, Christophe Paul: Kinetic Maintenance of Mobile k-Centres on Trees. ISAAC 2007: 341-352 | |
| 2006 | ||
| 10 | Stephane Durocher, Chris Gray, James A. King: Minimizing the Number of Arcs Linking a Permutation of Points in the Plane. CCCG 2006 | |
| 9 | Stephane Durocher, David G. Kirkpatrick: The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. Int. J. Comput. Geometry Appl. 16(4): 345-372 (2006) | |
| 2005 | ||
| 8 | Stephane Durocher, David G. Kirkpatrick: The Projection Median of a Set of Points in R2. CCCG 2005: 47-51 | |
| 2004 | ||
| 7 | Stephane Durocher, David G. Kirkpatrick: The gaussian centre and the projection centre of a set of points in r3. CCCG 2004: 140-144 | |
| 2003 | ||
| 6 | Stephane Durocher, David G. Kirkpatrick: The Gaussian Centre of a Set of Mobile Points. CCCG 2003: 123-127 | |
| 5 | Alex Brodsky, Stephane Durocher, Ellen Gethner: Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discrete Mathematics 262(1-3): 59-77 (2003) | |
| 2002 | ||
| 4 | Stephane Durocher, David G. Kirkpatrick: On the hardness of turn-angle-restricted rectilinear cycle cover problems. CCCG 2002: 13-16 | |
| 2001 | ||
| 3 | Alex Brodsky, Stephane Durocher, Ellen Gethner: The Rectilinear Crossing Number of K10 is 62. Electr. J. Comb. 8(1): (2001) | |
| 2000 | ||
| 2 | Alex Brodsky, Stephane Durocher, Ellen Gethner: The Rectilinear Crossing Number of K_10 is 62 CoRR cs.DM/0009023: (2000) | |
| 1 | Alex Brodsky, Stephane Durocher, Ellen Gethner: Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics CoRR cs.DM/0009028: (2000) | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page